Relative Nondeterministic Information Logic is EXPTIME-complete

Authors:
Stéphane Demri;Ewa Orłowska
Affiliations:
Laboratoire Spécification et Vérification, CNRS & INRIA Futurs & ENS de Cachan 61, av. Pdt. Wilson, 94235 Cachan Cedex, France. E-mail: demri@lsv.ens-cachan.fr;National Institute of Telecommunications, ul. Szachowa 1, 04-894 Warsaw, Poland. E-mail: orlowska@itl.waw.pl
Venue:
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Year:
2007

Citing 8
Cited 0

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
Modal logics for knowledge representation systems

Theoretical Computer Science
The nondeterministic information logic NIL is PSPACE-complete

Fundamenta Informaticae
Incomplete Information: Rough Set Analysis

Incomplete Information: Rough Set Analysis
Incomplete Information: Structure, Inference, Complexity

Incomplete Information: Structure, Inference, Complexity
Modal Logics with Relative Accessibility Relations

FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
The Complexity of Propositional Modal Theories and the Complexity of Consistency of Propositional Modal Theories

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Automata-Theoretic Decision Procedures for Information Logics

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that its satisfiability is not only decidable but also EXPTIME-complete. Such a logic combines two ingredients that are seldom present simultaneously in information logics: frame conditions involving more than one information relation and relative frames. The EXPTIME upper bound is obtained by designing a well-suited decision procedure based on the nonemptiness problem of Büchi automata on infinite trees. The paper provides evidence that Büchi automata on infinite trees are crucial language acceptors even for relative information logics with multiple types of relations.