Edge matching puzzles as hard SAT/CSP benchmarks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5202 LNCS, Issue , 2008, Pages 560-565

  Ansótegui, Carlos ^a   Béjar, Ramón ^a   Fernàndez, César ^a   Mateu, Carles ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER OPERATING PROCEDURES; COMPUTER PROGRAMMING; CONSTRAINT THEORY; NUCLEAR PROPULSION; PHASE TRANSITIONS;

COMPLETE PROBLEMS; EDGE MATCHING; EXPERIMENTAL INVESTIGATIONS; LEVELS OF CONSISTENCIES; PROBLEM INSTANCES; SAT SOLVERS; SOLVING METHODS;

BOOLEAN FUNCTIONS;

EID: 56449089376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_42     Document Type: Conference Paper

References (7)

1. Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Proceedings of the AAAI2000, pp. 256-261. AAAI Press / The MIT Press (2000)
2. Ansótegui, C., Béjar, R., Fernàndez, C., Mateu, C.: Edge matching puzzles as hard SAT/CSP benchmarks (extended version). Technical Report TR-1-08, Dept. of Computer Science, Universitat de Lleida (2008), http://ccia.udl.cat/images/stories/Papers/techrepl_08.pdf
3. Bessière, C., Régin, J.-C.: MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In: Principles and Practice of Constraint Programming, pp. 61-75 (1996)
4. Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs and Combinatorics 23(s1), 195 (2007)
5. Monasson, R., Zecchinna, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic phase transitions. Nature 400, 133-137 (1999)
6. Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the AAAI 1994, pp. 362-367. AAAI Press / The MIT Press (1994)
7. Régin, J.-C.: The symmetric alldiff constraint. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 1999, pp. 420-425. Morgan Kaufmann, San Francisco (1999)