19 citations
- Institut de recherche mathématique de RennesFR16 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Université de RennesFR8 papers
- Département de mathématiques et applicationsFR2 papers
- École Normale Supérieure - PSLFR2 papers
- Institut Camille JordanFR2 papers
- Institut de Recherche en Informatique de ToulouseFR2 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR2 papers
- International Center for Transitional JusticeUS2 papers
- Laboratoire d'Analyse et d'Architecture des SystèmesFR2 papers
- Laboratoire de Mathématiques d'OrsayFR2 papers
- Laboratoire des systèmes et applications des technologies de l'information et de l'énergieFR2 papers
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2025
Finding Regular Herbrand Models for CHCs using Answer Set Programming
Gregoire Maire, Thomas Genet
We are interested in proving satisfiability of Constrained Horn Clauses (CHCs) over Algebraic Data Types (ADTs). We propose to prove satisfiability by building a tree automaton rec…
cs.LO2025
The Complexity of Generalized HyperLTL with Stuttering and Contexts
Gaëtan Regaud, Martin Zimmermann
We settle the complexity of satisfiability and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the specification of asynchronous hyper…
cs.LO2023
The Complexity of Second-order HyperLTL
Hadar Frenkel, Gaëtan Regaud, Martin Zimmermann
We determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic. W…