Approximate epistemic planning with postdiction as answer-set programming

Publikationstyp
Conference Paper
Date Issued
2013-09
Sprache
English
Author(s)
Eppe, Manfred  
Bhatt, Mehul  
Dylla, Frank  
TORE-URI
http://hdl.handle.net/11420/12376
First published in
Lecture notes in computer science  
Number in series
8148 LNCS
Start Page
290
End Page
303
Citation
12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)
Contribution to Conference
12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013  
Publisher DOI
10.1007/978-3-642-40564-8_29
Scopus ID
2-s2.0-84885781416
We propose a history-based approximation of the Possible Worlds Semantics (PWS ) for reasoning about knowledge and action. A respective planning system is implemented by a transformation of the problem domain to an Answer-Set Program. The novelty of our approach is elaboration tolerant support for postdiction under the condition that the plan existence problem is still solvable in NP, as compared to Σ2P for non-approximated PWS of Son and Baral [20]. We demonstrate our planner with standard problems and present its integration in a cognitive robotics framework for high-level control in a smart home.
DDC Class
600: Technology