Propositional defeasible logic has linear complexity (Q4452647): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DELORES / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s1471068401001168 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109029617 / rank | |||
Normal rank | |||
Latest revision as of 10:24, 30 July 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
