Relative nondeterministic information logic is EXPTIME-complete

MaRDI QIDQ3425576zbMATH OpenFDO

Authors Stéphane Demri, Ewa Orłowska

Publication date 26 February 2007

zbMATH Keywords

Büchi tree automatoncomputational complexity

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1515320
• scientific article; zbMATH DE number 1876860
• A modal logic for non-deterministic information systems
• A class of decidable information logics
• scientific article; zbMATH DE number 3903963

Cited in

(2)

• scientific article; zbMATH DE number 1515320 (Why is no real title available?)
• scientific article; zbMATH DE number 1876860 (Why is no real title available?)

This page was built for publication: Relative nondeterministic information logic is EXPTIME-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3425576)