Accelerating filtering techniques for numeric CSPs

Authors:
Yahia Lebbah;Olivier Lhomme
Affiliations:
Départment Informatique, Faculté des Sciences, Université d'Oran Es-Senia, B.P. 1524, El-M'Naouar Oran, Algeria;ILOG, 1681 route des Dolines, Valbonne, France
Venue:
Artificial Intelligence
Year:
2002

Citing 11
Cited 10

A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
Constraint propagation with interval labels

Artificial Intelligence
Constraint reasoning based on interval arithmetic: the tolerance propagation approach

Artificial Intelligence - Special volume on constraint-based reasoning
Arc-consistency for continuous variables

Artificial Intelligence
CLP(intervals) revisited

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A derivation of extrapolation algorithms based on error estimates

Proceedings of the 6th international congress on Computational and applied mathematics
Solving Polynomial Systems Using a Branch and Prune Approach

SIAM Journal on Numerical Analysis
Acceleration methods of numeric CSPc

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Synthesizing constraint expressions

Communications of the ACM
A Constraint Satisfaction Approach to a Circuit Design Problem

Journal of Global Optimization
Improved bounds on the complexity of kB-consistency

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Rigorous Global Filtering Algorithm for Quadratic Constraints

Constraints
Using constraint techniques for a safe and fast implementation of optimality-based reduction

Proceedings of the 2007 ACM symposium on Applied computing
A Reinforcement Learning Approach to Interval Constraint Propagation

Constraints
A CSP approach for the network of product lifecycle constraints consistency in a collaborative design context

Engineering Applications of Artificial Intelligence
A CSP approach for the network of product lifecycle constraints consistency in a collaborative design context

Engineering Applications of Artificial Intelligence
ICOS: a branch and bound based solver for rigorous global optimization

Optimization Methods & Software - GLOBAL OPTIMIZATION
An analysis of slow convergence in interval propagation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Exponential propagation for set variables

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The complexity of integer bound propagation

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis.