Conditional Epistemic Planning

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

View graph of relations

Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism. Under such circumstances, a plan must branch if it is to guarantee achieving the goal under all contingencies (strong planning). Without branching, plans can offer only the possibility of achieving the goal (weak planning). We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete.
Original languageEnglish
TitleLogics in Artificial Intelligence : 13th European Conference, JELIA 2012, Toulouse, France, September 26-28, 2012. Proceedings
PublisherSpringer
Publication date2012
Pages 94-106
ISBN (print)978-3-642-33352-1
ISBN (electronic)978-3-642-33353-8
DOIs
StatePublished

Conference

Conference13th European Conference on Logics in Artificial Intelligence (JELIA 2012)
CountryFrance
CityToulouse
Period26/09/1228/09/12
Internet addresshttp://www.irit.fr/jelia2012/
NameLecture Notes in Computer Science
Volume7519
ISSN (Print)0302-9743
CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 30917326