Fixed-parameter tractability of disjunction-free default reasoning

DOI10.1007/BF02946660zbMath1025.68093OpenAlexW2028823236MaRDI QIDQ1400063

Zhao, Xishun, Ding, Decheng

Publication date: 13 August 2003

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02946660

zbMATH Keywords

disjunction-free default reasoning

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (2)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ On the parameterized complexity of non-monotonic logics

Cites Work

• Formalizing nonmonotonic reasoning systems
• On the relation between default and autoepistemic logic
• A logic for default reasoning
• A graph-theoretic approach to default logic
• Is intractability of nonmonotonic reasoning a real drawback?
• More on representation theory for default logic
• Tractable reasoning in artificial intelligence
• Propositional semantics for disjunctive logic programs
• A skeptical theory of inheritance in nonmonotonic semantic networks
• Complexity Results for Nonmonotonic Logics
• A survey of complexity results for non-monotonic logics
• Computing large and small stable models
• Constraints on extensions of a default theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed-parameter tractability of disjunction-free default reasoning