A generalised finite domain constraint solver for SWI-Prolog
| Authors |
|
|---|---|
| Publication date | 2008 |
| Journal | Technical Report |
| Event | 22nd Workshop on (Constraint) Logic Programming (WLP 2008), Dresden, Germanu |
| Pages (from-to) | 89-91 |
| Organisations |
|
| Abstract | In this paper we describe a new constraint solver over finite domains that has recently been included in the SWI-Prolog distribution 1. 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. |
| Document type | Article |
| Note |
Proceedings title: 22nd Workshop on (Constraint) Logic Programming, Dresden, Germany, September 30 - October 1, 2008 Publisher: Martin Luther University Halle-Wittenberg, Institute of Computer Science Place of publication: Halle Editors: S. Schwarz |
| Published at | http://nirvana.informatik.uni-halle.de/~schwarz/wlp2008/wlp08proc.pdf |
| Downloads | |
| Permalink to this page | |