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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
0102019762018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
We present description logics of minimal knowledge and negation as failure (MKNF-DLs), which augment description logics with… (More)
  • figure 1
Is this relevant?
1999
1999
Set-grouping and aggregation are powerful operations of practical interest in database query languages. An aggregate operation is… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The class of logic programs with negation as failure in the head is a subset of the logic of MBNF introduced by Lifschitz and is… (More)
Is this relevant?
1996
1996
We study action rule based systems with two forms of negation, namely classical negation and \negation as failure to nd a course… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Fangzhen Lin and Yoav Shoham deened a propositional nonmonotonic logic which uses two independent modal operators. One of them… (More)
Is this relevant?
1994
1994
What is the semantics of Negation-as-Failure in logic programming? We try to answer this question by proof-theoretic methods. A… (More)
  • table 1
  • table 2
  • table 4
Is this relevant?
1990
1990
Intuitionistic logic programming is an extension of Horn-clause logic programming in which implications may appear “embedded” on… (More)
Is this relevant?
1987
1987
We equip ordered logic programs with negation as failure, us ing a simple generalization of the preferred answer set semantic s… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
D A general logic program is a set of rules that have both positive and negative subgoals. We define negation in general logic… (More)
  • figure 1
  • figure 2
Is this relevant?
1986
1986
The aim of this paper is a modification o f Minker's Generalized Closed World Assumption that would allow application o f the… (More)
Is this relevant?