On the parameterized complexity of non-monotonic logics (Q494658)
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 parameterized complexity of non-monotonic logics |
scientific article; zbMATH DE number 6477398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of non-monotonic logics |
scientific article; zbMATH DE number 6477398 |
Statements
On the parameterized complexity of non-monotonic logics (English)
0 references
1 September 2015
0 references
The paper uses the logspace version of Courcelle's theorem and parametrised complexity to obtain fixed-parameter time and space algorithms for hard questions in four non-monotonic logics, abduction, autoepistemic logic, circumscription and default logic.
0 references
abduction
0 references
autoepistemic logic
0 references
circumscription
0 references
parametrised complexity
0 references
monadic second-order logic
0 references
Courcelle's theorem
0 references
0 references
0.90004563331604
0 references
0.8224284052848816
0 references
0.8222819566726685
0 references
