Least General Generalizations in Description Logic: Verification and Existence

We study two forms of least general generalizations in description logic, the least common subsumer (LCS) and most specific concept (MSC). While the LCS generalizes from examples that take the form of concepts, the MSC generalizes from individuals in data. Our focus is on the complexity of existence and verification, the latter meaning to decide whether a candidate concept is the LCS or MSC. We consider cases with and without a background TBox and a target signature. Our results range from coNP-complete for LCS and MSC verification in the description logic eℒ without TBoxes to undecidability of LCS and MSC verification and existence in eℒI with TBoxes. To obtain results in the presence of a TBox, we establish a close link between the problems studied in this paper and concept learning from positive and negative examples. We also give a way to regain decidability in eℒI with TBoxes and study single example MSC as a special case.

[1]  Ralf Küsters,et al.  Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions , 1998, KI.

[2]  Jean Christoph Jung,et al.  Conservative Extensions in Horn Description Logics with Inverse Roles , 2020, J. Artif. Intell. Res..

[3]  Vítor Santos Costa,et al.  Inductive Logic Programming , 2013, Lecture Notes in Computer Science.

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

[5]  Pablo Barceló,et al.  The complexity of reverse engineering problems for conjunctive queries , 2016, ICDT.

[6]  Alexander Borgida,et al.  Computing Least Common Subsumers in Description Logics , 1992, AAAI.

[7]  Jens Lehmann,et al.  Ideal Downward Refinement in the EL Description Logic , 2009, ILP.

[8]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[9]  Balder ten Cate,et al.  The Product Homomorphism Problem and Applications , 2015, ICDT.

[10]  Francesca A. Lisi.  A Formal Characterization of Concept Learning in Description Logics , 2012, Description Logics.

[11]  Jens Lehmann,et al.  DL-Learner Structured Machine Learning on Semantic Web Data , 2018, WWW.

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

[13]  Franz Baader,et al.  Pushing the EL Envelope Further , 2008, OWLED.

[14]  Kai-Uwe Kühnberger,et al.  A computational framework for conceptual blending , 2018, Artif. Intell..

[15]  David Harel,et al.  On the Complexity of Verifying Concurrent Transition Systems , 1997, Inf. Comput..

[16]  Alexander Borgida,et al.  What's in an Attribute? Consequences for the Least Common Subsumer , 2001, J. Artif. Intell. Res..

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

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

[19]  Ralf Küsters,et al.  Approximating most specific concepts in description logics with existential restrictions , 2002, AI Commun..

[20]  Francesco M. Donini,et al.  Defining and Computing Least Common Subsumers in RDF , 2016, J. Web Semant..

[21]  Franz Baader,et al.  Computing the Least Common Subsumer w.r.t. a Background Terminology , 2004, Description Logics.

[22]  Pascal Hitzler,et al.  Efficient Concept Induction for Description Logics , 2018, AAAI.

[23]  Anni-Yasmin Turhan,et al.  Most Specific Generalizations w.r.t. General EL-TBoxes , 2013, IJCAI.

[24]  Liviu Badea,et al.  A Refinement Operator for Description Logics , 2000, ILP.

[25]  Franz Baader.  Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles , 2003, IJCAI.

[26]  Ralf Küsters,et al.  Computing Least Common Subsumers in Description Logics with Existential Restrictions , 1999, IJCAI.

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

[28]  Paul Sambre,et al.  Gilles Fauconnier & Mark Turner, " The way we think: conceptual blending and the mind's hidden complexities" , 2002 .

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