A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach.
Gérard FleuryPhilippe LacommePublished in: CoRR (2024)
Keyphrases
- clause learning
- unit propagation
- sat solvers
- consequence finding
- boolean satisfiability
- max sat
- sat problem
- satisfiability problem
- propositional satisfiability
- search tree
- sat solving
- conjunctive normal form
- davis putnam
- search space
- sat encodings
- truth values
- search algorithm
- propositional logic
- propositional formulas
- random sat instances
- cnf formula
- sat instances
- phase transition
- state space
- graph coloring
- probabilistic planning
- automated reasoning
- variable ordering
- theorem proving
- branch and bound algorithm
- constraint satisfaction problems
- np complete
- knowledge representation