Practical reasoning for expressive Description Logics

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

Volumn 1705 LNAI, Issue , 1999, Pages 161-180

  Horrocks, Ian ^a   Sattler, Ulrike ^b   Tobies, Stephan ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LANGUAGES; KNOWLEDGE REPRESENTATION;

DESCRIPTION LOGIC; EXPRESSIVE DESCRIPTION LOGIC; NUMBER RESTRICTIONS; PRACTICAL REASONING; ROLE HIERARCHY; SATISFIABILITY;

DATA DESCRIPTION;

EID: 84886280180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_11     Document Type: Conference Paper

References (24)

1. F. Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proc. of IJCAI-91, 1991.
2. F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1-2): 195-213, 1996.
3. F. Baader, H.-J. Bürckert, B. Nebel, W. Nutt, and G. Smolka. On the expressivity of feature logics with negation, functional uncertainty, amd sort equations. J. of Logic, Language and Information, 2:1-18, 1993.
4. R. Berger. The undecidability of the dominoe problem. Mem. Amer. Math. Soc, 66, 1966.
5. F. Baader and U. Sattler. Number restrictions on complex roles in description logics. In Proc. of KR-96, pages 328-339, 1996.
6. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constretints. In Proc. of the nth ACM SIGAGT SIGMOD SIGART Sym. on Principles of Database Systems (PODS'98), pages 149-158, 1998.
7. D. Calvanese, G. De Giacomo, M. Lenzerini, D. Nardi, and R. Rosati. Source integration in data wsirehousing. In Proc. of DEXA-98. IEEE Computer Society Press, 1998.
8. D. Calvanese, G. De Giacomo, and M. Lenzerini. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. of the 16th Int. Joint. Conf. on Artificial Intelligence (IJCAI'QQ), 1999.
9. D. Calvanese, G. De Giiicomo, and R. Rosati. A note on encoding inverse roles and functional restrictions in ACC knowledge bases. In Proc. of DL '98, 1998.
10. Diego Calvanese, Maurizio Lenzerini, and Daniele Nardi. A unified framework for class based representation formalisms. Proc. of KR-94, pages 109-120. M. Kaufmann, Los Altos.
11. G. De Giacomo and M. Lenzerini. What's in an aggregate: Foundations for description logics with tuples and sets. In Proc. of IJCAI-95, 1995.
12. G. De Giacomo and M. Lenzerini. Tbox and Abox reasoning in expressive description logics. In Proc. of KR-96, pages 316-327. M. Kaufmeinn, Los Altos, 1996.
13. F. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. In Proc. of KR-91, Boston, MA, USA, 1991.
14. F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Restsoning in description logics. In G. Brewka, editor. Foundation of Knowledge Representation. CSLI Pubhcation, Cambridge University Press, 1996.
15. G. De Giacomo and F. Massaccci. Combining deduction and model checking into tableaux and algorithms for Converse-PDL. Information and Computation, 1998. To apper.
16. B. Hollunder, W. Nutt, and M. Schmidt-Schauss. Subsumption algorithms for concept description languages. In ECAI-90, Pitman PubUshing, London, 1990.
17. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. of KR-98, pages 636-647, 1998.
18. I. Horrocks and U. Sattler. A description logic with transitive and inverse roles and role hierarchies. J. of Logic and Computation, 1999. To appear.
19. I. Horrocks, U. Sattler, and S. Tobies. A PSPACE-algorithm for deciding ALCIR+-satisfiability. Technical Report 98-08, LuFg Theoretical Computer Science, RWTH Aachen, 1998. See http://www-lti.informatik.rwth-aachen.de/ Forschung/Papers.html.
20. I. Horrocks, U. Sattler, and S. Tobies. A description logic with transitive and converse roles, role hierarchies and qualifying number restrictions. LTCS-Report 99-08, LuFg Theoretical Computer Science, RWTH Acichen, Germany, 1999.
21. U. Sattler. A concept language extended with different kinds of trasnsitive roles. In 20. Deutsche Jahrestagung fur KI, LNAI 1137. Springer-Verlag, 1996.
22. K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91, pages 466-471, Sydney, 1991.
23. M. Schmidt-Schaufi and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(l):l-26, 1991.
24. S. Tobies. A PSpace algorithm for graded modal logic. In Proc. of CADE-16, LNCS. Springer, 1999.