|
Courses and Workshops
|
| Title: | Answer set programming |
| Lecturer(s): | Vladimir Lifschitz (University of Texas) |
| Type: | Introductory Course |
| Section: | Logic and Computation |
| Week: | First | | Time: | 11.00-12.30 (Slot 2) |
| Webpage: | http://www.cs.utexas.edu/users/vl
|
| Reader: | Download | | Room: | A2 |
Description Answer Set Programming (ASP) is a new methodology for solving
combinatorial search problems. It is a form of declarative programming
related to logic programming languages, such as Prolog, and to
propositional satisfiability solvers, such as Chaff.
This course is an elementary but mathematically solid introduction to
ASP. It covers the theory of answer sets (stable models), the
methodology of writing ASP programs and proving their correctness, and
the design and use of the ASP engines Smodels and Cmodels.
|
© 2003, 2004 LORIA, Carlos Areces. |
2004-06-08
| |
