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