Rules are an important paradigm in database programming.
In this work, a state-oriented extension of Datalog called Statelog is proposed, which integrates the dynamic capabilities of active rules and the declarative semantics of deductive rules in a unified logical framework. The basic idea of the language is to incorporate state terms, which allow to refer to different database states within the rule language. In Statelog, database transactions are modeled as a sequence of intermediate transitions, where each transition is declaratively specified by deductive rules. Moreover, it is shown that certain deductive and production rules correspond to special classes of Statelog programs. Results on the complexity of detecting termination conclude the first part of the work.