Completeness of hyper-resolution via the semantics of disjunctive logic programs

Authors:
Linh Anh Nguyen;Rajeev Goré
Affiliations:
Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland;RSISE and NICTA, The Australian National University, Canberra ACT 0200, Australia
Venue:
Information Processing Letters
Year:
2005

Citing 14
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
The resolution calculus

The resolution calculus
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
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

Journal of Automated Reasoning
Resolution Games and Non-Liftable Resolution Orderings

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A Resolution Calculus for Modal Logics

Proceedings of the 9th International Conference on Automated Deduction
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
Resolution decision procedures

Handbook of automated reasoning
A fixpoint semantics and an SLD-resolution calculus for modal logic programs

Fundamenta Informaticae

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a proof of completeness of hyper-resolution based on the fixpoint semantics of disjunctive logic programs. This shows that hyper-resolution can be studied from the point of view of logic programming.