A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Residuation and Guarded Rules for Constraint Logic Programming
[chapter]
1992
TEUBNER-TEXTE zur Informatik
A major difficulty with logic programming is combinatorial explosion: since goals are solved with possibly indeterminate (Le., branching) reductions, the resulting search trees may grow wildly. Constraint logic programming systems try to avoid combinatorial explosion by building in strong determinate (Le., 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
doi:10.1007/978-3-322-95233-2_24
fatcat:cgxmdubdijbx5mx26hc5aamjy4