All,
All this talk about Mathematica and a reference to monadic treatments of
backtracking reminded me that a year ago i was involved in work on a
Mathematica-like widget. At the time i noticed that a good deal of the
structure underlying LP, SAT and other solvers was terribly reminiscent of
On Thu, May 31, 2007 at 10:42:57AM -0700, Greg Meredith wrote:
All,
All this talk about Mathematica and a reference to monadic treatments of
backtracking reminded me that a year ago i was involved in work on a
Mathematica-like widget. At the time i noticed that a good deal of the
structure
At Thu, 31 May 2007 10:42:57 -0700,
Greg Meredith wrote:
BTW, i think this could have a lot of bang-for-buck because the literature i
read exhibited two basic features:
- the standard treatments (even by CS-types) are decidedly not
compositional
- the people in the field who face
At Thu, 31 May 2007 11:36:55 -0700,
Jeremy Shaw wrote:
This paper describes a non-monadic, compositional method for solving CSPs:
http://www.cse.ogi.edu/PacSoft/publications/2001/modular_lazy_search_jfp.pdf
btw, there are multiple versions of this paper. This version includes
a section on
