DeepAI AI Chat
Log In Sign Up

On Solving Word Equations via Program Transformation

07/23/2020
by   Antonina Nepeivoda, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/07/2021

Program Specialization as a Tool for Solving Word Equations

The paper focuses on the automatic generating of the witnesses for the w...
06/29/2018

Supercompiling String Programs Using Word Equations as Constraints

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

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

The study of word equations (or the existential theory of equations over...
11/14/2018

Translating a Math Word Problem to an Expression Tree

Sequence-to-sequence (SEQ2SEQ) models have been successfully applied to ...
05/17/2018

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...
04/14/2021

A Weakly Supervised Model for Solving Math word Problems

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