#### DMCA

## Binary vs. non-binary constraints (2002)

### Cached

### Download Links

Venue: | Artificial Intelligence |

Citations: | 31 - 3 self |

### Citations

1138 |
Consistency in networks of relations
- Mackworth
- 1977
(Show Context)
Citation Context ...search algorithms that maintain a local consistency property at each node in their search tree. Various types of local consistency have been defined, and algorithms developed for enforcing them (e.g, =-=[5, 13, 14]-=-). Algorithms that maintain a local consistency property during backtracking search (e.g., [8, 10, 15, 16, 20]) can detect dead-ends sooner and thus have the potential of significantly reducing the si... |

520 |
Increasing Tree Search Efficiency for Constraint-Satisfaction Problems
- Haralick, Elliot
- 1980
(Show Context)
Citation Context ...s types of local consistency have been defined, and algorithms developed for enforcing them (e.g, [5, 13, 14]). Algorithms that maintain a local consistency property during backtracking search (e.g., =-=[8, 10, 15, 16, 20]-=-) can detect dead-ends sooner and thus have the potential of significantly reducing the size of the tree they have to search. Such algorithms have demonstrated significant empirical advantages and are... |

277 |
Tree clustering for constraint networks
- Dechter, Pearl
- 1989
(Show Context)
Citation Context ... various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints [9, 22, 25], adding hidden variables [6, 24], aggregating or grouping variables together =-=[3, 7]-=-, and transforming a CSP model into an equivalent representation over a different set of variables [7, 11, 19, 26]. One important modeling decision is the arity of the constraints used. Constraints ca... |

226 | Contradicting conventional wisdom in constraint satisfaction
- SABIN, FREUDER
- 1994
(Show Context)
Citation Context ...s types of local consistency have been defined, and algorithms developed for enforcing them (e.g, [5, 13, 14]). Algorithms that maintain a local consistency property during backtracking search (e.g., =-=[8, 10, 15, 16, 20]-=-) can detect dead-ends sooner and thus have the potential of significantly reducing the size of the tree they have to search. Such algorithms have demonstrated significant empirical advantages and are... |

135 | J.C.: Arc consistency for general constraint networks: Preliminary results
- Bessière, Régin
- 1997
(Show Context)
Citation Context ...visit ins¢ ¡s� � �����¥¤ ¡ iff MAC visits in . To complete the proof, we note that arc consistency on a CSPs�� ¨�¡��stakes time in the worst case and arc consistency on =-=¡£¢ £ ¡�� ¨ � � �s¡ takes time [2], where ������ MAC-=--hidden and MAC-hidden � �����¥¤ ¡ � , , ¡ and denote the size of the largest domain, the number of constraints, andsthe arity of the largest constraint scheme ins, respectively. The... |

127 |
Constraint satisfaction algorithms
- Nadel
- 1989
(Show Context)
Citation Context ...s types of local consistency have been defined, and algorithms developed for enforcing them (e.g, [5, 13, 14]). Algorithms that maintain a local consistency property during backtracking search (e.g., =-=[8, 10, 15, 16, 20]-=-) can detect dead-ends sooner and thus have the potential of significantly reducing the size of the tree they have to search. Such algorithms have demonstrated significant empirical advantages and are... |

123 | A theoretical evaluation of selected backtracking algorithm
- Kondrak, Beek
- 1997
(Show Context)
Citation Context ... © constraints reduced so that they contain only tuples over the ¦ subdomain Constraint satisfaction problems are often solved using backtracking search (for a detailed presentation see, for example=-=, [12, 25]-=-). A backtracking search may be seen as traversing a search tree. In this approach we identify tuples (assignments of values to variables) with nodes: the empty tuple is the root of the tree, the firs... |

103 | CPlan: A Constraint Programming Approach to Planning
- Beek, Chen
- 1999
(Show Context)
Citation Context ...he time it takes to find a solution [3, 17, 21], and various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints [9, 22, 25], adding hidden variables =-=[6, 24]-=-, aggregating or grouping variables together [3, 7], and transforming a CSP model into an equivalent representation over a different set of variables [7, 11, 19, 26]. One important modeling decision i... |

93 | On the Equivalence of Constraint Satisfaction Problems
- Rossi, Petrie, et al.
- 1990
(Show Context)
Citation Context ...aints [9, 22, 25], adding hidden variables [6, 24], aggregating or grouping variables together [3, 7], and transforming a CSP model into an equivalent representation over a different set of variables =-=[7, 11, 19, 26]-=-. One important modeling decision is the arity of the constraints used. Constraints can be either binary over pairs of variables, or non-binary over three or more variables. Although a problem may be ... |

90 | On the Conversion Between Non-Binary and Binary Constraint Satisfaction Problems
- Bacchus, Beek
- 1998
(Show Context)
Citation Context ...rsity of Waterloo Ontario, Canada vanbeek@uwaterloo.ca Toby Walsh Department of Computer Science University of York York, England tw@cs.york.ac.uk ¡ This paper includes results that first appeared in=-= [1, 4, 23]-=-. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program. 1sAbstract There are two well known ... |

74 |
Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisficing assignment problems
- Gaschnig
- 1978
(Show Context)
Citation Context |

72 | Domain filtering consistencies - Debruyne, Bessiere |

70 |
On reading sketch maps
- Mackworth
- 1977
(Show Context)
Citation Context ...search algorithms that maintain a local consistency property at each node in their search tree. Various types of local consistency have been defined, and algorithms developed for enforcing them (e.g, =-=[5, 13, 14]-=-). Algorithms that maintain a local consistency property during backtracking search (e.g., [8, 10, 15, 16, 20]) can detect dead-ends sooner and thus have the potential of significantly reducing the si... |

64 |
Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
- McGregor
- 1979
(Show Context)
Citation Context |

47 |
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens
- Nadel
- 1990
(Show Context)
Citation Context ...ys of modeling a problem as a CSP. Each model might contain a different set of variables, domains, and constraints. The choice of model can have a large impact on the time it takes to find a solution =-=[3, 17, 21]-=-, and various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints [9, 22, 25], adding hidden variables [6, 24], aggregating or grouping variables toge... |

46 | Compiling constraint satisfaction problems
- Weigel, Faltings
- 1999
(Show Context)
Citation Context ...aints [9, 22, 25], adding hidden variables [6, 24], aggregating or grouping variables together [3, 7], and transforming a CSP model into an equivalent representation over a different set of variables =-=[7, 11, 19, 26]-=-. One important modeling decision is the arity of the constraints used. Constraints can be either binary over pairs of variables, or non-binary over three or more variables. Although a problem may be ... |

45 | Encodings of non-binary constraint satisfaction problems
- Stergiou, Walsh
- 1999
(Show Context)
Citation Context ...rsity of Waterloo Ontario, Canada vanbeek@uwaterloo.ca Toby Walsh Department of Computer Science University of York York, England tw@cs.york.ac.uk ¡ This paper includes results that first appeared in=-= [1, 4, 23]-=-. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program. 1sAbstract There are two well known ... |

42 | The progressive party problem: Integer linear programming and constraint programming compared
- Smith, Brailsford, et al.
- 1996
(Show Context)
Citation Context ...of model can have a large impact on the time it takes to find a solution [3, 17, 21], and various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints =-=[9, 22, 25]-=-, adding hidden variables [6, 24], aggregating or grouping variables together [3, 7], and transforming a CSP model into an equivalent representation over a different set of variables [7, 11, 19, 26]. ... |

33 |
On the expressiveness of networks with hidden variables
- Dechter
(Show Context)
Citation Context ...he time it takes to find a solution [3, 17, 21], and various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints [9, 22, 25], adding hidden variables =-=[6, 24]-=-, aggregating or grouping variables together [3, 7], and transforming a CSP model into an equivalent representation over a different set of variables [7, 11, 19, 26]. One important modeling decision i... |

32 |
Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
- Jégou
- 1993
(Show Context)
Citation Context ...aints [9, 22, 25], adding hidden variables [6, 24], aggregating or grouping variables together [3, 7], and transforming a CSP model into an equivalent representation over a different set of variables =-=[7, 11, 19, 26]-=-. One important modeling decision is the arity of the constraints used. Constraints can be either binary over pairs of variables, or non-binary over three or more variables. Although a problem may be ... |

19 | Effective Redundant Constraints for Online Scheduling
- Getoor, Ottosson, et al.
- 1997
(Show Context)
Citation Context ...of model can have a large impact on the time it takes to find a solution [3, 17, 21], and various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints =-=[9, 22, 25]-=-, adding hidden variables [6, 24], aggregating or grouping variables together [3, 7], and transforming a CSP model into an equivalent representation over a different set of variables [7, 11, 19, 26]. ... |

16 |
A Theoretical Comparison of Selected CSP Solving and Modeling Techniques
- Chen
- 2000
(Show Context)
Citation Context ...rsity of Waterloo Ontario, Canada vanbeek@uwaterloo.ca Toby Walsh Department of Computer Science University of York York, England tw@cs.york.ac.uk ¡ This paper includes results that first appeared in=-= [1, 4, 23]-=-. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program. 1sAbstract There are two well known ... |

12 | Formulation Selection for Constraint Satisfaction Problems: A Heuristic Approach
- Borrett
- 1998
(Show Context)
Citation Context ...ys of modeling a problem as a CSP. Each model might contain a different set of variables, domains, and constraints. The choice of model can have a large impact on the time it takes to find a solution =-=[3, 17, 21]-=-, and various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints [9, 22, 25], adding hidden variables [6, 24], aggregating or grouping variables toge... |

7 |
Standard Models for Finite Domain Constraint Solving
- Simonis
- 1996
(Show Context)
Citation Context ...ys of modeling a problem as a CSP. Each model might contain a different set of variables, domains, and constraints. The choice of model can have a large impact on the time it takes to find a solution =-=[3, 17, 21]-=-, and various modeling techniques have been developed, including adding redundant and symmetry-breaking constraints [9, 22, 25], adding hidden variables [6, 24], aggregating or grouping variables toge... |