Semantic characterization of rational closure: From propositional logic to description logics

Abstract In this paper we provide a semantic reconstruction of rational closure. We first consider rational closure as defined by Lehman and Magidor [33] for propositional logic, and we provide a semantic characterization based on a minimal models mechanism on rational models. Then we extend the whole formalism and semantics to Description Logics, by focusing our attention to the standard ALC : we first naturally adapt to Description Logics Lehman and Magidor's propositional rational closure, starting from an extension of ALC with a typicality operator T that selects the most typical instances of a concept C (hence T ( C ) stands for typical C). Then, for the Description Logics, we define a minimal model semantics for the logic ALC and we show that it provides a semantic characterization for the rational closure of a Knowledge base. We consider both the rational closure of the TBox and the rational closure of the ABox.

[1]  Laura Giordano,et al.  Minimal Model Semantics and Rational Closure in Description Logics , 2013, Description Logics.

[2]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

[3]  Laura Giordano,et al.  A Nonmonotonic Extension of KLM Preferential Logic P , 2010, LPAR.

[4]  Joseph Y. Halpern,et al.  Plausibility measures and default reasoning , 1996, JACM.

[5]  Laura Giordano,et al.  Rational Closure in SHIQ , 2014, Description Logics.

[6]  Donald Nute,et al.  Counterfactuals , 1975, Notre Dame J. Formal Log..

[7]  Sanghamitra Bandyopadhyay,et al.  Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph , 2009, Fundam. Informaticae.

[8]  Judea Pearl,et al.  System Z: a Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning^ , 1990 .

[9]  Umberto Straccia,et al.  Defeasible Inheritance-Based Description Logics , 2013, J. Artif. Intell. Res..

[10]  Umberto Straccia,et al.  Lexicographic Closure for Defeasible Description Logics , 2012 .

[11]  Laura Giordano,et al.  Reasoning about Typicality in Low Complexity DLs: The Logics EL⊥Tmin and DL-Litec Tmin , 2011, IJCAI.

[12]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..

[13]  Laura Giordano,et al.  Preferential vs Rational Description Logics: which one for Reasoning About Typicality? , 2010, ECAI.

[14]  Umberto Straccia.  Default Inheritance Reasoning in Hybrid KL-ONE-Style Logics , 1993, IJCAI.

[15]  Thomas Andreas Meyer,et al.  Semantic Foundation for Preferential Description Logics , 2011, Australasian Conference on Artificial Intelligence.

[16]  Pascal Hitzler,et al.  Local Closed World Semantics: Keep it simple, stupid! , 2011, Description Logics.

[17]  Thomas Andreas Meyer,et al.  Semantic Preferential Subsumption , 2008, KR.

[18]  Laura Giordano,et al.  A non-monotonic Description Logic for reasoning about typicality , 2013, Artif. Intell..

[19]  Thomas Andreas Meyer,et al.  A Protege Plug-in for Defeasible Reasoning , 2012, Description Logics.

[20]  Umberto Straccia,et al.  Rational Closure for Defeasible Description Logics , 2010, JELIA.

[21]  Craig Boutilier,et al.  Conditional Logics of Normality: A Modal Approach , 1994, Artif. Intell..

[22]  Didier Dubois,et al.  Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), Whistler, Canada, June 2-5, 2004 , 2004, KR.

[23]  Laura Giordano,et al.  PreDeLo 1.0: A Theorem Prover for Preferential Description Logics , 2013, AI*IA.

[24]  Ulrike Sattler,et al.  Next Steps for Description Logics of Minimal Knowledge and Negation as Failure , 2008, Description Logics.

[25]  Laura Giordano,et al.  Analytic tableaux calculi for KLM logics of nonmonotonic reasoning , 2006, TOCL.

[26]  Laura Giordano,et al.  ALC + T: a Preferential Extension of Description Logics , 2009, Fundam. Informaticae.

[27]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[28]  Laura Giordano,et al.  A Minimal Model Semantics for Nonmonotonic Reasoning , 2012, JELIA.

[29]  Carsten Lutz,et al.  The Complexity of Circumscription in DLs , 2009, J. Artif. Intell. Res..

[30]  Daniel Lehmann,et al.  What does a Conditional Knowledge Base Entail? , 1989, Artif. Intell..

[31]  Francesco M. Donini,et al.  Description logics of minimal knowledge and negation as failure , 2002, TOCL.

[32]  Boris Motik,et al.  Reconciling description logics and rules , 2010, JACM.

[33]  Michael Freund,et al.  Preferential Reasoning in the Perspective of Poole Default Logic , 1998, Artif. Intell..

[34]  Thomas Andreas Meyer,et al.  Nonmonotonic Reasoning in Description Logics: Rational Closure for the ABox , 2013, Description Logics.

[35]  Jeff B. Paris,et al.  A Note on the Rational Closure of Knowledge Bases with Both Positive and Negative Knowledge , 1998, J. Log. Lang. Inf..

[36]  Grigoris Antoniou,et al.  Nonmonotonic reasoning , 1997 .

[37]  Franz Baader,et al.  Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic , 1995, Journal of Automated Reasoning.

[38]  Laura Giordano,et al.  A tableaux calculus for ALC + T , 2013 .

[39]  Franz Baader,et al.  Qualifying Number Restrictions in Concept Languages , 1991, KR.

[40]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.