Parametric quantified SAT solving.

Thomas Sturm Christoph Zengler

Published in: ISSAC (2010)

Keyphrases

sat solving
sat solvers
boolean satisfiability
sat problem
boolean optimization
sat encodings
orders of magnitude
max sat
clause learning
genetic algorithm
search tree
sat instances
search methods
tabu search
information retrieval systems
special case
search space
lower bound