Inconsistency- and Error-Tolerant Reasoning w.r.t. ππβ₯ Ontologies
Research output: Contribution to book/conference proceedings/anthology/report βΊ Conference contribution βΊ Contributed βΊ peer-review
Contributors
Abstract
Errors in knowledge bases (KBs) written in a Description Logic (DL) are usually detected when reasoning derives an inconsistency or a consequence that does not hold in the application domain modelled by the KB. Whereas classical repair approaches produce maximal subsets of the KB not implying the inconsistency or unwanted consequence, optimal repairs maximize the consequence sets. In this paper, we extend previous results on how to compute optimal repairs from the DL ππ to its extension ππβ₯, which in contrast to ππ can express inconsistency. The problem of how to deal with inconsistency in the context of optimal repairs was addressed previously, but in a setting where the (fixed) terminological part of the KB must satisfy a restriction on cyclic dependencies. Here, we consider a setting where this restriction is not required. We also show how the notion of optimal repairs obtained this way can be used in inconsistency- and error-tolerant reasoning.
Details
Original language | English |
---|---|
Title of host publication | Proceedings of the 13th International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2024), April 8-11, 2024, Sheffield, United Kingdom |
Editors | Arne Meier, Magdalena Ortiz |
Pages | 3-22 |
Number of pages | 20 |
Volume | 14589 |
Publication status | Published - 2024 |
Peer-reviewed | Yes |
Publication series
Series | Lecture Notes in Computer Science |
---|
External IDs
Scopus | 85190702279 |
---|---|
dblp | conf/foiks/BaaderKN24 |
Mendeley | 671817fa-5b05-3cb1-a53a-937144cf498b |
ORCID | /0000-0003-0219-0330/work/159607637 |
ORCID | /0000-0002-4049-221X/work/159608032 |
ORCID | /0000-0002-9047-7624/work/159608188 |