Semantics of Horn and disjunctive logic programs

AbstractVan Emden and Kowalski proposed a fixpoint semantics based on model-theory and an operational semantics based on proof-theory for Horn logic programs. They prove the equivalence of these semantics using fixpoint techniques. The main goal of this paper is to present a unified theory for the semantics of Horn and disjunctive logic programs. For this, we extend the fixpoint semantics and the operational or procedural semantics to the class of disjunctive logic programs and prove their equivalence using techniques similar to the ones used for Horn programs