Related papers: Algebraic foundations for qualitative calculi and …
We study the computational complexity of the general network satisfaction problem for a finite relation algebra $A$ with a normal representation $B$. If $B$ contains a non-trivial equivalence relation with a finite number of equivalence…
Qualitative calculi play a central role in representing and reasoning about qualitative spatial and temporal knowledge. This paper studies distributive subalgebras of qualitative calculi, which are subalgebras in which (weak) composition…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…
Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…
Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…
In this work, we show that neural networks can be represented via the mathematical theory of quiver representations. More specifically, we prove that a neural network is a quiver representation with activation functions, a mathematical…
In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…
Robin Hirsch posed in 1996 the 'Really Big Complexity Problem': classify the computational complexity of the network satisfaction problem for all finite relation algebras A. We provide a complete classification for the case that A is…
In comparison to classical shallow representation learning techniques, deep neural networks have achieved superior performance in nearly every application benchmark. But despite their clear empirical advantages, it is still not well…
Andr\'eka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Hirsch and Cristiani showed that the network satisfaction problem (NSP) for each of these algebras…
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…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $\mathbb{R}^n$. All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden…
Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…
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…
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…
Neural networks have historically been built layerwise from the set of functions in ${f: \mathbb{R}^n \to \mathbb{R}^m }$, i.e. with activations and weights/parameters represented by real numbers, $\mathbb{R}$. Our work considers a richer…