In this paper we investigate minimal semantics for Propositional Dynamic Logic formulas. The goal is to be able to write action specifications in a declarative pre/post condition style. The declarative specification of actions comes with some well known problems: the frame problem, the qualification problem and the ramification problem. We incorporate the assumptions that are inherent to both the frame and the qualification problem into the semantics of Dynamic Logic by defining preferences over Dynamic logic models. This gives us an intended semantics that, for each declarative action specification, selects a unique meaning for each action.
|Number of pages||16|
|Publication status||Published - Nov 1996|