• search hit 9 of 1102
Back to Result List

Answer set planning

  • 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.

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Son Cao TranORCiD, Enrico PontelliORCiDGND, Marcello BalducciniORCiDGND, Torsten SchaubORCiDGND
DOI:https://doi.org/10.1017/S1471068422000072
ISSN:1471-0684
ISSN:1475-3081
Title of parent work (English):Theory and practice of logic programming
Subtitle (English):a survey
Publisher:Cambridge University Press
Place of publishing:New York
Publication type:Article
Language:English
Date of first publication:2022/04/01
Publication year:2022
Release date:2024/01/29
Tag:knowledge representation and reasoning; logic programming; planning
Article number:PII S1471068422000072
Number of pages:73
Funding institution:NSF [1914635, 1833630, 1757207, 1812628]; DFG, Germany [SCHA 550/15];; NIST [70NANB21H167]
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
DDC classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke
Peer review:Referiert
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.