On solving word equations using SAT

We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by reformulating the satisfiability of bounded word equations as a reachability problem for nondeterministic finite automata, an...

Full description

Bibliographic Details

Main Authors:	Joel Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen
Format:	Default Conference proceeding
Published:	2019
Subjects:	Artificial Intelligence & Image Processing
Online Access:	https://hdl.handle.net/2134/15028779.v1
Tags:	Add Tag No Tags, Be the first to tag this record!