Abstract
The current research works and the existing problems of terminological cycles in description logics are analyzed in this paper. Referring to the works of Baader F and Nebel B, we aim in a new direction. Firstly, description logic \( v\mathcal{L} \) is defined, and the description graphs GT and GJ are redefined. A syntax condition for the satisfiability of membership relation is given. By using this syntax condition, we prove the following: The subsumption reasoning in \( v\mathcal{L} \) with respect to gfp-model, lfp-model and descriptive model is polynomial.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Giacomo G D, Lenzerini M. A uniform framework for concept definitions in description logics. J Art Intell Res, 1997, 6(1): 87–110
Buchheit M, Donini F M, Nutt W, et al. A refined architecture for terminological systems: terminology = schema + views. Art Intell, 1998, 99(2): 209–260
Sirin E, Parsia B, Grau B C, et al. Pellet: a practical OWL-DL reasoner. J Web Semantics: Science, Services and Agents on the World Wide Web, 2007, 5(2): 51–53
Tsarkov D, Horrocks I. FaCT++ description logic reasoner: system description. In: Furbach U, Shankar N, eds. Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR 2006). LNAI 4130. Berlin: Springer, 2006. 292–297
Haarslev V, Moller R. RACER system description. In: Haarslev V, Moller R, eds. Proceedings of the 1st International Joint Conference on Automated Reasoning (IJCAR 2001). LNAI 2083. London: Springer, 2001. 701–706
Shi Z Z, Dong M K, Jiang Y C, et al. A logic foundation for the semantic Web. Sci China Ser F-Inf Sci, 2005, 48(2): 161–178
Baader F. Using automata theory for characterizing the semantics of terminological cycles. Ann Math Art Intell, 1996, 18(2–4): 175–219
Nebel B. Terminological cycles: semantics and computational properties. In: Sowa J F, ed. Principles of Semantic Networks. San Francisco: Morgan Kaufmann Publishers, 1991. 331–362
Nebel B. Reasoning and revision in hybrid representation systems. LNAI 422. Berlin: Springer-Verlag, 1990. 125–156
Baader F. Terminological cycles in a description logic with existential restrictions. In: Gottlob G, Walsh T, eds. Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003). San Francisco: Morgan Kaufmann Publishers, 2003. 325–330
Henzinger M R, Henzinger T A, Kopke P W. Computing simulations on finite and infinite graphs. In: Prabhakar R, ed. Proceedings of the 36th Annual Symposium on Foundations of Computer Science. New York: IEEE Computer Society Press, 1995. 453–462
Baader F, Calvanese D, McGuinness D, et al. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge: Cambridge University Press, 2003. 47–141
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (Grant Nos. 60496320, 60573010 and 60663001), the National Natural Science Foundation of Guangxi Province, China (Grant No. 0447032), and the Youth Science Foundation of Guangxi Province of China (Grant No. 0640030)
Rights and permissions
About this article
Cite this article
Wang, J., Jiang, Y. & Shen, Y. Satisfiability and reasoning mechanism of terminological cycles in description logic \( v\mathcal{L} \) . Sci. China Ser. F-Inf. Sci. 51, 1204–1214 (2008). https://doi.org/10.1007/s11432-008-0101-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-008-0101-6