Abstract
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.
We thank JNICT and Esprit BR project Compulog 2 (no 6810) for their support.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. J. Alferes, P. M. Dung, and L. M. Pereira. Scenario semantics of extended logic programs. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on Logic Programming and NonMonotonic Reasoning. MIT Press, 1993.
J. J. Alferes and L. M. Pereira. On logic programs semantics with two kinds of negation. In K. Apt, editor, Int. Joint Conf. and Symp. on Logic Programming, pages 574–588. MIT Press, 1992.
H. Blair and V. S. Subrahmanian. Paraconsistent logic programming. In Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 340–360. Springer-Verlag, 1987.
G. Brewka and K. Konolige. An abductive framework for generalized logic programs and other nonmonotonic systems. Tech. report, GMD and SRI Int., 1993.
N. Costa. On the theory of inconsistency formal system. Notre Dame J. of Formal Logic, 15:497–510, 1974.
P. M. Dung. Negation as hypotheses: An abductive framework for logic programming. In K. Furukawa, editor, 8th Int. Conf. on Logic Programming, pages 3–17. MIT Press, 1991.
P. Geerts and D. Vermeir. A nonmonotonic reasoning formalism using implicit specificity information. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on Logic Programming and NonMonotonic Reasoning. MIT Press, 1993.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, 5th Int. Conf. on Logic Programming, pages 1070–1080. MIT Press, 1988.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D. H. D. Warren and P. Szeredi, editors, 7th Int. Conf. on Logic Programming, pages 579–597. MIT Press, 1990.
K. Inoue. Extended logic programs with default assumptions. In K. Furukawa, editor, 8th Int. Conf. on Logic Programming, pages 490–504. MIT Press, 1991.
K. Konolige. Using default and causal reasoning in diagnosis. In B. Nebel, C. Rich, and W. Swartout, editors, 3rd Int. Conf. on Knowledge Representation and Reasoning. Morgan Kaufmann, 1992.
R. Kowalski. Problems and promises of computational logic. In John Lloyd, editor, Computational Logic Symp., pages 1–36. Springer-Verlag, November 1990.
R. Kowalski and F. Sadri. Logic programs with exceptions. In D. H. D. Warren and P. Szeredi, editors, 7th Int. Conf. on Logic Programming. MIT Press, 1990.
D. Pearce and G. Wagner. Reasoning with negative information I: Strong negation in logic programs. In L. Haaparanta, M. Kusch, and I. Niiniluoto, editors, Language, Knowledge and Intentionality, pages 430–453. Acta Philosophica Fennica 49, 1990.
L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, European Conf. on AI, pages 102–106. John Wiley & Sons, Ltd, 1992.
L. M. Pereira and J. J. Alferes. Contradiction: when avoidance equal removal. Part II. In R. Dyckhoff, editor, 4th Int. Ws. on Extensions of Logic Programming, 1993.
L. M. Pereira and J. J. Alferes. Optative reasoning with scenario semantics. In D. S. Warren, editor, 10th International Conference on Logic Programming, pages 601–615. MIT Press, 1993.
L. M. Pereira, J. N. Aparício, and J. J. Alferes. Counterfactual reasoning based on revising assumptions. In Ueda and Saraswat, editors, Int. Logic Programming Symp. MIT Press, 1991.
L. M. Pereira, J. N. Aparício, and J. J. Alferes. Nonmonotonic reasoning with well founded semantics. In K. Furukawa, editor, 8th Int. Conf. on Logic Programming, pages 475–489. MIT Press, 1991.
L. M. Pereira, J. N. Aparício, and J. J. Alferes. Logic programming for nonmonotonic reasoning. In Applied Logic Conf. ILLC, Amsterdam, 1992.
L. M. Pereira, C. Damásio, and J. J. Alferes. Diagnosis and debugging as contradiction removal. In L. M. Pereira and A. Nerode, editors, 2nd International Workshop on Logic Programming and NonMonotonic Reasoning, pages 316–330. MIT Press, 1993.
L. M. Pereira, C. Damásio, and J. J. Alferes. Diagnosis and debugging as contradiction removal in logic programs. In L. Damas and M. Filgueiras, editors, 6th Portuguese Artificial Intelligence Conference. Springer-Verlag, 1993.
D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27–47, 1988.
T. Przymusinski. Extended stable semantics for normal and disjunctive programs. In D. H. D. Warren and P. Szeredi, editors, 7th Int. Conf. on Logic Programming, pages 459–477. MIT Press, 1990.
C. Sakama. Extended well-founded semantics for paraconsistent logic programs. In Fifth Generation Computer Systems, pages 592–599. ICOT, 1992.
A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of ACM, pages 221–230, 1990.
G. Wagner. A database needs two kinds of negation. In B. Thalheim, J. Demetrovics, and H-D. Gerhardt, editors, MFDBS, pages 357–371. Springer-Verlag, 1991.
G. Wagner. Reasoning with inconsistency in extended deductive databases. In L. M. Pereira and A. Nerode, editors, 2nd Int. Ws. on Logic Programming and NonMonotonic Reasoning. MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alferes, J.J., Pereira, L.M. (1994). Contradiction: When avoidance equals removal Part I. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_47
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive