Abstract
We address the issue of the syntactical assymetry of logic programs: can one allow default negated literals in the heads? This issue has been resolved positively, with full generality for the Stable Models based Answer Sets Semantics and, more recently, for the Well-founded Model based Static Semantics, for a wide class of programs. The work by Jonker also explores this issue for IMEX semantics.
Here we examine one possible reading for default negation in the heads, and show how it is captured by our paraconsistent Well-founded Semantics with Explicit Negation, WFSX p, through the use of a suitable program transformation, without thus requiring any new fixpoint semantics. Furthermore, we extensively compare the three above mentioned approaches to our own.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. J. Alferes, C. V. Damásio, and L. M. Pereira. A logic programming system for non-monotonic reasoning. Journal of Automated Reasoning, 14(1):93–147, 1995.
J. J. Alferes and L. M. Pereira. On logic program semantics with two kinds of negation. In K. Apt, editor, Joint International Conference and Symposium on Logic Programming, pages 574–588, Washington, USA, November 1992. MIT Press.
J. J. Alferes and L. M. Pereira. Belief, provability and logic programs. Journal of Applied Non-Classical Logics. Logics in AI. A selection of extended versions of JELIA '94 papers, 5(1), 1995.
J. J. Alferes and L. M. Pereira. Reasoning with Logic Programming. Springer-Verlag, 1996. In print.
J. J. Alferes, L. M. Pereira, and T. C. Przymusinski. Belief revision in non-monotonic reasoning. In C. Pinto-Ferreira and N. J. Mamede, editors, Proc. EPIA '95, LNAI 990, pages 41–56, 1995.
J. J. Alferes, L. M. Pereira, and T. C. Przymusinski. “classical” negation in non-monotonic reasoning and logic programming. In AI & Math'96, 1996. To appear. Extended version available as technical report.
J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, XXII(3):227–255, 1995.
J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257–288, 1995.
J. Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In A. Fuhrmann and H. Rott, editors, Logic, Action and Information. Proceedings of the Konstanz Colloquium in Logic and Information (LogIn '92), pages 241–329. DeGruyter, 1995.
M. V. Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 4(23):733–742, 1976.
A. V. Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, 1991.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. A. Bowen, editors, ICLP'88, pages 1070–1080, 1988.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Warren and Szeredi, editors, ICLP'90, pages 579–597. MIT Press, 1990.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.
K. Inoue and C. Sakama. On positive occurrences of negation as failure. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proc. KR'94, pages 293–304. Morgan-Kaufmann, 1994.
C. Jonker. Constraints and Negations in Logic Programming. PhD thesis, Department of Philosophy-Utrecht University, September 1994.
V. Lifschitz. Minimal belief and negation as failure. Technical report, Department of Computer Science and Department of Philisophy, University of Texas at Austin, 1992.
V. Lifschitz and T. C. Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Representation and Reasoninng: Proceedinsg of the Third International Conference (KR'92), pages 603–614. Morgan-Kaufmann, 1992.
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 Conference on Artificial Intelligence, pages 102–106, Wien, Austria, August 1992. John Wiley & Sons.
T. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Warren and Szeredi, editors, 7th International Conference on Logic Programming, pages 459–477. MIT Press, 1990.
T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 14:323–357, 1995.
G. Wagner. A database needs two kinds of negation. In B. Thalheim, J. Demetrovics, and H.-D. Gerhardt, editors, Mathematical Foundations of Database Systems, pages 357–371. LNCS 495, Springer-Verlag, 1991.
G. Wagner. Vivid logic: Knowledge-based reasoning with two kinds of negation. Lecture Notes on Artificial Intelligence, 764, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag
About this paper
Cite this paper
Damásio, C.V., Pereira, L.M. (1996). Default negated conclusions: Why not?. In: Dyckhoff, R., Herre, H., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1996. Lecture Notes in Computer Science, vol 1050. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60983-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-60983-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60983-4
Online ISBN: 978-3-540-49751-6
eBook Packages: Springer Book Archive