Login / Signup
Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Yuri Malitsky
Barry O'Sullivan
Alessandro Previti
João Marques-Silva
Published in:
ECAI (2014)
Keyphrases
</>
satisfiability problem
np complete
search algorithm
phase transition
temporal logic
minimal subsets
sat problem
solving hard
stochastic local search algorithms
max sat
pspace complete
mazurkiewicz traces
davis putnam
random sat
sat instances
stochastic local search
genetic algorithm