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
相关论文
共 50 条
  • [41] A prolog constraint handling rules compiler and runtime system
    Holzbaur, C
    Frühwirth, T
    APPLIED ARTIFICIAL INTELLIGENCE, 2000, 14 (04) : 369 - 388
  • [42] EXPRESSIVE POWER OF CONSTRAINT HANDLING RULES EXTENSIONS AND FRAGMENTS
    Mauro, Jacopo
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2013, (111): : 168 - 194
  • [43] A unified semantics for constraint handling rules in transaction logic
    Meister, Marc
    Djelloul, Khalil
    Robin, Jacques
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2007, 4483 : 201 - +
  • [44] (Co-)Inductive semantics for Constraint Handling Rules
    Haemmerle, Remy
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2011, 11 : 593 - 609
  • [45] On proving confluence modulo equivalence for Constraint Handling Rules
    Christiansen, Henning
    Kirkeby, Maja H.
    FORMAL ASPECTS OF COMPUTING, 2017, 29 (01) : 57 - 95
  • [46] Confluence Modulo Equivalence with Invariants in Constraint Handling Rules
    Gall, Daniel
    Fruehwirth, Thom
    FUNCTIONAL AND LOGIC PROGRAMMING, FLOPS 2018, 2018, 10818 : 116 - 131
  • [47] Constraint solver synthesis using tabled resolution for constraint logic programming
    Abdennadher, S
    Rigotti, C
    LOGIC BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2003, 2664 : 32 - 47
  • [48] Failure tabled constraint logic programming by interpolation
    Gange, Graeme
    Navas, Jorge A.
    Schachte, Peter
    Sondergaard, Harald
    Stuckey, Peter J.
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2013, 13 : 593 - 607
  • [49] Towards Automatic Poetry Generation using Constraint Handling Rules
    el Bolock, Alia
    Abdennadher, Slim
    30TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, VOLS I AND II, 2015, : 1868 - 1873
  • [50] Analysing graph transformation systems through constraint handling rules
    Raiser, Frank
    Fruehwirth, Thom
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2011, 11 : 65 - 109
12345