DeepAI AI Chat
Log In Sign Up

On Solving Word Equations via Program Transformation

by   Antonina Nepeivoda, et al.

The paper presents an experiment of solving word equations via specialization of a configuration WE(R,E), where the program WE can be considered as an interpreter testing whether a composition of substitutions R produces a solution of a word equation E. Several variants of such interpreters, when specialized using a basic unfold/fold strategy, are able to decide solvability for a number of sets of the word equations with the overlapping variables.


page 1

page 2

page 3

page 4


Program Specialization as a Tool for Solving Word Equations

The paper focuses on the automatic generating of the witnesses for the w...

Supercompiling String Programs Using Word Equations as Constraints

We describe a general parameterized scheme of program and constraint ana...

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability

The study of word equations (or the existential theory of equations over...

Translating a Math Word Problem to an Expression Tree

Sequence-to-sequence (SEQ2SEQ) models have been successfully applied to ...

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Word equations are a crucial element in the theoretical foundation of co...

A Weakly Supervised Model for Solving Math word Problems

Solving math word problems (MWPs) is an important and challenging proble...