Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Handbook of theoretical computer science (vol. B)
Modal logics for knowledge representation systems
Theoretical Computer Science
Reasoning about infinite computations
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
Incomplete Information: Rough Set Analysis
Incomplete Information: Rough Set Analysis
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Incomplete Information: Structure, Inference, Complexity
Incomplete Information: Structure, Inference, Complexity
A Logic with Relative Knowledge Operators
Journal of Logic, Language and Information
Modal Logics with Relative Accessibility Relations
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Description Logics: Foundations for Class-based Knowledge Representation
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Complexity of the Graded µ-Calculus
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Relative Nondeterministic Information Logic is EXPTIME-complete
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
| Hi-index | 0.00 |
Automata-theoretic decision procedures for solving model-checking and satisfiability problems for temporal, dynamic, and description logics have flourished during the past decades. In the paper we define an EXPTIME decision procedure based on the emptiness problem of Büchi automata on infinite trees for the very expressive information logic SIM designed for reasoning about information systems. This logic involves modal parameters satisfying certain properties to capture the relevant nominals at the formula level, Boolean expressions and nominals at the modal level, an implicit intersection operation for relations, and a universal modality. The original combination of known techniques allows us to solve the open question related to the EXPTIME-completeness of SIM. Furthermore, we discuss how variants of SIM can be treated similarly although the decidability status of some of them is still unknown.