Abstract
Description logics are a well-established family of knowledge representation formalisms in Artificial Intelligence. Enriching description logics with non-monotonic reasoning capabilities, especially preferential reasoning as developed by Lehmann and colleagues in the 90’s, would therefore constitute a natural extension of such KR formalisms. Nevertheless, there is at present no generally accepted semantics, with corresponding syntactic characterization, for preferential consequence in description logics. In this paper we fill this gap by providing a natural and intuitive semantics for defeasible subsumption in the description logic \(\mathcal{ALC}\). Our semantics replaces the propositional valuations used in the models of Lehmann et al.. with structures we refer to as concept models. We present representation results for the description logic \(\mathcal{ALC}\) for both preferential and rational consequence relations. We argue that our semantics paves the way for extending preferential and rational consequence, and therefore also rational closure, to a whole class of logics that have a semantics defined in terms of first-order relational structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook, 2nd edn. Cambridge (2007)
Britz, K., Heidema, J., Meyer, T.: Semantic preferential subsumption. In: Proc. of KR, pp. 476–484. AAAI Press/MIT Press (2008)
Britz, K., Meyer, T., Varzinczak, I.: Preferential reasoning for modal logic. In: Proc. of Methods for Modalities (2011)
Casini, G., Straccia, U.: Rational Closure for Defeasible Description Logics. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 77–90. Springer, Heidelberg (2010)
Chellas, B.: Modal logic: An introduction. Cambridge University Press (1980)
Freund, M.: Preferential reasoning in the perspective of Poole default logic. Artificial Intelligence 98, 209–235 (1998)
Giordano, L., Olivetti, N., Gliozzi, V., Pozzato, G.L.: \(\mathcal{ALC}+{T}\): a preferential extension of description logics. Fundamenta Informaticae 96(3), 341–372 (2009)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44, 167–207 (1990)
Lehmann, D., Magidor, M.: Preferential logics: the predicate calculus case. In: Proc. of TARK, pp. 57–72 (1990)
Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? Artificial Intelligence 55, 1–60 (1992)
Poole, D.: A logical framework for default reasoning. Artificial Intelligence 36, 27–47 (1988)
Quantz, J.: A Preference Semantics for Defaults in Terminological Logics. In: Proc. of KR, pp. 294–305 (1992)
Quantz, J., Ryan, M.: Preferential Default Description Logics. Tech. rep., TU Berlin (1993), http://www.tu-berlin.de/fileadmin/fg53/KIT-Reports/r110.pdf
Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Proc. of IJCAI, pp. 466–471 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Britz, K., Meyer, T., Varzinczak, I. (2011). Semantic Foundation for Preferential Description Logics. In: Wang, D., Reynolds, M. (eds) AI 2011: Advances in Artificial Intelligence. AI 2011. Lecture Notes in Computer Science(), vol 7106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25832-9_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-25832-9_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25831-2
Online ISBN: 978-3-642-25832-9
eBook Packages: Computer ScienceComputer Science (R0)