Abstract
This paper is the continuation of [1] in this volume. There we present a sceptical semantics which avoids contradiction for extended logic programs plus integrity contraints in the form of denials, based on the notion of optative hypotheses -an abductive approach. In this part we define a program revision method for removing contradiction from contradictory programs under WFSX, based on the notion of revisable hypotheses -a belief revision approach- and show the equivalence between the contradiction avoidance semantics and the WFSX of revised programs obtained by contradiction removal.
The motivation, as well as some preliminary definitions can be found in [1]. Proofs of all theorems are omitted for brevity, but exist in an extended version of this work.
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 and L. M. Pereira. Contradiction: when avoidance equal removal. Part I. In R. Dyckhoff, editor, 4th Int. Ws. on Extensions of Logic Programming, 1993.
José Júlio Alferes. Semantics of Logic Programs with Explicit Negation. PhD thesis, Universidade Nova de Lisboa, October 1993.
W. Chen and D. H. D. Warren. A goal-oriented approach to computing wellfounded semantics. In K. Apt, editor, Int. Joint Conf. and Symp. on Logic Programming, pages 589–603. MIT Press, 1992.
K. Eshghi and R. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, 6th Int. Conf. on Logic Programming. MIT Press, 1989.
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, J. J. Alferes, and J. N. Aparício. Contradiction Removal within Well Founded Semantics. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and NonMonotonic Reasoning, pages 105–119. MIT Press, 1991.
L. M. Pereira, J. J. Alferes, and J. N. Aparício. The extended stable models of contradiction removal semantics. In P. Barahona, L. M. Pereira, and A. Porto, editors, 5th Portuguese AI Conf. Springer-Verlag, 1991.
L. M. Pereira, J. J. Alferes, and J. N. Aparício. Contradiction removal semantics with explicit negation. In Applied Logic Conf. ILLC, Amsterdam, 1992.
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. A derivation procedure for extended stable models. In Int. Joint Conf. on AI. Morgan Kaufmann Publishers, 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 and M. Calejo. A framework for Prolog debugging. In R. Kowalski, editor, 5th Int. Conf. on Logic Programming. MIT Press, 1988.
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.
T. Przymusinski. Every logic program has a natural stratification and an iterated fixed point model. In 8th Symp. on Principles of Database Systems. ACM SIGACT-SIGMOD, 1989.
R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57–96, 1987.
D.S. Warren. The XWAM: A machine that integrates prolog and deductive databases. Technical report, SUNY at Stony Brook, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pereira, L.M., Alferes, J.J. (1994). Contradiction: When avoidance equals removal Part II. 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_61
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_61
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