Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers-Reference-Cited by-同舟云学术

Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers

Published:2022 Issue: Volume: Page:42-56
ISSN:0302-9743
Container-title:Practical Aspects of Declarative Languages
language:
Short-container-title:

Author:

Faber Wolfgang^ORCID,Morak Michael^ORCID,Chrpa Lukáš^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-94479-7_4

Reference24 articles.

1. Amendola, G., Ricca, F., Truszczynski, M.: Beyond NP: quantifying over answer sets. Theory Pract. Log. Program. 19(5–6), 705–721 (2019). https://doi.org/10.1017/S1471068419000140

2. Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011). https://doi.org/10.1145/2043174.2043195

3. Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1–2), 165–204 (1994). https://doi.org/10.1016/0004-3702(94)90081-7

4. Calimeri, F., et al.: Asp-core-2 input language format. Theory Pract. Log. Program. 20(2), 294–309 (2020). https://doi.org/10.1017/S1471068419000450

5. Camacho, A., Muise, C.J., McIlraith, S.A.: From FOND to robust probabilistic planning: computing compact policies that bypass avoidable deadends. In: Proceedings ICAPS, pp. 65–69 (2016). http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13188

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs;Theory and Practice of Logic Programming;2023-07

2. An Efficient Solver for ASP(Q);Theory and Practice of Logic Programming;2023-07

3. Proceedings 38th International Conference on Logic Programming;Electronic Proceedings in Theoretical Computer Science;2022-08-04