Sciweavers

ICLP
1993
Springer
13 years 8 months ago
A Minimal Extension of the WAM for clp(FD)
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
Daniel Diaz, Philippe Codognet
FLOPS
1999
Springer
13 years 8 months ago
An Interval Lattice-Based Constraint Solving Framework for Lattices
We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constrai...
Antonio J. Fernández, Patricia M. Hill
CL
2000
Springer
13 years 8 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
ICLP
2005
Springer
13 years 10 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli