A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We begin by motivating the use of paraconsistency and the detection of contradiction supported conclusions by recourse to examples. Next we overview WFSX p and present its embedding into WFS. We then address the problem of detecting contradiction support and relate it to WFSX p's intrinsic properties. Afterwards, we show how to implement two recent modal contradiction related constructs in the language of extended logic programs in order to gain explicit control of contradiction propagation. Wedoi:10.1007/3-540-63255-7_18 fatcat:sxakliqjwrdvxelmeoelp77nvu