Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Yet some more complexity results for default logic

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

DOI10.1016/S0004-3702(02)00189-3zbMath1013.03025OpenAlexW2041487507MaRDI QIDQ1606113

Rachel Ben-Eliyahu-Zohary

Publication date: 31 July 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00189-3


zbMATH Keywords

default logicnonmonotonic reasoningcomplexity classes


Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (4)

Outlier detection for simple default theories ⋮ Rule Calculus: Semantics, Axioms and Applications ⋮ Restricted default theories: expressive power and outlier detection tasks ⋮ The Complexity of Reasoning for Fragments of Default Logic



Cites Work

  • Formalizing nonmonotonic reasoning systems
  • A theory of diagnosis from first principles
  • A logic for default reasoning
  • Hard problems for simple default logics
  • Default reasoning using classical logic
  • Complexity Results for Nonmonotonic Logics
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Yet some more complexity results for default logic

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1606113&oldid=13908844"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki