# Haut PDF Forbidden patterns in constraint satisfaction problems

### Forbidden patterns in constraint satisfaction problems

**forbidden**subproblem is shown

**in**Figure ...whose

**constraint**graph is a tree satisfies the broken-triangle property for some ordering of its variables; furthermore such an ordering can be ...

130

### Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden Patterns

**patterns**described

**in**this paper to arbitrary-arity CSP instances (perhaps using one of the possible definitions of microstructure for constraints of arbitrary arity [25] )? A partial positive ...

19

### Variable and Value Elimination in Binary Constraint Satisfaction via Forbidden Patterns

**in**a

**constraint**

**satisfaction**problem (CSP) can be used

**in**preprocessing or during search to reduce search space ...existential

**patterns**,

**in**arc- consistent CSP ...

18

### Tractability in constraint satisfaction problems: a survey

**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) together with a yes-no question (Is ...

34

### Characterising the Complexity of Constraint Satisfaction Problems Defined by 2-Constraint Forbidden Patterns

**constraint**

**satisfaction**problem) is NP-complete, even

**in**the case when all constraints are binary, certain classes of instances are ...forbidding

**patterns**(where a pattern is simply a compact ...

26

### Tractability in Constraint Satisfaction Problems: A Survey

**constraint**languages over infinite domains, it is natural to restrict attention to classes of constraints which commonly occur

**in**real ap- ...definition

**in**(Q; <), the ordered rational ...

34

### How to take into account piecewise constraints in constraint satisfaction problems

**Constraint**consistency techniques for continuous ...Lausanne].

**In**this paper, we propose to extend the method of generating Quad Trees

**in**order to take into account,

**in**CSPs, binary ...

9

### Expressing Constraint Satisfaction Problems in Declarative Modeling Using Natural Language and Fuzzy Sets

15

### Harnessing tractability in constraint satisfaction problems

**problems**not believed to be

**in**P are few

**in**number, but keep

**in**mind that CSP(M) is a promise problem and constructing very hard NP ∩ coNP promise

**problems**is easy by manipulating ...

138

### Temporal Constraint Satisfaction Problems and Difference Decision Diagrams: A Compilation Map

**in**the DDD framework, this assumption does not provide any good property, contrarily to what happens

**in**the classical decision diagram ...constraints

**satisfaction**problem (a TCSP or a DTP ...

10

### Clique Cuts in Weighted Constraint Satisfaction

**constraint**propaga- tion inside toulbar2 (version ...solver

**in**C++. Among the various benchmarks from [19] (available

**in**LP, WCNF, WCSP, UAI, and MiniZinc formats) where cplex reports that ...

18

### Variable Elimination in Binary CSP via Forbidden Patterns

**in**- stance. Variable elimination

**in**the

**constraint**sat- isfaction problem (CSP) can be used

**in**prepro- cessing or during search to reduce search space ...terns,

**in**arc-consistent CSP ...

8

### The complexity of satisfaction problems in reverse mathematics

**problems**and state a different dichotomy ...problem

**in**industry consists

**in**reducing it to a

**satisfaction**problem over propositional logic and using a SAT ...and

**constraint**...

20

### Temporal Constraint Satisfaction Problems and Difference Decision Diagrams: A Compilation Map

**in**a single

**constraint**may relate different ...DTP

**problems**can not be solved online with the guarantee that the response will be given

**in**polynomial time: checking the consistency ...

9

### On the Complexity of Global Constraint Satisfaction

**in**this paper that all the cases that were considered by Creigou [Cre95] and Khanna and Sudan [KS96]

**in**the dichotomy theorem become APX -hard and also that most of the trivial maximization ...

21

### Broken Triangles: From Value Merging to a Tractable Class of General-Arity Constraint Satisfaction Problems

**in**the 3-variable instance shown

**in**Fig. 2 .

**In**order to avoid cluttering up figures with broken lines linking each pair of incompatible assignments,

**in**all figures illustrating ...

24

### Computing and restoring global inverse consistency in interactive constraint satisfaction

**Constraint**Programming (CP) is widely used to express and solve combinatorial ...a

**constraint**network, efficient solving techniques generate a solution satisfying the constraints, if such a ...

18

### Cautious label-wise ranking with constraint satisfaction

**In**ranking

**problems**, it may also be interesting [ 9 , 18 ] to predict partial rather than complete rankings, abstaining to make a precise prediction

**in**presence of too little ...

15

### Global Inverse Consistency for Interactive Constraint Satisfaction

**constraint**problem by a human user.

**In**such cases, it is highly desirable that the person who interactively solves the problem is not given the choice to select values that do not lead to ...diagram. ...

17

### Weight-based heuristics for constraint satisfaction and combinatorial optimization problems

**in**tree search methods The heuristic presented previously can be grafted into tree search methods, such as discrepancy search or chronological ...discrepancies.

**In**the following of this section, ...

30