Answer set programming (ASP) is a form of declarative programming oriented towards difficult, primarily NP-hard search problems, based on the stable model (answer set) semantics of logic programming developed by Michael Gelfond and Vladimir Lifschitz. In ASP, search problems are reduced to computing stable models, and answer set solvers, programs for generating stable models, are used to perform search. Common solvers include clingo and DLV.
Facts
Partially Attested
First ReleasedThe term first appeared in 1999; an early example of the approach was proposed in 1997. ParadigmDeclarative programming, logic programming 1 SignificanceReduces hard search problems to computing stable models using answer set solvers. 1 Connections
Associated With
Answer set programming grew out of the stable-model semantics of logic programming that Prolog popularized.
Sources
1. Answer set programming - Wikipedia
History
In 1999, the term "answer set programming" appeared for the first time in a book The Logic Programming Paradigm.
Lead section
Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems.
Lead section, second paragraph
In ASP, search problems are reduced to computing stable models
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.