3 results
Tao Gu ; Fabio Zanasi.
Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with probabilities. This paper proposes a coalgebraic semantics on […]
Published on April 12, 2021
Robin Piedeleu ; Fabio Zanasi.
We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two […]
Published on February 15, 2023
Tobias Kappé ; Paul Brunet ; Bas Luttik ; Alexandra Silva ; Fabio Zanasi.
Pomset automata are an operational model of weak bi-Kleene algebra, which describes programs that can fork an execution into parallel threads, upon completion of which execution can join to resume as a single thread. We characterize a fragment of pomset automata that admits a decision procedure for […]
Published on August 13, 2021