A generalization of collapsible cases of circumscription (Q1115424): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0004-3702(89)90070-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049617814 / rank | |||
Normal rank | |||
Revision as of 02:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of collapsible cases of circumscription |
scientific article |
Statements
A generalization of collapsible cases of circumscription (English)
0 references
1989
0 references
Circumscription, proposed by McCarthy as a formalism intended to capture the nonmonotonicity aspects of common-sense reasoning, is a second-order formula expressing the minimality of the extension of a particular predicate or set of predicates. In many cases of interest, as for instance the case of solitary formulas, it is known that circumscription is collapsible to a first-order formula. The paper is aimed to point out a general case when circumscription is collapsible to a first-order formula, most of already known cases being special instances of it.
0 references
nonmonotonic logic
0 references
nonmonotonic reasoning
0 references
common-sense reasoning
0 references
circumscription
0 references
