Minimal and redundant SAT encodings for the all-interval-series problem

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2504, Issue , 2002, Pages 139-144

  Alsinet, T ^a   Bejar R ^a   Cabiscol, A ^a   Fernandez C ^a   Manya F ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOCAL SEARCH (OPTIMIZATION);

ENCODINGS; EXPERIMENTAL EVIDENCE; LOCAL SEARCH; LOCAL SEARCH METHOD;

ENCODING (SYMBOLS);

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

References (6)

1. H. H. Hoos. Stochastic Local Search - Methods, Models, Applications. PhD thesis, Department of Computer Science, Darmstadt University of Technology, 1998.
2. H. Kautz, Y. Ruan, D. Achlioptas, C. Gomes, B. Selman, and M. Stickel. Balance and filtering in structured satisfiable problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'01, Seattle/WA, USA, 351-358. Morgan Kaufmann, 2001
3. C. M. Li, and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'97, Nagoya, Japan, 366-371. Morgan Kaufmann, 1997.
4. D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, Providence/RI, USA, pages 321-326. AAAI Press, 1997.
5. D. Schuurmans and F. Southey. Local search characteristics of incomplete SAT procedures. In Proceedings of the 17th National Conference on Artificial Intelligence, AAAI-2000, Austin/TX, USA, pages 297-302. AAAI Press, 2000.
6. B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94, Seattle/WA, USA, pages 337-343. AAAI Press, 1994.