Negation as failure

Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive

n

o

t

p

{\displaystyle \mathrm {not} ~p}

(i.e. that

p

{\displaystyle p}

is assumed not to hold) from failure to derive

p

{\displaystyle p}

. Note that

n

o

t

p

{\displaystyle \mathrm {not} ~p}

can be different from the statement

¬

p

{\displaystyle \neg p}

of the logical negation of

p

{\displaystyle p}

, depending on the completeness of the inference algorithm and thus also on the formal logic system.

Negation as failure has been an important feature of logic programming since the earliest days of both Planner and Prolog. In Prolog, it is usually implemented using Prolog's extralogical constructs.

More generally, this kind of negation is known as weak negation, in contrast with the strong (i.e. explicit, provable) negation.

Planner semantics

In Planner, negation as failure could be implemented as follows:

if (not (goal p)), then (assert ¬p)

which says that if an exhaustive search to prove p fails, then assert ¬p. This states that proposition p shall be assumed as "not true" in any subsequent processing. However, Planner not being based on a logical model, a logical interpretation of the preceding remains obscure.