User loginNavigation |
Monadic Constraint Programming
Monadic Constraint Programming by Tom Schrijvers, Peter Stuckey and Philip Wadler.
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 where 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. By Greg Buchholz at 2009-06-03 22:27 | LtU Forum | previous forum topic | next forum topic | other blogs | 7117 reads
|
Browse archivesActive forum topics |
Recent comments
6 weeks 6 days ago
7 weeks 1 day ago
7 weeks 2 days ago
14 weeks 2 days ago
20 weeks 14 hours ago
20 weeks 1 day ago
21 weeks 15 hours ago
23 weeks 5 days ago
25 weeks 1 day ago
25 weeks 2 days ago