Thumbnail

Knowledge-Based Programs as Plans - The Complexity of Plan Verification

Lang, Jérôme; Zanuttini, Bruno (2012), Knowledge-Based Programs as Plans - The Complexity of Plan Verification, dans De Raedt, Luc; Bessiere, Christian; Dubois, Didier; Doherty, Patrick; Frasconi, Paolo; Heintz, Fredrik; Lucas, Peter, Proceedings of 20th European Conference on Artificial Intelligence (ECAI 2012), Ios Press : Amsterdam, p. 504-509. 10.3233/978-1-61499-098-7-504

Voir/Ouvrir
Type
Communication / Conférence
Date
2012
Titre du colloque
20th European Conference on Artificial Intelligence (ECAI 2012)
Date du colloque
2012-08
Ville du colloque
Montpellier
Pays du colloque
France
Titre de l'ouvrage
Proceedings of 20th European Conference on Artificial Intelligence (ECAI 2012)
Auteurs de l’ouvrage
De Raedt, Luc; Bessiere, Christian; Dubois, Didier; Doherty, Patrick; Frasconi, Paolo; Heintz, Fredrik; Lucas, Peter
Éditeur
Ios Press
Ville d’édition
Amsterdam
Isbn
978-1-61499-097-0
Nombre de pages
1056
Pages
504-509
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Lang, Jérôme
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Zanuttini, Bruno
Groupe de Recherche en Informatique, Image et Instrumentation de Caen [GREYC]
Résumé (EN)
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.
Mots-clés
knowledge representation; planning