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 application/pdf
.
Contradiction: When avoidance equals removal Part I
[chapter]
1994
Lecture Notes in Computer Science
Recently several authors have stressed and illustrated the importance of including a second kind of negation (explicit negation) in logic programs besides \negation as failure", and its use in deductive databases, knowledge representation, and nonmonotonic reasoning. By introducing explicit negation into logic programs contradiction may appear. In this work we present two approaches for dealing with contradiction, and show their equivalence. One of the approaches consists in avoiding
doi:10.1007/3-540-58025-5_47
fatcat:ljpzshgyb5e3dbtxgqc4vacmmm