scientific article; zbMATH DE number 2032416

zbMATH Open1034.68088MaRDI QIDQ4446263FDOQ4446263

Authors: Xishun Zhao 

Publication date: 2003

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

complexitydefault logicdefault reasoning with specificity

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• On the computational complexity of assumption-based argumentation for default reasoning.
• An argument-based approach to reasoning with specificity
• Logics in Artificial Intelligence
• Reinstatement and the Requirement of Maximal Specificity in Argument Systems

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)