On the measure of incoherent information in extended multi-adjoint logic programs

Abstract

We continue analyzing the introduction of negation into the framework of residuated logic programming [8], [10]; specifically, we focus on extended programs, that is we consider programs with strong negation. The classical approach to extended logic programs consists in considering negated literals as new, independent, ones and, then apply the usual monotonic approach (based on the fix-point semantics and the Tp operator); if the least fix-point so obtained is inconsistent, then the approach fails and no meaning is attached to the program. This paper introduces several approaches to measure consistency (under the term coherence) into a multi-adjoint setting.