Semantic forcing in disjunctive logic programs

We propose a semantics for disjunctive logic programs, based on the single notion of forcing. We show that the semantics properly extends, in a natura l way, previous approaches. A fixpoint characterization is also provided. W e also take a closer look at the relationship between disjunctive logic pro grams and disjunctive-free logic programs. We present certain criteria unde r which a disjunctive program is semantically equivalent with its disjuncti ve-free (shifted) version.