10 citations · 17 across the 10 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2022★ 2 cited
Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability
Michaël Cadilhac, Guillermo A. Pérez
We describe our implementation of downset-manipulating algorithms used to solve the realizability problem for linear temporal logic (LTL). These algorithms were introduced by Filio…
cs.LO2022
The Regular Languages of First-Order Logic with One Alternation
Corentin Barloy, Michaël Cadilhac, Charles Paperman +1
The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary formula de…
cs.LO2017
A Crevice on the Crane Beach: Finite-Degree Predicates
Michaël Cadilhac, Charles Paperman
First-order logic (FO) over words is shown to be equiexpressive with FO equipped with a restricted set of numerical predicates, namely the order, a binary predicate MSB, and th…