Title: Constraint Handling Rules and tabled execution
Authors: Schrijvers, Tom ×
Warren, David S #
Issue Date: 2004
Publisher: Springer-verlag berlin
Series Title: Logic programming, proceedings vol:3132 pages:120-136
Conference: International Conference on Logic Programming edition:20 location:St-Malo, France date:6-10 September 2004
Abstract: 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.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
iclp2004.pdf Published 150KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science