Back to Results
First PageMeta Content
Theoretical computer science / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Constraint satisfaction / Satisfiability modulo theories / Boolean satisfiability problem / Maximum satisfiability problem / Decomposition method / Constraint


To Encode or to Propagate? The Best Choice for Each Constraint in SAT Ignasi Ab´ıo1 , Robert Nieuwenhuis2 , Albert Oliveras2 , Enric Rodr´ıguez-Carbonell2 , Peter J. Stuckey3 1
Add to Reading List

Document Date: 2013-07-22 05:26:24


Open Document

File Size: 160,96 KB

Share Result on Facebook