PDL with intersection and converse Is 2EXP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4423 LNCS, Issue , 2007, Pages 198-212

  Göller, Stefan ^a   Lohrey, Markus ^a   Lutz, Carsten ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; TREES (MATHEMATICS);

CONTAINMENT; PROPOSITIONAL DYNAMIC LOGIC; SATISFIABILITY;

FORMAL LOGIC;

EID: 37149045660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_15     Document Type: Conference Paper

References (20)

1. L. Afanasiev, P. Blackburn, I. Dimitriou, B. Gaiffe, E. Goris, M. J. Marx, and M. de Rijke. PDL for ordered trees. Journal of Applied Non-Classical Logics, 15(2): 115-135, 2005.
2. N. Alechina, S. Demri, and M. de Rijke. A modal perspective on path constraints. Journal of Logic and Computation, 13(6):939-956, 2003.
3. R.Berger. The undecidability of the dominoe problem. Memoirs of the American Mathematical Society, 66, 1966.
4. R. Danecki. Nondeterministic Propositional Dynamic Logic with intersection is decidable. In Proc. 5th Symp. Computation Theory, LNCS 208, pages 34-53, 1984.
5. L. Farinas Del Cerro and E. Orlowska. DAL-a logic for data analysis. Theoretical Computer Science, 36(2-3):251-264, 1985.
6. M. J. Fischer and R. E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
7. G. D. Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proc. AAAI94, pages 205-212, 1994.
8. S. Goller and M. Lohrey. Infinite state model-checking of propositional dynamic logics. In Proc. CSL 2006, LNCS 4207, pages 349-364. Springer, 2006.
9. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. Foundations of computing. The MIT Press, 2000.
10. W. van der Hoek and J.J. Meyer. A complete epistemic logic for multiple agents - Combining distributed and common knowledge. Epistemic Logic and the Theory of Games and Decisions, pages 35-68. Kluwer, 1997.
11. M. Lange and C. Lutz. 2-ExpTime Lower Bounds for Propositional Dynamic Logics with Intersection. Journal of Symbolic Logic, 70(4): 1072-1086, 2005.
12. C. Lutz. PDL with intersection and converse is decidable. In Proc. CSL 2005, LNCS 3634, pages 413-127. Springer, 2005.
13. C. Lutz and D. Walther. PDL with negation of atomic programs. Journal of Applied Non-Classical Logics, 15(2): 189-213, 2005.
14. J. Meyer. Dynamic logic for reasoning about actions and agents. In J. Minker, editor, Logic-Based Artificial Intelligence, pages 281-311. Kluwer Academic Publishers, 2000.
15. D. Muller and P. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54(2-3):267-276, 1987.
16. V. Pratt. A near-optimal method for reasoning about action. Journal of Computer and System Sciences, 20:231-254, 1980.
17. B. ten Cate. The expressivity of XPath with transitive closure. In Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2006), pages 328-337. ACM Press, 2006.
18. H. P. van Ditmarsch, W. van der Hoek, and B. P. Kooi. Concurrent dynamic epistemic logic for MAS. In Proc. AAMAS 2003, pages 201-208. ACM Press, 2003.
19. M. Y. Vardi. The taming of converse: Reasoning about two-way computations. In Proc. Logics of Programs, LNCS 193, pages 413-423. Springer, 1985.
20. M. Y. Vardi. Reasoning about the past with two-way automata. In Proc. ICALP '98, LNCS 1443, pages 628-641. Springer, 1998.