A decidable multi-modal logic of context

Why is Modal Logic So Robustly Decidable?

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 kn...

A Decidable Linear Logic for Transforming Drss in Context

We present a decidable linear logic for encoding and transforming Discourse Representation Structures (DRSs) in context. The logic is a particular fragment of intuitionistic propositional linear logic (ILL), slimed down by not allowing for any occurrence of exponential, !, in the consequence and slightly enriched by allowing to combine commutative and non-commutative multiplicative connectives....

State Clock Logic : a Decidable Real-time Logic State Clock Logic: a Decidable Real-time Logic ?

In this paper we deene a real-time logic called SC logic. This logic is deened in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al 6]. Unlike timed automata 4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A...

A Multi-Modal Logic for Stereotyping

What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic

Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns out to be very powerful, strictly subsuming all major previously studied modal logics for strategic reasoning, including ATL, ATL∗, and the like. The price that one has to pa...