Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00355407" target="_blank" >RIV/68407700:21230/21:00355407 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1017/S1471068421000429" target="_blank" >https://doi.org/10.1017/S1471068421000429</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1017/S1471068421000429" target="_blank" >10.1017/S1471068421000429</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming

Popis výsledku v původním jazyce

In the context of planning and reasoning about actions and change, we call an action reversible when its effects can be reverted by applying other actions, returning to the original state. Renewed interest in this area has led to several results in the context of the PDDL language, widely used for describing planning tasks. In this paper, we propose several solutions to the computational problem of deciding the reversibility of an action. In particular, we leverage an existing translation from PDDL to Answer Set Programming (ASP), and then use several different encodings to tackle the problem of action reversibility for the STRIPS fragment of PDDL. For these, we use ASP, as well as Epistemic Logic Programming (ELP), an extension of ASP with epistemic operators, and compare and contrast their strengths and weaknesses.

Název v anglickém jazyce

Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming

Popis výsledku anglicky

In the context of planning and reasoning about actions and change, we call an action reversible when its effects can be reverted by applying other actions, returning to the original state. Renewed interest in this area has led to several results in the context of the PDDL language, widely used for describing planning tasks. In this paper, we propose several solutions to the computational problem of deciding the reversibility of an action. In particular, we leverage an existing translation from PDDL to Answer Set Programming (ASP), and then use several different encodings to tackle the problem of action reversibility for the STRIPS fragment of PDDL. For these, we use ASP, as well as Epistemic Logic Programming (ELP), an extension of ASP with epistemic operators, and compare and contrast their strengths and weaknesses.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Theory and Practice of Logic Programming

ISSN

1471-0684

e-ISSN

1475-3081

Svazek periodika

21

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

17

Strana od-do

646-662

Kód UT WoS článku

000721317500009

EID výsledku v databázi Scopus

2-s2.0-85117692872