The complexity of propositional closed world reasoning and circumscription (Q1329160)
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 propositional closed world reasoning and circumscription |
scientific article; zbMATH DE number 598091
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of propositional closed world reasoning and circumscription |
scientific article; zbMATH DE number 598091 |
Statements
The complexity of propositional closed world reasoning and circumscription (English)
0 references
13 February 1995
0 references
computational complexity
0 references
nonmonotonic inheritance
0 references
diagnosis
0 references
default reasoning
0 references
0 references
