Thesis: a generic, collaborative framework for interval constraint solving

Authors:
Antonio J. Fernández
Affiliations:
Dpto. Lenguajes y Ciencias de la Computación, ETSII, University of Málaga, D.P. 29071, Spain
Venue:
AI Communications
Year:
2004

Citing 5
Cited 0

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Comparative Study of Eight Constraint Programming LanguagesOver the Boolean and Finite Domains

Constraints
An Interval Lattice-Based Constraint Solving Framework for Lattices

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
On Benchmarking Constraint Logic Programming Platforms. Response to Fernandez and Hill's “A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains”

Constraints
An interval constraint system for lattice domains

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper abstracts the contents of a PhD dissertation entitled A Generic, Collaborative Framework for Interval Constraint Solving which has been recently defended. This thesis presents a generic framework for defining and solving interval constraints on any set of domains (finite or infinite) that are lattices. This framework combines a number of characteristics desirable in any constraint system such as transparency, on both constraints and computation domains (i.e., it follows a glass box approach where new constraints can be user defined and new, possibly compound, constraint domains can be constructed from existing domains using lattice combinators), cooperativity (so that different solvers, possibly on distinct domains, can communicate and hence, cooperate in solving a problem) and genericity (i.e., it can be applied on any computation domain with lattice structure).