Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68600OpenAlexW2483910514MaRDI QIDQ5714747FDOQ5714747

Authors: Marijn J. H. Heule, Hans van Maaren 

Publication date: 16 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11527695

Recommendations

• Equivalent literal propagation in the DLL procedure
• Hard satisfiable clause sets for benchmarking equivalence reasoning techniques
• Clause elimination procedures for CNF formulas
• On clausal equivalence and hull inclusion.
• Conflict-driven XOR-clause learning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (5)

• Equivalent literal propagation in the DLL procedure
• XOR local search for Boolean Brent equations
• Hard satisfiable clause sets for benchmarking equivalence reasoning techniques
• Simulating circuit-level simplifications on CNF
• Present and Future of Practical SAT Solving

This page was built for publication: Theory and Applications of Satisfiability Testing

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