scientific article; zbMATH DE number 1989649

MaRDI QIDQ4430396zbMATH OpenFDO

Authors Stéphane Demri

Publication date 9 October 2003

zbMATH Keywords

computational complexitymodal logicsatisfiabilitymulti-modal logicright linear grammar logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Grammars and rewriting systems (68Q42) Logic in computer science (03B70) Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The Complexity of Regularity in Grammar Logics and Related Modal Logics
• On the complexity of elementary modal logics
• On the complexity of fragments of modal logics
• scientific article; zbMATH DE number 4202248
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

Cited in

(11)

• PSPACE bounds for rank-1 modal logics
• A polynomial space construction of tree-like models for logics with local chains of modal connectives
• Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics
• Deciding regular grammar logics with converse through first-order logic
• The Complexity of Regularity in Grammar Logics and Related Modal Logics
• Complexity of modal logics with Presburger constraints
• scientific article; zbMATH DE number 1670487 (Why is no real title available?)
• scientific article; zbMATH DE number 5046366 (Why is no real title available?)
• Complexity through translations for modal logic with recursion
• PSPACE complexity of modal logic KD45\(_{n}\)
• PSPACE-decidability of Japaridze's polymodal logic

This page was built for publication:

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