Paper Info
Title
Approximate Epistemic Planning with Postdiction as Answer-Set Programming.
Abstract
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 Sigma(P)(2) 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.
Year
DOI
Venue
2013
10.1007/978-3-642-40564-8_29
Lecture Notes in Computer Science
Field
DocType
Volume
Cognitive robotics,Postdiction,Situation calculus,Problem domain,Computer science,Planner,Algorithm,Theoretical computer science,Answer set programming,Semantics,Possible world
Conference
8148
ISSN
Citations 
PageRank 
0302-9743
6
0.47
References 
Authors
19
3
Name
Order
Citations
PageRank
Manfred Eppe16311.60
Mehul Bhatt245242.11
Frank Dylla325220.20