Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough.
Reinhard PichlerStefan RümmeleStefan SzeiderStefan WoltranPublished in: KR (2010)
Keyphrases
- bounded treewidth
- answer set programming
- np complete
- constraint logic programming
- logic programs
- logic programming
- answer sets
- tractable classes
- reasoning tasks
- fixed parameter tractable
- decision problems
- conjunctive queries
- relational learning
- stable model semantics
- databases
- boolean functions
- np hard
- constraint programming
- belief revision
- knowledge representation
- computational complexity
- database
- answer set programs
- stable models
- tree decomposition
- query language