A generalization of collapsible cases of circumscription (Q1115424)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A generalization of collapsible cases of circumscription |
scientific article; zbMATH DE number 4085624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of collapsible cases of circumscription |
scientific article; zbMATH DE number 4085624 |
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
0 references
0.8424994
0 references
0.8241541
0 references
0.8236802
0 references
0.8202313
0 references
0 references
