Matteo Baldoni, Laura Giordano, Alberto Martelli, and Viviana Patti
In this paper we propose a modal approach for reasoning about dynamic domains in a logic programming setting. In particular we define a language, called DyLOG, in which actions are naturally represented by modal operators. DyLOG is a language for reasoning about actions which allows to deal with ramifications and to define procedures to build complex actions from elementary ones. Procedure definitions can be easily specified in the modal language by introducing suitable axioms.
In the language the frame problem is given a non-monotonic solution by making use of persistency assumptions in the context of an abductive characterization. Moreover, a goal directed proof procedure is defined, which allows to compute a query from a given dynamic domain description.