The top documents tagged [clause learning]

1 CSPs: Adding Structure to SAT George Katsirelos Fahiem Bacchus University of Toronto.

Model Counting of Query Expressions: Limitations of Propositional Methods Paul Beame 1 Jerry Li 2 Sudeepa Roy 1 Dan Suciu 1 1 University of Washington.

Learning to Search Henry Kautz

BIRS Workshop, Banff, Canada Jan 22, 2014 © 2014 IBM Corporation Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers.

Next 10 years of Constraint Programming: The Science of Constraints Carla P. Gomes Cornell University CP 2006.

AAAI 2013 Conference, Bellevue, WA AAAI 2013 © 2013 IBM Corporation Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT.

Motivation & Goal SAT and Constraint Processing (CP) are fundamental areas of Computer Science that address the same computational questions. Compare SAT.

Learning to Search Henry Kautz University of Washington joint work with Dimitri Achlioptas, Carla Gomes, Eric Horvitz, Don Patterson, Yongshao Ruan, Bart.

[published at AAAI-2013]

Trend Towards Parallelization

Motivation & Goal

Parallelizing MiniSat