A note on the complexity of the satisfiability of modal Horn clauses
From MaRDI portal
Publication:3762285
DOI10.1016/0743-1066(87)90018-5zbMATH Open0624.03010OpenAlexW2005920582MaRDI QIDQ3762285FDOQ3762285
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)
Cited In (18)
- Satisfiability of mixed Horn formulas
- Title not available (Why is that?)
- On the complexity of fragments of modal logics
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
- On renamable Horn and generalized Horn functions
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic
- Title not available (Why is that?)
- On temporal logic versus Datalog
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
