Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 2032416

From MaRDI portal
Publication:4446263
Jump to:navigation, search

zbMATH Open1034.68088MaRDI QIDQ4446263FDOQ4446263


Authors: Xishun Zhao Edit this on Wikidata


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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4446263&oldid=18498939"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 04:22. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki