GAC on Conjunctions of Constraints
Applying GAC on conjunctions of constraints can lead to more powerful pruning . 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.
KeywordsSimple Heuristic Conjunctive Constraint Backtrack Search Algorithm Golomb Ruler Implied Constraint
Unable to display preview. Download preview PDF.
- 1.C. Bessiére and J.-C. Régin. Local consistency on conjunctions of constraints. In Proceedings of the ECAI’98 Workshop on Non-binary constraints, pages 53–59, Brighton, UK, 1998.Google Scholar
- 2.A. K. Mackworth. On reading sketch maps. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, pages 598–606, Cambridge, Mass., 1977.Google Scholar
- 3.J. Gaschnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proceedings of the Second Canadian Conference on Artificial Intelligence, pages 268–277, Toronto, Ont., 1978.Google Scholar
- 4.D. Sabin and E. C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of the 11th European Conference on Artificial Intelligence, pages 125–129, Amsterdam, 1994.Google Scholar
- 5.C. Bessière and J.-C. Régin. Arc consistency for general constraint networks: Preliminary results. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 398–404, Nagoya, Japan, 1997.Google Scholar
- 6.B. Smith, K. Stergiou, and T. Walsh. Using auxilliary variables and implied constraints to model non-binary problems. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, Austin, Texas, 2000.Google Scholar