Comments on “general failure of logic programs”

https://doi.org/10.1016/0743-1066(86)90018-XGet rights and content
Under an Elsevier user license
open archive

Abstract

The paper [1] purports to present a classification of the general failure sets of logic programs and a simple proof of the theorem on the soundness and completeness of the negation-as-failure rule. In this note we clarify some conflicting terminology between [1] and the papers [2, 3] to which it predominantly refers. Our main purpose, however, is to point out major errors, in particular, one in the proof of the above mentioned theorem.

Cited by (0)

Department of Computer Science, Monash University, Victoria 3168, Australia.

∗∗

IBM Thomas J. Watson Research Center, Yorktown Heights, New York.