Abstract.
Description Logics (DLs) are a family of knowledge representation formalisms used for terminological reasoning. They have a wide range of applications such as medical knowledge-bases, or the semantic web. Research on DLs has been focused on the development of sound and complete inference algorithms to decide satisfiability and subsumption for increasingly expressive DLs. Non-standard inferences are a group of relatively new inference services which provide reasoning support for the building, maintaining, and deployment of DL knowledge-bases. So far, non-standard inferences are not available for very expressive DLs. In this paper we present first results on non-standard inferences for DLs with transitive roles. As a basis, we give a structural characterization of subsumption for DLs where existential and value restrictions can be imposed on transitive roles. We propose sound and complete algorithms to compute the least common subsumer (lcs).
Ralf Küsters: This work has been supported by the Deutsche Forschungsgemeinschaft, DFG Project BA 1122/4-3.
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.: Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles. LTCS-Report LTCS-02-07, Chair f. Automata Theory, Inst. f. Theor. Comp. Sci. TU Dresden, Germany (2002)
Baader, F., Küsters, R.: Unification in a description logic with inconsistency and transitive closure of roles. In: Horrocks, I., Tessaris, S. (eds.) Proc. of the 2002 International Workshop on Description Logics, Toulouse, France (2002)
Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. LTCS-Report LTCS-98-09, LuFG Theoretical Comp. Sci. RWTH Aachen, Germany (1998)
Baader, F., Küsters, R., Molitor, R.: Computing least common subsumer in description logics with existential restrictions. In: Dean, T. (ed.) Proc. of IJCAI 1999, Stockholm, Sweden, pp. 96–101. Morgan Kaufmann, San Francisco (1999)
Baader, F., Narendran, P.: Unification of concept terms in description logics. In: Prade, H. (ed.) Proc. of ECAI 1998, pp. 331–335. John Wiley & Sons Ltd, Chichester (1998)
Bechhofer, S., Horrocks, I., Goble, C., Stevens, R.: OilEd: a Reason-able Ontology Editor for the Semantic Web. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, p. 396. Springer, Heidelberg (2001)
Borgida, A., McGuinness, D.L.: Asking queries about frames. In: Aiello, L.C., Doyle, J., Shapiro, S.C. (eds.) Proc. of KR 1996, Cambridge, MA, pp. 340–349. Morgan Kaufmann, San Francisco (1996)
Brandt, S., Turhan, A.-Y.: Using non-standard inferences in description logics — what does it buy me? In: Proc. of KIDLWS 2001, Vienna, Austria. CEUR-WS, vol. (44), RWTH Aachen (2001)
Brandt, S., Turhan, A.-Y., Küsters, R.: Foundations of non-standard inferences for description logics with transitive roles. LTCS-Report 03-02, Chair f. Automata Theory, Inst. f. Theor. Comp. Sci. TU Dresden, Germany (2003)
Buchheit, M., Donini, F.M., Schaerf, A.: Decidable reasoning in terminological knowledge representation systems. Journal of Artificial Intelligence Research 1, 109–138 (1993)
Cohen, W.W., Borgida, A., Hirsh, H.: Computing least common subsumers in description logics. In: Swartout, W. (ed.) Proc. of AAAI 1992. AAAI Press, San Jose (1992)
Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: Reasoning in description logics. In: Brewka, G. (ed.) Foundation of Knowledge Representation. CSLI Publication, Cambridge University Press (1996)
Haarslev, V., Möller, R.: Expressive abox reasoning with number restrictions, role hierarchies, and transitively closed roles. In: Proc. of KR 2000 (2000)
Horrocks, I., Sattler, U.: A description logic with transitive and inverse roles. J. of Logic and Computation 9(3), 385–410 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandt, S., Turhan, AY., Küsters, R. (2003). Extensions of Non-standard Inferences to Description Logics with Transitive Roles. In: Vardi, M.Y., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2003. Lecture Notes in Computer Science(), vol 2850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39813-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39813-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20101-4
Online ISBN: 978-3-540-39813-4
eBook Packages: Springer Book Archive