Solving Constraint Satisfaction Puzzles with Constraint Programming

dc.contributor.author	Crawford, Broderick
dc.contributor.author	Castro, Carlos
dc.contributor.author	Monfroy, Eric
dc.contributor.author	Rodriguez, Nibaldo
dc.date.accessioned	2009-09-17T19:27:02Z
dc.date.available	2009-09-17T19:27:02Z
dc.date.issued	2009-09-17T19:27:02Z
dc.identifier.isbn	978-987-24967-3-9
dc.identifier.uri	http://hdl.handle.net/10226/474
dc.description.abstract	Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of di erent Variable and Value Selection Heuristics in its Enumeration phase. The platform used was Mozart	en
dc.language.iso	en	en
dc.relation.ispartofseries	Crawford, B., Castro, C., Monfroy, E. y Rodriguez, N., (2009, julio). Solving Constraint Satisfaction Puzzles with Constraint Programming. Trabajo presentado en el Congreso de Inteligencia Computacional Aplicada (CICA), realizado en Buenos Aires del 23 al 24 de julio de 2009.
dc.subject	Constraint Programming	en
dc.subject	Enumeration Strategies	en
dc.subject	Variable Selection Heuristics	en
dc.subject	Value Selection Heuristics	en
dc.subject	Combinatorial Problems	en
dc.title	Solving Constraint Satisfaction Puzzles with Constraint Programming	en
dc.type	Article	en