Restricted default theories: expressive power and outlier detection tasks
type: Item
instance of: scholarly article
title: Restricted default theories: expressive power and outlier detection tasks
zbMATH Open document ID: 1318.68168
author: Fabrizio Angiulli
author: Rachel Ben-Eliyahu-Zohary
author: Luigi Palopoli
published in: Theoretical Computer Science
publication date: 2014-12-16T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6380852
zbMATH Keywords: default logic
zbMATH Keywords: outlier detection
zbMATH Keywords: computational complexity
zbMATH Keywords: tractable algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.11.010
OpenAlex ID: W1994969449
cites work: Q4864249
cites work: Computational properties of metaquerying problems
cites work: Outlier detection using default reasoning
cites work: Outlier detection for simple default theories
cites work: Propositional semantics for disjunctive logic programs
cites work: Yet some more complexity results for default logic
cites work: Metaqueries: Semantics, complexity, and efficient algorithms
cites work: Proof complexity of propositional default logic
cites work: The complexity of reasoning for fragments of default logic
cites work: Q4850061
cites work: Complexity Results for Nonmonotonic Logics
cites work: Q4385525
cites work: Hard problems for simple default logics
cites work: On the Parameterized Complexity of Default Logic and Autoepistemic Logic
cites work: Introduction to logic-based artificial intelligence
cites work: Q4298260
cites work: Q4224292
cites work: A logic for default reasoning
cites work: Artificial intelligence. A new synthesis
cites work: Q4713941
DOI: 10.1016/J.TCS.2014.11.010
description: scientific article; zbMATH DE number 6380852