Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00355415" target="_blank" >RIV/68407700:21230/22:00355415 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-030-94479-7_4" target="_blank" >https://doi.org/10.1007/978-3-030-94479-7_4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-94479-7_4" target="_blank" >10.1007/978-3-030-94479-7_4</a>
Alternative languages
Result language
angličtina
Original language name
Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers
Original language description
In the field of automated planning, an action is called reversible when other actions can be applied in order to revert the effects of this action and return to the original state. In recent years, there has been renewed interest in this topic, which led to novel results in the widely known STRIPS formalism and the PDDL planning language. In this paper, we aim to solve the computational problem of deciding action reversibility in a practical setting, applying recent advances in the field of logic programming. In particular, a quantified extension of Answer Set Programming (ASP) named ASP with Quantifiers (ASP(Q)) has been proposed by Amendola, Ricca, and Truszczynski, which allows for stacking logic programs by quantifying over answer sets of the previous layer. This language is well-suited to express encodings for the action reversibility problem, since this problem naturally contains a quantifier alternation. In addition, a prototype solver for ASP(Q) is currently developed. We make use of the ASP(Q) language to offer an encoding for action reversibility, and then report on preliminary benchmark results on how well this encoding performs compared to classical ASP.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-030-94478-0
ISSN
0302-9743
e-ISSN
—
Number of pages
15
Pages from-to
42-56
Publisher name
Springer Science and Business Media Deutschland GmbH
Place of publication
—
Event location
Philadelphia
Event date
Jan 16, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—