View source for Answer Set Programming (ASP) Language

An [[Answer Set Programming (ASP) Language]] is a [[(declarative) logic programming language]] that is based on the [[stable model semantics|stable model]] (answer set) semantics of [[logic programming]].
* <B>AKA:</B> [[Answer Set Programming (ASP) Language|Answer Set Language]].
* <B>Context</U>:</B>
** It can be used to create an [[Answer Set (ASP) Program]].
** …
* <B>Example(s):</B>
** a [[DLV Programming Language]].
** [[AnsProlog]].
** …
* <B>Counter-Example(s):</B>
** a [[Prolog Programming Language]].
** [[LISP Language]].
* <B>See:</B> [[Answer Set]], [[Automated Planning and Scheduling]].

----
----

== References ==

=== 2017 ===
* (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/answer_set_programming Retrieved:2017-10-7.
** '''Answer set programming''' ('''ASP''') is a form of [[declarative programming]] oriented towards difficult (primarily [[NP-hard]]) [[search algorithm|search problems]]. It is based on the [[stable model semantics|stable model]] (answer set) semantics of [[logic programming]]. In ASP, search problems are reduced to computing stable models, and ''answer set solvers'' — programs for generating stable models — are used to perform search. The computational process employed in the design of many answer set solvers is an enhancement of the [[DPLL algorithm]] and, in principle, it always terminates (unlike [[Prolog]] query evaluation, which may lead to an [[infinite loop]]).         <P>        In a more general sense, ASP includes all applications of answer sets to [[knowledge representation]]  <ref> [http://www.depts.ttu.edu/cs/research/krlab/pdfs/papers/gel07b.pdf as PDF] </ref> and the use of Prolog-style query evaluation for solving problems arising in these applications.

=== 2017 ===
* (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/answer_set_programming#History Retrieved:2017-10-7.
** The [[Automated planning and scheduling|planning]] method proposed in 1993 by Dimopoulos, Nebel and Köhler <ref> [ftp://ftp.informatik.uni-freiburg.de/documents/papers/ki/dimopoulos-etal-ecp97.ps.gz as Postscript] </ref> is an early example of answer set programming. Their approach is based on the relationship between plans and stable models. <ref> [http://www.cs.ucla.edu/%7Ezaniolo/papers/iclp95.ps as Postscript] </ref> Soininen and Niemelä  applied what is now known as answer set programming to the problem of product configuration. The use of answer set solvers for search was identified as a new programming paradigm by [[Victor W. Marek|Marek]] and Truszczyński in a paper that appeared in a 25-year perspective on the logic programming paradigm published in 1999  and in [Niemelä 1999].  Indeed, the new terminology of "answer set" instead of "stable model" was first proposed by Lifschitz <ref> In </ref> in a paper appearing in the same retrospective volume as the Marek-Truszczynski paper.
<references/>

=== 2011 ===
* ([[2011_AnswerSetProgrammingataGlance|Brewka et al., 2011]]) ⇒ [[Gerhard Brewka]], [[Thomas Eiter]], and [[Mirosław Truszczyński]]. ([[2011]]). “[http://people.scs.carleton.ca/~bertossi/KR11/material/communications201112ASP.pdf Answer Set Programming at a Glance].” In: [[Communications of the ACM Journal]], 54(12). [http://dx.doi.org/10.1145/2043174.2043195 doi:10.1145/2043174.2043195] 
** QUOTE: The motivation and key [[concept]]s behind [[Answer Set Programming (ASP) Language|answer set programming]] --- a promising approach to [[declarative problem solving]]. </s>

=== 2008 ===
* ([[Lifschitz, 2008]]) ⇒ [[Vladimir Lifschitz]]. ([[2008]]). “What Is Answer Set Programming?. ” In: AAAI, vol. 8, no . 2008, pp. 1594-1597. </s>
** QUOTE: [[Answer set programming (ASP)]] is a form of [[declarative programming]] oriented towards [[difficult search problem]]s. As an outgrowth of research on the use of [[nonmonotonic reasoning]] in [[knowledge representation]], it is particularly useful in [[knowledge-intensive application]]s. [[ASP program]]s consist of rules that look like [[Prolog rule]]s, 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]].

----

__NOTOC__
[[Category:Concept]]