Skip to search formSkip to main contentSkip to account menu

Negation as failure

Known as: NAF, Negation by failure 
Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive (i.e. that is assumed not to hold) from… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Abductive logic programmingAbsysAnswer set programmingAtomic formula

Broader (1)

Logic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Stable models and circumscription
Review
2009
Review
2009
Datalog±: a unified approach to ontologies and integrity constraints
We report on a recently introduced family of expressive extensions of Datalog, called Datalog±, which is a new framework for… 
Highly Cited
2007
Highly Cited
2007
SPARQL-DL: SPARQL Query for OWL-DL
There are many query languages (QLs) that can be used to query RDF and OWL ontologies but neither type is satisfactory for… 
Highly Cited
1999
Highly Cited
1999
Scenario-based reliability analysis of component-based software
Software designers are motivated to utilize off-the-shelf software components for rapid application development. Such… 
1995
1995
Logic Programming without Negation as Failure
In this paper we study a new franiework for normal and extended logic programming, called logic programming without negation as… 
1994
1994
Cut-Property and Negation as Failure
What is the semantics of Negation-as-Failure in logic programming? We try to answer this question by proof-theoretic methods. A… 
Review
1992
Review
1992
Logics for Negation as Failure
Negation as failure is the version of negation commonly used in logic programming. It decrees that a (ground) goal A succeeds if… 
Highly Cited
1992
Highly Cited
1992
Embedding Negation as Failure into a Model Generation Theorem Prover
Here, for the first time, we give an implementation which computes answer sets of every class of (function-free) logic programs… 
Highly Cited
1989
Highly Cited
1989
Abduction Compared with Negation by Failure
Horn clause logic programming can be extended to include abduction with integrity constraints. In the resulting extension of… 
Highly Cited
1987
Highly Cited
1987
Negation in Logic Programming
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)