On the Parameterized Complexity of Default Logic and Autoepistemic Logic

DOI10.1007/978-3-642-28332-1_33zbMath1351.68120arXiv1110.0623OpenAlexW2113132662WikidataQ57998309 ScholiaQ57998309MaRDI QIDQ2890211

No author found.

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0623

Mathematics Subject Classification ID

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

Related Items (3)

Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Restricted default theories: expressive power and outlier detection tasks ⋮ Parameterized Complexity of CTL

This page was built for publication: On the Parameterized Complexity of Default Logic and Autoepistemic Logic