Hybrid Logics and Ontology Languages

Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for widely used ontology languages such as OIL, DAML+OIL and OWL, the last of which is now a World Wide Web Consortium (W3C) recommendation. SHOIN, the DL underlying OWL DL (the most widely used ''species'' of OWL), includes familiar features from hybrid logic. In particular, in order to support extensionally defined classes, SHOIN includes nominals: classes whose extension is a singleton set. This is an important feature for a logic that is designed for use in ontology language applications, because extensionally defined classes are very common in ontologies. Binders and state variables are another feature from Hybrid Logic that would clearly be useful in an ontology language, but it is well known that adding this feature to even a relatively weak language would lead to undecidability. However, recent work has shown that this feature could play a very useful role in query answering, where the syntactic structure of queries means that the occurrence of state variables is restricted in a way that allows for decidable reasoning.

[1]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[2]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[3]  Ian Horrocks,et al.  Web Ontology Reasoning with Datatype Groups , 2003, SEMWEB.

[4]  Boris Motik,et al.  A Resolution-Based Decision Procedure for SHOIQ , 2006, IJCAR.

[5]  Boris Motik,et al.  Query Answering for OWL-DL with Rules , 2004, SEMWEB.

[6]  Maurizio Lenzerini,et al.  Concept Languages as Query Languages , 1991, AAAI.

[7]  Ian Horrocks,et al.  From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..

[8]  Stephan Tobies,et al.  The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics , 2011, ArXiv.

[9]  Diego Calvanese,et al.  Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics , 2006, AAAI.

[10]  Ian Horrocks,et al.  Conjunctive Query Answering for Description Logics with Transitive Roles , 2006, Description Logics.

[11]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[12]  L McGuinnessDeborah,et al.  An Industrial Strength Description Logics-Based Configurator Platform , 1998 .

[13]  Patrick Blackburn,et al.  Hybrid languages , 1995, J. Log. Lang. Inf..

[14]  Diego Calvanese,et al.  Description Logic Framework for Information Integration , 1998, KR.

[15]  Franz Baader,et al.  An Overview of Tableau Algorithms for Description Logics , 2001, Stud Logica.

[16]  Volker Haarslev,et al.  Description of the RACER System and its Applications , 2001, Description Logics.

[17]  Jan Hladik,et al.  Tableau Systems for SHIO and SHIQ , 2004, Description Logics.

[18]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[19]  L. Stein,et al.  OWL Web Ontology Language - Reference , 2004 .

[20]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[21]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[22]  Ian Horrocks,et al.  OWL Web Ontology Language Reference-W3C Recommen-dation , 2004 .

[23]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[24]  E. Grädel.  The decidability of guarded fixed point logic , 1999 .

[25]  Boris Motik,et al.  Reducing SHIQ-Description Logic to Disjunctive Datalog Programs , 2004, KR.

[26]  Ian Horrocks,et al.  Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[27]  Andrea Schaerf.  Reasoning with Individuals in Concept Languages , 1993, AI*IA.

[28]  M. de Rijke,et al.  JFAK. Essays Dedicated to Johan van Benthem on the occasion of his 50th Birthday , 1999 .

[29]  Ian Horrocks,et al.  A Conjunctive Query Language for Description Logic Aboxes , 2000, AAAI/IAAI.

[30]  Leszek Pacholski,et al.  Complexity of two-variable logic with counting , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[31]  Ian Horrocks,et al.  A Tableaux Decision Procedure for SHOIQ , 2005, IJCAI.

[32]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[33]  Ian Horrocks,et al.  Ontology Reasoning in the SHOQ(D) Description Logic , 2001, IJCAI.

[34]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[35]  Volker Haarslev,et al.  Querying the Semantic Web with Racer + nRQL , 2004 .

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

[37]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.