Propositional defeasible logic has linear complexity (Q4452647)
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: Propositional defeasible logic has linear complexity |
scientific article; zbMATH DE number 2048623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Propositional defeasible logic has linear complexity |
scientific article; zbMATH DE number 2048623 |
Statements
Propositional defeasible logic has linear complexity (English)
0 references
1 March 2004
0 references
nonmonotonic logic
0 references
computational complexity
0 references
0.8283902406692505
0 references
0.7995648384094238
0 references
