Vivid Logic pp 89-110
Logic programming with strong negation and inexact predicates
Strong negation is probably the most appropriate candidate of logically welldefined negations to be implemented in logic programming. It solves the frequently discussed problem of representing and processing explicit negative information. Other researchers, notably Gelfond and Lifschitz [1990+1991], though apparently not aware of the logical concept, have also realized its usefulness and feasibility.
I believe that future systems of logic programming will incorporate two or even three kinds of negation: negation-as-failure, strong negation and possibly negation-as-inconsistency. This will greatly enhance the capability of a logic program as a means of knowledge representation.
Unable to display preview. Download preview PDF.