Restricted default theories: expressive power and outlier detection tasks
From MaRDI portal
Publication:483301
DOI10.1016/J.TCS.2014.11.010zbMATH Open1318.68168OpenAlexW1994969449MaRDI QIDQ483301FDOQ483301
Authors: Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luigi Palopoli 
Publication date: 16 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.010
Recommendations
Cites Work
- Propositional semantics for disjunctive logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logic for default reasoning
- Complexity Results for Nonmonotonic Logics
- Hard problems for simple default logics
- Yet some more complexity results for default logic
- Outlier detection using default reasoning
- Introduction to logic-based artificial intelligence
- Artificial intelligence. A new synthesis
- On the Parameterized Complexity of Default Logic and Autoepistemic Logic
- The complexity of reasoning for fragments of default logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational properties of metaquerying problems
- Outlier detection for simple default theories
- Proof complexity of propositional default logic
- Metaqueries: Semantics, complexity, and efficient algorithms
Cited In (2)
This page was built for publication: Restricted default theories: expressive power and outlier detection tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483301)
