The complexity of circumscriptive inference in Post's lattice (Q692903)
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: The complexity of circumscriptive inference in Post's lattice |
scientific article; zbMATH DE number 6113530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of circumscriptive inference in Post's lattice |
scientific article; zbMATH DE number 6113530 |
Statements
The complexity of circumscriptive inference in Post's lattice (English)
0 references
6 December 2012
0 references
circumscription
0 references
complexity theory
0 references
nonmonotonic reasoning
0 references
Post's lattice
0 references
0 references
0.999060034751892
0 references
0.865273118019104
0 references
0.8595897555351257
0 references
