All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00375706" target="_blank" >RIV/68407700:21730/24:00375706 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21230/24:00375706

  • Result on the web

    <a href="https://doi.org/10.1609/icaps.v34i1.31496" target="_blank" >https://doi.org/10.1609/icaps.v34i1.31496</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1609/icaps.v34i1.31496" target="_blank" >10.1609/icaps.v34i1.31496</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity

  • Original language description

    Classical planning looks for a sequence of actions that transform the initial state of the environment into a goal state. Studying whether the effects of an action can be undone by a sequence of other actions, that is, action reversibility, is beneficial, for example, in determining whether an action is safe to apply. This paper deals with action reversibility of non-deterministic actions, i.e., actions whose application might result in different outcomes. Inspired by the established notions of weak and strong plans in non-deterministic (or FOND) planning, we define the notions of weak and strong reversibility for non-deterministic actions. We then focus on the universality and uniformity of action reversibility, that is, whether we can always undo all possible effects of the action by the same means (i.e., policy), or whether some of the effects can never be undone. We show how these classes of problems can be solved via classical or FOND planning and evaluate our approaches on FOND benchmark domains.

  • 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

    2024

  • 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

    Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling

  • ISBN

    978-1-57735-889-3

  • ISSN

    2334-0835

  • e-ISSN

    2334-0843

  • Number of pages

    9

  • Pages from-to

    369-377

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park, California

  • Event location

    Banff

  • Event date

    Jun 1, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article