Separating Data Examples by Description Logic Concepts with Restricted Signatures

We study the separation of positive and negative data examples in terms of description logic concepts in the presence of an ontology. In contrast to previous work, we add a signature that specifies a subset of the symbols that can be used for separation, and we admit individual names in that signature. We consider weak and strong versions of the resulting problem that differ in how the negative examples are treated and we distinguish between separation with and without helper symbols. Within this framework, we compare the separating power of different languages and investigate the complexity of deciding separability. While weak separability is shown to be closely related to conservative extensions, strongly separating concepts coincide with Craig interpolants, for suitably defined encodings of the data and ontology. This enables us to transfer known results from those fields to separability. Conversely, we obtain original results on separability that can be transferred backward. For example, rather surprisingly, conservative extensions and weak separability in ALCO are both 3ExpTime-complete.

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

[2]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[3]  Jean Christoph Jung,et al.  Least General Generalizations in Description Logic: Verification and Existence , 2020, AAAI.

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

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

[6]  William Craig,et al.  Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory , 1957, Journal of Symbolic Logic.

[7]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[8]  Jens Lehmann,et al.  Concept learning in description logics using refinement operators , 2009, Machine Learning.

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

[10]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

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

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

[13]  Carsten Lutz,et al.  Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics , 2006, KR.

[14]  Jean Christoph Jung,et al.  Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments , 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

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

[16]  Ian Horrocks,et al.  Entity Comparison in RDF Graphs , 2017, SEMWEB.

[17]  Carsten Lutz,et al.  Dichotomies in Ontology-Mediated Querying with the Guarded Fragment , 2017, PODS.

[18]  Andrei Voronkov,et al.  Vinter: A Vampire-Based Tool for Interpolation , 2012, APLAS.

[19]  Stephen Daniel Comer,et al.  CLASSES WITHOUT THE AMALGAMATION PROPERTY , 1969 .

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

[21]  Boris Konev,et al.  Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey , 2016, RW.

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

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

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

[25]  A. K. Chandra,et al.  Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[26]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[27]  Ian Horrocks,et al.  Query-Based Entity Comparison in Knowledge Graphs Revisited , 2019, SEMWEB.

[28]  Jean Christoph Jung,et al.  Reverse Engineering Queries in Ontology-Enriched Systems: The Case of Expressive Horn Description Logic Ontologies , 2018, IJCAI.

[29]  Carsten Lutz,et al.  Conservative Extensions in Expressive Description Logics , 2007, IJCAI.

[30]  Don Pigozzi,et al.  Amalgamation, congruence-extension, and interpolation properties in algebras , 1971 .

[31]  Jean Christoph Jung,et al.  Conservative Extensions in Guarded and Two-Variable Fragments , 2017, ICALP.

[32]  Denis Mayr Lima Martins,et al.  Reverse engineering database queries from examples: State-of-the-art, challenges, and research opportunities , 2019, Inf. Syst..

[33]  Jean Christoph Jung,et al.  On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions , 2020, KR.

[34]  Jean Christoph Jung,et al.  Living Without Beth and Craig: Definitions and Interpolants in Description Logics with Nominals and Role Inclusions , 2021, AAAI.

[35]  Magdalena Ortiz,et al.  Ontology-Mediated Queries from Examples: a Glimpse at the DL-Lite Case , 2019, GCAI.

[36]  Daniele Nardi,et al.  An Introduction to Description Logics , 2003, Description Logic Handbook.

[37]  Egor V. Kostylev,et al.  Reverse Engineering SPARQL Queries , 2016, WWW.