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 10 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...
143
Voted
FROCOS
2009
Springer
15 years 11 months ago
Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
Luca Pulina, Armando Tacchella
IJCAI
2007
15 years 6 months ago
Symmetry Breaking in Quantified Boolean Formulae
Gilles Audemard, Saïd Jabbour, Lakhdar Sais