The importance of open and recursive circumscription

Artificial Intelligence 39 (2):251-262 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Note about cardinality-based circumscription.Yves Moinard - 2000 - Artificial Intelligence 119 (1-2):259-273.
Decidability and definability with circumscription.John S. Schlipf - 1987 - Annals of Pure and Applied Logic 35 (C):173-191.
FDE Circumscription.Daniel Skurt - 2017 - Australasian Journal of Logic 14 (2).
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Max and min limiters.James Owings, William Gasarch & Georgia Martin - 2002 - Archive for Mathematical Logic 41 (5):483-495.
Stability among r.e. quotient algebras.John Love - 1993 - Annals of Pure and Applied Logic 59 (1):55-63.

Analytics

Added to PP
2020-12-22

Downloads
3 (#1,704,746)

6 months
1 (#1,479,630)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Abstract minimality and circumscription.Churn Jung Liau & Bertrand I.-Peng Lin - 1992 - Artificial Intelligence 54 (3):381-396.

Add more citations

References found in this work

Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
On the satisfiability of circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.
The mathematics of non-monotonic reasoning.Martin Davis - 1980 - Artificial Intelligence 13 (1-2):73-80.

View all 7 references / Add more references