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
基金
英国工程与自然科学研究理事会;
关键词
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 条
  • [21] The Underlying Interactive Chain Structure in the Solution Space of Constraint Satisfaction Problems
    Wei, Wei
    Guo, Binghui
    Zheng, Zhiming
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTERNET TECHNOLOGY AND SECURITY (ITS 2010), 2010, : 169 - 173
  • [22] Efficient solution of constraint satisfaction problems by taking into account the relationship of constraints
    Iwate Prefectural University, 152-52 Sugo, Takizawa
    Iwate
    020-0693, Japan
    不详
    Iwate
    020-0021, Japan
    Int. J. Innov. Comput. Inf. Control, 1 (137-151):
  • [23] The solution space structure of planted constraint satisfaction problems with growing domains
    Xu, Wei
    Zhang, Zhe
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2022, 2022 (03):
  • [24] EFFICIENT SOLUTION OF CONSTRAINT SATISFACTION PROBLEMS BY TAKING INTO ACCOUNT THE RELATIONSHIP OF CONSTRAINTS
    Mabuchi, Hiroshi
    Fukuchi, Kohei
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2015, 11 (01): : 137 - 151
  • [25] The solution space structure of random constraint satisfaction problems with growing domains
    Xu, Wei
    Zhang, Pan
    Liu, Tian
    Gong, Fuzhou
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2015,
  • [26] Solution maintenance in dynamic constraint satisfaction problems: a survey of some approaches
    Verfaillie, G.
    Schiex, T.
    Revue d'Intelligence Artificielle, 1995, 9 (03): : 269 - 309
  • [27] Conditional Constraint Satisfaction: Logical Foundations and Complexity
    Gottlob, Georg
    Greco, Gianluigi
    Mancini, Toni
    20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 88 - 93
  • [28] The approximability of constraint satisfaction problems
    Khanna, S
    Sudan, M
    Trevisan, L
    Williamson, DP
    SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1863 - 1920
  • [29] Compiling constraint satisfaction problems
    Weigel, R
    Faltings, B
    ARTIFICIAL INTELLIGENCE, 1999, 115 (02) : 257 - 287
  • [30] Distance constraint satisfaction problems
    Bodirsky, Manuel
    Dalmau, Victor
    Martin, Barnaby
    Mottet, Antoine
    Pinsker, Michael
    INFORMATION AND COMPUTATION, 2016, 247 : 87 - 105