TY - GEN
T1 - Contradiction
T2 - 4th International Workshop on Extensions of Logic Programming, ELP 1993
AU - Alferes, José Júlio
AU - Pereira, Luís Moniz
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 1994
Y1 - 1994
N2 - 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 contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based on a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction. The work is divided into two parts: one is presented in this paper, and comprises the contradiction avoidance approach, and the other in [16] in this volume, comprises the contradiction removal approach and shows the equivalence between the avoidance and removal approaches.
AB - 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 contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based on a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction. The work is divided into two parts: one is presented in this paper, and comprises the contradiction avoidance approach, and the other in [16] in this volume, comprises the contradiction removal approach and shows the equivalence between the avoidance and removal approaches.
UR - http://www.scopus.com/inward/record.url?scp=21344480970&partnerID=8YFLogxK
U2 - 10.1007/3-540-58025-5_47
DO - 10.1007/3-540-58025-5_47
M3 - Conference contribution
AN - SCOPUS:21344480970
SN - 978-3-540-58025-6
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 11
EP - 23
BT - Extensions of Logic Programming - 4th International Workshop, ELP 1993, Proceedings
A2 - Dyckhoff, Roy
PB - Springer
CY - Berlin, Heidelberg
Y2 - 29 March 1993 through 1 April 1993
ER -