Stable Models and Circumscription (2011)
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming and, unlike the original definition, refers neither to grounding nor to fixpoints. It is based on a syntactic transformation similar to parallel circumscription.
Artificial Intelligence, Vol. 175 (2011), pp. 236--263.

Paolo Ferraris Ph.D. Alumni pieffe8 [at] gmail com
Joohyung Lee Ph.D. Alumni joolee [at] asu edu
Vladimir Lifschitz Faculty vl [at] cs utexas edu