On the complexity of extension checking in default logic (Q844157)
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 complexity of extension checking in default logic |
scientific article; zbMATH DE number 5659903
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of extension checking in default logic |
scientific article; zbMATH DE number 5659903 |
Statements
On the complexity of extension checking in default logic (English)
0 references
18 January 2010
0 references
default logic
0 references
knowledge representation
0 references
computational complexity
0 references
0.8975215
0 references
0.89219743
0 references
0 references
0.88301533
0 references
0.88301533
0 references
0.8761657
0 references
0.8761657
0 references
