Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
Reinhard PichlerStefan RümmeleStefan SzeiderStefan WoltranPublished in: CoRR (2012)
Keyphrases
- bounded treewidth
- answer set programming
- np complete
- constraint logic programming
- logic programs
- logic programming
- answer sets
- tractable classes
- fixed parameter tractable
- decision problems
- reasoning tasks
- answer set programs
- conjunctive queries
- constraint satisfaction problems
- boolean functions
- constraint satisfaction
- stable models
- constraint solving
- stable model semantics
- global constraints
- constraint programming
- knowledge representation
- computational problems
- data integration
- np hard
- databases