Constraint Satisfaction Problem
Unbiased statistics of a Constraint Satisfaction Problem - A controlled-bias generator
... Keywords: constraint satisfaction problem, modelling and simulation, unbiased statistics, Sudoku puzzle generation, Sudoku ...NTRODUCTION Constraint Satisfaction Problems (CSP) ...
8
Constraint satisfaction problem based on flow graph to study the resilience of inland navigation networks in a climate change context
... A constraint satisfaction problem based on flow graph is proposed in this paper to study the resilience of inland navigation networks against increase of the navigation demand and extreme ...
8
Constraint satisfaction problem based on flow graph to study the resilience of inland navigation networks in a climate change context
... a constraint satisfaction problem is defined to determine the water volumes that have to be exchanged between each navigation ...and constraint satisfaction in particular Sun et ...
8
Constraint satisfaction problem based on flow graph to study the resilience of inland navigation networks in a climate change context
... a constraint satisfaction problem based on flow transport graph is proposed to determine the resilience of inland navigation networks against increase of the navigation demand and extreme events as ...
7
Unbiased statistics of a Constraint Satisfaction Problem - a controlled-bias generator
... Keywords: constraint satisfaction problem, modelling and simulation, unbiased statistics, Sudoku puzzle generation, Sudoku ...NTRODUCTION Constraint Satisfaction Problems (CSP) ...
8
Analysis of standard and new algorithms for the integer ans linear constraint satisfaction problem
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
52
Forbidden patterns in constraint satisfaction problems
... 6 Conclusion 6.1 What we have done We now summarize the major contributions of this thesis. We have formally defined several versions of forbidden patterns in the context of the binary Constraint ...
130
Harnessing tractability in constraint satisfaction problems
... The Constraint Satisfaction Problem (CSP) is a fundamental NP-complete prob- lem with many applications in artificial ...This problem has enjoyed considerable scientific attention in the past ...
138
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree
... Boolean constraint satisfaction problem (CSP) over n variables x 1 , ...the constraint predicates do not need to be of the same “form”; however, it is common to study CSPs where this is the ...
15
Tractability in Constraint Satisfaction Problems: A Survey
... decision problem (such as the constraint satisfaction problem or CSP) consists of a generic instance (in the case of the CSP, a set of variables, their domains and a set of constraints) ...
34
Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors
... binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of ...
21
Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden Patterns
... a b s t r a c t Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. A variable elimination rule (value ...
18
Characterising the Complexity of Constraint Satisfaction Problems Defined by 2-Constraint Forbidden Patterns
... b INSIGHT, University College Cork, Ireland a b s t r a c t Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of ...
26
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
... a factor n Ω(1)/ log log n (cf. [KST97], [DKS98], [DKRS00]), and this hardness ratio is in fact also valid for average dense instances. Only recently a polynomial time algorithm with the first sublinear approximation ...
20
Tractability in constraint satisfaction problems: a survey
... decision problem (such as the constraint satisfaction problem or CSP) consists of a generic instance (in the case of the CSP, a set of variables, their domains and a set of constraints) ...
34
Temporal Constraint Satisfaction Problems and Difference Decision Diagrams: A Compilation Map
... In constraint-based reasoning, a model is built by means of a set of constraints restricting the combinations of values of the ...(Temporal Constraint Satisfaction Problem) ...a ...
9
Qualitative Preference Modelling in Constraint Satisfaction
... a constraint satisfaction problem, while sec- tion 5 extends dynamic constraint satisfaction problems in order to work with contextual preferences introducing preferences among active ...
15
Solving under-constrained numerical constraint satisfaction problems with IBEX
... contain one unique solution (see the left graphic of Figure 1). This twofold interpretation of inner boxes with respect to the problem structure seems not homogeneous. Intermediate cases with less equations than ...
3
Computing and restoring global inverse consistency in interactive constraint satisfaction
... the problem should not be led to a dead-end where satisfying all constraints of the network is ...the constraint network into a multi-valued decision diagram (MDD) at the modeling phase [4–6] or by ...
18
Using Constraint Satisfaction Techniques and Variational Methods for Probabilistic Reasoning
... MC-SAT rapidly reasons in the limit of determinism and L-Im is the recent lifted importance sampling inference that addresses the evidence problem (see Venugopal and Gogate, 2014a) and as a result improves the ...
191