The mathematics of inheritance systems
The mathematics of inheritance systems
On the relation between default and autoepistemic logic
Artificial Intelligence
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
A graph-theoretic approach to default logic
Information and Computation
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
Computing large and small stable models
Proceedings of the 1999 international conference on Logic programming
Constraints on extensions on a default theory
Journal of Computer Science and Technology
Tractable Reasoning in Artificial Intelligence
Tractable Reasoning in Artificial Intelligence
Reasoning with Incomplete Information
Reasoning with Incomplete Information
More on representation theory for default logic
Information and Computation
Complexity results for restricted credulous default reasoning
AI Communications
Complexity Results for 2CNF Default Theories
Fundamenta Informaticae
Parameterized Complexity
| Hi-index | 0.00 |
In this paper, the parameter which is the source of the complexity of disjunction-free default reasoning is determined. It is shown that when the value of this parameter is fixed, the disjunction-free default reasoning can be solved in time bounded by a polynomial whose degree does not depend on the parameter. Consequently, disjunction-free default reasoning is fixed parameter tractable.