Reconstructing Solutions after Blocked Clause Elimination

DOI10.1007/978-3-642-14186-7_30zbMath1306.68159OpenAlexW1600869845MaRDI QIDQ4930602

Armin Biere, Matti Järvisalo

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)

Related Items (4)

Simulating circuit-level simplifications on CNF ⋮ Conformant planning as a case study of incremental QBF solving ⋮ Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability ⋮ XOR local search for Boolean Brent equations

This page was built for publication: Reconstructing Solutions after Blocked Clause Elimination