The Complexity of Checking Action Redundancy
3,00 €
Area 09 – Ingegneria industriale e dell'informazione
Tweet
SINTESI
In the field of reasoning about actions, it is of practical importance to decide whether an action is redundant, i.e. it is not needed to reach the goal. In this paper, we study the computational complexityof several problems related to the redundancy of actions: checking whether a domain contains a redundant action, what is the minimal number of actions needed to make the goal reachable, checkingwhether the removal of an action does not increase the minimal plan length, and other related problems.
| pagine: | 24 |
| formato: | 17 x 24 |
| ISBN: | 978-88-548-0120-2 |
| data pubblicazione: | Gennaio 2006 |
| marchio editoriale: | Aracne |
| collana: | Dipartimento di Informatica e Sistemistica “Antonio Ruberti” della “Sapienza” Università di Roma | 2005/3 |
SINTESI
