![Boolean Equi-Propagation for Optimized SAT EncodingAmitMetodi, Michael Codish, Vitaly Lagoon, and Peter J. Stuckey Order encoding Binary Unary Direct encoding xi ↔ (X ≥ i) (X = 3) = [1,1,1,0,0] Number Xwith a domain {0,1,2, …, d} will be represented using n=𝑂(𝑑)Boolean variables. xi ↔ (X = i) (X = 3) = [0,0,0,1,0,0] b=c e=f=g Problems: ,[object Object]](https://image.slidesharecdn.com/poster-13159250389978-phpapp01-110913094543-phpapp01/85/cp-2011-poster-1-320.jpg)
Recommended
More Related Content
What's hot
What's hot (20)
Viewers also liked
Viewers also liked (20)
Similar to CP 2011 Poster
Similar to CP 2011 Poster (20)
CP 2011 Poster
- 3. A complete equi-propagator for a constraint can be implemented using binary decision diagrams (BDDs) and can be evaluate in polynomial time.
- 4. When C(X1,…,Xk) a constraint about (fixed) “k” integers with n bits each, the BDD representing it is of size O(n^k).
- 5. Global constraints (such as allDiff) implemented using Ad-Hoc rules.
- 6. There is a strong connection between Simplify and Encoding because Simplify done on the “encoding bits” and might change the encoding accordingly.
- 8. Ben-Gurion University Solver (http://www.cs.bgu.ac.il/~benr/nonograms/)BEE is faster than the dedicated solvers on the hard puzzles. Selected human puzzles 5,000 random 30x30 puzzles