Negation as Failure

@inproceedings{Clark1977NegationAF,
  title={Negation as Failure},
  author={K. Clark},
  booktitle={Logic and Data Bases},
  year={1977}
}
  • K. Clark
  • Published in Logic and Data Bases 1977
  • Computer Science, Mathematics
  • 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
    1,754 Citations

    Topics from this paper

    The Prolog not-predicate and negation as failure rule
    • T. W. Ling
    • Computer Science
    • New Generation Computing
    • 2009
    • 3
    • Highly Influenced
    DEDUCE 2: Further Investigations of Deduction in Relational Data Bases
    • C. Chang
    • Computer Science
    • Logic and Data Bases
    • 1977
    • 89
    The Justification of Negation as Failure
    • 21
    Negation as Failure: Careful Closure Procedure
    • 67
    Negation as Instantiation
    • 11
    • PDF
    Negation as Failure as Resolution
    Implementation of logical query languages for databases
    • 406
    Deductive Question-Answering on Relational Data Bases
    • R. Reiter
    • Mathematics, Computer Science
    • Logic and Data Bases
    • 1977
    • 176
    On Closed World Data Bases
    • R. Reiter
    • Mathematics, Computer Science
    • Logic and Data Bases
    • 1977
    • 813

    References

    SHOWING 1-9 OF 9 REFERENCES
    On Closed World Data Bases
    • R. Reiter
    • Mathematics, Computer Science
    • Logic and Data Bases
    • 1977
    • 813
    An Approach to Deductive Question-Answering
    • 34
    • PDF
    A Note on Deduction Rules with Negative Premises
    • 15
    • PDF
    Data Base: Theory vs. Interpretation
    • 96
    Logic for Data Description
    • 101
    Symbolic logic and mechanical theorem proving
    • C. Chang, R. Lee
    • Mathematics, Computer Science
    • Computer science classics
    • 1973
    • 1,716
    • PDF
    Linear Resolution with Selection Function
    • 270
    Computation and Deductive Information Retrieval
    • M. V. Emden
    • Computer Science
    • Formal Description of Programming Concepts
    • 1977
    • 22