Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
A minimal extension of the WAM for clp(FD)
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Constraint arithmetic on real intervals
Constraint logic programming
Boolean constraint solving using CLP(FD)
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
Maintaining knowledge about temporal intervals
Communications of the ACM
The role of commutativity in constraint propagation algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Interval Lattice-Based Constraint Solving Framework for Lattices
FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Interval Constraint Logic Programming
Selected Papers from Constraint Programming: Basics and Trends
On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
The Rough Guide to Constraint Propagation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
We present a generic framework for defining and solving interval constraints on any set of domains (finite or infinite) that are lattices. The approach is based on the use of a single form of constraint similar to that of an indexical used by CLP for finite domains and on a particular generic definition of an interval domain built from an arbitrary lattice. We provide the theoretical foundations for this framework and a schematic procedure for the operational semantics. Examples are provided that illustrate how new (compound) constraint solvers can be constructed from existing solvers using lattice combinators and how different solvers (possibly on distinct domains) can communicate and hence, cooperate in solving a problem. We describe the language clp(L), which is a prototype implementation of this framework and discuss ways in which this implementation may be improved.