Negation as Failure
@inproceedings{Clark1977NegationAF, title={Negation as Failure}, author={K. Clark}, booktitle={Logic and Data Bases}, year={1977} }
A query evaluation process for a logic data base comprising a set of clauses is described. It is essentially a Horn clause theorem prover augmented with a special inference rule for dealing with negation. This is the negation as failure inference rule whereby ~ P can be inferred if every possible proof of P fails. The chief advantage of the query evaluator described is the effeciency with which it can be implemented. Moreover, we show that the negation as failure rule only allows us to conclude… CONTINUE READING
Topics from this paper
1,754 Citations
The Prolog not-predicate and negation as failure rule
- Computer Science
- New Generation Computing
- 2009
- 3
- Highly Influenced
Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption
- Computer Science, Mathematics
- J. Log. Program.
- 1984
- 142
DEDUCE 2: Further Investigations of Deduction in Relational Data Bases
- Computer Science
- Logic and Data Bases
- 1977
- 89
Deductive Question-Answering on Relational Data Bases
- Mathematics, Computer Science
- Logic and Data Bases
- 1977
- 176
References
SHOWING 1-9 OF 9 REFERENCES
Symbolic logic and mechanical theorem proving
- Mathematics, Computer Science
- Computer science classics
- 1973
- 1,716
- PDF
Computation and Deductive Information Retrieval
- Computer Science
- Formal Description of Programming Concepts
- 1977
- 22