English
Related papers

Related papers: Extended Connectors: Structuring Glue Operators in…

200 papers

Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural…

Logic in Computer Science · Computer Science 2021-12-22 Miika Hannula , Jonni Virtema

Graph data management and querying has many practical applications. When graphs are very heterogeneous and/or users are unfamiliar with their structure, they may need to find how two or more groups of nodes are connected in a graph, even…

Databases · Computer Science 2022-08-10 Angelos Christos Anadiotis , Ioana Manolescu , Madhulika Mohanty

We propose and study the notions of behaviour type and composition operator making a first step towards the definition of a formal framework for studying behaviour composition in a setting sufficiently general to provide insight into how…

Logic in Computer Science · Computer Science 2012-12-18 Simon Bliudze

With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…

Group Theory · Mathematics 2007-05-23 Aleksander Strasburger

This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…

Rings and Algebras · Mathematics 2015-03-25 L. M. Cabrer , H. A. Priestley

Herein we develop category-theoretic tools for understanding network-style diagrammatic languages. The archetypal network-style diagrammatic language is that of electric circuits; other examples include signal flow graphs, Markov processes,…

Category Theory · Mathematics 2016-09-20 Brendan Fong

We adapt the bialgebra and Hopf relations to expose internal structure in the ground state of a Hamiltonian with $Z_2$ topological order. Its tensor network description allows for exact contraction through simple diagrammatic rewrite rules.…

Quantum Physics · Physics 2011-12-08 S. J. Denny , J. D. Biamonte , D. Jaksch , S. R. Clark

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…

Logic in Computer Science · Computer Science 2023-06-22 Matteo Acclavio , Ross Horne , Lutz Straßburger

The contribution of this paper is the development of the syntax and semantics of multi-sorted nominal abstract binding trees (abts), an extension of second order universal algebra to support symbol-indexed families of operators. Nominal…

Logic in Computer Science · Computer Science 2016-01-26 Jonathan Sterling , Darin Morrison

We study different algebraic structures associated to an operad and their relations: to any operad $\mathbf{P}$ is attached a bialgebra,the monoid of characters of this bialgebra, the underlying pre-Lie algebra and its enveloping algebra;…

Rings and Algebras · Mathematics 2017-02-20 Loïc Foissy

The vast quantity of data generated and captured every day has led to a pressing need for tools and processes to organize, analyze and interrelate this data. Automated reasoning and optimization tools with inherent support for data could…

Logic in Computer Science · Computer Science 2014-09-16 Panagiotis Manolios , Vasilis Papavasileiou , Mirek Riedewald

This paper concerns the relation between imperative process algebra and rely/guarantee logic. An imperative process algebra is complemented by a rely/guarantee logic that can be used to reason about how data change in the course of a…

Logic in Computer Science · Computer Science 2025-09-23 C. A. Middelburg

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…

Logic in Computer Science · Computer Science 2020-08-10 Fabian Zaiser , C. -H. Luke Ong

Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often fragmented. Consequently, fragmented program…

Logic in Computer Science · Computer Science 2011-06-17 J. A. Bergstra , C. A. Middelburg

Operator systems connect operator algebra, free semialgebraic geometry and quantum information theory. In this work we generalize operator systems and many of their theorems. While positive semidefinite matrices form the underlying…

Operator Algebras · Mathematics 2025-12-12 Gemma De les Coves , Mirte van der Eyden , Tim Netzer

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

Combinatorics · Mathematics 2007-05-23 Frederic Patras , Manfred Schocker

We describe an abstract loop-based intermediate representation that can express fused implementations of relational algebra expressions on sets and bags (multisets). The loops are abstracted away from physical data structures thus making it…

Programming Languages · Computer Science 2025-02-12 James Dong , Fredrik Kjolstad

We study the general twisted intertwining operators (intertwining operators among twisted modules) for a vertex operator algebra $V$. We give the skew-symmetry and contragredient isomorphisms between spaces of twisted intertwining operators…

Quantum Algebra · Mathematics 2025-07-08 Jishen Du , Yi-Zhi Huang

A generalization of the GNS-representation is investigated that represents partial ^*-algebras as systems of operators acting on a partial inner product space (PIP-space). It is based on possibly indefinite B-weights which are closely…

Operator Algebras · Mathematics 2007-05-23 Klaus-Detlef Kuersten , Elmar Wagner

Bipolar Argumentation Frameworks (BAFs) admit several interpretations of the support relation and diverging definitions of semantics. Recently, several classes of BAFs have been captured as instances of bipolar Assumption-Based…

Artificial Intelligence · Computer Science 2021-01-19 Amin Karamlou , Kristijonas Čyras , Francesca Toni
‹ Prev 1 3 4 5 6 7 10 Next ›