On undecidability of propositional temporal logics on trace systems
Information Processing Letters
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
Verification Based on Local States
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Fixpoint Alternation and the Game Quantifier
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of independence-friendly fixpoint logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
The Dynamification of Modal Dependence Logic
Journal of Logic, Language and Information
| Hi-index | 0.00 |
We consider Hintikka et al.'s 'independence-friendly first-order logic'. We apply it to a modal logic setting, defining a notion of 'independent' modal logic, and we examine the associated fixpoint logics.