Answer Set Planning: A Survey

IF 1.4 2区数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Theory and Practice of Logic Programming Pub Date : 2022-02-11 DOI:10.1017/s1471068422000072

Tran Cao Son, Enrico Pontelli, M. Balduccini, Torsten Schaub

引用次数: 4

Abstract

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.

查看原文本刊更多论文

答案集计划:一项调查

答案集计划是指使用答案集编程(ASP)来计算计划，即计划问题的解决方案，将给定的世界状态转换为另一种状态。高效且可扩展的答案集求解器的开发极大地促进了基于asp的规划系统的开发。本文调查了过去25年答题集规划领域的进展，从它的基础到它在具有挑战性的规划领域的应用。该调查探讨了答案集规划的优点和缺点。它还讨论了答案集规划的典型应用，并提出了未来研究的一系列挑战。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Theory and Practice of Logic Programming 工程技术-计算机：理论方法

CiteScore

4.50

自引率

21.40%

发文量

审稿时长

>12 weeks

期刊介绍： Theory and Practice of Logic Programming emphasises both the theory and practice of logic programming. Logic programming applies to all areas of artificial intelligence and computer science and is fundamental to them. Among the topics covered are AI applications that use logic programming, logic programming methodologies, specification, analysis and verification of systems, inductive logic programming, multi-relational data mining, natural language processing, knowledge representation, non-monotonic reasoning, semantic web reasoning, databases, implementations and architectures and constraint logic programming.