151 search results - page 4 / 31 » Propagation in CSP and SAT |
ICTAI
2002
IEEE
14 years 16 days ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
AAAI
1997
13 years 9 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood ...
ISMVL
2009
IEEE
14 years 2 months ago
2009
IEEE
We define a number of original encodings, called regular encodings, that map Max-CSP instances into Partial MaxSAT instances. First, we obtain new direct and (minimal) support en...
CP
2006
Springer
13 years 11 months ago
2006
Springer