Completeness of the Negation as Failure Rule
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
Cite
Text
Jaffar et al. "Completeness of the Negation as Failure Rule." International Joint Conference on Artificial Intelligence, 1983.Markdown
[Jaffar et al. "Completeness of the Negation as Failure Rule." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/jaffar1983ijcai-completeness/)BibTeX
@inproceedings{jaffar1983ijcai-completeness,
title = {{Completeness of the Negation as Failure Rule}},
author = {Jaffar, Joxan and Lassez, Jean-Louis and Lloyd, John W.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {500-506},
url = {https://mlanthology.org/ijcai/1983/jaffar1983ijcai-completeness/}
}