Publication View

Completeness of the negation as failure rule (1983)

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. I

Publication details

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.105.6316
Source	http://dli.iiit.ac.in/ijcai/IJCAI-83-VOL-1/PDF/118.pdf
Contributors	CiteSeerX
Repository	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type	text
Language	English
Relation	10.1.1.20.6815, 10.1.1.85.5645, 10.1.1.54.8201, 10.1.1.51.1548, 10.1.1.29.1466, 10.1.1.28.8989, 10.1.1.112.6683, 10.1.1.76.8302, 10.1.1.17.8524, 10.1.1.29.6537, 10.1.1.29.994, 10.1.1.35.7895, 10.1.1.54.1106, 10.1.1.54.8392, 10.1.1.55.7727, 10.1.1.7.8728, 10.1.1.8.9132, 10.1.1.96.8383, 10.1.1.119.6598, 10.1.1.133.9962