A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Yuri MalitskyBarry O'SullivanAlessandro PrevitiJoão Marques-SilvaPublished in: CPAIOR (2014)
Keyphrases
- satisfiability problem
- np complete
- temporal logic
- search algorithm
- minimal subsets
- phase transition
- stochastic local search algorithms
- pspace complete
- solving hard
- sat problem
- mazurkiewicz traces
- finite domain
- stochastic local search
- davis putnam
- constraint satisfaction
- modal logic
- search strategies
- cellular automata
- computational complexity