Abstract Clark's attempt [1] to validate negation as failure in first order logic is shown to contain some fundamental errors. In particular, we show that the motivation for the completed database, the definition of the completed database, and the attempt to validate negation as failure in terms of it are illogical, that the completed database cannot be regarded as the intended meaning of the database, and that the closed world assumption is generally absurd and, in any case, irrelevant. A validation is given using a consistent first order extension of the database and hence in the only terms which appear to make any sense, namely, consistency with the database. However, it seems that the query evaluation process, with negation interpreted as failure, is of no practical use as a theorem prover.
[1]
T. B. Flannagan.
On an Extension of Hilbert's Second epsilon-Theorem
,
1975,
J. Symb. Log..
[2]
Keith L. Clark,et al.
Negation as Failure
,
1987,
Logic and Data Bases.
[3]
John C. Shepherdson,et al.
Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption
,
1984,
J. Log. Program..
[4]
Joxan Jaffar,et al.
Completeness of the Negation as Failure Rule
,
1983,
IJCAI.
[5]
Raymond Reiter.
On Closed World Data Bases
,
1977,
Logic and Data Bases.
[6]
A. Leisenring.
Mathematical logic and Hilbert's ε-symbol
,
1971
.
[7]
John Wylie Lloyd,et al.
Foundations of Logic Programming
,
1987,
Symbolic Computation.