Related papers: Dynamic Conjunctive Queries
Dynamic Complexity was introduced by Immerman and Patnaik \cite{PatnaikImmerman97} (see also \cite{DongST95}). It has seen a resurgence of interest in the recent past, see…
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…
The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences…
This article contains ideas and their elaboration for quantifiers, which appeared after checking in practice the experimental language of the formal knowledge representation YAFOLL [1]: - looking at for_all and exists quantifiers as…
The quantum nature of gravity remains experimentally unverified, despite recent proposals to probe it using tabletop experiments such as gravity-mediated entanglement schemes. In parallel, consistent formulations of classical--quantum…
The logical structure of Quantum Mechanics (QM) and its relation to other fundamental principles of Nature has been for decades a subject of intensive research. In particular, the question whether the dynamical axiom of QM can be derived…
If $Q$ is a non degenerate quadratic form on ${\bb C}^n$, it is well known that the differential operators $X=Q(x)$, $Y=Q(\partial)$, and $H=E+\frac{n}{2}$, where $E$ is the Euler operator, generate a Lie algebra isomorphic to ${\go…
We define a new dynamical variable, the relative existence e, in terms of space and time. Taking it as a generalized positional coordinate, we show that for conservative systems the canonically conjugated momentum is identified as the…
In their target article, \citet{WangBusemeyer13} [A quantum question order model supported by empirical tests of an a priori and precise prediction. \emph{Topics in Cognitive Science}] discuss question order effects in terms of incompatible…
We study deterministic and quantum dynamics from a constructive "finite" point of view, since the introduction of a continuum, or other actual infinities in physics poses serious conceptual and technical difficulties, without any need for…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
A canonical formalism and constraint analysis for discrete systems subject to a variational action principle are devised. The formalism is equivalent to the covariant formulation, encompasses global and local discrete time evolution moves…
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…
The design and implementation of precise static analyzers for significant fragments of modern imperative languages like C, C++, Java and Python is a challenging problem. In this paper, we consider a core imperative language that has several…
We give a mathematical framework to describe the evolution of an open quantum systems subjected to finitely many interactions with classical apparatuses. The systems in question may be composed of distinct, spatially separated subsystems…
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…
The relationship between Lexical-Functional Grammar (LFG) {\em functional structures} (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear logic in a way that correctly explains…
Configurable systems typically consist of reusable assets that have dependencies between each other. To specify such dependencies, feature models are commonly used. As feature models in practice are often complex, automated reasoning is…
We present a unified dynamical systems framework for spatially flat FLRW cosmology in $f(Q)$ gravity, covering all three connection branches via a single set of Hubble-normalised variables without fixing $f(Q)$ \textit{a priori}. This…
We study the complexity of enumerating the answers of Conjunctive Queries (CQs) in the presence of Functional Dependencies (FDs). Our focus is on the ability to list output tuples with a constant delay in between, following a linear-time…