Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic.

PDF

In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1594-1597 2008. MIT Press.

@inproceedings{lif08, title={What Is Answer Set Programming?}, author={Vladimir Lifschitz}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, publisher={ MIT Press}, pages={1594-1597}, url="http://www.cs.utexas.edu/users/ai-lab?lif08", year={2008} }