F. Benhamou, D.A. McAllester, and P. Van Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming (ILPS'94), pages 124--138, Ithaca, New York, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Solving Mixed and Conditional Constraint Satisfaction Problems - Gelle (2003) (1 citation) (Correct)
....variables, called total constraints. Furthermore, this rule takes into account all the local extrema of the region defined by the total constraint, and not only intersections of interval bounds with the constraints, as proposed in bound consistency [25] tolerance propagation [23] CLP(intervals) [2], or box consistency [39] Convexity conditions for tractable global consistency in numeric domains are defined in [34, 35] The global consistency method relies on a discretized representation of the constraint regions as 2 k trees. This representation allows the combination of regions of ....
.... definition of midpoint value depends on the domain representation: discrete vari able labels can be represented by a set of integer intervals, e.g. the label a, b, d of a discrete variable domain a, b, c, d , arbitrarily ordered by a: 1, b:2, c:3, d:4, is represented by the list of intervals [1, 2], 4, 4] The midpoint value for a discrete interval [a, b] a, b J can, for example, be computed byfioor(a b 2) Continuous variable labels are represented by a set of real intervals. The midpoint value is thus the midpoint of one of the intervals [c, d] with c, d given by the formula (c ....
[Article contains additional citation context not shown here]
Benhamou, F., McAllester, D., & Van Hentenryck, P. CLP (intervals) revisited. (
Accelerating Filtering Techniques for Numeric CSPs - Lebbah, Lhomme (2002) (Correct)
....also been defined for numeric CSPs [25,32] Another technique from artificial intelligence [19,20] is to merge the constraints concerning the same variables, giving one total constraint (thanks to numerical analysis techniques) and to perform arc consistency on the total constraints. Finally, [6,45] aim at expressing interval analysis pruning as partial consistencies, bridging the gap between the two families of filtering techniques. All the above works address the issue of finding a new partial consistency property that can be computed by an associated filtering algorithm with a good ....
....constraint x 0; by using the Taylor form on the box we obtain the following interval linear equation 1 D) c) that is: AX B where A 1 D and B c D. The unique solution function of this 1dimensional linear equation is straightforward: X = B A. A third approach [6] does not use any analytical solution function. Instead, it transforms the constraint C j 1 , x j k ) into k mono variable constraints C j,l ,l= 1, k. The mono variable constraint C j,l on variable x j l is obtained by substituting their intervals for the other variables. The projection # ....
[Article contains additional citation context not shown here]
F. Benhamou, D. McAllester, P. Van Hentenryck, CLP(intervals) revisited, in: Proc. 1994.
Constraint Propagation - Bessiere (2006) (Correct)
No context found.
F. Benhamou, D.A. McAllester, and P. Van Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming (ILPS'94), pages 124--138, Ithaca, New York, 1994.
Using the Duality Principle to Improve Lower Bounds for - The Global Minimum (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) revisited. In Logic Programming: Proc. 1994 International Symposium, pages 124--138, 1994.
Solving Constraints over Floating-Point Numbers - Michel, Rueher, Lebbah (2001) (1 citation) (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124138, 1994.
Efficient Pruning Technique Based on Linear Relaxations - Lebbah, Michel, Rueher (2005) (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. CLP(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124--138, 1994.
Prediction by Extrapolation for Interval Tightening Methods - Lebbah, Lhomme (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the 1994 International Symposium, pages 109--123, 1994.
Accelerating Filtering Techniques for Numeric CSPs - Lebbah, Lhomme (2002) (Correct)
No context found.
F. Benhamou, D. McAllester, P. Van-Hentenryck, Clp(intervals) revisited, in: Proceedings of the 1994.
Efficient and Safe Global Constraints for Handling .. - Lebbah, Michel.. (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124--138, 1994.
A Global Filtering Algorithm For Handling Systems Of.. - LEBBAH, RUEHER, MICHEL (2002) (5 citations) (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124138, 1994.
Global Filtering Algorithms Based on Linear Relaxations - Lebbah, Michel, RUEHER (2003) (1 citation) (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124138, 1994.
New Light on Arc-Consistency over Continuous Domains - Chabert, Trombettoni, Neveu (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. Clp(intervals) revisited. In International Symposium on Logic programming, pages 124138. MIT Press, 1994.
Combining Local Consistencies with a New Global Filtering .. - LEBBAH, MICHEL, RUEHER (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van-Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124138, 1994.
Consistency Techniques in Constraint Networks - Yuanlin (2003) (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(intervals) revisited. In Proceedings of 1994 International Symposium on Logic Programming, pages 124--138, 1994.
Safe and Tight Linear Estimators - For Global Optimization (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In Proceedings of the International Symposium on Logic Programming (ILPS-94), pages 124--138, Ithaca, NY, November 1994.
Safe and Tight Linear Estimators - For Global Optimization (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In Proceedings of the International Symposium on Logic Programming (ILPS-94), pages 124--138, Ithaca, NY, November 1994.
Safety Verification of Hybrid Systems by Constraint.. - Ratschan, She (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) revisited. In International Symposium on Logic Programming, pages 124--138, Ithaca, NY, USA, 1994. MIT Press.
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
F. Benhamou, D. McAllister, and P. van Hentenryck. CLP(Intervals) revisited. In International Symposium on Logic Programming, pages 124--138. MIT Press, 1994. 125
Verifiable Constraint Propagation Based Solving of Quantified.. - Ratschan (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) revisited. In International Symposium on Logic Programming, pages 124--138, Ithaca, NY, USA, 1994. MIT Press.
Safe and Tight Linear Estimators - For Global Optimization (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In Proceedings of the International Symposium on Logic Programming (ILPS-94), pages 124--138, Ithaca, NY, Nov. 1994.
The Munich Rent Advisor - Frühwirth, Abdennadher (Correct)
No context found.
F. Benhamou, D. MacAllester, and P. Van Hentenryck. Clp(intervals) revisited. In ILPS'94. MIT Press, 1994. http://www.cs.brown.edu/publications/techreports/reports/CS94 -18.html. 15
Safe and Tight Linear Estimators for Global - Optimization Department Of (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In Proceedings of the International Symposium on Logic Programming (ILPS-94), pages 124-138, Ithaca, NY, November 1994.
Safe and Tight Linear Estimators - For Global Optimization (Correct)
No context found.
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited. In Proceedings of the International Symposium on Logic Programming (ILPS-94), pages 124--138, Ithaca, NY, November 1994.
Using Directed Acyclic Graphs to Coordinate Propagation.. - Vu, Schichl, Sam-Haroud (2004) (Correct)
No context found.
Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP(Intervals) Revisited. In: Proceedings of the International Logic Programming Symposium. (1994) 109--123
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
F. Benhamou, D. McAllister, and P. van Hentenryck. CLP(Intervals) revisited. In International Symposium on Logic Programming, pages 124--138. MIT Press, 1994. 125
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC