V. Lifschitz, "Answer set programming and plan generation," Artificial Intelligence, Vol. 138, 2002, pp. 39-54.
The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver such as SMODELS or DLV to find the answer set to the progrm.
This paper can serve as an introudction to answer set programming (ASP).
Unfortunately the paper starts with formal definitions that are a bit tiresome to follow. If you haven't encountered ASP before, I suggest starting with the example in section 4.
For a high level explanation of ASP, read this.
Posted to Logic/Declerative by Ehud Lamm on 2/16/03; 2:18:35 AM