This paper is about the functionality of software systems used in answer set programming (ASP). ASP languages are viewed here, in the spirit of Datalog, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach to the semantics of ASP programs is based on the concept of a stable model defined in terms of a modification of parallel circumscription.

PDF

In de Moor, O.; Gottlob, G.; Furche, T.; Sellers, A., editors, Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK, March 16-19, 2010. Revised Selected Papers, 2011. Springer.

@incollection{Lifschitz:datalog2010, title={Datalog Programs and Their Stable Models}, author={Vladimir Lifschitz}, booktitle={Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK, March 16-19, 2010. Revised Selected Papers}, editor={de Moor, O.; Gottlob, G.; Furche, T.; Sellers, A.}, publisher={Springer}, url="http://www.cs.utexas.edu/users/ai-lab/?Lifschitz:datalog2010", year={2011} }