Static and Dynamic Semantics: Preliminary Report

This paper is aiming at a contribution to the logic program updates research. A (dynamic) semantics of sequences of logic programs is presented. The semantics is closely connected to the answer set semantics. We follow the construction of answer sets proposed by Dimopoulos and Torres. Solutions of three kinds of conflicts are added to the construction. After that, some decisions aiming at a step from inconsistencies handling to updating, are presented and analyzed. We present also some postulates characterizing relations between static and dynamic semantics. Subsequently a comparison to other postulates for logic program updates is provided. Presented postulates are satisfied by our dynamic semantics.