by Jörg P. Müller
Design and Implementation of a Finite Domain Constraint Logic Programming System based on PROLOG with Coroutining
Many problems in Artificial Intelligence can be regarded as
constraint solving problems (CSPs). Due to its relational, declarative and
nondeterministic form, logic programming offers a convenient way for
stating CSPs. Unfortunately, logic programming languages such as e. g.
PROLOG tend to be inefficient for solving CSPs because of their poor
control facilities. One current way of remedying this is the Constraint
Logic Programming approach:
By integrating a domain concept for logic variables, and consistency techniques such as forward checking or looking-ahead into PROLOG, the search space can be restricted in an a priori manner. Thus, a more efficient control strategies can be realized, preserving the 'clean' dual PROLOG semantics.
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.