Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
Reinhard PichlerStefan RümmeleStefan SzeiderStefan WoltranPublished in: Theory Pract. Log. Program. (2014)
Keyphrases
- bounded treewidth
- answer set programming
- np complete
- constraint logic programming
- logic programs
- logic programming
- answer sets
- tractable classes
- reasoning tasks
- decision problems
- fixed parameter tractable
- conjunctive queries
- boolean functions
- stable model semantics
- relational learning
- answer set programs
- np hard
- global constraints
- high level
- constraint solving
- tree decomposition
- constraint networks
- integrity constraints
- constraint satisfaction
- information extraction
- monadic datalog