Sudoku as a SAT problem

9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006

Volumn , Issue , 2006, Pages

  Lynce, Inês ^a   Ouaknine, Joël ^b  

^a INESC ID   (Portugal)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODINGS; INFERENCE TECHNIQUES; NORMAL FORM; POLYNOMIAL-TIME; PROPOSITIONAL SATISFIABILITY; SAT PROBLEMS; UNIT PROPAGATION;

ARTIFICIAL INTELLIGENCE;

ENCODING (SYMBOLS);

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

References (12)

1. C. Ansótegui, A. del Val, I. Dotú, C. Fernández, and F. Manyá. Modeling choices in quasigroup completion: SAT vs. CSP. In Proceedings of the National Conference on Artificial Intelligence, pages 137-142, 2004.
2. F. Bacchus. Exploiting the computational tradeoff of more reasoning and less searching. In Fifth International Symposium on Theory and Applications of Satisfiability Testing, pages 7-16, May 2002.
3. F. Bacchus and J. Winter. Effective preprocessing with hyper-resolution and equality reduction. In Sixth International Conference on Theory and Applications of Satisfiability Testing, pages 183-192, May 2003.
4. C. Colbourn. The complexity of completing partial latin squares. Discrete Applied Mathematics, 8:25-30, 1984.
5. J. M. Crawford and L. Auton. Experimental results on the cross-over point in satisfiability problems. In Proceedings of the National Conference on Artificial Intelligence, pages 22-28, 1993.
6. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7:201-215, July 1960.
7. C. Gomes and D. Shmoys. Completing quasigroups or latin squares: A structured graph coloring problem. In Proceedings of the Computational Symposium on Graph Coloring and Generalizations, pages 22-39, 2002.
8. J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12(1):23-41, January 1965.
9. G. Royle. Personal Communication, 2005.
10. H. Simonis. Sudoku as a constraint problem. In CP Workshop on Modeling and Reformulating Constraint Satisfaction Problems, pages 13-27, October 2005. http://www.icparc.ic.ac.uk/-~hs/sudoku.pdf.
11. W. J. van Hoeve. The alldifferent constraint: a survey. In 6th Annual Workshop of the ERCIM Working Group on Constraints, 2001.
12. T. Yato and T. Seta. Complexity and completeness of finding another solution and its application to puzzles. In Proceedings of the National Meeting of the Information Processing Society of Japan (IPSJ), 2002.