We begin by motivating the use of paraconsistency and the detection of contradiction supported conclusions by recourse to examples. Next we overview WFSXp and present its embedding into WFS. We then address the problem of detecting contradiction support and relate it to WFSXp‘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. We finish by making comparisons and drawing some conclusions.
CITATION STYLE
Damásio, C. V., & Pereira, L. M. (1997). A paraconsistent semantics with contradiction support detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1265, pp. 224–243). Springer Verlag. https://doi.org/10.1007/3-540-63255-7_18
Mendeley helps you to discover research relevant for your work.