Revisiting global constraint satisfaction

被引：3

作者：

Hower, W ^{[1
]}

机构：

[1] Univ Hamburg, Fachbereich Informat, Lab Kunstl Intelligenz, D-22527 Hamburg, Germany

来源：

关键词：

analysis/design of algorithms; combinatorial problems; computational complexity; constraint satisfaction;

D O I：

10.1016/S0020-0190(98)00023-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：41 / 48

页数：8

共 50 条

[21] Dynamic Flexible Constraint Satisfaction
Ian Miguel
Qiang Shen
Applied Intelligence, 2000, 13 : 231 - 245
[22] Backtracking and random constraint satisfaction
Paul Walton Purdom
Annals of Mathematics and Artificial Intelligence, 1997, 20 : 393 - 410
[23] Relatively quantified constraint satisfaction
Manuel Bodirsky
Hubie Chen
Constraints, 2009, 14 : 3 - 15
[24] Sandwiches for promise constraint satisfaction
Deng, Guofeng
El Sai, Ezzeddine
Manders, Trevor
Mayr, Peter
Nakkirt, Poramate
Sparks, Athena
ALGEBRA UNIVERSALIS, 2021, 82 (01)
[25] Relatively quantified constraint satisfaction
Bodirsky, Manuel
Chen, Hubie
CONSTRAINTS, 2009, 14 (01) : 3 - 15
[26] Sandwiches for promise constraint satisfaction
Guofeng Deng
Ezzeddine El Sai
Trevor Manders
Peter Mayr
Poramate Nakkirt
Athena Sparks
Algebra universalis, 2021, 82
[27] On bounded occurrence constraint satisfaction
Håstad, J
INFORMATION PROCESSING LETTERS, 2000, 74 (1-2) : 1 - 6
[28] Dynamic flexible constraint satisfaction
Miguel, I
Shen, Q
APPLIED INTELLIGENCE, 2000, 13 (03) : 231 - 245
[29] The Complexity of Phylogeny Constraint Satisfaction
Bodirsky, Manuel
Jonsson, Peter
Trung Van Pham
33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
[30] CONSTRAINT SATISFACTION WITH COUNTING QUANTIFIERS
Martin, Barnaby
Madelaine, Florent
Stacho, Juraj
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (02) : 1065 - 1113