output
20052025
most citedDegenerate parabolic stochastic partial differential equations: Quasilinear case

90 citations

Showing cs.LOShow all

6 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…

cs.LO2018★ 35 cited

Strategy Logic with Imperfect Information

Raphaël Berthon, Bastien Maubert, Aniello Murano +2

We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player…

cs.LO2018★ 11 cited

Decidability results for ATL* with imperfect information and perfect recall

Raphaël Berthon, Bastien Maubert, Aniello Murano

Alternating-time Temporal Logic (ATL*) is a central logic for multiagent systems. Its extension to the imperfect information setting (ATL*i ) is well known to have an undecidable m…

cs.LO2018

Changing Observations in Epistemic Temporal Logic

Aurèle Barrière, Bastien Maubert, Aniello Murano +1

We study dynamic changes of agents' observational power in logics of knowledge and time. We consider CTL*K, the extension of CTL* with knowledge operators, and enrich it with a new…