CS 395T: Answer Set Programming

Instructor:

Vladimir Lifschitz

Homepage:

cs.utexas.edu/users/vl/teaching/asp.html

Description

We will study a new style of declarative programming, which is similar to logic programming except that it represents solutions to a problem by answer sets instead of answer substitutions. Instead of Prolog, answer set programming uses "answer set solvers" -- software systems capable of computing answer sets. It has been applied to combinatorial problems and to some problems in AI, such as planning and product configuration. There are no textbooks on answer set programming. The theory of answer sets will be presented in a series of handouts. The use of answer set solvers is explained in on-line manuals. In the theoretical part of the course, students will be expected to present their solutions to homework problems at the board and to participate in the discussion of the solutions presented by others.

Prerequisites

CS 388L or equivalent