Living Without Beth and Craig: Explicit Definitions and Interpolants in Description Logics with Nominals (Extended Abstract)

The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (BDP) states that an explicit definition exists iff a formula stating implicit definability is valid. Thus, they transform potentially hard existence problems into deduction problems in the underlying logic. Description Logics with nominals do not have the CIP nor BDP, but in particular, deciding and computing explicit definitions of concepts or individuals has many potential applications in ontology engineering and ontology-based data management. In this article we show two main results: even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in the description logics with nominals ALCO and ALCIO. However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity.

[1]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[2]  D. Gabbay,et al.  Interpolation and Definability: Modal and Intuitionistic Logic , 2005 .

[3]  A. Visser Uniform interpolation and layered bisimulation , 1996 .

[4]  Michael Benedikt,et al.  Effective Interpolation and Preservation in Guarded Logics , 2014, CSL-LICS.

[5]  J. Bruijn,et al.  Effective query rewriting with ontologies over DBoxes , 2009, IJCAI 2009.

[6]  Alexander Borgida,et al.  Concerning Referring Expressions in Query Answers , 2017, IJCAI.

[7]  Balder ten Cate Interpolation for extended modal languages , 2005, J. Symb. Log..

[8]  Boris Konev,et al.  Decomposing Description Logic Ontologies , 2010, KR.

[9]  Maarten Marx,et al.  Beth Definability for the Guarded Fragment , 1999, LPAR.

[10]  Jean Christoph Jung,et al.  Model Comparison Games for Horn Description Logics , 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[11]  Maarten Marx,et al.  Interpolation and Definability in Guarded Fragments , 2002, Stud Logica.

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

[13]  Maarten Marx,et al.  Queries determined by views: pack your views , 2007, PODS.

[14]  Jean Christoph Jung,et al.  Living without Beth and Craig: Explicit Definitions and Interpolants in the Guarded Fragment , 2020, ArXiv.

[15]  Patrick Koopmann,et al.  Uniform Interpolation and Forgetting for ALC Ontologies with ABoxes , 2014, AAAI.

[16]  David Toman,et al.  Identity Resolution in Ontology Based Data Access to Structured Data Sources , 2019, PRICAI.

[17]  Jean Christoph Jung,et al.  Learning Description Logic Concepts: When can Positive and Negative Examples be Separated? (Abstract) , 2019, Description Logics.

[18]  Diego Calvanese,et al.  Combined Covers and Beth Definability , 2020, IJCAR.

[19]  Carsten Lutz,et al.  The Data Complexity of Ontology-Mediated Queries with Closed Predicates , 2019, Log. Methods Comput. Sci..

[20]  Robert Piro,et al.  Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability , 2011, IJCAI.

[21]  Tomasz Kowalski,et al.  Uniform interpolation and coherence , 2018, Ann. Pure Appl. Log..

[22]  Michael Benedikt,et al.  SOME MODEL THEORY OF GUARDED NEGATION , 2018, The Journal of Symbolic Logic.

[23]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[24]  Valentina A. M. Tamma,et al.  Limiting Logical Violations in Ontology Alignnment Through Negotiation , 2016, KR.

[25]  B. T. Cate,et al.  Model theory for extended modal languages , 2005 .

[26]  Cesare Tinelli,et al.  Ground Interpolation for Combined Theories , 2009, CADE.

[27]  Johan van Benthem,et al.  The many faces of interpolation , 2008, Synthese.

[28]  Karsten Henckell,et al.  Aperiodic Pointlikes and Beyond , 2007, Int. J. Algebra Comput..

[29]  Boris Konev,et al.  Formal Properties of Modularisation , 2009, Modular Ontologies.

[30]  Andrea Schaerf,et al.  On the complexity of the instance checking problem in concept languages with existential quantification , 1993, Journal of Intelligent Information Systems.

[32]  Michael Benedikt,et al.  Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation , 2016, Synthesis Lectures on Data Management.

[33]  Alexander Borgida,et al.  On Referring Expressions in Query Answering over First Order Knowledge Bases , 2016, KR.

[34]  Maarten Marx,et al.  Hybrid logics: characterization, interpolation and complexity , 2001, Journal of Symbolic Logic.

[35]  Sebastian Rudolph,et al.  (Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL , 2014, Artif. Intell..

[36]  Michael Benedikt,et al.  Interpolation with Decidable Fixpoint Logics , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

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

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

[39]  Emiel Krahmer,et al.  Computational Generation of Referring Expressions: A Survey , 2012, CL.

[40]  Enrico Franconi,et al.  Beth Definability in Expressive Description Logics , 2011, IJCAI.

[41]  Karsten Henckell,et al.  Pointlike sets: the finest aperiodic cover of a finite semigroup , 1988 .

[42]  Jean Christoph Jung,et al.  Logical Separability of Incomplete Data under Ontologies , 2020, KR.

[43]  D. Nardi,et al.  An Introduction to Description Logic , 2017 .

[44]  Rosalie Iemhoff Uniform interpolation and the existence of sequent calculi , 2019, Ann. Pure Appl. Log..

[45]  Alberto Griggio,et al.  Interpolant Generation for UTVPI , 2009, CADE.

[46]  Jean Christoph Jung,et al.  Separating Positive and Negative Data Examples by Concepts and Formulas: The Case of Restricted Signatures (Abstract) , 2020, Description Logics.

[47]  Ian Horrocks,et al.  An Introduction to Description Logic , 2017 .

[48]  David Toman,et al.  Fundamentals of Physical Design and Query Compilation , 2011, Fundamentals of Physical Design and Query Compilation.

[49]  Valentin Goranko,et al.  Model theory of modal logic , 2007, Handbook of Modal Logic.