Bounded treewidth as a key to tractability of knowledge representation and reasoning.
Georg GottlobReinhard PichlerFang WeiPublished in: Artif. Intell. (2010)
Keyphrases
- knowledge representation and reasoning
- bounded treewidth
- np complete
- tractable cases
- knowledge representation
- logic programming
- artificial intelligence
- description logics
- reasoning systems
- automated reasoning
- incomplete information
- monadic datalog
- computational complexity
- conjunctive queries
- logic programs
- constraint satisfaction problems
- expert systems
- knowledge base
- data mining
- object oriented
- decision problems
- np hard
- machine learning
- databases