Dynamic domain splitting for numeric csp (original) (raw)
Related papers
Dynamic Backtracking with Constraint Propagation - Application to numeric CSPs
Recent w orks on constraint relaxation ] provided the decorum system (Deduction-based Constraint Relaxation Management). That system can be seen as an integration of arc-consistency within the dynamic backtracking algorithm . Dynamic backtracking replaces the backtracking process by a m uch less blind behavior that consists in local modi cations of the choices made up to the current situation. In this paper, a new enumeration technique over numeric csps is proposed: dynamic domain splitting. T h i s i s a d omain splitting search where chronological backtracking is replaced by a kind of dynamic backtracking.
Intelligent Splitting for Disjunctive Numerical CSPs
2006
Disjunctions in numerical CSPs appear in applications such as Design, Biology or Control. Generalized solving techniques have been proposed to handle these disjunctions in a Branch&Prune fashion. However, they focus essentially on the pruning operation. In this paper, we present experimental evidences that significant performance gains can be expected by exploiting the disjunctions in the branching operation.
Eliminating redundancy in CSPs through merging and subsumption of domain values
ACM SIGAPP Applied Computing Review, 2013
Onto-substitutability has been shown to be intrinsic to how a domain value is considered redundant in Constraint Satisfaction Problems (CSPs). A value is onto-substitutable if any solution involving that value remains a solution when that value is replaced by some other value. We redefine onto-substitutability to accommodate binary relationships and study its implication. Joint interchangeability, an extension of onto-substitutability to its interchangeability counterpart, emerges as one of the results. We propose a new way of removing interchangeable values by constructing a new value as an intermediate step, as well as introduce virtual interchangeability, a local reasoning that leads to joint interchangeability and allows values to be merged together. Algorithms for removing onto-substitutable values are also proposed. 1
Consistency techniques for numeric CSPs
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the consistency techniques that have been developed for CSPs can be adapted to numeric CSPs. Since the numeric domains are ordered the underlying idea is to handle domains only by their bounds. The semantics that have been elaborated, plus the complexity analysis and good experimental results, confirm that these techniques can be used in real applications.
An Efficient Library for Solving Csp With Local Search
Proceedings of MIC03, Fifth Metaheuristics …, 2003
In the last years, the application of local search techniques for constraint solving started to raise some interest in the Constraint Programming community, We proposed some years ago a domain-independent local search method called Adaptive Search for solving Constraint ...
Unifying search algorithms for CSP
M component: it moves in the search space thus modifying the set of constraints C D . Movement can be: a forward move (eg. classical partial solution extension), a backward move (eg. classical backtracking, back-jumping, etc.), or other kinds of moves.
Dynamic Backtracking with Constraint Propagation - Application to static and dynamic CSPs
Recent w orks on constraint relaxation ] provided the decorum system (Deduction-based Constraint Relaxation Management). In this paper, we s h o w h o w the ideas developed in that system can be used in order to integrate Constraint Propagation within the Dynamic Backtracking algorithm . Dynamic Backtracking replaces the backtracking process by a m uch l e s s b l i n d b e h a viour that consists in local modi cations of the choices made up to the current situation.
2008 20th IEEE International Conference on Tools with Artificial Intelligence, 2008
In this paper, a new evaluation of the complexity of Forward Checking for solving non-binary CSPs with finite domains is proposed. Unlike what is done usually, it does not consider the size of domains, but the size of the relations associated to the constraints. It may lead sometimes to define better complexity bounds. By using this first result, we show that the tractability hierarchy proposed in [6] which compares different methods based on a decomposition of constraint networks can be seen from a new viewpoint.
Extending consistent domains of numeric CSP
1999
This paper introduces a new framework for extending consistent domains of numeric CSP. The aim is to offer the greatest possible freedom of choice for one variable to the designer of a CAD application. Thus, we provide here an efficient and incremental algorithm which computes the maximal extension of the domain of one variable. The key point of this framework is the definition, for each inequality, of an univariate extrema function which computes the left most and right most solutions of a selected variable (in a space delimited by the domains of the other variables). We show how these univariate extrema functions can be implemented efficiently. The capabilities of this approach are illustrated on a ballistic example.
A data structure boosting the performance of local search for CSP solving
This paper is concerned with local search techniques (LS) for solving CSPs (Constraint Satisfaction Problems). An efficient data structure is presented that allows the performance of LS to be boosted. Experimentations on benchmarks from the last international CSP competitions illustrate its very positive impact. It has been implemented in wcsp δ : an efficient open-ended and open-source local search platform for CSP that can accommodate various meta-heuristics.