13 search results - page 1 / 3 » An Interval Constraint Branching Scheme for Lattice Domains |
JUCS
2006
13 years 4 months ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
FLOPS
1999
Springer
13 years 9 months ago
1999
Springer
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...
AICOM
2004
13 years 4 months ago
2004
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 pre...
SPATIALCOGNITION
2004
Springer
13 years 10 months ago
2004
Springer
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
CP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...