TY  - JOUR
AU  - Schrijvers, T
AU  - Stuckey, P
AU  - Wadler, P
Y2  - 2014/05/21
Y1  - 2009/11/01
SN  - 0956-7968
UR  - http://hdl.handle.net/11343/29395
AB  - <jats:title>Abstract</jats:title><jats:p>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.</jats:p>
LA  - English
PB  - CAMBRIDGE UNIV PRESS
KW  - Computer Software
T1  - Monadic constraint programming
DO  - 10.1017/S0956796809990086
IS  - JOURNAL OF FUNCTIONAL PROGRAMMING
VL  - 19
IS  - 6
SP  - 663-697
L1  - /bitstream/handle/11343/29395/278103_134251.pdf?sequence=1&isAllowed=n
ER  -