相关论文: A New Finitely Controllable Class of Tuple Generat…
We explain how, under some hypotheses, one can construct a sequence of finite dimensional $kG$-modules that lie in certain prescribed additive subcategories, but whose direct limits do not. We use these to show that many of the triangulated…
We present a comprehensive survey of the advancements and techniques in the field of tractable probabilistic generative modeling, primarily focusing on Probabilistic Circuits (PCs). We provide a unified perspective on the inherent…
We investigate the less-explored task of generating open-ended questions that are typically answered by multiple sentences. We first define a new question type ontology which differentiates the nuanced nature of questions better than widely…
We show that in the category of groups, every singly-generated class which is closed under isomorphisms, direct limits and extensions is also singly-generated under isomorphisms and direct limits, and in particular is co-reflective. We also…
We consider existential rules (aka Datalog+) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive query (CQ) entailment is decidable. However, most of these…
A tubular group is a group that acts on a tree with $\mathbb{Z}^2$ vertex stabilizers and $\mathbb{Z}$ edge stabilizers. This paper develops further a criterion of Wise and determines when a tubular group acts freely on a finite dimensional…
Bounded Derivation Depth property (BDD) and Finite Controllability (FC) are two properties of sets of datalog rules and tuple generating dependencies (known as Datalog +/- programs), which recently attracted some attention. We conjecture…
Recently, the tensor complementarity problem (TCP for short) has been investigated in the literature. An important question involving the property of global uniqueness and solvability (GUS-property) for a class of TCPs was proposed by Song…
Recent advancements in large language models (LLMs) have demonstrated remarkable text generation capabilities. However, controlling specific attributes of generated text remains challenging without architectural modifications or extensive…
We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of…
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…
Matching Dependencies (MDs) are a relatively recent proposal for declarative entity resolution. They are rules that specify, on the basis of similarities satisfied by values in a database, what values should be considered duplicates, and…
Generating functions, which are widely used in combinatorics and probability theory, encode function values into the coefficients of a polynomial. In this paper, we explore their use as a tractable probabilistic model, and propose…
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…
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…
We study the class of densely related groups. These are finitely generated (or more generally, compactly generated locally compact) groups satisfying a strong negation of being finitely presented, in the sense that new relations appear at…
We unify and generalize several approaches to constructing braid group representations from finite groups, using iterated twisted tensor products. Our results hint at a relationship between the braidings on the $G$-gaugings of a pointed…
The chase procedure, originally introduced for checking implication of database constraints, and later on used for computing data exchange solutions, has recently become a central algorithmic tool in rule-based ontological reasoning. In…
Controllable Text Generation (CTG) has obtained great success due to its fine-grained generation ability obtained by focusing on multiple attributes. However, most existing CTG researches overlook how to utilize the attribute entanglement…
We investigate the difficulty levels of questions in reading comprehension datasets such as SQuAD, and propose a new question generation setting, named Difficulty-controllable Question Generation (DQG). Taking as input a sentence in the…