30.3 VIP-Sat: A Boolean Satisfiability Solver Featuring 5×12 Variable In-Memory Processing Elements with 98% Solvability for 50-Variables 218-Clauses 3-SAT Problems.
Chaeyun ShimJooyoung BaeBongjin KimPublished in: ISSCC (2024)
Keyphrases
- boolean formula
- boolean satisfiability
- processing elements
- sat problem
- sat solvers
- sat solving
- boolean variables
- satisfiability problem
- random access
- associative memory
- np complete
- truth assignment
- sat instances
- constraint satisfaction problems
- max sat
- conjunctive normal form
- maximum satisfiability
- propositional satisfiability
- phase transition
- clause learning
- davis putnam
- practical problems
- randomly generated
- decision problems
- unit propagation
- constraint satisfaction
- random sat instances
- stochastic local search
- search tree
- cnf formula
- propositional formulas
- search strategies
- np hard
- search space
- binary decision diagrams
- linear constraints
- search algorithm