Shallow models for non-iterative modal logics

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

Volumn 5243 LNAI, Issue , 2008, Pages 324-331

  Schröder, Lutz ^a   Pattinson, Dirk ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRACTIVITY; COMPLEXITY BOUNDS; EXPRESSIVE POWERS; MODAL LOGICS; MODEL CONSTRUCTIONS; REASONING ABOUT KNOWLEDGES; RELATIONAL SEMANTICS;

ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTATIONAL LINGUISTICS; INFORMATION THEORY;

COMPUTATIONAL COMPLEXITY;

EID: 56549107559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85845-4_40     Document Type: Conference Paper

References (20)

1. Chellas, B.: Modal Logic. Cambridge Univ. Press, Cambridge (1980)
2. Cholvy, L., Garion, C., Saurel, C.: Ability in a multi-agent context: A model in the situation calculus. In: Toni, F., Torroni, P. (eds.) CLIMA 2005. LNCS (LNAI), vol. 3900, pp. 23-36. Springer, Heidelberg (2006)
3. D'Agostino, G., Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic 41, 267-298 (2002)
4. Demri, S., Lugiez, D.: Presburger modal logic is only PSPACE-complete. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 541-556. Springer, Heidelberg (2006)
5. Elgesem, D.: The modal logic of agency. Nordic J. Philos. Logic 2, 1-46 (1997)
6. Fagin, R., Halpern, J.Y.: Reasoning about knowledge and probability. J. ACM 41, 340-367 (1994)
7. Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic 13, 516-520 (1972)
8. 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, 361-372 (1995)
9. Halpern, J., Pucella, R.: Reasoning about expectation. In: Uncertainty in Artificial Intelligence, UAI 2002, pp. 207-215. Morgan Kaufmann, San Francisco (2002)
10. Halpern, J.Y., Moses, Y.O.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54, 319-379 (1992)
11. Jones, A., Parent, X.: Conventional signalling acts and conversation. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS (LNAI), vol. 2922, pp. 1-17. Springer, Heidelberg (2004)
12. Ladner, R.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6, 467-480 (1977)
13. Lewis, D.: Intensional logics without iterative axioms. J. Philos. Logic 3, 457-466 (1975)
14. Olivetti, N., Pozzato, G.L., Schwind, C.: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Logic 8 (2007)
15. Papadimitriou, C.: On the complexity of integer programming. J. ACM 28, 765-768 (1981)
16. Pattinson, D.: Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci. 309, 177-193 (2003)
17. Pauly, M.: A modal logic for coalitional power in games. J. Log. Comput. 12, 149-166 (2002)
18. Schröder, L.: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog. 73, 97-110 (2007)
19. Schröder, L., Pattinson, D.: PSPACE reasoning for rank-1 modal logics. In: Logic in Computer Science, LICS 2006, pp. 231-240. IEEE, Los Alamitos (2006)
20. Tobies, S.: PSPACE reasoning for graded modal logics. J. Log. Comput. 11, 85-106 (2001)