Completeness of the negation as failure rule

Authors:
Joxan Jaffar;Jean-Louis Lassez;John Lloyd
Affiliations:
Dept. of Computer Science, Monash University, Clayton, Victoria;-;Dept. of Computer Science, University of Melbourne, Parkville, Victoria
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Year:
1983

Citing 2
Cited 5

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

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

Journal of the ACM (JACM)

Knowledge systems: Principles and practice

IBM Journal of Research and Development
First order compiler: A deterministic logic program synthesis algorithm

Journal of Symbolic Computation
Disjunctive Logic Programming: A Survey and Assessment

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
A logic programming and verification system for recursive quantificational logic

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Foundations of rule-based query answering

RW'07 Proceedings of the Third international summer school conference on Reasoning Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let P be a Horn clause logic program and comp(p) be its completion in the sense of Clark. Clark gave a justification for the negation as failure rule by showing that if a ground atom A is in the finite failure set of P, then ∼A is a logical consequence of comp(P), that is, the negation as failure rule is sound. We prove here that the converse also holds, that is, the negation as failure rule is complete.