Simplifying binary propositional theories into connected components twice as fast

DOI10.1007/3-540-45653-8_27MaRDI QIDQ2996178zbMATH OpenOpenAlexFDO

Authors Alvaro del Val

Publication date 6 May 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45653-8_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Toward leaner binary-clause reasoning in a satisfiability solver
• LCF-Style Propositional Simplification with BDDs and SAT Solvers
• Efficient CNF simplification based on binary implication graphs
• Experimental comparison of 2-satisfiability algorithms
• Theory and Applications of Satisfiability Testing

Cited in

(3)

• Toward leaner binary-clause reasoning in a satisfiability solver
• Efficient CNF simplification based on binary implication graphs
• Clausal congruence closure

This page was built for publication: Simplifying binary propositional theories into connected components twice as fast

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