Domain-heuristics for arc-consistency algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2627, Issue , 2003, Pages 62-75

  van Dongen, Marc R C ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY;

ARC-CONSISTENCY ALGORITHMS; AVERAGE NUMBERS; CONSISTENCY CHECKS; DIFFERENT DOMAINS; DOMAIN SIZE; SEARCH SPACES; TIME COMPLEXITY;

CONSTRAINT SATISFACTION PROBLEMS; HEURISTIC METHODS;

ARC-CONSISTENCY ALGORITHMS; CONSTRAINT SATISFACTION PROBLEMS (CSP); DOMAIN-HEURISTICS; TIME-COMPLEXITY;

EID: 3843152902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36607-5_5     Document Type: Conference Paper

References (13)

1. C. Bessière, E.C. Freuder, and J.-C. Régin. Using inference to reduce arc consistency computation. In C.S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI’95), volume 1, pages 592–598, Montréal, Québec, Canada, 1995. Morgan Kaufmann Publishers, Inc., San Mateo, California, USA.
2. C. Bessière and J.-C. Régin. Refining the basic constraint propagation algorithm. In Proceedings of the 17 International Joint Conference on Artificial Intelligence (IJCAI’2001), pages 309–315, 2001.
3. P. Flajolet and R. Sedgewick. The average case analysis of algorithms: Mellin transform asymptotics. Technical Report Research Report 2956, INRIA, 1996.
4. J. Gaschnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proceeding of the Second Biennial Conference, Canadian Society for the Computational Studies of Intelligence, pages 268–277, 1978.
5. I.P. Gent, E. MacIntyre, P. Prosser, P. Shaw, and T. Walsh. The constrainedness of arc consistency. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP’1997), pages 327–340. Springer, 1997.
6. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
7. A.K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25(1):65–73, 1985.
8. D. Sabin and E.C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In A.G. Cohn, editor, Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI’94), pages 125–129. JohnWiley & Sons, 1994.
9. M.R.C. van Dongen. Constraints, Varieties, and Algorithms. PhD thesis, Department of Computer Science, University College, Cork, Ireland, 2002.
10. d an efficient arc-consistency algorithm with a low spacecomplexity. Technical Report TR-01-2002, Cork Constraint Computation Centre, 2002.
11. d an efficient arc-consistency algorithm with a low spacecomplexity. In P. Van Hentenryck, editor, Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP’2002), pages 755–760. Springer, 2002.
12. M.R.C. van Dongen and J.A. Bowen. Improving arc-consistency algorithms with doublesupport checks. In Proceedings of the Eleventh Irish Conference on Artificial Intelligence and Cognitive Science (AICS’2000), pages 140–149, 2000.
13. R. J. Wallace and E.C. Freuder. Ordering heuristics for arc consistency algorithms. In AI/GI/VI ’92, pages 163–169, Vancouver, British Columbia, Canada, 1992.