Negation as failure

In knowledge engineering, and formal logic of positivism is in the weak negation (English: Negation as Failure) instead. Set here is that if an atomic expression by resolution can not be proven, it is generally first assumed that the expression is false. The weak negation is also found in the programming language PROLOG use.

Pseudocode:

If ( ¬ resolute ( goal p)), then ( assert ¬ p ) The weak negation is useful, since it must be assumed that the accumulated knowledge is always incomplete and therefore often can not provide unambiguous results of the resolution.

Example

In Horn clause form:

Heizung_defekt: - ¬ batterie_leer, heizgebläse_defekt Can not be found by resolution as true batterie_leer, so it is assumed that batterie_leer does not apply. Thus heizung_defekt true if heizgebläse_defekt is true.

Swell

  • Http://users.informatik.uni-halle.de/ ~ brass/lp93/c9_negat.pdf
  • Http://www.cl.uni-heidelberg.de/courses/archiv/ss06/prolog/interpretation.pdf
  • Mathematical Logic
  • Logical calculus
596706
de