Knowledge-Based Programs as Plans - The Complexity of Plan Verification - (Extended Abstract) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Knowledge-Based Programs as Plans - The Complexity of Plan Verification - (Extended Abstract)

Jérôme Lang
MAD
Bruno Zanuttini
  • Fonction : Auteur
  • PersonId : 952903

Résumé

Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge. The use of KBPs for expressing action policies in AI planning has been surprisingly underlooked. Given that to each KBP corresponds an equivalent plan and vice versa , KBPs are typically more succinct than standard plans, but imply more online computation time. Here we compare KBPs and standard plans according to succinctness and to the complexity of plan verification.
Fichier principal
Vignette du fichier
lz12a.pdf (157.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00946845 , version 1 (14-02-2014)

Identifiants

  • HAL Id : hal-00946845 , version 1

Citer

Jérôme Lang, Bruno Zanuttini. Knowledge-Based Programs as Plans - The Complexity of Plan Verification - (Extended Abstract). Proc. 10th Conference on Logic and the Foundations of Game and Decision Theory (LOFT 2012), Jun 2012, Spain. 15 p. ⟨hal-00946845⟩
114 Consultations
65 Téléchargements

Partager

Gmail Facebook X LinkedIn More