Woorpje solves bounded word equations by encoding NFA reachability as SAT problems, achieving competitive results and exposing bugs in prior solvers.
In: 30th International Symposium on Theoretical Aspects of Com puter Sci- ence, STACS 2013, February 27 - March 2, 2013, Kiel, Germany
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Solving Word Equations Using SAT
Woorpje solves bounded word equations by encoding NFA reachability as SAT problems, achieving competitive results and exposing bugs in prior solvers.