The complexity of default reasoning under the stationary fixed point semantics

DOI10.1006/inco.1995.1124zbMath0832.68097OpenAlexW2007660757WikidataQ59259762 ScholiaQ59259762MaRDI QIDQ1898114

Georg Gottlob

Publication date: 20 February 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1124

zbMATH Keywords

Reiter's default logiccautious reasoning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55)

Related Items

Reasoning with power defaults, The complexity class θp2: Recent results and applications in AI and modal logic, Semantics and complexity of abduction from default theories, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, On the computational complexity of assumption-based argumentation for default reasoning., Propositional default logics made easier: computational complexity of model checking.