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\u27;) 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\u27; 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

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