scientific article; zbMATH DE number 97792

MaRDI QIDQ4022226zbMATH OpenFDO

Authors Ilkka Niemelä

Publication date 17 January 1993

zbMATH Keywords

autoepistemic logicautoepistemic reasoningcomputational complexitydecidabilityexpansions of premises

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other nonclassical logic (03B60) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• The complexity of reasoning for fragments of autoepistemic logic
• scientific article; zbMATH DE number 549992
• scientific article; zbMATH DE number 52991
• scientific article; zbMATH DE number 500200
• scientific article; zbMATH DE number 97788

Cited in

(8)

• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• A decision method for nonmonotonic reasoning based on autoepistemic reasoning
• On the decidability and complexity of reasoning about only knowing
• The complexity of reasoning for fragments of autoepistemic logic
• scientific article; zbMATH DE number 549992 (Why is no real title available?)
• Exploring the tractability border in epistemic tasks
• Reasoning with stratified default theories
• A uniform tableaux method for nonmonotonic modal logics

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 Q4022226)