Tighter Connections Between Formula-SAT and Shaving Logs.
Amir AbboudKarl BringmannPublished in: CoRR (2018)
Keyphrases
- propositional formulas
- boolean formula
- satisfiability problem
- sat solvers
- upper bound
- random sat
- lower bound
- sat problem
- unit propagation
- propositional satisfiability
- max sat
- cnf formula
- phase transition
- boolean satisfiability
- search algorithm
- conjunctive normal form
- log data
- sat instances
- sat solving
- search problems
- propositional logic
- stochastic local search
- web logs
- modal logic
- search strategies
- backtracking search
- website
- satisfiability testing