Unification in a description logic with transitive closure of roles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2250, Issue , 2001, Pages 217-232

  Baader, Franz ^a   Küsters, Ralf ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES;

CONCEPT DESCRIPTION; DESCRIPTION LOGIC; EXPTIME; FORMAL LANGUAGE THEORY; KNOWLEDGE BASIS; PSPACE-COMPLETE; TRANSITIVE CLOSURE;

DATA DESCRIPTION;

EID: 84937404541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_15     Document Type: Conference Paper

References (17)

1. 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.
2. 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.
3. F. Baader. Using Automata Theory for Characterizing the Semantics of Terminological Cycles. Annals of Mathematics and Artificial Intelligence, 18(2-4):175-219, 1996.
4. 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.
5. 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.
6. 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.
7. F. Baader, R. Küsters, A. Borgida, and D. McGuinness. Matching in Description Logics. Journal of Logic and Computation, 9(3):411-447, 1999.
8. 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.
9. An extended version has appeared in J. Symbolic Computation 31:277-305, 2001.
10. 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.
11. R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171-216, 1985.
12. E. Leiss. Implicit language equations: Existence and uniqueness of solutions. Theoretical Computer Science A, 145:71-93, 1995.
13. E. Leiss. Language Equations. Springer-Verlag, 1999.
14. D. L. McGuinness. Explaining Reasoning in Description Logics. PhD thesis, Department of Computer Science, Rutgers University, October, 1996.
15. H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2), 1994.
16. 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.
17. S. Yu and Q. Zhuang. On the State Complexity of Intersection of Regular Languages. ACM SIGACT News, 22(3):52-54, 1991.