A sharp threshold in proof complexity, 33rd STOC, pp.337-346, 2001. ,
Exponential bounds for DPLL below the satisfiability threshold, 15th SODA, pp.139-140, 2004. ,
Predicting learnt clauses quality in modern SAT solvers, 21st IJCAI, pp.399-404, 2009. ,
, SAT challenge, 2012.
Understanding and harnessing the potential of clause learning, JAIR, vol.22, pp.319-351, 2004. ,
Short proofs may be spacious: An optimal separation of space and length in resolution, FOCS, pp.709-718, 2008. ,
Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, 2009. ,
Plingeling: Solver description. SAT Challenge, 2012. ,
SatX10: A scalable plug&play parallel sat framework -(tool presentation), SAT, pp.463-468, 2012. ,
Resolution trees with lemmas: Resolution renements that characterize DLL-algorithms with clause learning, Logical Methods in Computer Science, vol.4, issue.4, p.13, 2008. ,
The relative efficiency of propositional proof systems, J. Symb. Logic, vol.44, issue.1, pp.36-50, 1979. ,
Precedence constrained scheduling in (2 ? 7/(3p + 1)) optimal, J. Comput. and Syst. Sc, vol.74, issue.7, pp.1139-1146, 2008. ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Seven challenges in parallel sat solving, 26th AAAI, 2012. ,
Clause learning can effectively p-simulate general propositional resolution, 23rd AAAI, pp.283-290, 2008. ,
Relating proof complexity measures and practical hardness of sat, CP, pp.316-331, 2012. ,
, SAT competition, 2011.
Lower bounds for natural proof systems, 18th Annual Symposium on, pp.254-266, 1977. ,
Complexity of scheduling under precedence constraints, Operations Research, vol.26, pp.22-35, 1978. ,
On the power of clause-learning SAT solvers as resolution engines, AI J, vol.175, issue.2, pp.512-525, 2011. ,
A machine oriented logic based on the resolution principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965. ,
, Solver description. SAT Challenge 2012. Soos, M. 2012. CryptoMiniSat 2.9, 2012.
The depth of resolution proofs, Studia Logica, vol.99, issue.1-3, pp.349-364, 2011. ,
, Solver description. SAT Challenge, 2012.