Negation as failure
id:
negation-as-failure-316-393922
title:
Negation as failure
text:
Negation as failure is a non-monotonic inference rule in logic programming, used to derive n o t p from failure to derive p . Note that n o t p can be different from the statement ¬ p of the logical negation of 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 extralo
brand slug:
wiki
category slug:
encyclopedia
description:
Inference rule treating non-provability as falsity
original url:
https://en.wikipedia.org/wiki/Negation_as_failure
date created:
date modified:
2023-10-11T21:35:38Z
main entity:
{"identifier":"Q2119400","url":"https://www.wikidata.org/entity/Q2119400"}
image:
fields total:
13
integrity:
14