Failure tabled constraint logic programming by interpolation

We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. This allows us to compute interpolants rather...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 13; no. 4-5; pp. 593 - 607
Main Authors: GANGE, GRAEME, NAVAS, JORGE A., SCHACHTE, PETER, SØNDERGAARD, HARALD, STUCKEY, PETER J.
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2013
Subjects:
Derivation
Failure
Interpolation
Logic programming
Projection
Redundant
Regular Papers
Reuse
Strategy
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. This allows us to compute interpolants rather than constraint projection for generation of reuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068413000379