Talks and Poster Presentations (with Proceedings-Entry):
M. Triska, U. Neumerkel, J. Wielemaker:
"A Generalised Finite Domain Constraint Solver for SWI-Prolog";
Talk: 22nd Workshop on (Constraint) Logic Programming,
- 2008-10-01; in: "22nd Workshop on (Constraint) Logic Programming",
Technical Report, University Halle-Wittenberg, Institute of Computer Science,
In this paper we describe a new constraint solver over finite domains that has recently been included in the SWI-Prolog distribution. Our solver generalises finite domain constraint solving towards unbounded domains, and thus enables a uniform approach to integer arithmetic and constraints. We ensure termination of all predicates, which facilitates termination proofs of constraint logic programs. The solver is written in Prolog and can be quite easily ported to other systems.
finite domain constraints
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.