相关论文: A New Finitely Controllable Class of Tuple Generat…
Ontology-mediated querying and querying in the presence of constraints are two key database problems where tuple-generating dependencies (TGDs) play a central role. In ontology-mediated querying, TGDs can formalize the ontology and thus…
We study consistent query answering in relational databases. We consider an expressive class of schema constraints that generalizes both tuple-generating dependencies and equality-generating dependencies. We establish the complexity of…
Given an action of a finite group on a triangulated category, we investigate under which conditions one can construct a linearised triangulated category using DG-enhancements. In particular, if the group is a finite group of automorphisms…
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…
This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…
We solve a problem, stated in [CGP10], showing that Sticky Datalog, defined in the cited paper as an element of the Datalog\pm project, has the finite controllability property. In order to do that, we develop a technique, which we believe…
The solution of the global controllability problem is obtained for a class of the triangular systems of O.D.E. that are not feedback linearizable. The introduced class is a generalization of the classes of triangular systems investigated…
The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to…
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…
A tubular group $G$ is a finite graph of groups with $\mathbb{Z}^2$ vertex groups and $\mathbb{Z}$ edge groups. We characterize residually finite tubular groups: $G$ is residually finite if and only if its edge groups are separable. Methods…
We give an account of model theory in the context of compactly generated triangulated and tensor-triangulated categories ${\cal T}$. We describe pp formulas, pp-types and free realisations in such categories and we prove elimination of…
We prove a formula which allows us to recursively compute planar tropical gravitational descendants which involve psi-classes of arbitrary power at marked ends fixed by points and additionally a psi-class of power one at exactly one marked…
Nakano's later modality can be used to specify and define recursive functions which are causal or synchronous; in concert with a notion of clock variable, it is possible to also capture the broader class of productive (co)programs. Until…
The development of Automatic Question Generation (QG) models has the potential to significantly improve educational practices by reducing the teacher workload associated with creating educational content. This paper introduces a novel…
In this work we consider the question of realizing triangulated dg-categories by derived categories of algebraic varieties. For this, we introduce the notion of "system of points" in saturated dg-categories. We show that given such a system…
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…
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…
Ontological query answering is the problem of answering queries in the presence of schema constraints representing the domain of interest. Datalog+/- is a common family of languages for schema constraints, including tuple-generating…
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…
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…