The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
From MaRDI portal
Publication:1329742
DOI10.1016/0304-3975(94)90082-5zbMath0808.03025OpenAlexW2093824806MaRDI QIDQ1329742
Publication date: 15 March 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90082-5
Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items
Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations ⋮ A polynomial space construction of tree-like models for logics with local chains of modal connectives ⋮ Unnamed Item ⋮ 3-SAT = SAT for a class of normal modal logics ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Unnamed Item ⋮ Comparative Approach to the Multi-Valued Logic Construction for Preferences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strategies for modal resolution: Results and problems
- MOLOG: A system that extends PROLOG with modal logic
- Modal resolution in clausal form
- On the size of refutation Kripke models for some linear modal and tense logics
- Tense logic
- Temporal logic CTL \(+\) Prolog
- N-Prolog: An extension of Prolog with hypothetical implications. I.
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A note on the complexity of the satisfiability of modal Horn clauses
- Clausal intuitionistic logic I. fixed-point semantics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- The complexity of theorem-proving procedures
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- Naming worlds in modal and temporal logic
