Fixed-parameter tractability of disjunction-free default reasoning
type: Item
instance of: scholarly article
title: Fixed-parameter tractability of disjunction-free default reasoning
zbMATH Open document ID: 1025.68093
DOI: 10.1007/BF02946660
published in: Journal of Computer Science and Technology
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 1963351
zbMATH Keywords: disjunction-free default reasoning
author: Xishun Zhao
author: Decheng Ding
MaRDI profile type: Publication
cites work: Q4503944
cites work: Q4955325
cites work: Computing large and small stable models
cites work: A logic for default reasoning
cites work: Constraints on extensions of a default theory
cites work: More on representation theory for default logic
cites work: Complexity Results for Nonmonotonic Logics
cites work: A survey of complexity results for non-monotonic logics
cites work: Propositional semantics for disjunctive logic programs
cites work: Tractable reasoning in artificial intelligence
cites work: Is intractability of nonmonotonic reasoning a real drawback?
cites work: A graph-theoretic approach to default logic
cites work: A skeptical theory of inheritance in nonmonotonic semantic networks
cites work: Complexity results for restricted credulous default reasoning
cites work: Complexity results for 2CNF default theories
cites work: Formalizing nonmonotonic reasoning systems
cites work: Q3992826
cites work: On the relation between default and autoepistemic logic
full work available at URL: https://doi.org/10.1007/bf02946660
OpenAlex ID: W2028823236
Recommended article: The complexity of default reasoning under the stationary fixed point semantics
Recommended article: Default reasoning from conditional knowledge bases: Complexity and tractable cases
Recommended article: The complexity of reasoning for fragments of default logic
Recommended article: The Complexity of Reasoning for Fragments of Default Logic
Recommended article: Consequence-based and fixed-parameter tractable reasoning in description logics
Recommended article: Complexity results for restricted credulous default reasoning
Recommended article: On the Parameterized Complexity of Default Logic and Autoepistemic Logic
Recommended article: Q5186763
Recommended article: Towards fixed-parameter tractable algorithms for abstract argumentation
description: scientific article; zbMATH DE number 1963351