Answer Set Programming (ASP) Language: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "lems]]" to "lem]]s") |
m (Text replacement - "]] " to "]] ") |
||
| Line 20: | Line 20: | ||
=== 2017 === | === 2017 === | ||
* (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/answer_set_programming Retrieved:2017-10-7. | * (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 problem]]s. 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]] | ** '''Answer set programming''' ('''ASP''') is a form of [[declarative programming]] oriented towards difficult (primarily [[NP-hard]]) [[search algorithm|search problem]]s. 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 === | === 2017 === | ||
Latest revision as of 02:38, 4 November 2024
An Answer Set Programming (ASP) Language is a (declarative) logic programming language that is based on the stable model (answer set) semantics of logic programming.
- AKA: Answer Set Language.
- Context:
- It can be used to create an Answer Set (ASP) Program.
- …
- Example(s):
- Counter-Example(s):
- See: 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 problems. It is based on the 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).
In a more general sense, ASP includes all applications of answer sets to knowledge representation [1] and the use of Prolog-style query evaluation for solving problems arising in these applications.
- Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the 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).
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/answer_set_programming#History Retrieved:2017-10-7.
- The planning method proposed in 1993 by Dimopoulos, Nebel and Köhler [2] is an early example of answer set programming. Their approach is based on the relationship between plans and stable models. [3] 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 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 in a paper appearing in the same retrospective volume as the Marek-Truszczynski paper.
2011
- (Brewka et al., 2011) ⇒ Gerhard Brewka, Thomas Eiter, and Mirosław Truszczyński. (2011). “Answer Set Programming at a Glance.” In: Communications of the ACM Journal, 54(12). doi:10.1145/2043174.2043195
- QUOTE: The motivation and key concepts behind answer set programming --- a promising approach to declarative problem solving.
2008
- (Lifschitz, 2008) ⇒ Vladimir Lifschitz. (2008). “What Is Answer Set Programming?. ” In: AAAI, vol. 8, no . 2008, pp. 1594-1597.
- QUOTE: 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.