Franz Baader
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.
- Carlos E. Alchourrón, Peter Gärdenfors, and David Makinson. 1985. On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. J. Symb. Log. 50, 2 (1985), 510--530. Google Scholar
Cross Ref
- Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. 2017. An Introduction to Description Logic. Cambridge University Press. Google ScholarCross Ref
- Franz Baader, Patrick Koopmann, Francesco Kriegel, and Adrian Nuradiansyah. 2021. Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL TBoxes. In Automated Deduction - CADE 28 - 28th International Conference on Automated Deduction, Proceedings (LNCS), André Platzer and Geoff Sutcliffe (Eds.), Vol. 12699. Springer, 309--326. Google ScholarDigital Library
- Franz Baader, Patrick Koopmann, Francesco Kriegel, and Adrian Nuradiansyah. 2022. Optimal ABox Repair w.r.t. Static EL TBoxes: From Quantified ABoxes Back to ABoxes. In The Semantic Web - 19th International Conference, ESWC 2022, Proceedings (LNCS), Vol. 13261. Springer, 130--146. Google ScholarDigital Library
- Franz Baader, Francesco Kriegel, Adrian Nuradiansyah, and Rafael Peñaloza. 2018. Making Repairs in Description Logics More Gentle. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018, Michael Thielscher, Francesca Toni, and Frank Wolter (Eds.). AAAI Press, 319--328. https://aaai.org/ocs/index.php/KR/KR18/paper/view/18056Google Scholar
- Franz Baader and Boontawee Suntisrivaraporn. 2008. Debugging SNOMED CT Using Axiom Pinpointing in the Description Logic EL+. In Proceedings of the Third International Conference on Knowledge Representation in Medicine, Phoenix, Arizona, USA, May 31st - June 2nd, 2008 (CEUR Workshop Proceedings), Ronald Cornet and Kent A. Spackman (Eds.), Vol. 410. CEUR-WS.org. http://ceur-ws.org/Vol-410/Paper01.pdfGoogle Scholar
- Jianfeng Du, Guilin Qi, and Xuefeng Fu. 2014. A Practical Fine-grained Approach to Resolving Incoherent OWL 2 DL Terminologies. In Proc. of the 23rd ACM Int. Conf. on Information and Knowledge Management, (CIKM'14). ACM, 919--928. Google ScholarDigital Library
- Marcelo A. Falappa, Eduardo L. Fermé, and Gabriele Kern-Isberner. 2006. On the Logic of Theory Change: Relations Between Incision and Selection Functions. In ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings (Frontiers in Artificial Intelligence and Applications), Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso (Eds.), Vol. 141. IOS Press, 402--406.Google Scholar
- André Fuhrmann. 1991. Theory Contraction Through Base Contraction. J. Philos. Logic 20 (1991), 175--203. Google ScholarCross Ref
- Peter Gärdenfors (Ed.). 1992. Belief Revision. Cambridge University Press. Google ScholarCross Ref
- Sven Ove Hansson. 1989. New Operators for Theory Change. Theoria 55, 2 (1989), 114--132. Google ScholarCross Ref
- Sven Ove Hansson. 1992. In Defense of Base Contraction. Synthese 92 (1992), 239--245. Google ScholarCross Ref
- Sven Ove Hansson. 1993. Changes of disjunctively closed bases. J. Log. Lang. Inf. 2, 4 (1993), 255--284. Google ScholarCross Ref
- Sven Ove Hansson. 1993. Reversing the Levi identity. J. Philos. Logic 22, 6 (1993), 637--669. Google ScholarCross Ref
- Sven Ove Hansson. 1994. Kernel Contraction. J. Symb. Log. 59, 3 (1994), 845--859. Google ScholarDigital Library
- Matthew Horridge, Bijan Parsia, and Ulrike Sattler. 2008. Laconic and Precise Justifications in OWL. In The Semantic Web - ISWC 2008, 7th International Semantic Web Conference, ISWC 2008, Karlsruhe, Germany, October 26-30, 2008. Proceedings (Lecture Notes in Computer Science), Amit P. Sheth, Steffen Staab, Mike Dean, Massimo Paolucci, Diana Maynard, Timothy W. Finin, and Krishnaprasad Thirunarayan (Eds.), Vol. 5318. Springer, 323--338. Google ScholarDigital Library
- Joey Sik Chun Lam, Derek H. Sleeman, Jeff Z. Pan, and Wamberto Weber Vasconcelos. 2008. A Fine-Grained Approach to Resolving Unsatisfiable Ontologies. J. Data Semant. 10 (2008), 62--95. Google ScholarCross Ref
- Vinícius Bitencourt Matos, Ricardo Guimarães, Yuri David Santos, and Renata Wassermann. 2019. Pseudo-contractions as Gentle Repairs. In Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday (Lecture Notes in Computer Science), Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, and Frank Wolter (Eds.), Vol. 11560. Springer, 385--403. Google ScholarCross Ref
- Vinícius Bitencourt Matos and Renata Wassermann. 2022. Repairing Ontologies via Kernel Pseudo-Contraction. In Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, NMR 2022, Part of the Federated Logic Conference (FLoC 2022), Haifa, Israel, August 7-9, 2022 (CEUR Workshop Proceedings), Ofer Arieli, Giovanni Casini, and Laura Giordano (Eds.), Vol. 3197. CEUR-WS.org, 16--26. http://ceur-ws.org/Vol-3197/paper2.pdfGoogle Scholar
- Bijan Parsia, Evren Sirin, and Aditya Kalyanpur. 2005. Debugging OWL ontologies. In Proceedings of the 14th International Conference on World Wide Web, WWW 2005, Chiba, Japan, May 10-14, 2005, Allan Ellis and Tatsuya Hagino (Eds.). ACM, 633--640. Google ScholarDigital Library
- Guilin Qi and Fangkai Yang. 2008. A Survey of Revision Approaches in Description Logics. In Web Reasoning and Rule Systems, Second International Conference, RR 2008, Karlsruhe, Germany, October 31-November 1, 2008. Proceedings (Lecture Notes in Computer Science), Diego Calvanese and Georg Lausen (Eds.), Vol. 5341. Springer, 74--88. Google ScholarDigital Library
- Raymond Reiter. 1987. A Theory of Diagnosis from First Principles. Artif. Intell. 32, 1 (1987), 57--95. Google ScholarDigital Library
- Yuri David Santos, Vinícius Bitencourt Matos, Márcio Moretto Ribeiro, and Renata Wassermann. 2018. Partial meet pseudo-contractions. Int. J. Approx. Reason. 103 (2018), 11--27. Google ScholarCross Ref
- Stefan Schlobach, Zhisheng Huang, Ronald Cornet, and Frank Harmelen. 2007. Debugging Incoherent Terminologies. J. Automated Reasoning 39, 3 (2007), 317--349. Google ScholarDigital Library
- Nicolas Troquard, Roberto Confalonieri, Pietro Galliani, Rafael Peñaloza, Daniele Porello, and Oliver Kutz. 2018. Repairing Ontologies via Axiom Weakening. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), Sheila A. McIlraith and Kilian Q. Weinberger (Eds.). AAAI Press, 1981--1988.Google ScholarCross Ref
Index Terms
- Optimal Repairs in Ontology Engineering as Pseudo-Contractions in Belief Change
Recommendations
Relating Optimal Repairs in Ontology Engineering with Contraction Operations in Belief Change
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 ontology engineering under the name of repair and in the area of belief change under the name of ...
Parallel belief revision: Revising by sets of formulas
The area of belief revision studies how a rational agent may incorporate new information about a domain into its belief corpus. An agent is characterised by a belief state K, and receives a new item of information @a which is to be included among its ...
Iterated belief change in the situation calculus
John McCarthy's situation calculus has left an enduring mark on artificial intelligence research. This simple yet elegant formalism for modelling and reasoning about dynamic systems is still in common use more than forty years since it was first ...
Comments