On quantitative measurement of negation in logic programming
Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen · 1996
A b s t r a c tThe introduction of the Negation as Failure rule increases the expressiveness and derivability of logic programs, but also leads to general incompleteness and the need for rnore sophisticated semantics.It has been shown that in some non-trivial cases, the amount of negation existing in a program can be greatly reduced via an effective transformation procedure [8].To properly formalize and fully understand this negation reduction process, we need to appropriately quantify negation in logic programs.In this paper, we initiate the investigation of this issue with the class of locally stratified programs.