document: Accelerating filtering techniques for numeric CSPs Search algorithms for solving Numeric CSPs -LRB- Constraint Satisfaction Problems -RRB- 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
doc_bio_tags: O B I O B I B I O O B I O B I I O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O B I
extractive_keyphrases: search algorithms numeric csps constraint satisfaction problems filtering techniques artificial intelligence interval analysis propagation
abstractive_keyphrases: csps-solving extrapolation methods pruning