Why is Modal Logic So Robustly Decidable?

@inproceedings{Vardi1996WhyIM,
  title={Why is Modal Logic So Robustly Decidable?},
  author={Moshe Y. Vardi},
  booktitle={Descriptive Complexity and Finite Models},
  year={1996}
}
  • Moshe Y. Vardi
  • Published in
    Descriptive Complexity and…
    1996
  • Philosophy, Computer Science
In the last 20 years modal logic has been applied to numerous areas of computer science, including artificial intelligence, program verification, hardware verification, database theory, and distributed computing. There are twomain computational problems associated with modal logic. The first problem is checking if a given formula is true in a given state of a given structure. This problem is known as the model-checking problem. The second problem is checking if a given formula is true in all… 

Figures from this paper

Complexity of modal logic

On Logics with Two Variables

Decidability of modal logics with particular emphasis on the interval temporal logics

It is shown that the logic of subintervals, the fragment of the Halpern–Shoham logic where only the operator “during”, or D, is allowed, is undecidable over discrete structures, which is surprising as this, apparently very simple, logic is decidable over dense orders.

Decidability of order-based modal logics

Why are Modal Logics so Robustly Decidable?

The question to identify the main reasons for the robust decidabil-ity properties of modal logics is discussed in the light of recent research on guarded fragments of rst-order logic and xed point logic.

12 Modal mu-calculi

Modal decision problems

Optimised Proof Procedures for Quantitative Logics

Methods for improving the performance of satisfiability checking for graded and probabilistic modal logic using methods from linear programming, the resulting algorithms appear to offer significant rewards.

Bounded model checking of infinite state systems

A new approach to BMC is presented that extends current methods in three ways: instead of a reduction to propositional logic which restricts BMC to finite state systems, this work focuses on infinite state systems and therefore considers more powerful, yet decidable base logics.

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

Tight complexity bounds are obtained for the problem of determining the satisfiability of a given graded modal logic formula over the classes of frames characterized by any combination of reflexivity, seriality, symmetry, transitivity and the Euclidean property.
...

References

SHOWING 1-10 OF 96 REFERENCES

SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC

  • V. Pratt
  • Computer Science, Philosophy
    FOCS 1976
  • 1976
An appropriate axiom system is given which is complete for loop-free programs and also puts conventional predicate calculus in a different light by lumping quantifiers with non-logical assignments rather than treating them as logical concepts.

Undecidability results on two-variable logics

It is shown that going beyond L2 by adding any one of the following leads to an undecidable logic: very weak forms of recursion, such as transitive closure or monadic fixed-point operations.

Verification Tools for Finite-State Concurrent Systems

This paper describes in detail how the new implementation works and gives realistic examples to illustrate its power, and discusses a number of directions for future research.

A completeness theorem in modal logic

The present paper attempts to state and prove a completeness theorem for the system S5 of [1], supplemented by first-order quantifiers and the sign of equality. We assume that we possess a

The complexity of tree automata and logics of programs

  • E. EmersonC. Jutla
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
It is shown that for tree automata with m states and n pairs nonemptiness can be tested in time O((mn)/sup 3n/), even though the problem is in general NP-complete, and it follows that satisfiability for propositional dynamic logic with a repetition construct and for the propositional mu-calculus can be tests in deterministic single exponential time.

"Sometime" is sometimes "not never": on the temporal logic of programs

  • L. Lamport
  • Philosophy, Computer Science
    POPL '80
  • 1980
The logical foundations of the application of temporal logic to concurrent programs are clarified, and the relation between concurrency and nondeterminism is clarified, as well as some problems for further research.

Back and Forth Between Modal Logic and Classical Logic

This paper proves decidability for a largèbounded fragment' of predicate logic, and points out several applications, including a fresh look at the landscape of possible predicate logics, including candi-685.
...