Related papers: Achieving compositionality of the stable model sem…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We construct a moduli space of stable pairs over a smooth projective variety, parametrizing morphisms from a fixed coherent sheaf to a varying sheaf of fixed topological type, subject to a stability condition. This generalizes the notion…
Methods for learning Bayesian network structure can discover dependency structure between observed variables, and have been shown to be useful in many applications. However, in domains that involve a large number of variables, the space of…
Human beings possess the most sophisticated computational machinery in the known universe. We can understand language of rich descriptive power, and communicate in the same environment with astonishing clarity. Two of the many contributors…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all…
In classical logic, nonBoolean fluents, such as the location of an object, can be naturally described by functions. However, this is not the case in answer set programs, where the values of functions are pre-defined, and nonmonotonicity of…
We introduce a notion of Gieseker stability for coherent sheaves on tame Deligne-Mumford stacks with projective moduli scheme and some chosen generating sheaf on the stack in the sense of Olsson and Starr \cite{MR2007396}. We prove that…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
Constructor-Based Conditional Rewriting Logic is a general framework for integrating first-order functional and logic programming which gives an algebraic semantics for non-deterministic functional-logic programs. In the context of this…
Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic logic programming, where the goal is to compute the…
A persistence module is a functor $f: \mathbf{I} \to \mathsf{E}$, where $\mathbf{I}$ is the poset category of a totally ordered set. This work introduces saecular decomposition: a categorically natural method to decompose $f$ into simple…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
The theory of program modules is of interest to language designers not only for its practical importance to programming, but also because it lies at the nexus of three fundamental concerns in language design: the phase distinction,…
We develop a stable analogue to the theory of cosimplicial frames in model cagegories; this is used to enrich all homotopy categories of stable model categories over the usual stable homotopy category and to give a different description of…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
We prove the decomposition theorem for Hodge modules with integral structure along proper K\"ahler morphisms, partially generalizing M. Saito's theorem for projective morphisms. Our proof relies on compactifications of period maps of…
In this paper, a decomposition theorem for (covariant) unitary group representations on Kaplansky-Hilbert modules over Stone algebras is established, which generalizes the well-known Hilbert space case (where it coincides with the…
Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary first-order sentences. We show its relation to the idea of loop formulas with…