Related papers: Generalising KAT to verify weighted computations
We extend the definition and study the algebraic properties of the polylogarithm Li(T), where T is rational series over the alphabet X = {x 0, x 1} belonging to suitable subalgebras of rational series.
We give a presentation of localized affine and degenerate affine Hecke algebras of arbitrary type in terms of weights of the polynomial subalgebra and varied Demazure-BGG type operators. We offer a definition of a graded algebra…
We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…
We introduce the class of graded Lie-Rinehart algebras as a natural generalization of the one of graded Lie algebras. For $G$ an abelian group, we show that if $L$ is a tight $G$-graded Lie-Rinehart algebra over an associative and…
This paper presents several efficient decision procedures for trace equivalence of GKAT automata, which make use of on-the-fly symbolic techniques via SAT solvers. To demonstrate applicability of our algorithms, we designed symbolic…
In this paper, we associate the TKK algebra $\widehat{\mathcal{G}}(\mathcal{J})$ with vertex algebras through twisted modules. Firstly, we prove that for any complex number $\ell$, the category of restricted…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…
Machine learning approaches to solving Boolean Satisfiability (SAT) aim to replace handcrafted heuristics with learning-based models. Graph Neural Networks have emerged as the main architecture for SAT solving, due to the natural graph…
Obtaining a single-vector representation from a Large Language Model's (LLM) token-level outputs is a critical step for nearly all sentence-level tasks. However, standard pooling methods like mean or max aggregation treat tokens as an…
Flat iteration is a variation on the original binary version of the Kleene star operation P*Q, obtained by restricting the first argument to be a sum of atomic actions. It generalizes prefix iteration, in which the first argument is a…
We present a new construction of a class pseudo BL-algebras, called kite pseudo BL-algebras. We start with a basic pseudo hoop $A$. Using two injective mappings from one set, $J$, into the second one, $I$, and with an identical copy…
In our previous work [1] we described quantized computation using Horn clauses and based the semantics, dubbed as entanglement semantics as a generalization of denotational and distribution semantics, and founded it on quantum probability…
We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic languages extending the Graphical Linear Algebra programme. We construct several languages within this family and prove that they are universal and complete for the…
Large language models (LLMs) have unveiled remarkable reasoning capabilities by exploiting chain-of-thought (CoT) prompting, which generates intermediate reasoning chains to serve as the rationale for deriving the answer. However, current…
This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…
Realizability, introduced by Kleene, can be understood as a concretization of the Brouwer-Heyting-Kolmogorov (BHK) interpretation of proofs, providing a framework to interpret mathematical statements and proofs in terms of their…
A generalized set theory (GST) is like a standard set theory but also can have non-set structured objects that can contain other structured objects including sets. This paper presents Isabelle/HOL support for GSTs, which are treated as type…
We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…
Given an abelian category and a stability condition satisfying appropriate conditions, we define generalized $K$-theoretic invariants and prove that they satisfy wall-crossing formulas. For this, we introduce a new associative algebra…