相关论文: On Distributive Subalgebras of Qualitative Spatial…
The Region Connection Calculus (RCC) is a well-known calculus for representing part-whole and topological relations. It plays an important role in qualitative spatial reasoning, geographical information science, and ontology. The…
Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent…
A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^\phi = a^\phi | b^\phi$, as we do for ordinary representations, we only require that $c^\phi\supseteq a^\phi |…
We consider spatial discretizations by the finite section method of the restricted group algebra of a finitely generated discrete group, which is represented as a concrete operator algebra via its left-regular representation. Special…
Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…
We provide a unified approach, via deformations of incidence algebras, to several important types of representations with finiteness conditions, as well as the combinatorial algebras which produce them. We show that over finite dimensional…
In the recent literature of Artificial Intelligence, an intensive research effort has been spent, for various algebras of qualitative relations used in the representation of temporal and spatial knowledge, on the problem of classifying the…
Qualitative Spatial and Temporal Reasoning (QSTR) is concerned with symbolic knowledge representation, typically over infinite domains. The motivations for employing QSTR techniques range from exploiting computational properties that allow…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
A central question in cognitive science is whether conceptual representations converge onto a shared manifold to support generalization, or diverge into orthogonal subspaces to minimize task interference. While prior work has discovered…
Let $Q$ be a subset of a finite distributive lattice $D$. An algebra $A$ represents the inclusion $Q\subseteq D$ by principal congruences if the congruence lattice of $A$ is isomorphic to $D$ and the ordered set of principal congruences of…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
We demonstrate that topological defects in a rational conformal field theory can be described by a classifying algebra for defects - a finite-dimensional semisimple unital commutative associative algebra whose irreducible representations…
A differential calculus on an associative algebra A is an algebraic analogue of the calculus of differential forms on a smooth manifold. It supplies A with a structure on which dynamics and field theory can be formulated to some extent in…
A unified treatment of both superconformal and quasisuperconformal algebras with quadratic non-linearity is given. General formulas describing their structure are found by solving the Jacobi identities. A complete classification of…
The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…
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…
Distributed linear algebraic equation over networks, where nodes hold a part of problem data and cooperatively solve the equation via node-to-node communications, is a basic distributed computation task receiving an increasing research…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…