On the equivalence of semantics for normal logic programs
- 1 March 1995
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 22 (3) , 211-222
- https://doi.org/10.1016/0743-1066(94)00023-y
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A three-valued semantics for deductive databases and logic programsJournal of Computer and System Sciences, 1994
- The alternating fixpoint of logic programs with negationJournal of Computer and System Sciences, 1993
- Skeptical reason maintenance and belief revisionArtificial Intelligence, 1993
- Dualities between alternative semantics for logic programming and nonmonotonic reasoningJournal of Automated Reasoning, 1993
- Short note preferred extensions are partial stable modelsThe Journal of Logic Programming, 1992
- Stable and extension class theory for logic programs and default logicsJournal of Automated Reasoning, 1992
- Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. Logic programming, Proceedings of the fifth international conference and symposium, Volume 2, edited by Robert A. Kowalski and Kenneth A. Bowen, Series in logic programming, The MIT Press, Cambridge, Mass., and London, 1988, pp. 1070–1080. - Kit Fine. The justification of negation as failure. Logic, methodology and philosophy of science VIII, Proceedings of the Eighth International Congress of Logic, Methodology and Philosophy of Science, Moscow, 1987, edited by Jens Erik Fenstad, Ivan T. Frolov, and Risto Hilpinen, Studies in logic and the foundations of mathematics, vol. 126, North-Holland, Amsterdam etc. 1989, pp. 263–301.The Journal of Symbolic Logic, 1992
- Well-Founded Semantics Coincides with Three-Valued Stable Semantics1Fundamenta Informaticae, 1990
- Unfounded sets and well-founded semantics for general logic programsPublished by Association for Computing Machinery (ACM) ,1988