Complexity results for restricted credulous default reasoning

Authors:
Xishun Zhao;Decheng Ding;Hans Kleine Büning
Affiliations:
Dept. of Math., Henan Normal Univ., Xinxiang 453002, P.R. China, zxsy@public.xxptt.ha.cn and Dept. of Math. and Comp. Sci., Paderborn Univ., 33095 Paderborn, Germany, kbcsl@uni‐ ...;Department of Mathematics, Nanjing University, Nanjing 210093, P.R. China E‐mail: dcding@netra.nju.edu.cn;Department of Mathematics and Computer Science, Paderborn University, 33095 Paderborn, Germany E‐mail: kbcsl@uni‐paderborn.de
Venue:
AI Communications
Year:
2000

Citing 5
Cited 9

Hard problems for simple default logics

Artificial Intelligence - Special issue on knowledge representation
A graph-theoretic approach to default logic

Information and Computation
Introduction to Default Logic

Introduction to Default Logic
Reasoning with Incomplete Information

Reasoning with Incomplete Information
Propositional Logic: Deduction and Algorithms

Propositional Logic: Deduction and Algorithms

Yet some more complexity results for default logic

Artificial Intelligence
Complexity of argument-based default reasoning with specificity

AI Communications
Fixed-parameter tractability of disjunction-free default reasoning

Journal of Computer Science and Technology
Regular disjunction-free default theories

Journal of Computer Science and Technology
Complexity of argument-based default reasoning with specificity

AI Communications
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems

Fundamenta Informaticae
Complexity of the Unique Extension Problem in Default Logic

Fundamenta Informaticae
Complexity of the Unique Extension Problem in Default Logic

Fundamenta Informaticae
Some Algorithms for Extension Computation of Nonmonotonic Rule Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concentrates on the complexity of the decision problem deciding whether a literal belongs to at least one extension of a default theory 〈D,W〉 in which D is a set of Horn defaults and W is a definite Horn formula or a Bi‐Horn formula.