Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification.
Andrew ReynoldsMaverick WooClark W. BarrettDavid BrumleyTianyi LiangCesare TinelliPublished in: CAV (2) (2017)
Keyphrases
- context dependent
- sat solvers
- clause learning
- sat instances
- sat solving
- orders of magnitude
- semantic level
- sat problem
- boolean satisfiability
- data structure
- propositional satisfiability
- context free
- low level
- constraint satisfaction
- search tree
- edit distance
- satisfiability problem
- search strategies
- search space
- natural language
- pattern matching
- string matching
- np complete
- user centric
- multiresolution
- regular expressions
- context free grammars
- max sat
- high level
- suffix tree
- davis putnam
- boolean formula
- propositional logic
- phase transition
- contextual factors
- randomly generated
- sat encodings
- search algorithm