Bibliography

Bacchus, Chen, van Beek, WalshBacchus et al.2002

Bacchus, F., Chen, X., van Beek, P., Walsh, T. 2002.
Binary vs. Non-binary CSPs
Artificial Intelligence, 140, 1-37.

Bacchus van BeekBacchus van Beek1998

Bacchus, F. van Beek, P. 1998.
On the Conversion between Non-binary and Binary Constraint Satisfaction Problems
In Proceedings of AAAI'98, 310-318.

BaterBater2000

Bater, J. 2000.
Non-binary (Higher-Order) Modelling and Solution Techniques for Frequency Assignment in Mobile Communications Networks.
Ph.D. thesis, University of London.

Beacham, Chen, Sillito, van BeekBeacham et al.2001

Beacham, A., Chen, X., Sillito, J., van Beek, P. 2001.
Constraint programming lessons learned from crossword puzzles
In Proceedings of the 14th Canadian Conference in AI.

Bessière, Freuder, RéginBessière et al.1995

Bessière, C., Freuder, E., Régin, J. 1995.
Using Inference to Reduce Arc Consistency Computation
In Proceedings of IJCAI'95, 592-599.

Bessière, Meseguer, Freuder, LarrosaBessière et al.2002

Bessière, C., Meseguer, P., Freuder, E., Larrosa, J. 2002.
On Forward Checking for Non-binary Constraint Satisfaction
Artificial Intelligence, 141, 205-224.

Bessière RéginBessière Régin1996a

Bessière, C. Régin, J. 1996a.
Arc Consistency for General Constraint Networks: Preliminary Results
In Proceedings of IJCAI'97, 398-404.

Bessière RéginBessière Régin1996b

Bessière, C. Régin, J. 1996b.
MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems
In Proceedings of CP'96, 61-75.

Bessière RéginBessière Régin2001

Bessière, C. Régin, J. 2001.
Refining the Basic Constraint Propagation Algorithm
In Proceedings of IJCAI'2001, 309-315.

Cabon, De Givry, Lobjois, Schiex, WarnersCabon et al.1999

Cabon, B., De Givry, S., Lobjois, L., Schiex, T., Warners, J. 1999.
Radio Link Frequency Assignment
Constraints, 4, 79-89.

CLibCLib2005

CLib 2005.
Configuration Benchmarks Library (http://www.itu.dk/doi/VeCoS/clib/), Maintained by VeCoS group, IT-University of Copenhagen.

Debruyne BessièreDebruyne Bessière2001

Debruyne, R. Bessière, C. 2001.
Domain Filtering Consistencies
Journal of Artificial Intelligence Research, 14, 205-230.

Dechter PearlDechter Pearl1989

Dechter, R. Pearl, J. 1989.
Tree Clustering for Constraint Networks
Artificial Intelligence, 38, 353-366.

Ginsberg, Frank, Halpin, TorranceGinsberg et al.1990

Ginsberg, M., Frank, M., Halpin, M., Torrance, M. 1990.
Search Lessons Learned from Crossword Puzzles
In Proceedings of AAAI-90, 210-215.

Haralick ElliotHaralick Elliot1980

Haralick, R. Elliot, G. 1980.
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
Artificial Intelligence, 14, 263-313.

Hodge, Hurley, SmithHodge et al.2002

Hodge, L., Hurley, S., Smith, D. 2002.
Higher-Order Constraint Techniques for the Frequency Assignment Problem
, University of Cardiff.

Jeavons, Dunkin, BaterJeavons et al.1998

Jeavons, P., Dunkin, N., Bater, J. 1998.
Why Higher Order Constraints are Necessary to Model Frequency Assignment Problems
In ECAI'98 Workshop on Non-binary constraints.

MackworthMackworth1977

Mackworth, A. 1977.
Consistency in Networks of Relations
Artificial Intelligence, 99-118.

Mamoulis StergiouMamoulis Stergiou2001

Mamoulis, N. Stergiou, K. 2001.
Solving Non-Binary CSPs using the Hidden Variable Encoding
In Proceedings of CP-2001, 168-182.

Mohr HendersonMohr Henderson1986

Mohr, R. Henderson, T. 1986.
Arc and Path Consistency Revisited
Artificial Intelligence, 28, 225-233.

Mohr MasiniMohr Masini1988

Mohr, R. Masini, G. 1988.
Good Old Discrete Relaxation
In Proceedings of ECAI-88, 651-656.

PeircePeirce1933

Peirce, C. 1933
Collected Papers Vol. III.
Cited in F. Rossi, C. Petrie, and V. Dhar 1989.

Prosser, Stergiou, WalshProsser et al.2000

Prosser, P., Stergiou, K., Walsh, T. 2000.
Singleton Consistencies
In Proceedings of CP-2000, 353-368.

RéginRégin1994

Régin, J. 1994.
A Filtering Algorithm for Constraints of Difference in CSPs
In Proceedings of AAAI-94, 362-367.

Rossi, Petrie, DharRossi et al.1990

Rossi, F., Petrie, C., Dhar, V. 1990.
On the Equivalence of Constraint Satisfaction Problems
In Proceedings of ECAI-90, 550-556.

SmithSmith2002

Smith, B. 2002.
A Dual Graph Translation of a Problem in `Life'
In Proceedings of CP-02, 402-414.

Smith, Stergiou, WalshSmith et al.2000

Smith, B., Stergiou, K., Walsh, T. 2000.
Using Auxiliary Variables and Implied Constraints to Model Non-binary Problems
In Proceedings of AAAI'2000, 182-187.

Stergiou WalshStergiou Walsh1999

Stergiou, K. Walsh, T. 1999.
Encodings of Non-Binary Constraint Satisfaction Problems
In Proceedings of AAAI'99, 163-168.

Subbarayan, Jensen, Hadzic, Andersen, Hulgaard, MollerSubbarayan et al.2004

Subbarayan, S., Jensen, R., Hadzic, T., Andersen, H., Hulgaard, H., Moller, J. 2004.
Comparing two Implementations of a Complete and Backtrack-Free Interactive Configurator
In Proceedings of the CP-04 Workshop on CSP Techniques with Immediate Application, 97-111.

Van HentenryckVan Hentenryck1989

Van Hentenryck, P.. 1989.
Constraint Satisfaction in Logic Programming.
MIT Press.

Van Hentenryck, Deville, TengVan Hentenryck et al.1992

Van Hentenryck, P., Deville, Y., Teng, C. 1992.
A Generic Arc Consistency Algorithm and its Specializations
Artificial Intelligence, 57, 291-321.

Watkins, Hurley, SmithWatkins et al.1998

Watkins, W., Hurley, S., Smith, D. 1998.
Area Coverage Frequency Assignment: Evaluation of Models for Area Coverage
, University of Glamorgan.
Also presented in INFORMS-98.

Zhang YapZhang Yap2001

Zhang, Y. Yap, R. 2001.
Making AC-3 an Optimal Algorithm
In Proceedings of IJCAI'2001, 316-321.