# Publication details

##
Residuation and Guarded Rules for Constraint Logic Programming

Gert Smolka

Constraint Logic Programming: Selected Research, pp. 405--419, The MIT Press, April 1993

A major difficulty with logic programming is combinatorial explosion: since goals are solved with possibly indeterminate
(i.e., branching) reductions, the resulting search trees may grow
wildly. Constraint logic programming systems try to avoid
combinatorial explosion by building in strong determinate (i.e.,
non-branching) reduction in the form of constraint
simplification. In this paper we present two concepts,
residuation and guarded rules, for further strengthening
determinate reduction. Both concepts apply to constraint logic
programming in general and yield an operational semantics that
coincides with the declarative semantics. Residuation is a
control strategy giving priority to determinate reductions.
Guarded rules are logical consequences of programs adding
otherwise unavailable determinate reductions.

Download PDF
Show BibTeX

@INCOLLECTION{ResiduationBook,
title = {Residuation and Guarded Rules for Constraint Logic Programming},
author = {Gert Smolka},
year = {1993},
month = {apr # { 3--5}},
editor = {"Fr\'ed\'eric Benhamou and Alain Colmerauer"},
publisher = {"The MIT Press"},
booktitle = {Constraint Logic Programming: Selected Research},
series = {{Lecture Notes in Computer Science, vol. 1000}},
pages = {"405--419"},
chapter = {22},
address = {"Cambridge, Mass."},
note = {"Previous version as DFKI Research Report RR-91-13"},
}

Login to edit

Webmaster,
Wed Sep 16 10:47:00 2009