The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
From MaRDI portal
Publication:1209339
DOI10.1016/0020-0190(93)90014-ZzbMath0796.68116OpenAlexW2041433942MaRDI QIDQ1209339
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90014-z
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic programming (68N17)
Related Items (7)
Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ An artificial neural network satisfiability tester ⋮ Unnamed Item ⋮ Backdoors for linear temporal logic ⋮ Unnamed Item ⋮ The complexity of propositional linear temporal logics in simple cases
Cites Work
- MOLOG: A system that extends PROLOG with modal logic
- A note on the complexity of the satisfiability of modal Horn clauses
- The complexity of propositional linear temporal logics
- Clausal intuitionistic logic I. fixed-point semantics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Unnamed Item
- Unnamed Item
This page was built for publication: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic