Domain transmutation in constraint satisfaction problems

被引：0

作者：

Bowen, J ^{[1
]}

Likitvivatanavong, C ^{[1
]}

机构：

[1] Natl Univ Ireland Univ Coll Cork, Cork Constraint Computat Ctr, Cork, Ireland

来源：

PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE | 2004年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of "subvalues". We present an algorithm for breaking up values and combining identical fragments. Experimental results show that the transformed problems take less time to solve for all solutions and yield more compactly-representable, but equivalent, solution sets. We obtain new theoretical results on context dependent interchangeability and full interchangeability, and suggest some other applications.

引用

页码：149 / 154

页数：6

共 15 条

[1] BENSON BW, 1992, P 10 ECAI VIENN AUST, P28
[2] CHMEISS A, 2003, CP 03 WORKSH SYMM CO
[3] Choueiry BY, 1998, FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, P326
[4] FREUDER E, 1995, P IJCAI95, P548
[5] FREUDER EC, 1991, PROCEEDINGS : NINTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, P227
[6] Random constraint satisfaction: Flaws and structure
Gent I.P.
Macintyre E.
Prosser P.
Smith B.M.
Walsh T.
[J]. Constraints, 2001, 6 (4) : 345 - 372
[7] Ginsberg ML, 1998, FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, P334
[8] HASELBOCK A, 1993, P IJCAI 93, P282
[9] HUBBE PD, 1992, P AAAI, P421
[10] LESAINT D, 1994, P ECAI94, P1110

← 1 2 →