Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

Bialgebraic Semantics for Logic Programming

Filippo Bonchi ; Fabio Zanasi.
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques&nbsp;[&hellip;]
Published on March 30, 2015

Distribution Bisimilarity via the Power of Convex Algebras

Filippo Bonchi ; Alexandra Silva ; Ana Sokolova.
Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition systems, combine probability and nondeterminism. They can be given different semantics, like strong bisimilarity, convex bisimilarity, or (more recently) distribution bisimilarity. The latter is based on&nbsp;[&hellip;]
Published on July 23, 2021

  • < Previous
  • 1
  • Next >