English
Related papers

Related papers: Conjunctive Table Algebras

200 papers

To appear in Theory and Practice of Logic Programming (TPLP). Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling…

Programming Languages · Computer Science 2020-02-19 Thepfrastos Mantadelis , Ricardo Rocha , Paulo Moura

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Logic in Computer Science · Computer Science 2019-02-05 Stefan Milius , Henning Urbat

A non-associative algebra over a field $\mathbb{K}$ is a $\mathbb{K}$-vector space $A$ equipped with a bilinear operation \[ {A\times A\to A\colon\; (x,y)\mapsto x\cdot y=xy}. \] The collection of all non-associative algebras over…

Rings and Algebras · Mathematics 2021-10-20 Tim Van der Linden

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

Numerical Analysis · Mathematics 2025-10-20 Uwe Naumann

Existential positive formulas form a fragment of first-order logic that includes and is semantically equivalent to unions of conjunctive queries, one of the most important and well-studied classes of queries in database theory. We consider…

Databases · Computer Science 2016-04-21 Hubie Chen , Stefan Mengel

To a semisimple and cosemisimple Hopf algebra over an algebraically closed field, we associate a planar algebra defined by generators and relations and show that it is a connected, irreducible, spherical, non-degenerate planar algebra with…

Quantum Algebra · Mathematics 2007-05-23 Vijay Kodiyalam , V. S. Sunder

This is a short survey on the recent developments made in the integration theory with effective formulas of algebraic structures stronger or higher than Lie algebras.

Rings and Algebras · Mathematics 2025-10-14 Bruno Vallette

P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…

Quantum Physics · Physics 2024-08-16 Daniel Lehmann

Linear algebra is usually defined over a field such as the reals or complex numbers. It is possible to extend this to skew fields such as the quaternions. However, to the authors' knowledge there is no commonly accepted notation of linear…

Rings and Algebras · Mathematics 2014-03-21 Dominik Schulz , Reiner S. Thomä

In this note, we introduce a class of algebras that are in some sense related to conformal algebras. This class (called TC-algebras) includes Weyl algebras and some of their (associative and Lie) subalgebras. By a conformal algebra we…

Quantum Algebra · Mathematics 2007-06-20 Pavel Kolesnikov

These are lecture notes for a course on the theory of Clifford algebras, with special emphasis on their wide range of applications in mathematics and physics. Clifford algebra is introduced both through a conventional tensor algebra…

Mathematical Physics · Physics 2009-07-31 Douglas Lundholm , Lars Svensson

Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html ) is a research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more traditionally been.…

Logic in Computer Science · Computer Science 2011-02-08 Giorgi Japaridze

Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…

Functional Analysis · Mathematics 2007-05-23 Antoine Delcroix , Maximilian F. Hasler , Stevan Pilipović , Vincent Valmorin

Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…

Information Theory · Computer Science 2021-01-01 Juerg Kohlas , Juerg Schmid

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

Logic · Mathematics 2022-06-15 Célia Borlido , Brett McLean

We introduce a new class of algebras, which we call cluster-tilted. They are by definition the endomorphism algebras of tilting objects in a cluster category. We show that their representation theory is very close to the representation…

Representation Theory · Mathematics 2020-12-21 Aslak Bakke Buan , Bethany Marsh , Idun Reiten

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

Artificial Intelligence · Computer Science 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

We introduce and investigate the concept of Stratified Algebra, a new algebraic framework equipped with a layer-based structure on a vector space. We formalize a set of axioms governing intra-layer and inter-layer interactions, study their…

General Mathematics · Mathematics 2025-05-27 Stanislav Semenov

Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be used to represent and manipulate field-theory expressions,…

Symbolic Computation · Computer Science 2008-11-26 Kasper Peeters