Answer Set Planning: A Survey

Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans , that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the developme...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory and practice of logic programming Ročník 23; číslo 1; s. 226 - 298
Hlavní autoři: CAO TRAN, SON, PONTELLI, ENRICO, BALDUCCINI, MARCELLO, SCHAUB, TORSTEN
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cambridge Cambridge University Press 01.01.2023
Témata:
Automation
Declarative programming
Knowledge
Logic programming
Mathematical programming
Planning
Semantics
ISSN:1471-0684, 1475-3081
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans , that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068422000072