Answer set programming (ASP) is a form of declarative logic programming oriented towards difficult combinatorial search problems. ASP has been applied, for instance, to developing a decision support system for the Space Shuttle and to graph-theoretic problems arising in zoology and linguistics. This paper is about the design of provably correct ASP programs and about the mathematical theory it is based on. Our description of ASP may be useful as a complement to the monograph by Chitta Baral (2003) and to the manuals on the software systems smodels and dlv.

PDF, PS

In We Will Show Them! Essays in Honour of Dov Gabbay, pp. 615-664 2005. King's College Publications.

@INCOLLECTION{fer05e, title={Mathematical Foundations of Answer Set Programming}, author={Paolo Ferraris and Vladimir Lifschitz}, booktitle={We Will Show Them! Essays in Honour of Dov Gabbay}, publisher={King's College Publications}, pages={615-664}, url="http://www.cs.utexas.edu/users/ai-lab?fer05e", year={2005} }