Journal article
Default Reasoning from Conditional Knowledge Bases: Complexity and Tractable Cases
- Abstract:
-
Such rules may have exceptions, which can be handled in different ways. A number of entailment semantics for conditional knowledge bases have been proposed in the literature. However, while the semantic properties and interrelationships of these formalisms are quite well understood, about their computational properties only partial results are known so far. In this paper, we fill these gaps and first draw a precise picture of the complexity of default reasoning from conditional knowledge b...
Expand abstract
Actions
Authors
Bibliographic Details
- Journal:
- Artificial Intelligence
- Volume:
- 124
- Issue:
- 2
- Pages:
- 169-241
- Publication date:
- 2000-12-01
Item Description
- UUID:
-
uuid:3d973005-1478-44a7-8f13-6177c8745e77
- Local pid:
- cs:4668
- Deposit date:
- 2015-03-31
Terms of use
- Copyright date:
- 2000
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record