On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth.
Igor RazgonPublished in: Algorithmica (2016)
Keyphrases
- bounded treewidth
- monadic datalog
- np complete
- highly parallelizable
- decision problems
- bounded degree
- conjunctive queries
- conjunctive normal form
- polynomial size
- database
- relational learning
- satisfiability problem
- search algorithm
- domain knowledge
- np hard
- xml documents
- fixed parameter tractable
- database systems
- databases