An epistemic logic for planning with trials

Authors:
Rajdeep Niyogi;R. Ramanujam
Affiliations:
Electronics and Computer Engineering Department, Indian Institute of Technology Roorkee, India;The Institute of Mathematical Sciences, Chennai, India
Venue:
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Year:
2009

Citing 12
Cited 0

How to clear a block: A theory of plans

Journal of Automated Reasoning
Reasoning about knowledge

Reasoning about knowledge
Formalizing sensing actions—a transition function based approach

Artificial Intelligence
Dynamic Logic

Dynamic Logic
Knowledge, action, and the frame problem

Artificial Intelligence
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice
Reasoning about knowledge in philosophy: the paradigm of epistemic logic

TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Dynamic Epistemic Logic

Dynamic Epistemic Logic
Plan synthesis: a logical perspective

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Planning with loops

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
What is planning in the presence of sensing?

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Dynamic logic for plan revision in intelligent agents

CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We suggest that in the context of planning in uncertain environments, an agent's performance of an action may be tentative and not definitive. In this view, an agent plans to merely try performing an action, and further planning is dependent on the success or failure of such a trial. Epistemic logics seem well suited to formalize the reasoning in such contexts. We study a simple such logic for one planning agent making bounded plans, for which we give a complete axiomatization and prove decidability. We discuss preliminary results for extensions to multi-agent plans as well as unbounded plans.