相关论文: A New Decidable Class of Tuple Generating Dependen…

The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in the database and knowledge representation communities. We…

The main result of this paper is that there is an additive equivalence between $\overline{\mathcal{C}}_n$, the Paquette-Yildirim completion of the discrete cluster categories of Dynkin type $A_{\infty}$, and the perfect derived category of…

A graded tensor category over a group $G$ will be called a strongly $G$-graded tensor category if every homogeneous component has at least one multiplicativily invertible object. Our main result is a description of the module categories…

In the paper "Deformation theory of abelian categories", the last two authors proved that an abelian category with enough injectives can be reconstructed as the category of finitely presented modules over the category of its injective…

Let G be a finite group. The stable module category of G has been applied extensively in group representation theory. In particular, it has been used to great effect that it is a triangulated category which is compactly generated. Let H be…

Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence such as deductive databases and knowledge representation and reasoning. Disjunctive existential rules (a.k.a. disjunctive…

Generative models for classification use the joint probability distribution of the class variable and the features to construct a decision rule. Among generative models, Bayesian networks and naive Bayes classifiers are the most commonly…

We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the…

We construct an "almost involution" assigning a new DG-category to a given one, and use this construction to recover, say, the abelian category of graded modules over the graded ring $R^*$ from the DG-category of DG-modules over a DG-ring…

We systematically develop the theory of definable functors between compactly generated triangulated categories. Such functors preserve pure triangles, pure injective objects, and definable subcategories, and as such appear in a wide range…

Graph data structures are fundamental for studying connected entities. With an increase in the number of applications where data is represented as graphs, the problem of graph generation has recently become a hot topic. However, despite its…

We define unbounded twisted complexes and bicomplexes generalising the notion of a (bounded) twisted complex over a DG category [BK90]. These need to be considered relative to another DG category $B$ admitting countable direct sums and…

The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…

We introduce Probabilistic Dependency Graphs (PDGs), a new class of directed graphical models. PDGs can capture inconsistent beliefs in a natural way and are more modular than Bayesian Networks (BNs), in that they make it easier to…

The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a…

Closed classes of three-valued logic generated by symmetric funtions that equal $1$ in almost all tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence for these classes is obtained.

A recollement of triangulated categories describes one such category as being "glued together" from two others. This paper gives a precise criterion for the existence of a recollement of the derived category of a Differential Graded Algebra…

We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…

Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. While prior work has been focusing on adding constituency-based structures to Transformers, we introduce…

Categorical bundles provide a natural framework for gauge theories involving multiple gauge groups. Unlike the case of traditional bundles there are distinct notions of triviality, and hence also of local triviality, for categorical…