Binary vs. non-binary constraints, Artificial Intelligence, vol.140, issue.1-2, pp.1-37, 2002. ,
Neighborhood-based variable ordering heuristics for the constraint satisfaction problem, Proceedings CP'01, pp.565-569, 2001. ,
On forward checking for non-binary constraint satisfaction, Artificial Intelligence, vol.141, pp.205-224, 2002. ,
MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems, Proceedings CP'96, pp.61-75, 1996. ,
Refining the basic constraint propagation algorithm, Proceedings IJCAI'01, pp.309-315, 2001. ,
A machine program for theorem proving, Communications of the ACM, vol.5, pp.394-397, 1962. ,
A property of path inverse consistency leading to an optimal PIC algorithm, Proceedings ECAI'00, pp.88-92, 2000. ,
Local and global relational consistency, Theoretical Computer Science, vol.173, issue.1, pp.283-308, 1997. ,
A sufficient condition for backtrack-bounded search, Journal of the ACM, vol.32, pp.755-761, 1985. ,
Arc consistency in SAT, Proceedings ECAI'02, 2002. ,
Berkmin: a fast and robust sat-solver, Proceeding DATE'02, pp.142-149, 2002. ,
On the parallel complexity of discrete relaxation in constraint satisfaction networks, Artificial Intelligence, vol.45, pp.275-286, 1990. ,
Constraint satisfaction algorithms, Computational Intelligence, vol.5, pp.188-224, 1989. ,
Constraint tightness and looseness versus local and global consistency, Journal of the ACM, vol.44, pp.549-566, 1997. ,
Fast optimal instruction scheduling for singleissue processors with arbitrary latencies, Lecture Notes in Computer Science, vol.2239, pp.625-639, 2001. ,
A generic customizable framework for inverse local consistency, Proceeding AAAI'99, pp.169-174, 1999. ,
SAT v CSP, Proceedings CP'00, pp.441-456, 2000. ,