Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning.
Georg GottlobReinhard PichlerFang WeiPublished in: AAAI (2006)
Keyphrases
- knowledge representation and reasoning
- bounded treewidth
- np complete
- artificial intelligence
- tractable cases
- reasoning systems
- knowledge representation
- tractable classes
- monadic datalog
- logic programming
- description logics
- incomplete information
- automated reasoning
- dynamic environments
- constraint satisfaction
- np hard
- computational complexity
- reinforcement learning
- machine learning