Monadic Second Order Finite Satisfiability and Unbounded Tree-Width.
Tomer KotekHelmut VeithFlorian ZulegerPublished in: CSL (2016)
Keyphrases
- tree width
- tree decomposition
- structural properties
- constraint networks
- conjunctive queries
- np complete
- higher order
- shortest path
- deductive databases
- computational complexity
- probabilistic reasoning
- datalog programs
- decomposition method
- exact and approximate
- computationally challenging
- constraint satisfaction problems
- conditional probabilities
- parallel processing