Reasoning with concrete domains

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 90-95

  Lutz, Carsten ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT LEVELS; CONCEPTUAL KNOWLEDGE; CONCRETE DOMAINS; CONCRETE OBJECTS; DESCRIPTION LOGIC; OPTIMAL ALGORITHM; SPATIAL REGIONS; TIME INTERVAL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA DESCRIPTION; FORMAL LANGUAGES;

CONCRETES;

EID: 84880661289     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In John Mylopoulos and Ray Reiter, editors, Proc. of UCAI-91, pages 452-457, Sydney, Australia, August 24-30, 1991.
2. F. Baader and P. Hanschke. Extensions of concept languages for a mechanical engineering application. In Proc. of GWAI-92, volume 671 of LNCS, pages 132-143, Bonn, Germany, 1993. Springer-Verlag.
3. F. Baader and B. Hollunder. KRIS: Knowledge representation and inference system. SIGART Bulletin, 2(3):8-14, 1991. Special Issue on Implemented Knowledge Representation and Reasoning Systems.
4. F. Baader and U. Sattler. Description logics with concrete domains and aggregation. In Henri Prade, editor, Proc. of ECAI-98, Brighton, August 23-28, 1998. John Wiley & Sons, New York, 1998.
5. A. Borgida, R.J. Brachman, D.L. McGuiness, and L. Alpern Resnick. CLASSIC: A structural data model for objects. In Proc. of 1989 ACM SIGMOID pages 59-67, Portland, OR, 1989.
6. V. Haarslev, C. Lutz, and R. Moller. A description logic with concrete domains and role-forming predicates. Journal of Ijogic and Computation, 1998. To appear.
7. B. Hollunder and W. Nutt. Subsumption algorithms for concept languages. DFKI Research Report RR-90-04, German Research Center for Artificial Intelligence, Kaiserslautern, 1990.
8. B. Hollunder. Algorithmic Foundations of Terminological Knowledge Representation Systems. PhD thesis, Universitiit des Saarlandes, 1994.
9. I. Horrocks. Using an expressive description logic: Fact or fiction? In A.G. Cohn, L.K. Schubert, and S.C. Shapiro, editors, Proc. ofKR' 98, pages 636- 647, Trento, Italy, 1998. Morgan Kaufmann Publ. Inc., San Francicso, CA, 1998.
10. C. Lutz. The complexity of reasoning with concrete domains. LTCS-Report 99-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999.
11. C. Lutz. On the Complexity of Terminological Reasoning. LTCS-Report 99-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. To appear.
12. U. Sattler. A concept language extended with different kinds of transitive roles. In G. Gorz and S. Holldobler, editors, 20. Deutsche Jahrestagung fur KI, volume 1137 of Lecture Notes in Artificial Intelligence, 1996.
13. W. J. Savitch. Relationsship between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4:177-192, 1970.
14. M. Schmidt-SchauB and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1): 1-26, 1991.