A Tree Decomposition Based Approach to Solve Structured SAT Instances.
Djamal HabetLionel ParisCyril TerriouxPublished in: ICTAI (2009)
Keyphrases
- tree decomposition
- sat instances
- tree width
- constraint networks
- branch and bound
- decomposition method
- satisfiability problem
- probabilistic reasoning
- sat solvers
- parallel processing
- randomly generated
- sat problem
- answer set programming
- branch and bound algorithm
- decomposition methods
- knowledge representation
- combinatorial optimization
- orders of magnitude
- constraint satisfaction problems