On the parameterized complexity of non-monotonic logics

DOI10.1007/s00153-015-0435-xzbMath1361.03036WikidataQ57998282 ScholiaQ57998282MaRDI QIDQ494658

Yong-Cai Geng, Sumit K. Garg

Publication date: 1 September 2015

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-015-0435-x

zbMATH Keywords

monadic second-order logic; autoepistemic logic; abduction; circumscription; Courcelle's theorem; parametrised complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03B60: Other nonclassical logic

03B42: Logics of knowledge and belief (including belief change)

03D15: Complexity of computation (including implicit computational complexity)