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 an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started with the invention of formal nonmonotonic reasoning in 1980.

PS

Artificial Intelligence, Vol. 138 (2002), pp. 39-54.

@article{lif02, title={Answer Set Programming and Plan Generation}, author={Vladimir Lifschitz}, volume={138}, journal={Artificial Intelligence}, pages={39-54}, url="http://www.cs.utexas.edu/users/ai-lab?lif02", year={2002} }