Tractable answer-set programming with weight constraints: bounded treewidth is not enough
- 17 July 2012
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 14 (2) , 141-164
Abstract
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks related to programs with cardinality or weight constraints – like checking the consistency of a program – are intractable. Many intractable problems in the area of knowledge representation and reasoning have been shown to become linear time tractable if the treewidth of the programs or formulas under consideration is bounded by some constant. The goal of this paper is to apply the notion of treewidth to programs with cardinality or weight constraints and to identify tractable fragments. It will turn out that the straightforward application of treewidth to such class of programs does not suffice to obtain tractability. However, by imposing further restrictions, tractability can be achieved.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Bounded treewidth as a key to tractability of knowledge representation and reasoningArtificial Intelligence, 2010
- Combinatorial Optimization on Graphs of Bounded TreewidthThe Computer Journal, 2007
- Safe Reduction Rules for Weighted TreewidthAlgorithmica, 2007
- Invitation to Fixed-Parameter Algorithms2006
- Safe separators for treewidthDiscrete Mathematics, 2006
- Treewidth: Computational ExperimentsElectronic Notes in Discrete Mathematics, 2001
- Parameterized Complexity1999
- Stable Models and an Alternative Logic Programming Paradigm1999
- The Logic Programming Paradigm1999
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996