• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

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

Thumbnail
View/Open
lz-ecai12.pdf (268.3Kb)
Date
2012
Notes
Frontiers in Artificial Intelligence and Applications, vol. 242
Dewey
Intelligence artificielle
Sujet
knowledge representation; planning
DOI
http://dx.doi.org/10.3233/978-1-61499-098-7-504
Conference name
20th European Conference on Artificial Intelligence (ECAI 2012)
Conference date
08-2012
Conference city
Montpellier
Conference country
France
Book title
Proceedings of 20th European Conference on Artificial Intelligence (ECAI 2012)
Author
De Raedt, Luc; Bessiere, Christian; Dubois, Didier; Doherty, Patrick; Frasconi, Paolo; Heintz, Fredrik; Lucas, Peter
Publisher
Ios Press
Publisher city
Amsterdam
Year
08-2012
Pages number
1056
ISBN
978-1-61499-097-0
URI
https://basepub.dauphine.fr/handle/123456789/16429
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Lang, Jérôme
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Zanuttini, Bruno
150 Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen [GREYC]
Type
Communication / Conférence
Item number of pages
504-509
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.