Sciweavers

29 search results - page 1 / 6
» Constraint Solving Specializations for Equality on an Interv...
Sort
View
JACIII
2007
68views more  JACIII 2007»
13 years 4 months ago
Constraint Solving Specializations for Equality on an Interval-Variable Domain
Hiroshi Mabuchi, Kiyoshi Akama, Katsunori Miura, T...
RC
2002
100views more  RC 2002»
13 years 4 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
CPAIOR
2008
Springer
13 years 6 months ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
AIPS
2008
13 years 7 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
ECAI
2008
Springer
13 years 6 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson