Return to Seminars

June 28, 2018, 2:00 pm: Cesar Prouté (GraphIK)

June 28, 2018,2:00 pm, Room 03/124, Building 5

Title: Distance based repair filtering for inconsistent knowledge bases

Abstract: The number of repairs of an inconsistent knowledge base can be exponential with respect to the number of facts. Furthermore, reasoning with repair based semantics can be computationally expensive. During this internship we focused on the following research question: “What is a *representative* subset of repairs?” In order to answer this question we defined a syntactic distance measure between repairs following the intuition that it can allow us to filter some repairs “close” to each other. We analysed this measure from a semantic point of view. and provided a purely semantic notion of optimal subsets of repairs.

Permanent link to this article: