[BOOK][B] Answer set programming
V Lifschitz - 2019 - cdn.aaai.org
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.
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.
Answer set programming and plan generation
V Lifschitz�- Artificial Intelligence, 2002 - Elsevier
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.
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.