Propositional temporal proving with reductions to a SAT problem

DOI10.1007/978-3-642-38574-2_30MaRDI QIDQ4928457zbMATH OpenOpenAlexFDO

Authors

Publication date 14 June 2013

Published in Automated Deduction – CADE-24 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38574-2_30

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)

Recommendations

• scientific article; zbMATH DE number 1950255
• scientific article; zbMATH DE number 1301761
• Implicates and reduction techniques for temporal logics
• scientific article; zbMATH DE number 1136071
• A hierarchical analysis of propositional temporal logic based on intervals

Cited in

(7)

• Implicates and reduction techniques for temporal logics
• SAT-based explicit LTL reasoning and its application to satisfiability checking
• Temporal induction by incremental SAT solving
• Labelled superposition for PLTL
• A PLTL-prover based on labelled superposition with partial model guidance
• Temporal Assertions with Parametrized Propositions
• Boolean Abstraction for Temporal Logic Satisfiability

This page was built for publication: Propositional temporal proving with reductions to a SAT problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928457)