A polynomial space construction of tree-like models for logics with local chains of modal connectives

Theoretical Computer Science

Volumn 300, Issue 1-3, 2003, Pages 235-258

  Demri, Stéphane ^a  

^a CNRS   (France)

Author keywords

Computational complexity; Ladner like algorithm; Local agreement; Modal logic

Indexed keywords

MODAL ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; SEMANTICS; TREES (MATHEMATICS);

MODAL CONNECTIVES;

COMPUTER SCIENCE;

EID: 0038076445     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00082-8     Document Type: Article

References (45)

1. Archangelsky D., Taitslin M. A logic for data description. Meyer A., Taitslin M. Symp. Logic Foundations of Computer Science, Pereslavl-Zalessky. Lecture Notes in Computer Science. Vol. 363:1989;2-11 Springer, Berlin.
2. Baader F., Sattler U. An overview of tableau algorithms for description logics. Studia Logica. 69:2001;5-40.
3. Balbiani Ph. A modal logic for data analysis. Penczek W., Szalas A. 21st Symp. Math. Foundations of Computer Sciences, Krakow, Poland. Lecture Notes in Computer Science. Vol. 1113:1996;167-179 Springer, Berlin.
4. Balbiani Ph. Emptiness relations in property systems. de Swart H. Sixth Internat. Workshop on Relational Methods in Computer Science. 2001;47-61 Oisterwijk, The Netherlands.
5. Balbiani Ph., Orlowska E. A hierarchy of modal logics with relative accessibility relations. J. Appl. Non-Classical Logics. 9(2-3):1999;303-328. (special issue in the memory of George Gargov).
6. Blackburn P., de Rijke M., Venema Y. Modal Logic. 2001;Cambridge University Press, Cambridge.
7. Chen C.-C., Lin I-P. The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics. Theoret. Comput. Sci. 129:1994;95-121.
8. Demri S. The validity problem for the logic DALLA is decidable. Bull. Polish Acad. Sci. Math. Section. 44(1):1996;79-86.
9. Demri S. A class of decidable information logics. Theoret. Comput. Sci. 195(1):1998;33-60.
10. Demri S. The nondeterministic information logic NIL is PSPACE-complete. Fund. Inform. 42:2000;211-234.
11. S. Demri, Modal logics with weak forms of recursion: PSPACE specimens, in: M. de Rijke, H. Wansing, F. Wolter, M. Zakharyaschev (Eds.), Advances in Modal Logics, selected papers from Third Workshop on Advances in Modal Logics (AIML'2000), Leipzig, Germany, 2000. CSLI, 2001. Preliminary version available via http://www.lsv.ens-cachan.fr/̃demri/ on WWW, to appear.
12. Demri S., Orłowska E. Logical analysis of indiscernibility. Orłowska E. Incomplete Information: Rough Set Analysis. 1998;347-380 Physica Verlag, Heidelberg.
13. S. Demri, E. Orlowska, Incomplete Information: Structure, Inference, Complexity, EATCS Monograph Series, Springer, Berlin, to appear.
14. S. Demri, Ph. Schnoebelen, The complexity of propositional linear temporal logics in simple cases. Information and Computation, 2002. Preliminary version available via http://www.lsv.ens-cachan.fr/̃demri/ on WWW, to appear.
15. Donini F., Lenzerini M., Nardi D., Nutt W. The complexity of concept languages. Inform. Comput. 134:1997;1-58.
16. Emerson A., Jutla C., Sistla A. On model-checking for. μ -calculus and its fragments Theoret. Comput. Sci. 258(1-2):2001;491-522. (Journal version of the CAV'93 paper).
17. Fariñas del Cerro L., Orłowska E. DAL - A logic for data analysis. Theoret. Comput. Sci. 36:1985;251-264 L. Fariñas del Cerro, E. Orłowska, DAL - A logic for data analysis, Theoret. Comput. Sci. 47, 1986, 345. Short version available in: T. O'Shea (Ed.), Sixth European Conf. Artificial Intelligence, 1984, pp. 285-294.
18. Fariñas del Cerro L., Orłowska E. DAL - A logic for data analysis. Theoret. Comput. Sci. 36:1985;251-264 L. Fariñas del Cerro, E. Orłowska, DAL - A logic for data analysis, Theoret. Comput. Sci. 47, 1986, 345. Short version available in: T. O'Shea (Ed.), Sixth European Conf. Artificial Intelligence, 1984, pp. 285-294.
19. Fariñas del Cerro L., Orłowska E. DAL - A logic for data analysis. Theoret. Comput. Sci. 36:1985;251-264 L. Fariñas del Cerro, E. Orłowska, DAL - A logic for data analysis, Theoret. Comput. Sci. 47, 1986, 345. Short version available in: T. O'Shea (Ed.), Sixth European Conf. Artificial Intelligence, 1984, pp. 285-294.
20. Fischer M., Ladner R. Propositional dynamic logic of regular programs. J. Comput. System Sci. 18:1979;194-211.
21. G. Gargov, Two completeness theorems in the logic for data analysis, Technical Report 581, Institute of Computer Science, Polish Academy of Sciences, Warsaw, 1986.
22. Goranko V., Passy S. Using the universal modality: gains and questions. J. Logic Comput. 2(1):1992;5-30.
23. Grädel E. Why are modal logics so robustly decidable? Bull. EATCS. 68:1999;90-103.
24. Halpern J. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence. 75(2):1995;361-372.
25. Halpern J., Moses Y. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence. 54:1992;319-379.
26. Hemaspaandra E. The price of universality. Notre Dame J. Formal Logic. 37(2):1996;173-203.
27. Hughes G., Cresswell M. An Introduction to Modal Logic. 1968;Methuen and Co. London.
28. van der Hoek W., Meyer J.-J. A complete epistemic logic for multiple agents - combining distributed and common knowledge. Mongin P., Bacharach M., Gerard-Valet L., Shin H. Epistemic Logic and the Theory of Games and Decisions. 1997;35-68 Kluwer, Dordrecht.
29. W. van der Hoek, J.-J. Meyer, A postscript to a completeness proof for Johan, in: J. Gerbrandy, M. Marx, M. de Rijke, Y. Venema (Eds.), JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, 1999. Available via http://www.illc.uva.nl/̃j50/ on WWW.
30. Kracht M. Power and weakness of the modal display calculus. Wansing H. Proof Theory of Modal Logic. 1996;93-121 Kluwer Academic Publishers, Dordrecht.
31. Ladner R. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6(3):1977;467-480.
32. Massacci F. Single steps tableaux for modal logics. J. Automat. Reason. 24(3):2000;319-364.
33. Mints G. Gentzen-type and resolution rules part I: propositional logic. Martin-Löf P., Mints G. Internat. Conf. Computer Logic, Tallinn. Lecture Notes in Computer Science. Vol. 417:1988;198-231 Springer, Berlin.
34. Nakamura A. On a logic based on graded modalities. IEICE Trans. E76-D(5):1993;527-532.
35. Papadimitriou Ch. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
36. Pawlak Z. Rough Sets - Theoretical Aspects of Reasoning about Data. 1991;Kluwer Academic Publishers, Dordrecht.
37. Sahlqvist H. Completeness and correspondence in the first and second order semantics for modal logics. Kanger S. Third Scandinavian Logic Symp. Uppsala, Sweden, 1973. 1975;110-143 North-Holland, Amsterdam.
38. Schmidt-Schauss M., Smolka G. Attribute concept descriptions with complements. Artificial Intelligence. 48(1):1991;1-26.
39. E. Spaan, Complexity of modal logics, Ph.D. Thesis, ILLC, Amsterdam University, March 1993.
40. Spaan E. The complexity of propositional tense logics. de Rijke M. Diamonds and Defaults. Series Studies in Pure and Applied Intensional Logic. Vol. 229:1993;287-309 Kluwer Academic Publishers, Dordrecht.
41. Stockmeyer L. The polynomial-time hierarchy. Theoret. Comput. Sci. 3:1977;1-21.
42. M. Vardi, Reasoning about past with two-way automata, ICALP'98, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998, pp. 628-641.
43. Vardi M., Wolper P. Automata-theoretic techniques for modal logics of programs. J. Comput. System Sci. 32:1986;183-221.
44. Vardi M., Wolper P. Reasoning about infinite computations. Inform. Comput. 115:1994;1-37. (Journal version of the FOCS'83 paper).
45. Vigano L. Labelled Non-Classical Logics. 2000;Kluwer Academic Publishers, Dordrecht.