A note on the complexity of the satisfiability of modal Horn clauses
From MaRDI portal
Publication:3762285
DOI10.1016/0743-1066(87)90018-5zbMath0624.03010OpenAlexW2005920582MaRDI QIDQ3762285
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
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)
Related Items (10)
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics ⋮ On renamable Horn and generalized Horn functions ⋮ Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations ⋮ A short biography of Luis Fariñas del Cerro ⋮ On temporal logic versus Datalog ⋮ Resolution principles in possibilistic logic ⋮ Unnamed Item ⋮ 3-SAT = SAT for a class of normal modal logics ⋮ The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic ⋮ Unnamed Item
This page was built for publication: A note on the complexity of the satisfiability of modal Horn clauses
