On the influence of confluence in modal logics

MaRDI QIDQ5480177zbMATHFDO

Authors Olivier Gasquet

Publication date 26 July 2006

zbMATH Keywords

complexitymodal logicsconfluencetableauxtiling problemsatisfaction problemNEXPTIME-completeness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Clausal resolution for modal logics of confluence
• On the complexity of elementary modal logics
• scientific article; zbMATH DE number 1500520
• scientific article; zbMATH DE number 1062288
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics

This page was built for publication: On the influence of confluence in modal logics

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