Sciweavers

351 search results - page 8 / 71
» On the Learnability of Boolean Formulae
Sort
View
SAT
2005
Springer
142views Hardware» more  SAT 2005»
15 years 3 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
IJCAI
2007
14 years 11 months ago
Symmetry Breaking in Quantified Boolean Formulae
Gilles Audemard, Saïd Jabbour, Lakhdar Sais