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.
The Monadic Constraint Programming framework gives a monadic definition of constraint programming where the solver is defined as a monad threaded through the monadic search tree. Search and search strategies can then be defined as firstclass 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.
| Identifer | oai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:4141 |
| Date | January 2010 |
| Creators | Schrijvers, Tom |
| Contributors | Gesellschaft für Logische Programmierung e.V. |
| Publisher | Universität Potsdam, Extern. Extern |
| Source Sets | Potsdam University |
| Language | English |
| Detected Language | English |
| Type | InProceedings |
| Format | application/pdf |
| Source | Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 1 - 15 |
| Rights | http://opus.kobv.de/ubp/doku/urheberrecht.php |
Page generated in 0.0021 seconds