Presburger modal logic is PSPACE-complete

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

Volumn 4130 LNAI, Issue , 2006, Pages 541-556

  Demri, Stéphane ^a   Lugiez, Denis ^b  

^a CNRS   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MODAL ANALYSIS; QUERY LANGUAGES; XML;

NUMBER RESTRICTIONS; PRESBURGER CONSTRAINTS; PRESBURGER MODAL LOGIC; QUERY XML DOCUMENTS;

FORMAL LOGIC;

EID: 33749549927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_44     Document Type: Conference Paper

References (33)

1. +05] L. Afanasiev, P. Blackburn, I. Dimitriou, B. Gaiffe, E. Goris, M. Marx, and M. de Rijke. PDL for ordered trees. JANCL, 15(2):115-135, 2005.
2. [ADdR03] N. Alechina, S. Demri, and M. de Rijke. A modal perspective on path constraints. JLC, 13(6):939-956, 2003.
3. [AH94] R. Alur and T. Henzinger. A really temporal logic. JACM, 41(1):181-204, 1994.
4. [BC85] M. Fattorosi Barnaba and F. De Caro. Graded modalities, Studia Logica, 44(2):197-221, 1985.
5. [BCT04] N. Bidoit, S. Cerrito, and V. Thion. A first step towards modeling semistructured data in hybrid multimodal logic. JANCL, 14(4):447-475, 2004.
6. [BdRV01] P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
7. [BP04] P. Bonatti and A. Peron. On the undecidability of logics with converse, nominals, recursion and counting. AI, 158(1):75-96, 2004.
8. [BT05] I. Boneva and J.M. Talbot. Automata and logics for unranked and unordered trees. In RTA'05, volume 3467 of LNCS, pages 500-515, 2005.
9. [Cer94] C. Cerrato. Decidability by filtrations for graded normal logics (graded modalities V). Studio, Logica, 53(1):61-73, 1994.
10. [CG05] D. Calvanese and G. De Giacomo, Expressive description logics. In Description Logics Handbook, pages 178-218. Cambridge University Press, 2005.
11. [Dem03] S. Demri. A polynomial space construction of tree-like models for logics with local chains of modal connectives. TCS, 300(1-3):235-258, 2003.
12. [DL06] S. Demri and D. Lugiez. Presburger modal logic is PSPACE-complete. Technical report, LSV, ENS de Cachan, 2006.
13. [Fin72] K. Fine. In so many possible worlds. NDJFL, 13(4):516-520, 1972.
14. [FL79] M. Fischer and R. Ladner. Prepositional dynamic logic of regular programs. JCSS, 18:194-211, 1979.
15. [Gor99] R. Goré. Tableaux methods for modal and temporal logics. In Handbook of Tableaux Methods, pages 297-396. Kluwer, 1999.
16. [Hem01] E. Hemaspaandra. The complexity of poor man's logic. JLC, 11(4):609-622, 2001.
17. [HST00] I. Horrocks, U. Sattler, and S. Tobies. Reasoning with individuals for the description logic SHIQ. In CADE-17, volume 1831 of LNCS, pages 482-496. Springer, 2000.
18. [KSV02] O. Kupferman, U. Sattler, and M.Y. Vardi. The complexity of the graded μ-calculus. In CADE'02, volume 2392 of LNCS, pages 423-437, 2002.
19. [Lad77] R. Ladner. The computational complexity of provability in systems of modal prepositional logic. SIAM Journal of Computing, 6(3):467-480, 1977.
20. [Mar03] M. Marx. XPath and Modal Logics of finite DAG's. In TABLEAUX'03, volume 2796 of LNAI, pages 150-164. Springer, 2003.
21. [MP97] A. Montanari and A. Policriti. A set-theoretic approach to automated deduction in graded modal logics. In IJCAI-15, pages 196-201, 1997.
22. [OSH96] H.J. Ohlbach, R. Schmidt, and U. Hustadt. Translating graded modalities into predicate logics. In H. Wansing, editor, Proof theory of modal logic, pages 253-291. Kluwer, 1996.
23. [Pap81] Chr. Papadimitriou. On the complexity of integer programming. JACM, 28(4):765-768, 1981.
24. [Spa93] E. Spaan. The complexity of propositional tense logics. In M. de Rijke, editor, Diamonds and Defaults, pages 287-309. Kluwer, 1993.
25. [SSMH04] H. Seidl, Th. Schwentick, A. Muscholl, and P. Habermehl. Counting in trees for free. In ICALP'04, volume 3142 of LNCS, pages 1136-1149, 2004. Long version available at http://www.mathematik.uni-marburg.de/~tick/.
26. [Tob00] S. Tobies. ESPACE reasoning for graded modal logics. JLC, 10:1-22, 2000.
27. [vdH92] W. van der Hoek. On the semantics of graded modalities. JANCL, 2(1):81-123, 1992.
28. [vdHdR95] W. van der Hoek and M. de Rijke. Counting objects. JLC, 5(3):325-345, 1995.
29. [vdHM91] W. van der Hoek and J.-J. Meyer. Graded modalities in epistemic logic. Logique et Analyse, 133-134:251-270, 1991.
30. [VSS05] K. N. Verma, H. Seidl, and Th. Schwentick. On the complexity of equational Horn clauses. In CADE'05, volume 3632 of LNCS, pages 337-352, 2005.
31. [Wol83] P. Wolper. Temporal logic can be more expressive. I & C, 56:72-99, 1983.
32. [ZL03] S. Dal Zilio and D. Lugiez. XML schema, tree logic and sheaves automata. In RTA 2003, volume 2706 of LNCS, pages 246-263. Springer, 2003.
33. [ZL06] S. Dal Zilio and D. Lugiez. XML schema, tree logic and sheaves automata. Applicable Algebra in Engineering, Communication and Computing (AAECC), 2006. To appear.