%0 Conference Paper %1 672a326e2bed4583964eb540be1047ac %A Baader, Franz %B Proceedings of the ACM Symposium on Applied Computing %D 2023 %I Association for Computing Machinery %K topic_knowledge FIS_scads belief change, description logic, ontology repair %P 983--990 %R 10.1145/3555776.3577719 %T Optimal Repairs in Ontology Engineering as Pseudo-Contractions in Belief Change %X The question of how a given knowledge base can be modified such that certain unwanted consequences are removed has been investigated in the area of knowledge engineering under the name of repair and in the area of belief change under the name of contraction. Whereas in the former area the emphasis was more on designing and implementing concrete repair algorithms, the latter area concentrated on characterizing classes of contraction operations by certain postulates they satisfy. In the classical setting, repairs and contractions are subsets of the knowledge base that no longer have the unwanted consequence. This makes these approaches syntax-dependent and may result in removal of more consequences than necessary. To alleviate this problem, gentle repairs and pseudo-constractions have been introduced in the respective research areas, and their connections have been investigated in recent work. Optimal repairs preserve a maximal amount of consequences, but they may not always exist. We show that, if they exist, then they can be obtained by certain pseudo-contraction operations, and thus they comply with the postulates that these operations satisfy. Conversely, under certain conditions, pseudo-contractions are guaranteed to produce optimal repairs.

@inproceedings{672a326e2bed4583964eb540be1047ac, abstract = {The question of how a given knowledge base can be modified such that certain unwanted consequences are removed has been investigated in the area of knowledge engineering under the name of repair and in the area of belief change under the name of contraction. Whereas in the former area the emphasis was more on designing and implementing concrete repair algorithms, the latter area concentrated on characterizing classes of contraction operations by certain postulates they satisfy. In the classical setting, repairs and contractions are subsets of the knowledge base that no longer have the unwanted consequence. This makes these approaches syntax-dependent and may result in removal of more consequences than necessary. To alleviate this problem, gentle repairs and pseudo-constractions have been introduced in the respective research areas, and their connections have been investigated in recent work. Optimal repairs preserve a maximal amount of consequences, but they may not always exist. We show that, if they exist, then they can be obtained by certain pseudo-contraction operations, and thus they comply with the postulates that these operations satisfy. Conversely, under certain conditions, pseudo-contractions are guaranteed to produce optimal repairs.}, added-at = {2024-11-28T16:27:18.000+0100}, author = {Baader, Franz}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/293059bb6d7597b2bd8f962b9e623540c/scadsfct}, booktitle = {Proceedings of the ACM Symposium on Applied Computing}, day = 27, doi = {10.1145/3555776.3577719}, interhash = {aa9be1e96bb5c09e476fc8dc436ab77d}, intrahash = {93059bb6d7597b2bd8f962b9e623540c}, keywords = {topic_knowledge FIS_scads belief change, description logic, ontology repair}, language = {English}, month = mar, note = {Publisher Copyright: {\textcopyright} 2023 ACM.}, pages = {983--990}, publisher = {Association for Computing Machinery}, timestamp = {2024-11-28T17:41:09.000+0100}, title = {Optimal Repairs in Ontology Engineering as Pseudo-Contractions in Belief Change}, year = 2023 }