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, in 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

View/Open
Type
Communication / Conférence
Date
2012
Conference title
20th European Conference on Artificial Intelligence (ECAI 2012)
Conference date
2012-08
Conference city
Montpellier
Conference country
France
Book title
Proceedings of 20th European Conference on Artificial Intelligence (ECAI 2012)
Book author
De Raedt, Luc; Bessiere, Christian; Dubois, Didier; Doherty, Patrick; Frasconi, Paolo; Heintz, Fredrik; Lucas, Peter
Publisher
Ios Press
Published in
Amsterdam
ISBN
978-1-61499-097-0
Number of pages
1056
Pages
504-509
Publication identifier
Metadata
Show full item record
Author(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]
Abstract (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.
Subjects / Keywords
knowledge representation; planning