Propositional defeasible logic has linear complexity (Q4452647): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DELORES / rank | |||
Normal rank | |||
Revision as of 20:10, 29 February 2024
scientific article; zbMATH DE number 2048623
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
