On the revision of planning tasks

When a planning task cannot be solved then it can often be made solvable by modifying it a bit: one may change either the set of actions, or the initial state, or the goal description. We show that modification of actions can be reduced to initial state modification. We then apply Katsuno and Mendelzon's distinction between update and revision and show that the modification of the initial state is an update and the modification of the goal description is a revision. We consider variants of Forbus's update and Dalal's revision operation and argue that existing belief change operations do not apply as they stand because their inputs are boolean formulas, while plan task modification involves counterfactual statements. We show that they can be captured in Dynamic Logic of Propositional Assignments DL-PA.

[1]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[2]  Kenneth D. Forbus.  Introducing Actions into Qualitative Simulation , 1989, IJCAI.

[3]  Jérôme Lang,et al.  Belief Update Revisited , 2007, IJCAI.

[4]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[5]  Bernhard Nebel,et al.  Coming up With Good Excuses: What to do When no Plan Can be Found , 2010, Cognitive Robotics.

[6]  Andreas Herzig,et al.  Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments , 2014, KR.

[7]  David E. Smith.  Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.

[8]  Emiliano Lorini,et al.  A Dynamic Logic of Normative Systems , 2011, IJCAI.

[9]  Andreas Herzig,et al.  Propositional Belief Base Update and Minimal Change , 1999, Artif. Intell..

[10]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[11]  Andreas Herzig,et al.  Belief Merging in Dynamic Logic of Propositional Assignments , 2014, FoIKS.

[12]  Andreas Herzig,et al.  Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[13]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.