Enumeration Strategies in Constraint Programming for solving puzzles

被引：0
|
作者：
Crawford, Broderick [1 ]
Aranda, Mary [1 ]
Castro, Carlos
Monfroy, Eric
机构：
[1] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile
来源：
CERMA 2007: ELECTRONICS, ROBOTICS AND AUTOMOTIVE MECHANICS CONFERENCE, PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/CERMA.2007.4367772
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Constraint Programming is one of the major contributions of Computer Science for solving problems of high complexity. This paradigm is used to represent a wide variety of problems that can be modeled like Constraint Satisfaction Problems and solving them via Constraint Propagation and Enumeration. In this work, we study the resolution of puzzles with this approach, we evaluate the performance of different variable and value selection heuristics in the Enumeration phase. It is demonstrated the relevance of the Enumeration Strategy in a Constraint Programming process.
引用
收藏
页码：718 / +
页数：2
相关论文
共 50 条
  • [1] Adaptive enumeration strategies and metabacktracks for constraint solving
    Monfroy, Eric
    Castro, Carlos
    Crawford, Broderick
    ADVANCES IN INFORMATION SYSTEMS, PROCEEDINGS, 2006, 4243 : 354 - 363
  • [2] DYNAMIC SELECTION OF ENUMERATION STRATEGIES IN CONSTRAINT PROGRAMMING
    Crawford, Broderick
    Montecinos, Mauricio
    Castro, Carlos
    Monfroy, Eric
    ANNALS OF DAAAM FOR 2009 & PROCEEDINGS OF THE 20TH INTERNATIONAL DAAAM SYMPOSIUM, 2009, 20 : 1331 - 1332
  • [3] A Hyperheuristic Approach to Select Enumeration Strategies in Constraint Programming
    Crawford, Broderick
    Montecinos, Mauricio
    Castro, Carlos
    Monfroy, Eric
    AIC '09: PROCEEDINGS OF THE 9TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED INFORMATICS AND COMMUNICATIONS: RECENT ADVANCES IN APPLIED INFORMAT AND COMMUNICATIONS, 2009, : 460 - +
  • [4] Dynamic Selection of Enumeration Strategies for Solving Constraint Satisfaction Problems
    Crawford, Broderick
    Castro, Carlos
    Monfroy, Eric
    Soto, Ricardo
    Palma, Wenceslao
    Paredes, Fernando
    ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2012, 15 (02): : 106 - 128
  • [5] Enumeration Strategies for Solving Constraint Satisfaction Problems: A Performance Evaluation
    Soto, Ricardo
    Crawford, Broderick
    Olivares, Rodrigo
    Herrera, Rodrigo
    Johnson, Franklin
    Paredes, Fernando
    ARTIFICIAL INTELLIGENCE PERSPECTIVES AND APPLICATIONS (CSOC2015), 2015, 347 : 169 - 179
  • [6] A Choice Function to Dynamic Selection of Enumeration Strategies Solving Constraint Satisfaction Problems
    Crawford, Broderick
    Montecinos, Mauricio
    Castro, Carlos
    Monfroy, Eric
    2009 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION, 2009, : 229 - +
  • [7] Solving crossword puzzles as probabilistic constraint satisfaction
    Shazeer, NM
    Littman, ML
    Keim, GA
    SIXTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-99)/ELEVENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE (IAAI-99), 1999, : 156 - 162
  • [8] A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problems
    Russell, Tyre
    van Beek, Peter
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (03) : 819 - 828
  • [9] Using Constraint Programming to solve Sudoku Puzzles
    Crawford, Broderick
    Aranda, Mary
    Castro, Carlos
    Monfroy, Eric
    THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 2, PROCEEDINGS, 2008, : 926 - +
  • [10] Subgoal strategies for solving board puzzles
    Huang, GX
    Myers, D
    JOURNAL OF AUTOMATED REASONING, 1998, 20 (03) : 215 - 253
12345