A note on the stable model semantics for logic programs

Artificial Intelligence 96 (2):467-479 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(97)00058-1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

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.
The Refined Extension Principle for Semantics of Dynamic Logic Programming.Joao Alexandre Leite - 2005 - Studia Logica 79 (1):7-32.
A game semantics for disjunctive logic programming.Thanos Tsouanas - 2013 - Annals of Pure and Applied Logic 164 (11):1144-1175.
Twelve definitions of a stable model.Vladimir Lifschitz - unknown
Hybrid Probabilistic Logic Programs as Residuated Logic Programs.Carlos Damásio & Luís 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.
Hybrid probabilistic logic programs as residuated logic programs.Carlos Viegas Damásio & Luís Moniz Pereira - 2002 - Studia Logica 72 (1):113 - 138.
Revision algebra semantics for conditional logic.John Pais - 1992 - Studia Logica 51 (2):279 - 316.
A general theory of confluent rewriting systems for logic programming and its applications.Jürgen Dix, Mauricio Osorio & Claudia Zepeda - 2001 - Annals of Pure and Applied Logic 108 (1-3):153-188.
An argument game for stable semantics.Martin Caminada & Yining Wu - 2008 - Logic Journal of the IGPL 17 (1):77-90.
Stratified, Weak Stratified, and Three-valued Semantics.Melvin Fitting & Marion Ben-Jacob - unknown
Interpretations of intuitionist logic in non-normal modal logics.Colin Oakes - 1999 - Journal of Philosophical Logic 28 (1):47-60.
The Stable Model Semantics for Logic Programming.Melvin Fitting - 1992 - Journal of Symbolic Logic 57 (1):274-277.
Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15.
Modeling the suppression task under weak completion and well-founded semantics.Emmanuelle-Anna Dietz, Steffen Hölldobler & Christoph Wernhard - 2014 - Journal of Applied Non-Classical Logics 24 (1-2):61-85.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,815,597)

6 months
2 (#1,250,897)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
A logical framework for default reasoning.David Poole - 1988 - Artificial Intelligence 36 (1):27-47.
A comparative study of open default theories.Michael Kaminski - 1995 - Artificial Intelligence 77 (2):285-319.

Add more references