Negative Hyper-resolution as Procedural Semantics of Disjunctive Logic Programs
نویسنده
چکیده
We prove that negative hyper-resolution 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
منابع مشابه
Completeness of hyper-resolution via the semantics of disjunctive logic programs
We present a proof of completeness of hyper-resolution based on the fixpoint semantics of disjunctive logic programs. This shows that hyperresolution can be studied from the point of view of logic programming.
متن کاملCalculi for Disjunctive Logic Programming
In this paper we investigate relationships between top-down and bottomup approaches to computation with disjunctive logic programs (DLPs). The bottom-up calculus considered, hyper tableaux, is depicted in its ground version and its relation to fixed point approaches from the literature is investigated. For the top-down calculus we use restart model elimination (RME) and show as our main result ...
متن کاملNegative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
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.
متن کاملStatic Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal programs. Based on considerations about how disjunctive information is treated by a given semantics, we divide the computation of that semantics into two phases. The first one is a program transformation phase, which applie...
متن کاملDomain-theoretic Semantics for Disjunctive Logic Programs
We propose three equivalent domain-theoretic semantics for dis-junctive logic programs in the style of Gelfond and Lifschitz. These are (i) a resolution-style inference semantics; (ii) a model-theoretic semantics; and (iii) a (nondeterministic) state-transition semantics. We show how these three semantics generalize \for free" to disjunctive logic programming over any Scott domain. We also rela...
متن کامل