School Homepage

Interval Constraint Solving over Lattices using Chaotic Iteration

A. Fernandez
E.T.S. de Ingenieria Informatica
Departamento de Lenguajes y Ciencias de la Computacion
Despacho 3.2.50
Universidad de Malaga
Teatinos s/n
29071-Malaga
Spain

Patricia M. Hill
School of Computing
The University of Leeds
Leeds LS2 9JT
England

Abstract:

We have defined a constraint solver for any domain that is a lattice. The approach is based on the use of a single constraint similar to the indexicals used in CLP (Constraint Logic programming) over the finite domains. In this paper, we present this constraint solver and the algorithm used by the solver for constraint propagation within the framework of chaotic iteration.