In this talk, I would like to share my experiences gained from participating in four CSP solver competitions and the second ASP solver competition. In particular, I’ll talk about how various programming techniques can make huge differences in solving some of the benchmark problems used in the competitions. These techniques include global constraints, table constraints, and problem-specific propagators and labeling strategies for selecting variables and values. I’ll present these techniques with experimental results from B-Prolog and other CLP(FD) systems.
| Identifer | oai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:4143 |
| Date | January 2010 |
| Creators | Zhou, Neng-Fa |
| 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. 17 - 34 |
| Rights | http://opus.kobv.de/ubp/doku/urheberrecht.php |
Page generated in 0.0022 seconds