A decision procedure for combinations of propositional temporal logic and other specialized theories
DOI10.1007/BF02432150zbMATH Open0635.03026OpenAlexW2074163046MaRDI QIDQ1097264FDOQ1097264
Authors: David A. Plaisted 
Publication date: 1986
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02432150
Recommendations
fixed pointsdecision procedurediscrete linear time propositional temporal logicquantifier-free theoriesreasoning about concurrent programsspecialized theory
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70)
Cites Work
- The complexity of propositional linear temporal logics
- Simplification by Cooperating Decision Procedures
- The propositional dynamic logic of deterministic, well-structured programs
- Using branching time temporal logic to synthesize synchronization skeletons
- Fast Decision Procedures Based on Congruence Closure
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Deciding full branching time logic
- Title not available (Why is that?)
- The Total Correctness of Parallel Programs
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- A decidability result for the model checking of infinite-state systems
- Combining temporal logic systems
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Title not available (Why is that?)
- TABLEAUX: A general theorem prover for modal logics
- Efficient decision procedure for propositional projection temporal logic
This page was built for publication: A decision procedure for combinations of propositional temporal logic and other specialized theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097264)
