Restricted default theories: expressive power and outlier detection tasks

DOI10.1016/j.tcs.2014.11.010zbMath1318.68168OpenAlexW1994969449MaRDI QIDQ483301

Luigi Palopoli, Rachel Ben-Eliyahu-Zohary, Fabrizio Angiulli

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

zbMATH Keywords

computational complexitydefault logicoutlier detectiontractable algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outlier detection for simple default theories
• Proof complexity of propositional default logic
• Metaqueries: Semantics, complexity, and efficient algorithms
• A logic for default reasoning
• Hard problems for simple default logics
• Yet some more complexity results for default logic
• Propositional semantics for disjunctive logic programs
• Outlier detection using default reasoning
• On the Parameterized Complexity of Default Logic and Autoepistemic Logic
• The complexity of reasoning for fragments of default logic
• Complexity Results for Nonmonotonic Logics
• Computational properties of metaquerying problems

This page was built for publication: Restricted default theories: expressive power and outlier detection tasks