A note on the complexity of the satisfiability of modal Horn clauses

DOI10.1016/0743-1066(87)90018-5MaRDI QIDQ3762285zbMATH OpenOpenAlexFDO

Authors Luis Fariñas del Cerro, Martti Penttonen

Publication date 1987

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(87)90018-5

zbMATH Keywords

complexitysatisfiabilityS5propositional modal logicmodal Horn clauses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Recommendations

• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• scientific article; zbMATH DE number 1500520
• On the complexity of fragments of modal logics
• On the complexity of elementary modal logics
• On the decidability of elementary modal logics

Cited in

(18)

• Satisfiability of mixed Horn formulas
• scientific article; zbMATH DE number 1453038 (Why is no real title available?)
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• On renamable Horn and generalized Horn functions
• On the complexity of fragments of modal logics
• Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow
• Resolution principles in possibilistic logic
• A short biography of Luis Fariñas del Cerro
• scientific article; zbMATH DE number 4085614 (Why is no real title available?)
• scientific article; zbMATH DE number 6302919 (Why is no real title available?)
• The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
• On temporal logic versus Datalog
• scientific article; zbMATH DE number 2213633 (Why is no real title available?)
• scientific article; zbMATH DE number 6917935 (Why is no real title available?)
• scientific article; zbMATH DE number 7439733 (Why is no real title available?)
• The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
• Sub-propositional fragments of the interval temporal logic of Allen's relations
• 3-SAT = SAT for a class of normal modal logics

This page was built for publication: A note on the complexity of the satisfiability of modal Horn clauses

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