Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming

Abstract

We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic programs. In our formulation, answers of queries are defined using disjunctive substitutions, which are more flexible than answer literals used in theorem proving systems.