Related papers: Fregean Flows

Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given…

We study gradient flows of general functionals with linear growth with very weak assumptions. Classical results concerning characterisation of solutions require differentiability of the Lagrangian, as for the time-dependent minimal surface…

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

Let $x\in\mathbb{R}^{n}$. For $\phi:\mathbb{R}^{n}\mapsto\mathbb{R}^{n}$ and $t\in\mathbb{R}$, we put $\phi^{t}=t^{-1}\phi(xt)$. A projective flow is a solution to the projective translation equation $\phi^{t+s}=\phi^{t}\circ\phi^{s}$,…

We introduce the concept of compactly representing a large number of state sequences, e.g., sequences of activities, as a flow diagram. We argue that the flow diagram representation gives an intuitive summary that allows the user to detect…

Graph Interpolation Grammars are a declarative formalism with an operational semantics. Their goal is to emulate salient features of the human parser, and notably incrementality. The parsing process defined by GIGs incrementally builds a…

We introduce a new formalism for representing proofs in propositional logic called "scroll nets". Its fundamental construct is the "scroll", a topological notation for implication proposed by C. S. Peirce at the end of the 19th century as…

The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear logic in a way that explains correctly the…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…

We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum Bayesian inference wherein one considers density operators…

Let $\pi_1$ be a standard representation of $\mathrm{GL}_{n+1}(F)$ and let $\pi_2$ be the smooth dual of a standard representation of $\mathrm{GL}_n(F)$. When $F$ is non-Archimedean, we prove that $\mathrm{Ext}^i_{\mathrm{GL}_n(F)}(\pi_1,…

We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such…

Normalizing Flows (NF) are Generative models which transform a simple prior distribution into the desired target. They however require the design of an invertible mapping whose Jacobian determinant has to be computable. Recently introduced,…

Machine learning systems typically apply the same model to both easy and tough cases. This is in stark contrast with humans, who tend to evoke either fast (instinctive) or slow (analytical) thinking depending on the problem difficulty, a…

We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G'$ such that $G$ can be obtained form $G'$ by a finite number of $2$-cut reductions. As a consequence, some hard…

Defeasible reasoning is the mode of reasoning where conclusions can be overturned by taking into account new evidence. A commonly used method in cognitive science and logic literature is to handcraft argumentation supporting inference…

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…

We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension,…

We derive pointwise curvature estimates for graphical mean curvature flows in higher codimensions. To the best of our knowledge, this is the first such estimates without assuming smallness of first derivatives of the defining map. An…