Computer Science – Logic in Computer Science
Scientific paper
2012-04-13
Computer Science
Logic in Computer Science
Under consideration for publication in Theory and Practice of Logic Programming
Scientific paper
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.
Pichler Reinhard
Rümmele Stefan
Szeider Stefan
Woltran Stefan
No associations
LandOfFree
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-144474