Reconstructing solutions after blocked clause elimination

DOI10.1007/978-3-642-14186-7_30MaRDI QIDQ4930602zbMATH OpenOpenAlexFDO

Authors Matti Järvisalo, Armin Biere

Publication date 29 September 2010

Published in Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Blocked clause elimination
• Theory and Applications of Satisfiability Testing
• Everything you always wanted to know about blocked sets (but were afraid to ask)
• Clause elimination for SAT and QSAT
• Inprocessing rules

Cited in

(7)

• XOR local search for Boolean Brent equations
• Conformant planning as a case study of incremental QBF solving
• Everything you always wanted to know about blocked sets (but were afraid to ask)
• Simulating circuit-level simplifications on CNF
• Blocked clause elimination
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• On Incremental Pre-processing for SMT

This page was built for publication: Reconstructing solutions after blocked clause elimination

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