Fixpoints in temporal description logics

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 875-880

  Franconi, Enrico ^a   Toman, David ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY RESULTS; DESCRIPTION LOGIC; FIRST-ORDER; FIXPOINTS;

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES;

DATA DESCRIPTION;

EID: 84878799949     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-152     Document Type: Conference Paper

References (16)

1. Alessandro Artale and Enrico Franconi. Temporal Description Logics. In Dov Gabbay, Michael Fisher, and Lluis Vila, editors, Handbook of Temporal Reasoning in Artificial Intelligence. Elsevier, Foundations of Artificial Intelligence, 2005.
2. A. Artale, E. Franconi, F. Wolter, and M. Zakharyaschev. A temporal description logic for reasoning over conceptual schemas and queries. In Proc. of the 8th European Conference on Logics in Artificial Intelligence (JELIA-2002), 2002.
3. Diego Calvanese, Giuseppe De Giacomo, and Maurizio 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'99), pages 84-89, 1999.
4. R.E. Fisher, M.L. ans Ladner. Propositional dynamic logic of regular programs. J. Computer and Systems Science, 10:194-211, 1979.
5. Enrico Franconi and David Toman. Fixpoint extensions of temporal description logics. In Diego Calvanese, Giuseppe De Giacomo, and Enrico Franconi, editors, Description Logics, volume 81 of CEUR Workshop Proceedings. CEUR-WS.org, 2003.
6. D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications. Elsevier, 2003.
7. I. Hodkinson, F.Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic, 106:85-134, 2000.
8. Ian M. Hodkinson, Frank Wolter, and Michael Zakharyaschev. Monodic fragments of first-order temporal logics: 2000-2001 A.D. In Proceedings of the 8th International Conference on Logic for Programming and Automated Reasoning (LPAR'01), 2001.
9. Ian Hodkinson, Roman Kontchakov, Agi Kurucz, and Michael Zakharyaschev Frank Wolter. On the computational complexity of decidable fragments of first-order linear temporal logics. In Proceedings of the Joint 10th International Symposium on Temporal Representation and Reasoning and 4th International Conference on Temporal Logic (TIME-ICTL 2003), 2003.
10. Ian M. Hodkinson. Monodic packed fragment with equality is decidable. Studia Logica, 72(2):185-197, 2002.
11. Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. Temporal description logics: A survey. In 15th International Symposium on Temporal Representation and Reasoning, TIME 2008, Université du Québec à Monteéal, Canada, 16-18 June 2008, pages 3-14, 2008.
12. Robert S. Streett and E. Allen Emerson. The propositional mu-calculus is elementary. In Jan Paredaens, editor, ICALP, volume 172 of Lecture Notes in Computer Science, pages 465-472. Springer, 1984.
13. Moshe Y. Vardi. A Temporal Fixpoint Calculus. In 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 88), pages 250-259, 1988.
14. Pierre Wolper. Temporal Logic Can Be More Expressive. Information and Control, 56(1/2):72-99, 1983. (Pubitemid 14570587)
15. F. Wolter and M. Zakharyaschev. Temporalizing description logics. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems. Studies Press-Wiley, 1999.
16. Also in the Proceedings of FroCoS'98, Amsterdam, 1998.