Stable models and circumscription

Artificial Intelligence 175 (1):236-263 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,252

External links

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

Through your library

Similar books and articles

Honesty in partial logic.Wiebe Hoek, Jan Jaspars & Elias Thijsse - 1996 - Studia Logica 56 (3):323-360.
Decidability and definability with circumscription.John S. Schlipf - 1987 - Annals of Pure and Applied Logic 35 (C):173-191.
On the satisfiability of circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.
FDE Circumscription.Daniel Skurt - 2017 - Australasian Journal of Logic 14 (2).
Closed-world databases and circumscription.Vladimir Lifschitz - 1985 - Artificial Intelligence 27 (2):229-235.
An Old Friend Revisited: Countable Models of ω-Stable Theories.Michael C. Laskowski - 2007 - Notre Dame Journal of Formal Logic 48 (1):133-141.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,081,857)

6 months
10 (#226,679)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.

View all 7 references / Add more references