Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference

We develop a clausal resolution-based approach for computing uniform interpolants of TBoxes formulated in the description logic ALC when such uniform interpolants exist. We also present an experimental evaluation of our approach and of its application to the logical difference problem for real-life ALC ontologies. Our results indicate that in many practical cases uniform interpolants exist and that they can be computed with the presented algorithm.

[1]  Ian Horrocks,et al.  Modular Reuse of Ontologies: Theory and Practice , 2008, J. Artif. Intell. Res..

[2]  Boris Konev,et al.  The Logical Difference for the Lightweight Description Logic EL , 2012, J. Artif. Intell. Res..

[3]  Boris Konev,et al.  Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies , 2009, IJCAI.

[4]  Jeff Z. Pan,et al.  Forgetting Concepts in DL-Lite , 2008, ESWC.

[5]  Willem Conradie,et al.  Definitorially Complete Description Logics , 2006, KR.

[6]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[7]  Carsten Lutz,et al.  Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics , 2011, IJCAI.

[8]  Jean Goubault-Larrecq,et al.  Normal Form Transformations , 2001, Handbook of Automated Reasoning.

[9]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[10]  Patrick Koopmann,et al.  Uniform Interpolation of -Ontologies Using Fixpoints , 2013, FroCos.

[11]  Ian Horrocks,et al.  Supporting concurrent ontology development: Framework, algorithms and tool , 2011, Data Knowl. Eng..

[12]  Sebastian Rudolph,et al.  ExpExpExplosion: Uniform Interpolation in General EL Terminologies , 2012, ECAI.

[13]  Hans Tompits,et al.  Forgetting in Managing Rules and Ontologies , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[14]  Michel C. A. Klein,et al.  Ontology Versioning and Change Detection on the Web , 2002, EKAW.

[15]  P. Koopmann,et al.  Uniform Interpolation of ALC-Ontologies Using Fixpoints , 2013 .

[16]  Andreas Herzig,et al.  Uniform Interpolation by Resolution in Modal Logic , 2008, JELIA.

[17]  Patrice Enjalbert,et al.  Strategies for modal resolution: Results and problems , 2004, Journal of Automated Reasoning.

[18]  Reidar Conradi,et al.  Version models for software configuration management , 1998, CSUR.

[19]  Kewen Wang,et al.  Tableau-based Forgetting in ALC Ontologies , 2010, ECAI 2010.

[20]  Mark A. Musen,et al.  Promptdiff: a fixed-point algorithm for comparing ontology versions , 2002, AAAI/IAAI.

[21]  Jeff Z. Pan,et al.  ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS , 2014, Comput. Intell..

[22]  Ian Horrocks,et al.  ContentCVS: A CVS-based Collaborative ONTology ENgineering Tool , 2009, SWAT4LS.

[23]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

[24]  Clark Thomborson,et al.  Manufacturing cheap, resilient, and stealthy opaque constructs , 1998, POPL '98.

[25]  Yi Zhou,et al.  Bounded Forgetting , 2011, AAAI.

[26]  Ulrike Sattler,et al.  Which Kind of Module Should I Extract? , 2009, Description Logics.

[27]  Boris Konev,et al.  The Logical Difference Problem for Description Logic Terminologies , 2008, IJCAR.

[28]  Carsten Lutz,et al.  An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL , 2012, KR.

[29]  Bijan Parsia,et al.  Concept-Based Semantic Difference in Expressive Description Logics , 2012, Description Logics.

[30]  Boris Konev,et al.  Towards Practical Uniform Interpolation and Forgetting for ALC TBoxes , 2013, Description Logics.