English
Related papers

Related papers: Notes on Coalgebras in Stylometry

200 papers

We describe a general approach to deriving linear-time logics for a wide variety of state-based, quantitative systems, by modelling the latter as coalgebras whose type incorporates both branching and linear behaviour. Concretely, we define…

Logic in Computer Science · Computer Science 2024-08-07 Corina Cirstea

Safety constraints are crucial to the development of mission-critical systems. The practice of developing software for systems of this type requires reliable methods for identifying and analysing project artefacts. This paper proposes a…

Logic in Computer Science · Computer Science 2020-05-15 Grygoriy Zholtkevych , Maksym Labzhaniia

We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define…

Logic in Computer Science · Computer Science 2024-07-16 Paolo Baldan , Filippo Bonchi , Henning Kerstan , Barbara König

We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour…

Logic in Computer Science · Computer Science 2013-09-05 Corina Cirstea

We investigate the possibility of deriving metric trace semantics in a coalgebraic framework. First, we generalize a technique for systematically lifting functors from the category Set of sets to the category PMet of pseudometric spaces,…

Logic in Computer Science · Computer Science 2015-06-01 Paolo Baldan , Filippo Bonchi , Henning Kerstan , Barbara König

This article describes recent work on the topic of specifying properties of transition systems. By giving a suitably abstract description of transition systems as coalgebras, it is possible to derive logics for capturing properties of these…

Logic in Computer Science · Computer Science 2007-05-23 Alexander Kurz

The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling…

Logic in Computer Science · Computer Science 2015-02-11 Georgiana Caltais

The paper explores stylometry as a method to distinguish between texts created by Large Language Models (LLMs) and humans, addressing issues of model attribution, intellectual property, and ethical AI use. Stylometry has been used…

Computation and Language · Computer Science 2025-07-25 Karol Przystalski , Jan K. Argasiński , Iwona Grabska-Gradzińska , Jeremi K. Ochab

Temporal logics are an obvious high-level descriptive companion formalism to dynamical systems which model behavior as deterministic evolution of state over time. A wide variety of distinct temporal logics applicable to dynamical systems…

Logic in Computer Science · Computer Science 2012-12-11 Baltasar Trancón y Widemann

Statistical methods have been widely employed in many practical natural language processing applications. More specifically, complex networks concepts and methods from dynamical systems theory have been successfully applied to recognize…

Computation and Language · Computer Science 2015-03-04 Diego R. Amancio

Whether enjoying the lucid prose of a favorite author or slogging through some other writer's cumbersome, heavy-set prattle (full of parentheses, em dashes, compound adjectives, and Oxford commas), readers will notice stylistic signatures…

Computation and Language · Computer Science 2023-06-22 Alexandra N. M. Darmon , Marya Bazzi , Sam D. Howison , Mason A. Porter

Behavioural conformances -- e.g. behavioural equivalences, distances, preorders -- on a wide range of system types (non-deterministic, probabilistic, weighted etc.) can be dealt with uniformly in the paradigm of universal coalgebra. One of…

Logic in Computer Science · Computer Science 2025-02-04 Paul Wild , Lutz Schröder

This paper proposes to use dialgebras to specify the semantics of interactive systems in a natural way. Dialgebras are a conservative extension of coalgebras. In this categorical model, from the point of view that we provide, the notions of…

Programming Languages · Computer Science 2011-08-03 Vincenzo Ciancia

We study behavioral metrics in an abstract coalgebraic setting. Given a coalgebra alpha: X -> FX in Set, where the functor F specifies the branching type, we define a framework for deriving pseudometrics on X which measure the behavioral…

Logic in Computer Science · Computer Science 2014-10-14 Paolo Baldan , Filippo Bonchi , Henning Kerstan , Barbara König

It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of…

Logic in Computer Science · Computer Science 2017-05-31 Harsh Beohar , Sebastian Küpper

Processes are often viewed as coalgebras, with the structure maps specifying the state transitions. In the simplest case, the state spaces are discrete, and the structure map simply takes each state to the next states. But the coalgebraic…

Category Theory · Mathematics 2015-12-23 Dusko Pavlovic , Bertfried Fauser

Statistical methods have been widely employed to study the fundamental properties of language. In recent years, methods from complex and dynamical systems proved useful to create several language models. Despite the large amount of studies…

Computation and Language · Computer Science 2015-09-18 Diego R. Amancio

The syntactic structures of sentences can be readily read-out from the activations of large language models (LLMs). However, the ``structural probes'' that have been developed to reveal this phenomenon are typically evaluated on an…

Computation and Language · Computer Science 2025-08-12 Pablo J. Diego-Simón , Emmanuel Chemla , Jean-Rémi King , Yair Lakretz

We suggest an information-theoretic approach for measuring stylistic coordination in dialogues. The proposed measure has a simple predictive interpretation and can account for various confounding factors through proper conditioning. We…

Computation and Language · Computer Science 2015-08-28 Shuyang Gao , Greg Ver Steeg , Aram Galstyan

Semantics, morphology and syntax are strongly interdependent. However, the majority of computational methods for semantic change detection use distributional word representations which encode mostly semantics. We investigate an alternative…

Computation and Language · Computer Science 2021-09-23 Mario Giulianelli , Andrey Kutuzov , Lidia Pivovarova
‹ Prev 1 2 3 10 Next ›