An Incremental Algorithm for Computing All Repairs in Inconsistent Knowledge Bases

Bruno Yun* (Corresponding Author), Madalina Croitoru

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Repair techniques are used for reasoning in presence of inconsistencies. Such techniques rely on optimisations to avoid the computation of all repairs while certain applications need the generation of all repairs. In this paper, we show that the problem of all repair computation is not trivial in practice. To account for a scalable solution, we provide an incremental approach for the computation of all repairs when the conflicts have a cardinality of at most three. We empirically study its performance on generated knowledge bases (where the knowledge base generator could be seen as a secondary contribution in itself).
Original languageEnglish
Title of host publicationOntologies and Concepts in Mind and Machine
EditorsMehwish Alam, Tanya Braun, Bruno Yun
PublisherSpringer Nature Switzerland AG
Pages33-47
Number of pages15
Volume12277
ISBN (Electronic)978-3-030-57855-8
ISBN (Print)978-3-030-57854-1
DOIs
Publication statusE-pub ahead of print - 10 Sep 2020
EventOntologies and Concepts in Mind and Machine: 25th International Conference on Conceptual Structures - Bolzano, Italy
Duration: 18 Sep 202020 Sep 2020
Conference number: 25th

Publication series

NameLecture Notes in Computer Science

Conference

ConferenceOntologies and Concepts in Mind and Machine
Abbreviated titleICCS 2020
CountryItaly
CityBolzano
Period18/09/2020/09/20

Keywords

  • repairs
  • Knowledge base
  • existential rule
  • Repairs
  • Existential rule

Fingerprint Dive into the research topics of 'An Incremental Algorithm for Computing All Repairs in Inconsistent Knowledge Bases'. Together they form a unique fingerprint.

Cite this