New structural decomposition techniques for constraint satisfaction problems

被引：0

作者：

Zheng, YL ^{[1
]}

Choueiry, BY ^{[1
]}

机构：

[1] Univ Nebraska, Constraint Syst Lab, Lincoln, NE 68588 USA

来源：

RECENT ADVANCES IN CONSTRAINTS | 2005年 / 3419卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge decomposition and hypertree decomposition. Our experiments show that one of our techniques offers the best trade-off between the computational cost of the decomposition and the width of the resulting decomposition tree.

引用

页码：113 / 127

页数：15

共 50 条

[1] 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
[2] 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
[3] Fast and parallel decomposition of constraint satisfaction problems
Gottlob, Georg
Okulmus, Cem
Pichler, Reinhard
[J]. CONSTRAINTS, 2022, 27 (03) : 284 - 326
[4] Fast and Parallel Decomposition of Constraint Satisfaction Problems
Gottlob, Georg
Okulmus, Cem
Pichler, Reinhard
[J]. PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 1155 - 1162
[5] HYPERTREE DECOMPOSITION FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS
Ait-Amokhtar, Abdelmalek
Amroun, Kamal
Habbas, Zineb
[J]. ICAART 2009: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, 2009, : 85 - +
[6] Fast and parallel decomposition of constraint satisfaction problems
Georg Gottlob
Cem Okulmus
Reinhard Pichler
[J]. Constraints, 2022, 27 : 284 - 326
[7] Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study
Habbas, Zineb
Krajecki, Michael
Singer, Daniel
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2005, 1 (2-4) : 192 - 206
[8] Solution Techniques for Constraint Satisfaction Problems: Foundations
I. Miguel
Q. Shen
[J]. Artificial Intelligence Review, 2001, 15 : 243 - 267
[9] Solution techniques for constraint satisfaction problems: Foundations
Miguel, I
Shen, Q
[J]. ARTIFICIAL INTELLIGENCE REVIEW, 2001, 15 (04) : 243 - 267
[10] Solving partial constraint satisfaction problems with tree decomposition
Koster, AMCA
van Hoesel, SPM
Kolen, AWJ
[J]. NETWORKS, 2002, 40 (03) : 170 - 180

← 1 2 3 4 5 →