Circumscription and implicit definability (Q1819950): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00244277 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2032362523 / rank | |||
Normal rank |
Latest revision as of 10:11, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Circumscription and implicit definability |
scientific article |
Statements
Circumscription and implicit definability (English)
0 references
1985
0 references
We explore some connections between the technique of circumscription in artificial intelligence and the notion of implicit definition in mathematical logic. Implicit definition can be taken as the informal intent, but not necessarily the formal result, of circumscription. This raises some questions for logical theory and suggests some implications for artificial intelligence practice. The principal implication is that when circumscription ''works'' its conclusions can be explicitly described.
0 references
circumscription
0 references
implicit definition
0 references
Beth's theorem
0 references
artificial intelligence
0 references
non-monotonic reasoning
0 references