Rational Closure in SHIQ

We define a notion of rational closure for the logic SHIQ, which does not enjoys the finite model property, building on the notion of rational closure introduced by Lehmann and Magidor in [24]. We provide a semantic characterization of rational closure in SHIQ in terms of a preferential semantics, based on a finite rank characterization of minimal models. We show that the rational closure of a TBox can be computed in EXPTIME using entailment in SHIQ.

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

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

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

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

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

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

[7]  KrausSarit,et al.  Nonmonotonic reasoning, preferential models and cumulative logics , 1990 .

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

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

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

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

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

[13]  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..

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

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

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

[17]  Umberto Straccia,et al.  Defeasible Inheritance-Based Description Logics , 2011, IJCAI.

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

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

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

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

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

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

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

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

[26]  Laura Giordano,et al.  Preferential Description Logics , 2007, LPAR.