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 条
  • [41] Nonuniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
    Creignou, Nadia
    Schnoor, Henning
    Schnoor, Ilka
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2010, 11 (04) : 1 - 32
  • [42] A Meta Constraint Satisfaction Optimization Problem for the Optimization of Regular Constraint Satisfaction Problems
    Loeffler, Sven
    Liu, Ke
    Hofstedt, Petra
    [J]. PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE (ICAART), VOL 2, 2019, : 435 - 442
  • [43] A constraint directed model for partial constraint satisfaction problems
    Nagarajan, S
    Goodwin, S
    Sattar, A
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2000, 1822 : 26 - 39
  • [44] Constraint satisfaction techniques in planning and scheduling
    Roman Barták
    Miguel A. Salido
    Francesca Rossi
    [J]. Journal of Intelligent Manufacturing, 2010, 21 : 5 - 15
  • [45] Constraint satisfaction techniques in planning and scheduling
    Bartak, Roman
    Salido, Miguel A.
    Rossi, Francesca
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2010, 21 (01) : 5 - 15
  • [46] Complexity of Conservative Constraint Satisfaction Problems
    Bulatov, Andrei A.
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (04)
  • [47] Optimal Refutations for Constraint Satisfaction Problems
    Hulubei, Tudor
    O'Sullivan, Barry
    [J]. 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 163 - 168
  • [48] ROBUSTLY SOLVABLE CONSTRAINT SATISFACTION PROBLEMS
    Barto, Libor
    Kozik, Marcin
    [J]. SIAM JOURNAL ON COMPUTING, 2016, 45 (04) : 1646 - 1669
  • [49] Argumentation frameworks as constraint satisfaction problems
    Leila Amgoud
    Caroline Devred
    [J]. Annals of Mathematics and Artificial Intelligence, 2013, 69 : 131 - 148
  • [50] Constraint satisfaction problems: Algorithms and applications
    Brailsford, SC
    Potts, CN
    Smith, BM
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 119 (03) : 557 - 581
12345