scientific article; zbMATH DE number 97788

MaRDI QIDQ4022222zbMATH OpenFDO

Authors Thomas Eiter, Georg Gottlob

Publication date 17 January 1993

zbMATH Keywords

autoepistemic reasoningexpansionsnonmonotonic reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• The complexity of reasoning for fragments of autoepistemic logic
• scientific article; zbMATH DE number 549992
• The complexity of theorem proving in autoepistemic logic
• Autoepistemic logic

Cited in

(6)

• Hyperequivalence of logic programs with respect to supported models
• Semantics and complexity of abduction from default theories
• On the computational complexity of assumption-based argumentation for default reasoning.
• On the computational cost of disjunctive logic programming: Propositional case
• On the decidability and complexity of reasoning about only knowing
• scientific article; zbMATH DE number 97792 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022222)