Ian Gent Computer Science Department University of St Andrews email:...  Home/Search
Context Related
| dcs.stand.ac.uk/~...apes141999.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.stand.ac.uk/~apes/2000 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we will abbreviate this to decomposable. For example, an all-different constraint is decomposable into a clique of binary not-equals constraints. As a second example, a monotonicity constraint is decomposable into a sequence of ordering constraints on pairs of variables. Not all non-binary constraints are decomposable into binary constraints on the same set of variables. For example, the parity constraint even(x 1 +x 2 +x 3 ) cannot be represented as a binary constraint satisfaction ... (Update)
Cited by: More
The alldifferent Constraint: A Survey - van Hoeve (2001) (Correct)
Constraint Propagation - Bessiere (2006) (Correct)
Permutation Problems and Channelling Constraints - Walsh (2001) (Correct)
Similar documents (at the sentence level): More
63.4%: Decomposable Constraints - Ian Gent Kostas (1999) (Correct)
62.1%: Artificial Intelligence 123 (2000) 133--156 - Decomposable Constraints Ian (Correct)
5.9%: Encodings of Non-Binary Constraint Satisfaction Problems - Stergiou (1999) (Correct)
Active bibliography (related documents): More All
0.1: Relational Consistencies - Walsh (2001) (Correct)
0.1: Tightness of Constraint Satisfaction Problems - Culberson, Walsh (2001) (Correct)
0.1: Modelling the Golomb Ruler Problem - Smith, Stergiou, Walsh (1999) (Correct)
Similar documents based on text: More All
0.4: Using Auxiliary Variables and Implied Constraints to.. - Smith, Stergiou, Walsh (2000) (Correct)
0.3: Random Constraint Satisfaction: Flaws and Structure - Gent, MacIntyre, Prosser.. (1998) (Correct)
0.3: Singleton Consistencies - Prosser, Stergiou, Walsh (2000) (Correct)
Related documents from co-citation: More All
6: Good old discrete relaxation (context) - Mohr, Masini - 1988
6: A generic arc-consistency algorithm and its specializations - Van Hentenryck, Deville et al. - 1992
6: On forward checking for non-binary constraint satisfaction (context) - Bessiere, Meseguer et al.
BibTeX entry: (Update)
I.P. Gent, K. Stergiou, and T. Walsh. Decomposable constraints. Artificial Intelligence, 123(12) :133--156, 2000. http://citeseer.ist.psu.edu/article/gent99decomposable.html More
@inproceedings{ gent99decomposable,
author = "Ian P. Gent and Kostas Stergiou and Toby Walsh",
title = "Decomposable Constraints",
booktitle = "New Trends in Constraints",
pages = "134-149",
year = "1999",
url = "citeseer.ist.psu.edu/article/gent99decomposable.html" }
Citations (may not include all citations):307 Networks of constraints: Fundamental properties and applicat.. (context) - Montanari - 1974
267 Network-based heuristics for constraintsatisfaction problems (context) - Dechter, Pearl - 1988
185 A sufficient condition for backtrack-free search (context) - Freuder - 1982
112 Performance measurement and analysis of certain search algor.. (context) - Gaschnig - 1979
87 A Theoretical Evaluation of Selected Backtracking Algorithms - Kondrak, van Beek - 1997
66 A sufficient condition for backtrack-bounded search (context) - Freuder - 1985
63 the conversion between non-binary and binary constraint sati.. - Bacchus, van Beek
56 Good old discrete relaxation (context) - Mohr, Masini
54 A generic arc-consistency algorithm and its specializations - van Hentenryck, Deville et al. - 1992
52 A filtering algorithm for constraints of difference in CSPs (context) - R'egin
44 On forward checking for non-binary constraint satisfaction (context) - Bessiere, Meseguer et al.
35 Some practicable filtering techniques for the constraint sat.. - Debruyne, Bessiere
33 Generalized arc consistency for global cardinality constrain.. (context) - R'egin
29 the expressiveness of networks with hidden variables (context) - Dechter
19 ere and J-C. R (context) - Bessi - 1996
16 Neighborhood inverse consistency preprocessing - Freuder, Elfe
16 The difference all-difference makes - Stergiou, Walsh
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dcs.st-and.ac.uk/~apes/2000.html): More
Parallel Heuristic Search in Haskell - Cope, Gent, Hammond (Correct)
Symmetry Breaking in Constraint Programming - Gent, Smith (2000) (Correct)
Using Auxiliary Variables and Implied Constraints to.. - Smith, Stergiou, Walsh (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC