On the undecidability of logics with converse, nominals, recursion and counting

Artificial Intelligence

Volumn 158, Issue 1, 2004, Pages 75-96

  Bonatti, Piero A ^a   Peron, A ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Description logics; Graded modalities; Hybrid calculus; Number restrictions; Regular roles

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; DECISION MAKING; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS;

DESCRIPTION LOGICS; GRADED MODALITIES; HYBRID Μ-CALCULUS; NUMBER RESTRICTIONS; REGULAR ROLES;

ARTIFICIAL INTELLIGENCE;

EID: 3142742517     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.04.012     Document Type: Article

References (19)

1. Baader F., Calvanese D., McGuinness D.L., Nardi D., Patel-Schneider P.F. The Description Logic Handbook. 2003;Cambridge University Press, Cambridge.
2. Berger R. The undecidability of the domino problem. Mem. Amer. Math. Soc. vol. 66:1966;1-72 Amer. Math. Soc. Providence, RI.
3. P. Blackburn, Nominal tense logic and other sorted intensional frameworks, Ph.D. Thesis, University of Edinburgh, 1990.
4. Bonatti P.A. Towards service description logics. Proc. of JELIA'02, Cosenza, Italy. Lecture Notes in Artif. Intel. vol. 2424:2002;74-85 Springer, Berlin.
5. Bonatti P.A. Undecidability results for description and dynamic logics with recursion and counting. Proc. of IJCAI'03, Acapulco, Mexico. 2003;331-336 Morgan Kaufmann, San Mateo, CA.
6. Calvanese D., De Giacomo G., Lenzerini M. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. Proc. of IJCAI'99, Stockholm, Sweden. 1999;84-89 Morgan Kaufmann, San Mateo, CA.
7. Cerato C. General canonical models for graded normal logics. Studia Logica. 49:(2):1990;242-252.
8. G. De Giacomo, Decidability of class-based knowledge representation formalisms, Ph.D. Thesis, Università di Roma "La Sapienza", 1995.
9. De Giacomo G., Lenzerini M. Boosting the correspondence between description logics and propositional dynamic logics. Proc. of the 12th National Conference on Artificial Intelligence (AAAI'94), Seattle, WA. 1994;205-212 AAAI Press.
10. de Rijke M. The modal logic of inequality. J. Symbolic Logic. 57:1992;566-584.
11. Fattorossi Barnaba M., De Caro F. Graded modalities. Studia Logica. 44:(2):1985;197-221.
12. Gargov G., Goranko V. Modal logic with names. J. Philos. Logic. 22:(6):1993;607-636.
13. Gargov G., Passy S. Determinism and looping in combinatory PDL. Theoretical Comput. Sci. 61:1988;259-277.
14. Horrocks I., Sattler U., Tobies S. Practical reasoning for very expressive description logics. Logic J. IGPL. 8:(3):2000;239-263.
15. Kupferman O., Sattler U., Vardi M.Y. The Complexity of the graded μ -calculus. Proc. of 18th Conf. on Automated Deduction (CADE 2002), Copenhagen, Denmark. Lecture Notes in Comput. Sci. vol. 2392:2002;423-437 Springer, Berlin.
16. Passy S., Tinchev T. PDL with data constants. Inform. Processing Lett. 20:1985;35-41.
17. Passy S., Tinchev T. An essay in combinatory dynamic logic. Inform. Comput. 93:1991;263-332.
18. Schild K. A correspondence theory for terminological logics: Preliminary report. Proc. of the 12th International Joint Conference on Artificial Intelligence (IJCAI'91), Sydney, Australia. 1991;466-471 Morgan Kaufmann, San Mateo, CA.
19. Sattler U., Vardi M.Y. The hybrid μ -calculus. Proc. of the First Int. Joint Conf. on Automated Reasoning (IJCAR'01), Siena, Italy. Lecture Notes in Artif. Intel. vol. 2083:2001;76-91 Springer, Berlin.