Efficient Temporal Satisfiability
From MaRDI portal
Publication:4013255
DOI10.1093/logcom/2.2.173zbMath0767.03013OpenAlexW2067210292MaRDI QIDQ4013255
Jai Srinivasan, Tom Sadler, E. Allen Emerson
Publication date: 27 September 1992
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/2.2.173
temporal logicprogram synthesispolynomial time complexityexponential time complexity\(P=NP\)complexity of testing satisfiabilityHorn propositional logic
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)
Related Items (2)
A temporal logic-based approach for the description of object behavior evolution ⋮ Model Theoretic Syntax and Parsing
This page was built for publication: Efficient Temporal Satisfiability
