scientific article; zbMATH DE number 2032416

MaRDI QIDQ4446263zbMATHFDO

Authors Xishun Zhao

Publication date 2003

zbMATH Keywords

complexitydefault logicdefault reasoning with specificity

Mathematics Subject Classification ID

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

Recommendations

• On the computational complexity of assumption-based argumentation for default reasoning.
• Hard problems for simple default logics
• Publication:3493327
• scientific article; zbMATH DE number 4106303
• The Complexity of Reasoning for Fragments of Default Logic

Cited in

(5)

• On the computational complexity of assumption-based argumentation for default reasoning.
• Logics in Artificial Intelligence
• scientific article; zbMATH DE number 4106303 (Why is no real title available?)
• Reinstatement and the Requirement of Maximal Specificity in Argument Systems
• An argument-based approach to reasoning with specificity

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