Abstract
Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that unification in the small description logic \( \mathcal{F}\mathcal{L}_0 \) , which allows for conjunction, value restriction, and the top concept only, is already ExpTime-complete. The present paper shows that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles. It also shows that matching (which is polynomial in \( \mathcal{F}\mathcal{L}_0 \) ) is PSpace-complete in the extended description logic. These results are proved via a reduction to linear equations over regular languages, which are then solved using automata. The obtained results are also of interest in formal language theory.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The Complexity of Set Constraints. In Proc. 1993 Conf. Computer Science Logic (CSL’93), volume 832 of LNCS, pages 1–17. European Association Computer Science Logic, Springer, 1993.
F. Baader. Augmenting Concept Languages by Transitive Closure of Rules: An Alternativ to Terminological Cycles. In Proc. of the 12th International Joint Conference on Artificial Intelligence (IJCAI’91), pages 446–451, 1991. Morgan Kaufmann Publishers.
F. Baader. Using Automata Theory for Characterizing the Semantics of Terminological Cycles. Annals of Mathematics and Artificial Intelligence, 18(2–4):175–219, 1996.
F. Baader and B. Hollunder. A Terminological Knowledge Representation System with Complete Inference Algorithms. In Proc. of the First International Workshop on Processing Declarative Knowledge, volume 572 of LNCS, pages 67–85, 1991. Springer-Verlag.
F. Baader and R. Küsters. Matching in Description Logics with Existential Restrictions. In Proc. of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000), pages 261–272, 2000. Morgan Kaufmann Publishers.
F. Baader and R. Küsters. Unification in a Description Logic with Transitive Closure of Roles. LTCS-Report 01-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
F. Baader, R. Küsters, A. Borgida, and D. McGuinness. Matching in Description Logics. Journal of Logic and Computation, 9(3):411–447, 1999.
F. Baader and P. Narendran. Unification of Concept Terms in Description Logics. In Proc. of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 331–335, 1998. John Wiley & Sons Ltd. An extended version has appeared in J. Symbolic Computation 31:277-305, 2001.
A. Borgida and D. L. McGuinness. Asking Queries about Frames. In Proc. of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR’96), pages 340–349, 1996. Morgan Kaufmann Publishers.
R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171–216, 1985.
E. Leiss. Implicit language equations: Existence and uniqueness of solutions. Theoretical Computer Science A, 145:71–93, 1995.
E. Leiss. Language Equations. Springer-Verlag, 1999.
D.L. McGuinness. Explaining Reasoning in Description Logics. PhD thesis, Department of Computer Science, Rutgers University, October, 1996.
H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2), 1994.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133–191. Elsevier Science Publishers, Amsterdam, 1990.
S. Yu and Q. Zhuang. On the State Complexity of Intersection of Regular Languages. ACM SIGACT News, 22(3):52–54, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Küsters, R. (2001). Unification in a Description Logic with Transitive Closure of Roles. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive