C[omp]ute

From: "andrew cooke" <andrew@...>

Date: Thu, 5 Feb 2004 12:06:04 -0300 (CLST)

This seems like a nice intro - Constraints are a declarative knowledge
representation formalism that allows for a compact and expressive modeling
of many real-life problems. Constraint satisfaction and propagation tools,
as well as constraint programming languages, are successfully used to
model, solve, and reason about many classes of problems, such as design,
diagnosis, scheduling, spatio-temporal reasoning, resource allocation,
configuration, network optimization, and graphical interfaces.
- http://www.ics.uci.edu/~dechter/publications/r85.html

And here's a lighter article that explains Satisfiability -
http://sjcomp.virtualave.net/files/compsci9703.html

The author of the second article looks to have written a pile of
interesting stuff - http://www.amsci.org/amsci/other/BPH.html (see loinks
at bottom of page).

From this list - http://www-course.cs.york.ac.uk/cop/links.html

Andrew

-- 
personal web site: http://www.acooke.org
personal mail list: http://www.acooke.org/andrew/compute.html

_______________________________________________
compute mailing list
compute@...
https://200.83.153.5/cgi-bin/mailman/listinfo/compute