- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Stable Model Semantics for Logic Programming
Journal of Symbolic Logic 57 (1):274-277 (1992)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Review: Michael Gelfond, Vladimir Lifschitz, Robert A. Kowalski, Kenneth A. Bowen, The Stable Model Semantics for Logic Programming; Kit Fine, Jens Erik Fenstad, Ivan T. Frolov, Risto Hilpinen, The Justification of Negation as Failure. [REVIEW]Melvin Fitting - 1992 - Journal of Symbolic Logic 57 (1):274-277.
The Refined Extension Principle for Semantics of Dynamic Logic Programming.José Júlio Alferes, Federico Banti, Antonio Brogi & João Alexandre Leite - 2005 - Studia Logica 79 (1):7-32.
A Logical Account of Formal Argumentation.Yining Wu, Martin Caminada & Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):383-403.
Logic Programming: Proceedings of the Fifth International Conference and Symposium.Robert Kowalski & Kenneth A. Bowen - 1988 - MIT Press (MA).
A game semantics for disjunctive logic programming.Thanos Tsouanas - 2013 - Annals of Pure and Applied Logic 164 (11):1144-1175.
Hybrid Probabilistic Logic Programs as Residuated Logic Programs.Carlos Damásio & Luís Pereira - 2002 - Studia Logica 72 (1):113-138.
Hybrid probabilistic logic programs as residuated logic programs.Carlos Viegas Damásio & Luís Moniz Pereira - 2002 - Studia Logica 72 (1):113 - 138.
An infinite-game semantics for well-founded negation in logic programming.Chrysida Galanaki, Panos Rondogiannis & William W. Wadge - 2008 - Annals of Pure and Applied Logic 151 (2-3):70-88.
Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski, Part I.Antonis C. Kakas & Robert Kowalski - 2002 - Springer.
How complicated is the set of stable models of a recursive logic program?W. Marek, A. Nerode & J. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):119-135.
A reductive semantics for counting and choice in answer set programming.Vladimir Lifschitz - unknown
Multiple Predicate Learning in Two Inductive Logic Programming Settings.Luc de Raedt & Nada Lavrac - 1996 - Logic Journal of the IGPL 4 (2):227-254.
Analytics
Added to PP
2015-02-06
Downloads
42 (#380,966)
6 months
6 (#530,265)
2015-02-06
Downloads
42 (#380,966)
6 months
6 (#530,265)
Historical graph of downloads
Author's Profile
Citations of this work
Bilattices are nice things.Melvin Fitting - 2006 - In T. Bolander, V. Hendricks & S. A. Pedersen (eds.), Self-Reference. CSLI Publications.
A Logical Account of Formal Argumentation.Yining Wu, Martin Caminada & Dov M. Gabbay - 2009 - Studia Logica 93 (2-3):383-403.
Recognizing Argument Types and Adding Missing Reasons.Christoph Lumer - 2019 - In Bart J. Garssen, David Godden, Gordon Mitchell & Jean Wagemans (eds.), Proceedings of the Ninth Conference of the International Society for the Study of Argumentation (ISSA). [Amsterdam, July 3-6, 2018.]. Amsterdam (Netherlands): pp. 769-777.
A QBF-based formalization of abstract argumentation semantics.Ofer Arieli & Martin W. A. Caminada - 2013 - Journal of Applied Logic 11 (2):229-252.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5ff6c685cb-9vkzx uwo