Modular lazy search for Constraint Satisfaction Problems

Journal of Functional Programming

Volumn 11, Issue 5, 2001, Pages 557-587

  Nordin, Thomas ^a   Tolmach, Andrew ^a  

^a PORTLAND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035645464     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796801004051     Document Type: Article

References (27)

1. Bacchus, F. and Grove, A. (1995) On the forward checking algorithm. Proc. Principles and Practice of Constraint Programming, pp. 293-309.
2. Bacchus, F. and van Run, P. (1995) Dynamic variable ordering in CSPs. Proc. Principles and Practice of Constraint Programming, pp. 258-275.
3. Bird, R. and Wadler, P. (1988) Introduction to Functional Programming. Prentice Hall.
4. Caldwell, J. L., Gent, I. P. and Underwood, J. (1997) Search algorithms in type theory. Theoretical Computer Science. (To appear in Special Issue on Proof Search in Type-theoretic Languages).
5. de Moor, O. (1995) A generic program for sequential decision processes. Proc. Programming Language Implmenetation and Logic Programming, pp. 1-23.
6. Dent, M. J. and Mercer, R. (1994) Minimal forward checking. Proc. of the Int. Conference on Tools with Artificial Intelligence, pp. 432-438. IEEE Computer Society, New Orleans, LA.
7. Frost, D. H. (1997) Algorithms and Heuristics for Constraint Satisfaction Problems. PhD thesis, University of California at Irvine.
8. Gaschnig, J. (1977) A general backtracking algorithm that eliminates most redundant tests. Proc. International Joint Conference on Artificial Intelligence, p. 457.
9. Gill, A., Launchbury, J. and Jones, S. P. (1993) A short-cut to deforestation. Proc. Functional Programming and Computer Architecture, pp. 223-232.
10. Ginsberg, M. L. (1993) Dynamic backtracking. J. Artif. Intell. Res. 1, 25-46.
11. Hughes, J. (1989) Why functional programming matters. Computer J. 32(2), 98-107.
12. Kempe, A. B. (1879) On the geographical problem of the four colours. Am. J. Math. 2, 193-201.
13. King, D. and Launchbury, J. (1995) Structuring depth first search algorithms in Haskell. Proc. ACM Principles of Programming Languages, pp. 344-354.
14. Knuth, D. E. (1994) The Stanford Graph Base. Addison Wesley. (Graph data available from ftp://labrea.stanford.edu/pub/sgb/.).
15. Kondrak, G. (1994) A Theoretical Evaluation of Selected Backtracking Algorithms. M.Phil. thesis, University of Alberta.
16. Kumar, V. (1992) Algorithms for constraint satisfaction problems: A survey. AI Magazine, 13(1), 32-44.
17. Marriott, K. and Stuckey, P. (1998) Programming with Constraints: an Introduction. MIT Press.
18. Nadel, B. A. (1990) Representation selection for constraint satisfaction: A case study using n-queens. IEEE Expert, 5(3), 16-23.
19. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
20. Pepper, P. and Smith, D. R. (1996) A high-level derivation of global search algorithms (with constraint propagation). Science of Computer Programming, 28, 247-271.
21. Peyton Jones, S. and Hughes, J. (eds.) (1999) Report on the Programming Language Haskell 98: A Non-strict, Purely Functional Language. (Available at http://www.haskell.org/definition/.).
22. Prosser, P. (1993a) Domain filtering can degrade intelligent backtracking search. Proc. International Joint Conference on Artificial Intellience, pp. 262-267.
23. Prosser, P. (1993b) Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3), 268-299.
24. Schiex, T., Regin, J. C., Gaspin, C. and Verfaillie, G. (1996) Lazy arc consistency. Proc. of AAAI, pp. 216-221.
25. Stergiou, K. and Walsh, T. (1999) Encodings of non-binary constraint satisfaction problems. Proc. 16th National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence (AAAI-99), pp. 163-168.
26. Tsang, E. (1993) Foundations of Constraint Satisfaction. Academic Press Limited.
27. Van Hentenryck, P. (1999) The OPL Optimization Programming Language. MIT Press.