extradoc / soc-2006 / constraints.txt

Specialized propagators for specialized finite domains
======================================================

Concerns WP09 (concurrent constraint & logic programming workpackage).

We need specialized propagators for specialized finite domains (over
numbers, sets, intervals, etc.). There are two ways to provide them :

* rPython : which means implementing it entirely at intepreter level
  in a strict subset of Python,

* wrapping Gecode[1] : first finish the c-wrapper around Gecode
  (unless interfacing PyPy with C++ becomes available), then use
  rctypes to provide interpreter access to low-level Gecode
  functionality, and finally integrate it into the existing
  interpreter-level constraint solver.

Rctypes is what PyPy offers, using the python ctypes API, to interface
the interpreter with C code.

One reasonable target could be running the simple send-more-money
problem with very few actual search steps due to the efficient
propagation happening on integer finite domains.


[1] http://www.gecode.org/
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.