Automated Generation of Simplification Rules for SAT and MAXSAT.
Alexander S. KulikovPublished in: SAT (2005)
Keyphrases
- sat solvers
- sat problem
- boolean satisfiability
- sat solving
- multiresolution
- semi automated
- branch and bound algorithm
- association rules
- satisfiability problem
- maximum satisfiability
- stochastic local search
- sat instances
- generation process
- upper bound
- search algorithm
- rule sets
- combinatorial optimization
- attribute values
- orders of magnitude
- rough sets
- propositional satisfiability
- optimal solution
- data mining