Description logics with concrete domains and functional dependencies

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 378-382

  Lutz, Carsten ^a   Miličić, Maja ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONCRETES; FORMAL LANGUAGES;

COMPUTATIONAL PROPERTIES; CONCRETE DOMAINS; DESCRIPTION LOGIC; EXPRESSIVE POWER; FUNCTIONAL DEPENDENCY; KEY CONSTRAINTS;

DATA DESCRIPTION;

EID: 85017397887     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, Addison-Wesley, (1995).
2. F. Baader and P. Hanschke, 'A scheme for integrating concrete domains into concept languages', in Proc. of the Twelfth Int. Joint Conf. on AI (IJCAI-91), pp. 452-457, Sydney, Australia, (1991).
3. F. Baader, I. Horrocks, and U. Sattler, 'Description logics as ontology languages for the semantic web', in Festschrift in honor of Jorg Siekmann, LNAI. Springer-Verlag, (2003).
4. F. Baader, D.L. McGuiness, D. Nardi, and Peter Patel-Schneider, The Description Logic Handbook: Theory, implementation and applications, Cambridge University Press, (2003).
5. E. Borger, E. Gradel, and Y. Gurevich, The Classical Decision Problem, Perspectives in Mathematical Logic, Springer-Verlag, (1997).
6. A. Borgida and G.E. Weddell, 'Adding uniqueness constraints to description logics (preliminary report)', in Proc. of the 5th Int. Conf. on Deductive and Object-Oriented Databases (DOOD97), volume 1341 of LNCS, pp. 85-102. Springer, (1997).
7. D. Calvanese, G. Giacomo, and M. Lenzerini, 'Identification constraints and functional dependencies in description logics', in Proc. of the Seventeenth Int. Joint Conf. on AI (IJCAI'01), pp. 155-160. Morgan-Kaufmann, (2001).
8. I. Horrocks and P. F. Patel-Schneider, 'Optimising description logic subsumption', Jour. of Logic and Computation, 9(3), 267-293, (1999).
9. V.L. Khizder, D. Toman, and G.E. Weddell, 'On decidability and complexity of description logics with uniqueness constraints', in Proc. of the 8th Int. Conf. on Database Theory (ICDT2001), volume 1973 of LNCS, pp. 54-67. Springer, (2001).
10. C. Lutz, 'Description logics with concrete domains-a survey', in Advances in Modal Logics Vol. 4, 265-296. King's College Publications, (2003).
11. C. Lutz, The Complexity of Reasoning with Concrete Domains, Ph.D. dissertation, LuFG Theoretical Computer Science, RWTH Aachen, Germany, (2002).
12. C. Lutz, 'Reasoning about entity relationship diagrams with complex attribute dependencies', in Proc. of the Int. Workshop on Description Logics 2002 (DL2002), number 53 in CEUR-WS (http://ceur-ws.org/), pp. 185-194, (2002).
13. C. Lutz, 'NExpTime-complete description logics with concrete domains', ACM Transactions on Computational Logic, (2003). To appear.
14. C. Lutz, C. Areces, I. Horrocks, and U. Sattler, 'Keys, nominals, and concrete domains', LTCS-Report 02-04, Technical University Dresden, (2002). see http://lat.inf.tu-dresden.de/research/reports.html.
15. C. Lutz, C. Areces, I. Horrocks, and U. Sattler, 'Keys, nominals, and concrete domains', in Proc. of the Eighteenth Int. Joint Conf. on AI (IJCAI'03), pp. 349-354. Morgan-Kaufmann, (2003).
16. C. Lutz and M. Milicic, 'Description logics with concrete domains and functional dependencies', LTCS-Report 04-06, TU Dresden, (2004). see http://lat.inf.tu-dresden.de/research/reports.html.
17. E.M. Post, 'A variant of a recursively unsolvable problem', Bulletin of the American Mathematical Society, 52, 264-268, (1946).
18. D. Toman and G.E.Weddell, 'On reasoning about structural equality in XML: A description logic approach', in Proc. of the 9th Int. Conf. on Database Theory, number 2572 in LNCS, pp. 96-110, (2002).