Related papers: Dynamic Conjunctive Queries
We study the enumeration of answers to ontology-mediated queries (OMQs) where the ontology is a set of guarded TGDs or formulated in the description logic ELI and the query is a conjunctive query (CQ). In addition to the traditional notion…
Regular languages are closed under a wealth of formal language operators. Incorporating such operators in regular expressions leads to concise language specifications, but the transformation of such enhanced regular expressions to finite…
Quantum Gravity by Causal Dynamical Triangulation has over the last few years emerged as a serious contender for a nonperturbative description of the theory. It is a nonperturbative implementation of the sum-over-histories, which relies on…
The reduced dynamics of an atomic qubit coupled both to its own quantized center of mass motion through the spatial mode functions of the electromagnetic field, as well as the vacuum modes, is calculated in the influence functional…
We investigate some particular completely positive maps which admit a stable commutative Von Neumann subalgebra. The restriction of such maps to the stable algebra is then a Markov operator. In the first part of this article, we propose a…
We investigate a general class of dissipative quantum circuit capable of computing arbitrary Conjunctive Normal Form (CNF) Boolean formulas. In particular, the clauses in a CNF formula define a local generator of Markovian quantum dynamics…
Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether the query is stable, that is, whether the answers will stay…
Quantum Darwinism extends the traditional formalism of decoherence to explain the emergence of classicality in a quantum universe. A classical description emerges when the environment tends to redundantly acquire information about the…
In order to figure out why quantum physics needs the complex Hilbert space, many attempts have been made to distinguish the C*-algebras and von Neumann algebras in more general classes of abstractly defined Jordan algebras (JB- and…
Density Functional Theory (DFT) is widely used for atomistic simulations. However, its reach stays limited due to several limitations such as lack of accurate exchange-correlation functional, requirement of costly O(N 3) diagonalization…
Dung's abstract argumentation framework consists of a set of interacting arguments and a series of semantics for evaluating them. Those semantics partition the powerset of the set of arguments into two classes: extensions and…
We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considering queries formulated in fragments of propositional linear…
Echo dynamics and fidelity are often used to discuss stability in quantum information processing and quantum chaos. Yet fidelity yields no information about entanglement, the characteristic property of quantum mechanics. We study the…
Using arbitrary symplectic structures and parametrization invariant actions, we develop a formalism, based on Dirac's quantization procedure, that allows us to consider theories with both space-space as well as space-time noncommutativity.…
The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…
Quantified Boolean Formula (QBF) is a notoriously hard generalization of \textsc{SAT}, especially from the point of view of parameterized complexity, where the problem remains intractable for most standard parameters. A recent work by…
We study query containment in three closely related formalisms: monadic disjunctive Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems), and ontology-mediated queries (OMQs) based on expressive description…
It is shown that the rich algebraic structure of the standard $d$-dimensional Coulomb problem can be extended to its Dunkl counterpart. Replacing standard derivatives by Dunkl ones in the so($d+1$,2) dynamical algebra generators of the…
We consider the problem of Partial Quantifier Elimination (PQE). Given formula exists(X)[F(X,Y) & G(X,Y)], where F, G are in conjunctive normal form, the PQE problem is to find a formula F*(Y) such that F* & exists(X)[G] is logically…
Recently, the separated fragment (SF) of first-order logic has been introduced. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. SF properly generalizes both the…