Constraint Handling Rules and tabled execution

被引：9

作者：

Schrijvers, T ^{[1
]}

Warren, DS

机构：

[1] Katholieke Univ Leuven, Dept Comp Sci, Louvain, Belgium

[2] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA

来源：

LOGIC PROGRAMMING, PROCEEDINGS | 2004年 / 3132卷

关键词：

D O I：

10.1007/978-3-540-27775-0_9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Both Constraint Handling Rules (CHR) and tabling - as implemented in XSB - are powerful enhancements of Prolog systems, based on fix point computation. Until now they have only been implemented in separate systems. This paper presents the work involved in porting a CHR system to XSB and in particular the technical issues related to the integration of CHR with tabled resolution. These issues include call abstraction, answer projection, entailment checking, answer combination and tabled constraint store representations. Different optimizations related to tabling constraints are evaluated empirically. The integration requires no changes to the tabling engine. We also show that the performance of CHR programs without tabling is not affected. Now, with the combined power of CHR and tabling, it is possible to easily introduce constraint solvers in applications using tabling, or to use tabling in constraint solvers.

引用

页码：120 / 136

页数：17

共 19 条

[1] Tabled evaluation with delaying for general logic programs [J].

Chen, WD ;

Warren, DS .

JOURNAL OF THE ACM, 1996, 43 (01) :20-74

[2]

CODISH M, 1998, SPRINGER INT J SOFTW, V2, P29

[3]

COSTA VS, YAP USERS MANUAL

[4]

CUI B, 2000, ELECT NOTES THEORETI, V30

[5]

Cui BQ, 2000, LECT NOTES ARTIF INT, V1861, P478

[6]

Demoen B, 1999, LECT NOTES COMPUT SC, V1713, P174

[7]

Demoen B, 2000, LECT NOTES ARTIF INT, V1861, P1240

[8]

DEMOEN B, 2002, 350 CW K U LEUV DEP

[9]

DU X, 2000, IEEE REAL TIME SYSTE

[10]

FRUHWIRTH T, 1998, SPECIAL ISSUE CONSTR, V37

← 1 2 →