Keys, nominate, and concrete domains

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 349-354

  Lutz, Carsten ^a   Areces, Carlos ^b   Horrocks, Ian ^c   Sattler, Ulrike ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b INRIA   (France)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AS NUMBERS; COMPLEXITY BOUNDS; CONCRETE DOMAINS; DESCRIPTION LOGIC; KEY CONSTRAINTS; LOGICAL LEVELS; SOCIAL SECURITY NUMBERS;

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; CONCRETES; DATA DESCRIPTION; FORMAL LANGUAGES; XML;

KNOWLEDGE REPRESENTATION;

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

References (19)

1. F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In Proc. ofIJCAI-91, Morgan-Kaufmann, 1991.
2. F. Baader and P. Hanschke. Extensions of concept languages for a mechanical engineering application. In Proc. ofGWAI-92, vol. 671 of LNCS, Springer, 1992.
3. A. Borgida and G.E. Weddell. Adding uniqueness constraints to description logics (preliminary report). In Proc. of DOOD 97, volume 1341 of LNCS, pages 85-102. Springer, 1997.
4. D. Calvanese, G. De Giacomo, and M. Lenzerini. Keys for Free in Description Logics. In Proc. of DL2000, number 33 in http://CEUR-WS.org/, 2000.
5. V. Haarslcv and R. Moller. Practical reasoning in racer with a concrete domain for linear inequations. In Pmc. ofDL2002, number 53 in http://CEUR-WS.org/, 2002.
6. B. Hollunderand F. Baader. Qualifying number restrictions in concept languages. In Proc. of KR'9], Morgan-Kaufmann, 1991.
7. 1. Horrocks and U. Sattler. Ontology reasoning in the SHOQ(D) description logic. In Proc. of IJCAJ-01, Morgan-Kaufmann, 2001.
8. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for very expressive description logics. Logic Journal of the 1GPL, 8(3):239-264, 2000.
9. I. Horrocks, P.F. Patel-Schncidcr, and F. van Harmelen. Reviewing the design of DAML+OIL: An ontology language for the semantic web. In Proc. of AAAI2(X)2, 2002.
10. V. Khizder, D. Toman, and G. Weddell. On Decidability and Complexity of Description Logics with Uniqueness Constraints. In Proc. of ICDT 2001, 2001.
11. D. Knuth. The Art of Computer Programming, volume 1. Addison-Wesley, 1968.
12. C. Lutz, C. Areccs, I. Horrocks, and U. Sattler. Keys, nominals, and concrete domains. LTCS-Report 02-04, Technical University Dresden, 2002. See http://lat.inf.drcsden.de/rescarch/reports.html.
13. C. Lutz. Description logics with concrete domains - a survey. In Proc. of AiML 2002, 2002.
14. C. Lutz. PSPACE reasoning with the description logic ACCT{V). Logic J. of the JGPL, 10(5):535-568, 2002.
15. C. Lutz. Reasoning about entity relationship diagrams with complex attribute dependencies. In Proc. ofDL2002, number 53 in http://CEUR-WS.org/, 2002.
16. C. Lutz. NExpTime-complete description logics with concrete domains. ACM Transactions on Computational Logic, 2003. To appear.
17. n) description logic. In Proc. of DL2002, number 53 in http://CEUR-WS.org/, 2002.
18. E. M. Post. A variant of a recursively unsolvable problem. Bull. of the Amer. Math. Soc, 52:264-268, 1946.
19. D. Toman and G. Weddell. On reasoning about structural equality in XML: A description logic approach. In Proc. of ICDT2003, number 2572 in LNCS, pages 96-110, Springer, 2002.