Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CP
2001
Springer

favoriteEmaildiscussreport

78views Artificial Intelligence» more CP 2001»

GAC on Conjunctions of Constraints

13 years 10 months ago

GAC on Conjunctions of Constraints

Download www.cs.toronto.edu

Abstract. Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be useful to conjoin. The result is a useful automatic way of improving a CSP model for GAC solving.

George Katsirelos, Fahiem Bacchus

Real-time Traffic

Artificial Intelligence | CP 2001 | CSP Model | Powerful Pruning | Useful Automatic Way |

claim paper

Related Content

» SameRelation Constraints

» A Compression Algorithm for Large Arity Extensional Constraints

» GAC Via Unit Propagation

» Watched Literals for Constraint Propagation in Minion

» Inverse Consistencies for NonBinary Constraints

» Generalised arc consistency for the AllDifferent constraint An empirical survey

» Encoding Table Constraints in CLPFD Based on PairWise AC

» The extended global cardinality constraint An empirical survey

» SecondOrder Consistencies

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CP
Authors	George Katsirelos, Fahiem Bacchus

Comments (0)