Completeness of the Negation as Failure Rule
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 500-505.
Abstract
Let P be a Horn clause logic program and com p(P) be its completion in th e sense of Clark . Clark gave a justification for the negation as failure rule by sho '.;in g that if a grou nd a tom A. is in the finite failur e set of P, then - A. is a logic9.l consequence of co mp ( P) , th9. t is , the neg9.tion as failure rule is so und. We prove he re that the converse also holds, that is, the negation as failure rule is compl ete .
Joxan Jaffar, Jean-Louis Lassez, and John W. Lloyd. 1983. Completeness of the Negation as Failure Rule. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83. IJCAI, 500–505. https://ijcai.org/proceedings/1983/121
Jaffar, J., Lassez, J., & Lloyd, J. W. (1983). Completeness of the Negation as Failure Rule. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 (pp. 500–505). IJCAI. https://ijcai.org/proceedings/1983/121
@inproceedings{ijcai1983p121,
title = {Completeness of the Negation as Failure Rule},
author = {Jaffar, Joxan and Lassez, Jean-Louis and Lloyd, John W.},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {500--505},
year = {1983},
note = {Logic Programming},
url = {https://ijcai.org/proceedings/1983/121},
}
TY - CPAPER TI - Completeness of the Negation as Failure Rule AU - Jaffar, Joxan AU - Lassez, Jean-Louis AU - Lloyd, John W. T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 500 EP - 505 UR - https://ijcai.org/proceedings/1983/121 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
