SAT-based versus CSP-based constraint weighting for satisfiability

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 455-460

  Pham, Duc Nghia ^a   Thornton, John ^a   Sattar, Abdul ^a   Ishtaiwi, Abdelraouf ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PROBLEM SOLVING; SCHEDULING;

CONSTRAINT SATISFACTION PROBLEM (CSP); SAT SOLVERS; SATISFIABILITY (SAT);

ARTIFICIAL INTELLIGENCE;

EID: 29344447101     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Ansótegui, C.; Larrubia, J.; Li, C. M.; and Manyà, F. 2003. Mv-Satz: A SAT solver for many-valued clausal forms. In Proceedings of JIM-2003.
2. Ansótegui, C.; Larrubia, J.; and Manyà, F. 2003. Boosting Chaff's performance by incorporating CSP heuristics. In Proceedings of CP-2003, 96-107.
3. Béjar, R., and Manyà, F. 2000. Solving the round robin problem using propositional logic. In Proceedings of AAAI-2000, 262-266.
4. Béjar, R.; Cabiscol, A.; Fernández, C.; Manyà, F.; and Gomes, C. P. 2001. Capturing structure with satisfiability. In Proceedings of CP-2001, 137-152.
5. Choi, K.; Lee, J. H.-M.; and Stuckey, P. J. 2000. A La grangian reconstruction of GENET. Artificial Intelligence 123:201-215.
6. Frisch, A., and Peugniez, T. 2001. Solving non-Boolean satisfiability problems with stochastic local search. In Proceedings of IJCAI-2001.
7. Gent, I. P. 2002. Arc consistency in SAT. In Proceedings of ECAI-02, 121-125.
8. Gomes, C.; Selman, B.; McAloon, K.; and Tretkoff, C. 1998. Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In Proceedings of AIPS-1998.
9. Hoos, H. H., and Stützle, T. 2005. Stochastic Local Search: Foundations and Applications. San Francisco, CA: Morgan Kaufmann.
10. Hoos, H. H. 1999a. On the run-time behaviour of stochastic local search algorithms for SAT. In Proceedings of AAAI-7999, 661-666.
11. Hoos, H. H. 1999b. SAT-encodings, search space structure, and local search performance. In Proceedings of IJCAI-1999, 296-302.
12. Hutter, F.; Tompkins, D. A. D.; and Hoos, H. H. 2002. Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In Proceedings of CP-2002, 233-248.
13. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of AAAI-1996, 1194-1201.
14. Kautz, H.; Ruan, Y.; Achlioptas, D.; Gomes, C.; Selman, B.; and Stickel, M. 2001. Balance and filtering in structured satisfiable problems. In Proceedings of IJCAI-2001, 351-358.
15. Morris, P. 1993. The Breakout method for escaping from local minima. In Proceedings of AAAI-1993, 40-45.
16. Ostrowski, R.; Grégoire, E.; Mazure, B.; and Saïs, L. 2002. Recovering and exploiting strutural knowledge from CNF formulas. In Proceedings of CP-2002, 185-199.
17. Prestwich, S. 2004. Full dynamic substitutability by SAT encoding. In Proceedings of CP-2004, 512-526.
18. Thornton, J.; Pham, D. N.; Bain, S.; and Ferreira Jr., V. 2004. Additive versus multiplicative clause weighting for SAT. In Proceedings of AAAI-2004, 191-196.
19. Velev, M. N., and Bryant, R. E. 2003. Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. Journal of Symbolic Computation 35(2):73-106.
20. Walsh, T. 2000. SAT v CSP. In Proceedings of CP-2000, 441-456.