Controlled Model Exploration

We provide a detailed analysis of very weak fragments of modal logic. Our fragments lack connectives that introduce non-determinism and they feature restrictions on the modal operators, which may lead to substantial reductions in complexity. Our main result is a general game-based characterization of the expressive power of our fragments over the class of nite structures.

[1]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[2]  Hector J. Levesque,et al.  Expressiveness and tractability in knowledge representation and reasoning 1 , 1987, Comput. Intell..

[3]  Dov M. Gabbay,et al.  Extensions of Classical Logic , 1989 .

[4]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[5]  Eric Rosen,et al.  Modal Logic over Finite Structures , 1997, J. Log. Lang. Inf..

[6]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[7]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[8]  Leszek Pacholski,et al.  Complexity of two-variable logic with counting , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[9]  M. de Rijke,et al.  Encoding Two-Valued Nonclassical Logics in Classical Logic , 2001, Handbook of Automated Reasoning.

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[12]  Kees Doets,et al.  Basic model theory , 1996, Studies in logic, language and information.

[13]  Erich Grädel,et al.  Why are Modal Logics so Robustly Decidable? , 2001, Bull. EATCS.

[14]  M. de Rijke,et al.  Expressiveness of Concept Expressions in First-Order Description Logics , 1999, Artif. Intell..

[15]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[16]  Francesco M. Donini,et al.  Complexity of Reasoning , 2003, Description Logic Handbook.

[17]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[18]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[19]  Martin Otto.  Modal and guarded characterisation theorems over finite transition systems , 2004, Ann. Pure Appl. Log..

[20]  Nachum Dershowitz,et al.  In handbook of automated reasoning , 2001 .

[21]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[22]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.