First order synthesis for data words revisited
Logic in Computer Science
2023-07-11 v1
Abstract
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.
Cite
@article{arxiv.2307.04499,
title = {First order synthesis for data words revisited},
author = {Julien Grange and Mathieu Lehaut},
journal= {arXiv preprint arXiv:2307.04499},
year = {2023}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
Synthesis for prefix first-order logic on data words
Julien Grange, Mathieu Lehaut
2024-04-24
Logic in Computer Science · Computer Science
Parameterized Synthesis for Fragments of First-Order Logic over Data Words
Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
2019-11-01
Logic in Computer Science · Computer Science
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
2021-09-27
Logic in Computer Science · Computer Science
On the Satisfiability of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
2024-08-07
Logic in Computer Science · Computer Science
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability
Joel Day, Vijay Ganesh, Paul He, Florin Manea +1
2018-02-05
Logic in Computer Science · Computer Science
Adding modular predicates to first-order fragments
Luc Dartois, Charles Paperman
2015-11-16
Logic in Computer Science · Computer Science
On the Existential Fragments of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
2022-09-22
Logic in Computer Science · Computer Science
$\mu$-calculus on data words
Thomas Colcolmbet, Amaldev Manuel
2014-04-21
Logic · Mathematics
Notes on Fragments of First-Order Concatenation Theory
Lars Kristiansen, Juvenal Murwanashyaka
2018-04-18
Logic in Computer Science · Computer Science
Existential Definability over the Subword Ordering
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
2024-02-14
Programming Languages · Computer Science
Decidable Synthesis of Programs with Uninterpreted Functions
Paul Krogmeier, Umang Mathur, Adithya Murali, P. Madhusudan +1
2020-07-24
Logic in Computer Science · Computer Science
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Viktor Kuncak, Martin Rinard
2007-05-23
Logic in Computer Science · Computer Science
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
Toby Cathcart Burn, Luke Ong, Steven Ramsay, Dominik Wagner
2021-04-30
Logic in Computer Science · Computer Science
Ordered fragments of first-order logic
Reijo Jaakkola
2021-03-16
Formal Languages and Automata Theory · Computer Science
Some Remarks on First-Order Definable Tree Languages
Achim Blumensath
2024-07-02
Logic in Computer Science · Computer Science
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
Ian Pratt-Hartmann
2024-04-24
Logic · Mathematics
First-Order Concatenation Theory with Bounded Quantifiers
Lars Kristiansen, Juvenal Murwanashyaka
2020-03-12
Formal Languages and Automata Theory · Computer Science
Resynchronized Uniformization and Definability Problems for Rational Relations
Christof Löding, Sarah Winter
2024-02-14
Logic in Computer Science · Computer Science
Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
Alessandro Artale, Christopher Hampson, Roman Kontchakov, Andrea Mazzullo +1
2025-09-11
Logic in Computer Science · Computer Science
Separateness of Variables -- A Novel Perspective on Decidable First-Order Fragments
Marco Voigt
2019-11-27
Logic · Mathematics
One-dimensional fragment of first-order logic
Lauri Hella, Antti Kuusisto
2014-04-16
Logic in Computer Science · Computer Science
Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2023-05-25
Formal Languages and Automata Theory · Computer Science
Languages ordered by the subword order
Dietrich Kuske, Georg Zetzsche
2019-01-09
Logic in Computer Science · Computer Science
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable
Matthias Horbach, Marco Voigt, Christoph Weidenbach
2017-03-06
Logic in Computer Science · Computer Science
Logical Queries over Views: Decidability and Expressiveness
James Bailey, Guozhu Dong, Anthony Widjaja To
2008-12-18