Bounded treewidth as a key to tractability of knowledge representation and reasoning
<p>Several forms of reasoning in AI – like abduction, closed world reasoning, circumscription, and disjunctive logic programming – are well known to be intractable. In fact, many of the relevant problems are on the second or third level of the polynomial hierarchy. In this paper, we show how t...
| Main Authors: | , , |
|---|---|
| 格式: | Journal article |
| 語言: | English |
| 出版: |
Elsevier
2010
|
| 主題: |