Answer Set Planning: A Survey

被引:7
作者
Tran, Son Cao [1 ]
Pontelli, Enrico [1 ]
Balduccini, Marcello [2 ]
Schaub, Torsten [3 ]
机构
[1] New Mexico State Univ, Dept Comp Sci, Las Cruces, NM 88003 USA
[2] St Josephs Univ, Dept Decis & Syst Sci, Philadelphia, PA 19131 USA
[3] Univ Potsdam, Dept Comp Sci, Potsdam, Germany
基金
美国国家科学基金会;
关键词
planning; knowledge representation and reasoning; logic programming; WELL-FOUNDED SEMANTICS; DECENTRALIZED CONTROL; SENSING ACTIONS; STABLE MODEL; LOGIC; COMPLEXITY; SYSTEMS; SATISFIABILITY; PREFERENCES; DIAGNOSIS;
D O I
10.1017/S1471068422000072
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:226 / 298
页数:73
相关论文
共 281 条
  • [21] Balduccini M., 2013, THEOR PRACT LOG PROG, V13, P4
  • [22] Balduccini M., 2009, P 2 WORKSH ANSW SET, P16
  • [23] CASP solutions for planning in hybrid domains
    Balduccini, Marcello
    Magazzeni, Daniele
    Maratea, Marco
    Leblanc, Emily C.
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2017, 17 (04) : 591 - 633
  • [24] Constraint answer set solver EZCSP and why integration schemas matter
    Balduccini, Marcello
    Lierler, Yuliya
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2017, 17 (04) : 462 - 515
  • [25] Balduccini M, 2011, LECT NOTES ARTIF INT, V6645, P284
  • [26] Clingcon: The next generation
    Banbara, Mutsunori
    Kaufmann, Benjamin
    Ostrowski, Max
    Schaub, Torsten
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2017, 17 (04) : 408 - 461
  • [27] Baral C, 2002, EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, P507
  • [28] Baral C, 2000, SPRINGER INT SER ENG, V597, P257
  • [29] Computational complexity of planning and approximate planning in the presence of incompleteness
    Baral, C
    Kreinovich, V
    Trejo, R
    [J]. ARTIFICIAL INTELLIGENCE, 2000, 122 (1-2) : 241 - 267
  • [30] Baral C., 2000, P 7 INT C PRINCIPLES, P311