This is a survey of the theory of logic programs with classical negation and negation as failure. The semantics of this class of programs is based on the notion of an answer set. The operation of Prolog is described in terms of proof search in the SLDNF calculus.
View:
PS
Citation:
In Principles of Knowledge Representation, Brewka, Gerhard (Eds.), pp. 69-128 1996. CSLI Publications.
Bibtex:

Vladimir Lifschitz Faculty vl [at] cs utexas edu