TY - GEN
T1 - Negation as failure and constraints through abduction and defaults
AU - Giordano, L.
AU - Martelli, A.
AU - Sapino, M. L.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.
PY - 1991
Y1 - 1991
N2 - The paper presents an extension of the abduction framework proposed by Eshghi and Kowalski to give the semantics of negation as failure in logic programming. The extension allows to cope with the presence of integrity constraints, not only for pruning inconsistent solutions, but for computing new solutions. This is achieved by adding constraints to the program and using them as logical formulae. Furthermore a new semantics based on defaults, equivalent to the previous one, is given for logic programs with negation as failure and constraints. Finally a transformation is presented which allows constraints to be eliminated, so that proof procedures for general clauses without constraints will be applicable. The approach proposed in this paper is applicable not only to logic programs with negation as failure but to other nonmonotonic formalisms as well, and, for instance, it can be used to give a semantic characterization to justification-based Truth Maintenance Systems with dependency-directed backtracking.
AB - The paper presents an extension of the abduction framework proposed by Eshghi and Kowalski to give the semantics of negation as failure in logic programming. The extension allows to cope with the presence of integrity constraints, not only for pruning inconsistent solutions, but for computing new solutions. This is achieved by adding constraints to the program and using them as logical formulae. Furthermore a new semantics based on defaults, equivalent to the previous one, is given for logic programs with negation as failure and constraints. Finally a transformation is presented which allows constraints to be eliminated, so that proof procedures for general clauses without constraints will be applicable. The approach proposed in this paper is applicable not only to logic programs with negation as failure but to other nonmonotonic formalisms as well, and, for instance, it can be used to give a semantic characterization to justification-based Truth Maintenance Systems with dependency-directed backtracking.
UR - http://www.scopus.com/inward/record.url?scp=84990576644&partnerID=8YFLogxK
U2 - 10.1007/3-540-54712-6_220
DO - 10.1007/3-540-54712-6_220
M3 - Conference contribution
AN - SCOPUS:84990576644
SN - 9783540547129
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 78
EP - 87
BT - Trends in Artificial Intelligence - 2nd Congress of the Italian Association for Artificial Intelligence, AI*IA, Proceedings
A2 - Ardizzone, Edoardo
A2 - Gaglio, Salvatore
A2 - Sorbello, Filippo
PB - Springer Verlag
T2 - 2nd Congress of the Italian Association for Artificial Intelligence, AI*IA 1991
Y2 - 29 October 1991 through 31 October 1991
ER -