On the computability of circumscription (Q1098651)
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: On the computability of circumscription |
scientific article; zbMATH DE number 4039347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computability of circumscription |
scientific article; zbMATH DE number 4039347 |
Statements
On the computability of circumscription (English)
0 references
1988
0 references
first-order logic
0 references
second-order logic
0 references
nonmonotonic reasoning
0 references
Turing machine
0 references
computability
0 references
circumscription
0 references
undecidability
0 references
minimal models
0 references
