On the computational complexity of assumption-based argumentation for default reasoning.
Yannis DimopoulosBernhard NebelFrancesca ToniPublished in: Artif. Intell. (2002)
Keyphrases
- default reasoning
- computational complexity
- belief revision
- nonmonotonic reasoning
- default logic
- conditional logic
- proof theory
- special case
- dependency directed backtracking
- closed world reasoning
- probabilistic logic
- argumentation systems
- probabilistic reasoning
- default rules
- np complete
- np hard
- partial order
- proof theoretic
- machine learning
- model theoretic
- logic programming
- software engineering
- data model
- artificial intelligence