English
Related papers

Related papers: A formal algebraic approach for the quantitative m…

200 papers

We introduce and investigate a weighted propositional configuration logic over commutative semirings. Our logic is intended to serve as a specification language for software architectures with quantitative features. We prove an efficient…

Logic in Computer Science · Computer Science 2020-01-20 Paulina Paraponiari , George Rahonis

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

New functional representation for the strongly interacting systems is proposed which contains a new type of the quantum coherent state. As a result the new algebraic structure- so called "tower of algebras" appears which gives the tower (or…

Strongly Correlated Electrons · Physics 2008-02-03 V. M. Zharkov

We introduce a formal operational semantics that describes the fused execution of variable contraction problems, which compute indexed arithmetic over a semiring and generalize sparse and dense tensor algebra, relational algebra, and graph…

Programming Languages · Computer Science 2022-07-28 Scott Kovach , Fredrik Kjolstad

A quite flourishing research thread in the recent literature on component-based systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Roberto Bruni , Hernan Melgratti , Ugo Montanari , Pawel Sobocinski

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…

Algebraic Geometry · Mathematics 2020-11-16 Hoon Hong , James Rohal , Mohab Safey El Din , Eric Schost

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2016-01-28 Andrei A. Bulatov

Networked structures arise in a wide array of different contexts such as technological and transportation infrastructures, social phenomena, and biological systems. These highly interconnected systems have recently been the focus of a great…

Statistical Mechanics · Physics 2009-11-10 Alain Barrat , Marc Barthelemy , Romualdo Pastor-Satorras , Alessandro Vespignani

We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…

Commutative Algebra · Mathematics 2014-02-11 Wolmer V. Vasconcelos

Weighted model counting (WMC) is a well-known inference task on knowledge bases, used for probabilistic inference in graphical models. We introduce algebraic model counting (AMC), a generalization of WMC to a semiring structure. We show…

Logic in Computer Science · Computer Science 2012-11-20 Angelika Kimmig , Guy Van den Broeck , Luc De Raedt

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Attila Egri-Nagy , Chrystopher L. Nehaniv

We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…

Formal Languages and Automata Theory · Computer Science 2020-10-01 C. Aiswarya , Paul Gastin

We review the main tools which allow for the statistical characterization of weighted networks. We then present two case studies, the airline connection network and the scientific collaboration network, which are representative of critical…

Statistical Mechanics · Physics 2009-11-10 Marc Barthelemy , Alain Barrat , Romualdo Pastor-Satorras , Alessandro Vespignani

We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs multioperator monoids as weight algebras. It generalizes previous work in that area (semiring parsing, weighted deductive…

Formal Languages and Automata Theory · Computer Science 2019-11-18 Richard Mörbitz , Heiko Vogler

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

Symbolic Computation · Computer Science 2024-06-13 Cordian Riener , Robin Schabert , Thi Xuan Vu

This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…

Multiagent Systems · Computer Science 2022-01-13 Pedro M. Sequeira , António P. Aguiar , João Hespanha

A general framework for obtaining certain types of contracted and centrally extended algebras is presented. The whole process relies on the existence of quadratic algebras, which appear in the context of boundary integrable models.

High Energy Physics - Theory · Physics 2014-11-20 Anastasia Doikou , Konstadinos Sfetsos

A formalism for the study of highly interacting electronic systems is presented. The proposed scheme is based on two key concepts: composite operators and algebra constraints. Composite field operators, that naturally appear as a…

Strongly Correlated Electrons · Physics 2009-11-10 Ferdinando Mancini

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

Logic in Computer Science · Computer Science 2022-04-25 Takeshi Tsukada , Kazuyuki Asada

This paper introduces a material-aware strength-of-connection measure for smoothed aggregation algebraic multigrid methods, aimed at improving robustness for scalar partial differential equations with heterogeneous and anisotropic material…

Computational Engineering, Finance, and Science · Computer Science 2026-02-06 Max Firmbach , Malachi Phillips , Christian Glusa , Alexander Popp , Christopher M. Siefert , Matthias Mayr
‹ Prev 1 2 3 10 Next ›