Tractable answer-set programming with weight constraints: Bounded treewidth is not enough

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2010, Pages 508-517

  Pichler, Reinhard ^a   Rümmele, Stefan ^a   Szeider, Stefan ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; BOUNDED TREEWIDTH; CARDINALITIES; CARDINALITY CONSTRAINTS; KNOWLEDGE REPRESENTATION AND REASONING; TREE-WIDTH; WEIGHT CONSTRAINTS;

KNOWLEDGE REPRESENTATION;

EID: 78049355536     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bodlaender, H. L., and Koster, A. M. C. A. 2006. Safe separators for treewidth. Discrete Mathematics 306(3):337- 350.
2. Bodlaender, H. L., and Koster, A. M. C. A. 2008. Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3):255-269.
3. Bodlaender, H. L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6):1305-1317.
4. Courcelle, B. 1987. Recognizability and second-order definability for sets of finite graphs. Technical Report I-8634, Université de Bordeaux.
5. Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. Springer Verlag.
6. Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory. Springer Verlag.
7. Gottlob, G.; Pichler, R.; and Wei, F. 2006. Bounded treewidth as a key to tractability of knowledge representation and reasoning. In Proc. AAAI'06, 250-256.
8. Jakl, M.; Pichler, R.; and Woltran, S. 2009. Answer-set programming with bounded treewidth. In Proc. IJCAI'09, 816-822.
9. Kloks, T. 1994. Treewidth, Computations and Approximations. Springer Verlag.
10. Koster, A. M. C. A.; Bodlaender, H. L.; and van Hoesel, S. P. M. 2001. Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics 8:54-57.
11. Liu, G. 2009. Level mapping induced loop formulas for weight constraint and aggregate programs. In Proc. LPNMR' 09, volume 5753 of LNCS, 444-449. Springer.
12. Marek, V. W., and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective, 375- 398. Springer.
13. Niedermeier, R. 2006. Invitation to Fixed-Parameter Algorithms. Oxford University Press.
14. Niemelä, I.; Simons, P.; and Soininen, T. 1999. Stable model semantics of weight constraint rules. In Proc. LPNMR'99, volume 1730 of LNCS, 317-331. Springer.
15. Szeider, S. 2008a. Monadic second order logic on graphs with local cardinality constraints. In Proc. MFCS'08, volume 5162 of LNCS, 601-612. Springer.
16. Szeider, S. 2008b. Not so easy problems for tree decomposable graphs (invited talk). In Proc. ICDM'08, 2nd International Conference on Discrete Mathematics, 161-171.
17. van den Eijkhof, F.; Bodlaender, H. L.; and Koster, A. M. C. A. 2007. Safe reduction rules for weighted treewidth. Algorithmica 47(2):139-158.