The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs.
Tamás BallaCsaba BiróGábor KusperPublished in: ICAI (2020)
Keyphrases
- directed graph
- sat problem
- satisfiability problem
- constraint satisfaction problems
- np complete
- sat solvers
- phase transition
- random walk
- boolean satisfiability
- sat instances
- randomly generated
- max sat
- sat solving
- propositional satisfiability
- davis putnam
- stochastic local search
- decision problems
- directed acyclic graph
- backtracking search
- graph structure
- constraint satisfaction
- undirected graph
- np hard
- strongly connected
- branch and bound
- search algorithm
- combinatorial problems
- temporal logic
- orders of magnitude
- sufficient conditions
- probabilistic planning
- computational complexity
- optimal solution