8 citations
- Centre National de la Recherche ScientifiqueFR4 papers
- Masaryk UniversityCZ2 papers
- University of BirminghamGB2 papers
- University of OxfordGB2 papers
- Aalborg UniversityDK1 paper
- Aarhus UniversityDK1 paper
- Bar-Ilan UniversityIL1 paper
- Boğaziçi UniversityTR1 paper
- Chalmers University of TechnologySE1 paper
- École Normale Supérieure de RennesFR1 paper
- Film IndependentUS1 paper
- Fondazione Bruno KesslerIT1 paper
14 papers · 1 filter
The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
Jean Christoph Jung, JÄdrzej KoÅodziejski, Jędrzej Kołodziejski
Modal separability for modal fixpoint formulae is the problem to decide for two given modal fixpoint formulae whether there is a modal formula that separates them, in th…
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Isolde Adler, Eva Fluck, Tim Seppelt +1
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment, using homomorphism indistinguishability.…
Computation by infinite descent made explicit
Sebastian Enqvist
We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotate…
Automating Boundary Filling in Cubical Type Theories
Maximilian Doré, Evan Cavallo, Anders Mörtberg
When working in a proof assistant, automation is key to discharging routine proof goals such as equations between algebraic expressions. Homotopy type theory allows the user to rea…
Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent
Carter Bunch, Saraid Dwyer Satterfield, Serdar Erbatur +2
We introduce a new form of restricted term rewrite system, the graph-embedded term rewrite system. These systems, and thus the name, are inspired by the graph minor relation and ar…
Quantitative Verification with Neural Networks
Alessandro Abate, Alec Edwards, Mirco Giacobbe +2
We present a data-driven approach to the quantitative verification of probabilistic programs and stochastic dynamical models. Our approach leverages neural networks to compute tigh…