A generalization of collapsible cases of circumscription

Artificial Intelligence 38 (1):111-117 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,337

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

Circumscription.Manfred Jaeger - 1993 - Artificial Intelligence 60 (2):293-301.
On the satisfiability of circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.
Abstract minimality and circumscription.Churn Jung Liau & Bertrand I.-Peng Lin - 1992 - Artificial Intelligence 54 (3):381-396.
History of circumscription.John McCarthy - 1993 - Artificial Intelligence 59 (1-2):23-26.
Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.
Loop formulas for circumscription.Joohyung Lee & Fangzhen Lin - 2006 - Artificial Intelligence 170 (2):160-185.
A theorem on the consistency of circumscription.Peter L. Mott - 1987 - Artificial Intelligence 31 (1):87-98.
Completeness results for circumscription.Donald Perlis & Jack Minker - 1986 - Artificial Intelligence 28 (1):29-42.
The expressive power of circumscription.Tom Costello - 1998 - Artificial Intelligence 104 (1-2):313-329.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,637,090)

6 months
5 (#1,039,842)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Circumscription.Manfred Jaeger - 1993 - Artificial Intelligence 60 (2):293-301.
An extension of pointwise circumscription.Koji Iwanuma & Kazuhiko Oota - 1996 - Artificial Intelligence 86 (2):391-402.

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.

Add more references