6 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR9 papers
- Institut de Recherche en Informatique FondamentaleFR3 papers
- Université Paris CitéFR3 papers
- Université Paris-SaclayFR3 papers
- Aalborg UniversityDK2 papers
- Czech Academy of Sciences, Institute of SociologyCZ2 papers
- Herzliya Medical CenterIL2 papers
- Laboratoire Méthodes FormellesFR2 papers
- Masaryk UniversityCZ2 papers
- Paris-Est SupFR2 papers
- Radboud University NijmegenNL2 papers
- Sorbonne Paris CitéFR2 papers
17 papers · 1 filter
Algorithms for Markov Binomial Chains
Alejandro Alarcón Gonzalez, Niel Hens, Tim Leys +1
We study algorithms to analyze a particular class of Markov population processes that is often used in epidemiology. More specifically, Markov binomial chains are the model that ar…
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
Christoph Haase, Alessio Mansutti, Amaury Pouly
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that…
The Size-Change Principle for Mixed Inductive and Coinductive types
Pierre Hyvernat
This paper shows how to use Lee, Jones and Ben Amram's size-change principle to check correctness of arbitrary recursive definitions in an ML / Haskell like programming language wi…
The categorical contours of the Chomsky-Schützenberger representation theorem
Paul-André Melliès, Noam Zeilberger
We develop fibrational perspectives on context-free grammars and on nondeterministic finite-state automata over categories and operads. A generalized CFG is a functor from a free c…
Using weakest application conditions to rank graph transformations for graph repair
Lars Fritsche, Alexander Lauer, Maximilian Kratz +2
When using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph i…
Computing the unit group of a commutative finite -algebra
Martin Kreuzer, Florian Walsh
For a commutative finite -algebra, i.e., for a commutative ring whose additive group is finitely generated, it is known that the group of units of is finitely g…
A categorical account of composition methods in logic (extended version)
Tomáš Jakl, Dan Marsden, Nihil Shah
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of sim…
Constrained inhomogeneous spherical equations: average-case hardness
Alexander Ushakov
In this paper we analyze computational properties of the Diophantine problem (and its search variant) for spherical equations (and its variants…
On the Unprovability of Circuit Size Bounds in Intuitionistic
Lijie Chen, Jiatu Li, Igor C. Oliveira
We show that there is a constant such that Buss's intuitionistic theory does not prove that SAT requires co-nondeterministic circuits of size at least .…
One is all you need: Second-order Unification without First-order Variables
David M. Cerna, Julian Parsert
We introduce a fragment of second-order unification, referred to as \emph{Second-Order Ground Unification (SOGU)}, with the following properties: (i) only one second-order variable…
The Church Synthesis Problem over Continuous Time
Alexander Rabinovich, Daniel Fattal
The Church Problem asks for the construction of a procedure which, given a logical specification A(I,O) between input omega-strings I and output omega-strings O, determines whether…
A Categorical Treatment of Open Linear Systems
Dario Stein, Richard Samuelson
An open stochastic system à la Jan Willems is a system affected by two qualitatively different kinds of uncertainty: one is probabilistic fluctuation, and the other one is nondeter…
Representing Guardedness in Call-by-Value and Guarded Parametrized Monads
Sergey Goncharov
Like the notion of computation via (strong) monads serves to classify various flavours of impurity, including exceptions, non-determinism, probability, local and global store, the…
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…
Unifying Graded Linear Logic and Differential Operators
Flavien Breuvart, Marie Kerjean, Simon Mirwasser
Linear Logic refines Intuitionnistic Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various…
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…
MacroSwarm: A Field-based Compositional Framework for Swarm Programming
Gianluca Aguzzi, Roberto Casadei, Mirko Viroli
Swarm behaviour engineering is an area of research that seeks to investigate methods and techniques for coordinating computation and action within groups of simple agents to achiev…