March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver, Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT2004), pp.345-359, 2004. ,
DOI : 10.1007/11527695_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.4634
On the parallel complexity of discrete relaxation in constraint satisfaction networks, Artificial Intelligence, vol.45, issue.3, pp.275-286, 1990. ,
DOI : 10.1016/0004-3702(90)90009-O
A comparison of ATMS and CSP techniques, Proceedings of IJCAI'89, pp.290-296, 1989. ,
Equivalent literal propagation in the DLL procedure, Discrete Applied Mathematics, vol.130, issue.2, pp.251-276, 2003. ,
DOI : 10.1016/S0166-218X(02)00407-9
New algorithms for exact satisfiability, 2003. ,
An algorithm for Exact Satisfiability analysed with the number of clauses as parameter, Information Processing Letters, vol.97, issue.1, pp.28-30, 2006. ,
DOI : 10.1016/j.ipl.2005.08.011
Upper bound for covering problems, Methods of Operations Research, vol.34, pp.419-431, 1981. ,
Chaff, Proceedings of the 38th conference on Design automation , DAC '01, 2001. ,
DOI : 10.1145/378239.379017
Recovering and Exploiting Structural Knowledge from CNF Formulas, CP'02, pp.185-199, 2002. ,
DOI : 10.1007/3-540-46135-3_13
The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978. ,
DOI : 10.1145/800133.804350
Towards robust cnf encodings of cardinality constraints, CP, pp.483-497, 2007. ,
On the complexity of derivations in the propositional calculus, Structures in Constructives Mathematics and Mathematical Logic, Part II, pp.115-125, 1968. ,