All instances of MONOTONE 3-SAT-(3, 1) are satisfiable.
Hannah Van SantvlietRonald de HaanPublished in: CoRR (2023)
Keyphrases
- sat instances
- sat problem
- satisfiability problem
- randomly generated
- sat solvers
- phase transition
- stochastic local search
- random instances
- propositional satisfiability
- max sat
- solving hard
- random sat
- maximum satisfiability
- random sat instances
- boolean satisfiability
- boolean functions
- np complete
- truth assignment
- search algorithm
- np complete problems
- boolean formula
- branch and bound algorithm
- search procedures
- randomly chosen
- weighted max sat
- easy hard easy pattern
- constraint satisfaction problems
- computational properties
- propositional formulas
- upper bound
- sat solving
- cnf formula
- temporal logic
- search strategies
- graph coloring
- backtracking search
- state space
- linear programming
- orders of magnitude
- cellular automata
- stochastic local search algorithms
- heuristic search
- constraint satisfaction
- branch and bound