First order synthesis for data words revisited

07/10/2023
by   Julien Grange, et al.
0

We carry on the study of the synthesis problem on data words for fragments of first order logic, and delineate precisely the border between decidability and undecidability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2021

Ordered fragments of first-order logic

Using a recently introduced algebraic framework for the classification o...
research
10/27/2022

Existential Definability over the Subword Ordering

We study first-order logic (FO) over the structure consisting of finite ...
research
10/31/2019

Parameterized Synthesis for Fragments of First-Order Logic over Data Words

We study the synthesis problem for systems with a parameterized number o...
research
02/03/2016

Image and Information

A well-known old adage says that "A picture is worth a thousand words!"...
research
04/05/2022

Too Big to Fail? Active Few-Shot Learning Guided Logic Synthesis

Generating sub-optimal synthesis transformation sequences ("synthesis re...
research
02/26/2019

SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --

We present the derivation reduction problem for SLD-resolution, the unde...
research
10/13/2018

Combining fragments of classical logic: When are interaction principles needed?

We investigate the combination of fragments of classical logic as a way ...

Please sign up or login with your details

Forgot password? Click here to reset