We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Monadic constraint programming.
- Authors
Schrijvers, Tom; Stuckey, Peter; Wadler, Philip
- Abstract
A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. In this paper we give a monadic definition of constraint programming in which the solver is defined as a monad threaded through the monadic search tree. We are then able to define search and search strategies as first-class objects that can themselves be built or extended by composable search transformers. Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible.
- Subjects
COMPUTER programming; SEARCH engines; ENGINE (Information retrieval system); DATA mining; COMPUTER systems; COMPUTER software
- Publication
Journal of Functional Programming, 2009, Vol 19, Issue 6, p663
- ISSN
0956-7968
- Publication type
Article
- DOI
10.1017/S0956796809990086