Solution techniques for constraint satisfaction problems: Foundations

被引：10
|
作者：
Miguel, I [1 ]
Shen, Q [1 ]
机构：
[1] Univ Edinburgh, Sch Artificial Intelligence, Div Informat, Edinburgh EH1 1HN, Midlothian, Scotland
来源：
ARTIFICIAL INTELLIGENCE REVIEW | 2001年 / 15卷 / 04期
基金：
英国工程与自然科学研究理事会;
关键词：
Constraint Satisfaction Problems; constraint graph; tree search; pre-processing; consistency enforcing;
D O I：
10.1023/A:1011039901653
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The Constraint Satisfaction Problem (CSP) is ubiquitous in artificial intelligence. It has a wide applicability, ranging from machine vision and temporal reasoning to planning and logic programming. This paper attempts a systematic and coherent review of the foundations of the techniques for constraint satisfaction. It discusses in detail the fundamental principles and approaches. This includes an initial definition of the constraint satisfaction problem, a graphical means of problem representation, conventional tree search solution techniques, and pre-processing algorithms which are designed to make subsequent tree search significantly easier.
引用
收藏
页码：243 / 267
页数：25
相关论文
共 50 条
  • [1] Solution Techniques for Constraint Satisfaction Problems: Foundations
    I. Miguel
    Q. Shen
    [J]. Artificial Intelligence Review, 2001, 15 : 243 - 267
  • [2] Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
    I. Miguel
    Q. Shen
    [J]. Artificial Intelligence Review, 2001, 15 : 269 - 293
  • [3] Solution techniques for constraint satisfaction problems: Advanced approaches
    Miguel, I
    Shen, Q
    [J]. ARTIFICIAL INTELLIGENCE REVIEW, 2001, 15 (04) : 269 - 293
  • [4] Structuring techniques for constraint satisfaction problems
    Weigel, R
    Faltings, BV
    [J]. IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 418 - 423
  • [5] Constraint Satisfaction Techniques for Combinatorial Problems
    Narvaez, David E.
    [J]. THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 8028 - 8029
  • [6] COOPERATIVE SOLUTION OF CONSTRAINT SATISFACTION PROBLEMS
    CLEARWATER, SH
    HUBERMAN, BA
    HOGG, T
    [J]. SCIENCE, 1991, 254 (5035) : 1181 - 1183
  • [7] On finding a solution in temporal constraint satisfaction problems
    Gerevini, A
    Cristani, M
    [J]. IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 1460 - 1465
  • [8] New structural decomposition techniques for constraint satisfaction problems
    Zheng, YL
    Choueiry, BY
    [J]. RECENT ADVANCES IN CONSTRAINTS, 2005, 3419 : 113 - 127
  • [9] DECOMPOSING CONSTRAINT SATISFACTION PROBLEMS USING DATABASE TECHNIQUES
    GYSSENS, M
    JEAVONS, PG
    COHEN, DA
    [J]. ARTIFICIAL INTELLIGENCE, 1994, 66 (01) : 57 - 89
  • [10] Solution equivalent subquadrangle reformulations of constraint satisfaction problems
    Houghton, C
    Cohen, D
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2005, PROCEEDINGS, 2005, 3709 : 851 - 851
12345