Bounded treewidth as a key to tractability of knowledge representation and reasoning

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 250-256

  Gottlob, Georg ^a   Pichler, Reinhard ^a   Wei, Fang ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

NATIONAL CONFERENCE; POLYNOMIAL HIERARCHY; TREEWIDTH;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; KNOWLEDGE ACQUISITION; LOGIC PROGRAMMING; POLYNOMIALS; SOFTWARE PROTOTYPING;

KNOWLEDGE REPRESENTATION;

EID: 33750697262     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Arnborg, S.; Lagergren, J.; and Seese, D. 1991. Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2):308-340.
2. Arnborg, S. 1985. Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. BIT 25(1):2-23.
3. Baaz, M.; Egly, U.; and Leitsch, A. 2001. Normal Form Transformations. In Robinson, J. A., and Voronkov, A., eds., Handbook of Automated Reasoning, volume 1. Elsevier Science, chapter 5, 273-333.
4. Berwanger, D., and Grädel, E. 2005. Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. In Proc. LPAR 2004, volume 3452 of LNCS, 209-223.
5. Berwanger, D.; Dawar, A.; Hunter, P.; and Kreutzer, S. 2006. DAG-Width and Parity Games. In Proc. STACS 2006, LNCS.
6. Bodlaender, H. L. 1993. A tourist guide through treewidth. Acta Cybern. 11(1-2):1-22.
7. Bodlaender, H. L. 1996. A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6):1305-1317.
8. Cadoli, M., and Lenzerini, M. 1990. The Complexity of Closed World Reasoning and Circumscription. In Proc. AAAI-90, 550-555.
9. Courcelle, B. 1990. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Volume B. Elsevier Science Publishers. 193-242.
10. Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. New York: Springer.
11. p-complete. Theoretical Computer Science 114:231-245.
12. Eiter, T., and Gottlob, G. 1995a. On the Computational Cost of Disjunctive Logic Programming: Prepositional Case. Annals of Math. and Artif. Intell. 15(3/4):289-323.
13. Eiter, T., and Gottlob, G. 1995b. The Complexity of Logic-Based Abduction. J. ACM 42(1):3-42.
14. Flum, J.; Frick, M.; and Grohe, M. 2002. Query evaluation via tree-decompositions. J. ACM 49(6):716-752.
15. Gelfond, M., and Lifschitz, V. 1988. The Stable Model Semantics for Logic Programming. In Proc. ICLP/SLP, 1070-1080.
16. Gelfond, M.; Przymusinska, H.; and Przymusinski, T. C. 1989. On the Relationship Between Circumscription and Negation as Failure. Artif. Intell. 38(1):75-94.
17. Gottlob, G.; Scarcello, F.; and Sideri, M. 2002. Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. Artif. Intell. 138(1-2):55-86.
18. Klarlund, N.; Møller, A.; and Schwartzbach, M. I. 2002. MONA Implementation Secrets. International Journal of Foundations of Computer Science 13(4):571-586. World Scientific Publishing Company.
19. Earlier version in Proc. CIAA '00, LNCS vol. 2088.
20. Przymusinski, T. C. 1991. Stable Semantics for Disjunctive Programs. New Generation Comput. 9(3/4):401-424.
21. Reed, B. 1992. Finding approximate separators and computing treewdith quickly. In ACM Symposium on Theory of Computing.
22. Szeider, S. 2004. On Fixed-Parameter Tractable Parameterizations of SAT. In Proc. 6th Int. Conf. SAT 2003, Selected Revised Papers, volume 2919 of LNCS, 188-202.