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

Authors:
Linh Anh Nguyen
Affiliations:
Institute of Informatics University of Warsaw Banacha 2, 02-097 Warsaw, Poland. E-mail: nguyen@mimuw.edu.pl
Venue:
Fundamenta Informaticae
Year:
2006

Citing 10
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A fixpoint semantics for disjunctive logic programs

Journal of Logic Programming
Semantics of Horn and disjunctive logic programs

Theoretical Computer Science
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
Calculi for disjunctive logic programming

ILPS '97 Proceedings of the 1997 international symposium on Logic programming
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Generalized Bottom-Up Query Evaluation

EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology

Quantified Score

Hi-index	0.00

Visualization

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.