- Titel
- Contractions Based on Optimal Repairs
- Untertitel
- Extended Version
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-926322
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 24-03
- Erstveröffentlichung
- 2024
- DOI
- https://doi.org/10.25368/2024.122
- Abstract (EN)
- Removing unwanted consequences from a knowledge base has been investigated in belief change under the name contraction and is called repair in ontology engineering. Simple repair and contraction approaches based on removing statements from the knowledge base (respectively called belief base contractions and classical repairs) have the disadvantage that they are syntax-dependent and may remove more consequences than necessary. Belief set contractions do not have these problems, but may result in belief sets that have no finite representation if one works with logics that are not fragments of propositional logic. Similarly, optimal repairs, which are syntax-independent and maximize the retained consequences, may not exist. In this paper, we want to leverage advances in characterizing and computing optimal repairs of ontologies based on the description logics EL to obtain contraction operations that combine the advantages of belief set and belief base contractions. The basic idea is to employ, in the partial meet contraction approach, optimal repairs instead of optimal classical repairs as remainders. We introduce this new approach in a very general setting, and prove a characterization theorem that relates the obtained contractions with well-known postulates. Then, we consider several interesting instances, not only in the standard repair/contraction setting where one wants to get rid of a consequence, but also in other settings such as variants of forgetting in propositional and description logic. This is an extended version of an article accepted at KR 2024.
- Zitiert in
- Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024)
- Freie Schlagwörter (DE)
- Wissensrevision, Kontraktion, Beschreibungslogik, Optimale Reparatur
- Freie Schlagwörter (EN)
- Belief Change, Contraction, Description Logic, Optimal Repair
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Herausgeber (Institution)
- Technische Universität Dresden
- Förder- / Projektangaben
- Deutsche Forschungsgemeinschaft (DFG)
Foundations of Perspicuous Software Systems - Enabling Comprehension in a Cyber-Physical World
(TRR 248)
ID: 389792660 - Center for Scalable Data Analytics and Artificial Intelligence Dresden/Leipzig (ScaDS.AI)
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-926322
- Veröffentlichungsdatum Qucosa
- 22.07.2024
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0