Related papers: Achieving compositionality of the stable model sem…
An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with…
Logical reasoning about program data often requires dealing with heap structures as well as scalar data types. Recent advances in Satisfiability Modular Theory (SMT) already offer efficient procedures for dealing with scalars, yet they lack…
Despite a multitude of empirical studies, little consensus exists on whether neural networks are able to generalise compositionally, a controversy that, in part, stems from a lack of agreement about what it means for a neural model to be…
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…
We scale layered modal type theory to dependent types, introducing DeLaM, dependent layered modal type theory. This type theory is novel in that we have one uniform type theory in which we can not only compose and execute code, but also…
Compositionality is thought to be a key component of language, and various compositional benchmarks have been developed to empirically probe the compositional generalization of existing sequence processing models. These benchmarks often…
We study Demazure modules which occur in a level $\ell$ irreducible integrable representation of an affine Lie algebra. We also assume that they are stable under the action of the standard maximal parabolic subalgebra of the affine Lie…
In this short note, we will explain that the good moduli space morphisms behave as if they are proper when we consider sheaf operations, though they are not separated. For example, the decomposition theorem and the base change theorem hold…
We introduce the notion of pure extending modules, a refinement of classical extending modules in which only pure submodules are required to be essential in direct summands. Fundamental properties and characterizations are established,…
We present a method for proving that a program running under the Total Store Ordering (TSO) memory model is robust, i.e., all its TSO computations are equivalent to computations under the Sequential Consistency (SC) semantics. This method…
In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…
We prove a generalization of Gotzmann's persistence theorem in the case of modules with constant Hilbert polynomial. As a consequence, we show that the defining equations that give the embedding of a Quot scheme of points into a…
We introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…
The general idea of this paper is to start from a classical integrable (partial differential) equation which arises as a compatibility condition for a matrix linear differential problem. For definitiveness' sake, a generalised sinh-Gordon…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
We attempt to generalize a congruence property of elliptic modular forms proved by Sturm to that of Haupttypus of Siegel modular forms of degree 2 with level. Namely, we give an explicit bound of Fourier coefficients required to determine…
The diffusion model has been a crucial component in studies about social networks. Many studies, especially these about influence maximization concern the proof of the submodularity of particular diffusion models. Such proofs have been…
Semantic composition remains an open problem for vector space models of semantics. In this paper, we explain how the probabilistic graphical model used in the framework of Functional Distributional Semantics can be interpreted as a…
In the Declarative Networking paradigm, Datalog-like languages are used to express distributed computations. Whereas recently formal operational semantics for these languages have been developed, a corresponding declarative semantics has…