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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

Since m1 and m2 are not explicitly defined to be different from each other, they will be inferred to be same due to the…

1999

Set-grouping and aggregation are powerful operations of practical interest in database query languages. An aggregate operation is…

1996

We study action rule based systems with two forms of negation, namely classical negation and "negation as failure to find a…

1996

Normal logic programs are usually shorter and easier to write and understand than definite logic programs. As a consequence, it…

1995

In this paper we study a new franiework for normal and extended logic programming, called logic programming without negation as…

Review

1992

Review

1992

Negation as failure is the version of negation commonly used in logic programming. It decrees that a (ground) goal A succeeds if…

1992

1992

Over the years negation in Afrikaans has been a popular topic in linguistics (e.g. Pauwels 1958, Uys 1962 and Heiberg 1974). The…

1989

We extend the Kripke-like model theory given in 10] for a fragment of rst-order hereditary Harrop formulae to include negated…

1988