The Complexity of Reasoning for Fragments of Autoepistemic Logic

DOI10.1145/2159531.2159539zbMath1352.68226OpenAlexW2404324099WikidataQ57998305 ScholiaQ57998305MaRDI QIDQ2946665

No author found.

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2523/

zbMATH Keywords

complexityautoepistemic logicnonmonotonic reasoningPost's lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Related Items (4)

Parametrised Complexity of Satisfiability in Temporal Logic ⋮ On the applicability of Post's lattice ⋮ On the parameterized complexity of non-monotonic logics ⋮ Strong Backdoors for Default Logic

This page was built for publication: The Complexity of Reasoning for Fragments of Autoepistemic Logic