DFKI Technical Memo-93-04
by Hans-Günther Hein
Propagation Techniques in WAM-based Architectures
--- The FIDO-III Approach
In this paper we develop techniques to implement finite domain constraints into the Warren Abstract Machine (WAM) to solve large combinatorial problems effciently. The WAM is the de facto standard model for compiling PROLOG. The FIDO system ("FInite DOmain") provides the same functionality as the finite domain part of CHIP.
The extension includes the integration of several new variable types (suspended variables, domain variables and suspended domain variables) into the WAM.
The "firing conditions" are lookahead and forward control schemes known from CHIP. We have developed a constraint model where the constraint is divided into constraint initialization code, constraint testing code and constraint body. Furthermore, we supply a deeply integrated WAM builtin to realize the first fail principle. Besides the summary of the important theoretical results, the specification of the compilation process in the WAM Compilation Scheme is given.
We also present a simple graphical analysis method to estimate the computational burden of lookahead and forward constraints.
The work is an instance of exploring finite domain consistency techniques in logic programming belonging to the FIDO lab within the ARC-TEC project.
This document is available as Postscript.
The next abstract is here, and the previous abstract is here.
Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.