Optimum PLA folding through boolean satisfiability.

José M. Quintana Maria J. Avedillo Maria P. Parra José L. Huertas

Published in: ASP-DAC (1995)

Keyphrases

boolean satisfiability
sat solvers
branch and bound algorithm
boolean optimization
sat solving
randomly generated

probabilistic planning
integer linear programming
symmetry breaking
sat problem
maximum satisfiability
max sat

phase transition
random sat instances
combinatorial problems
satisfiability problem
boolean formula
lower bound

genetic algorithm
sat instances
propositional satisfiability
constraint programming
constraint satisfaction
orders of magnitude