Related papers: Dynamic Conjunctive Queries
An extension of the Dirac procedure for the quantization of constrained systems is necessary to address certain issues that are left open in Dirac's original proposal. These issues play an important role especially in the context of…
Detection and elimination of redundant clauses from propositional formulas in Conjunctive Normal Form (CNF) is a fundamental problem with numerous application domains, including AI, and has been the subject of extensive research. Moreover,…
There is a vast gap in the quality of IDE tooling between static languages like Java and dynamic languages like Python or JavaScript. Modern frameworks and libraries in these languages heavily use their dynamic capabilities to achieve the…
A general formlulation for discrete-time quantum mechanics, based on Feynman's method in ordinary quantum mechanics, is presented. It is shown that the ambiguities present in ordinary quantum mechanics (due to noncommutativity of the…
A generalized algebra of quantum observables, depending on extra dimensional constants, is considered. Some limiting forms of the algebra are investigated and their possible applications to the descriptions of interactions of fundamental…
Answer Set Programming with Quantifiers (ASP(Q)) has been introduced to provide a natural extension of ASP modeling to problems in the polynomial hierarchy (PH). However, ASP(Q) lacks a method for encoding in an elegant and compact way…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
We address the problem of Conjunctive Query Answering (CQA) for the description logic $\dlssx$ ($\shdlssx$, for short) which extends the logic $\dlss$ with Boolean operations on concrete roles and with the product of concepts. The result is…
In this paper, we explore various ways in which a factor $\sigma$-algebra $\mathscr{B}$ can sit in a dynamical system $\mathbf{X} :=(X, \mathscr{A}, \mu, T)$, i.e. we study some possible structures of the extension $\mathscr{A} \rightarrow…
The stochastic--quantum correspondence reinterprets quantum dynamics as arising from an underlying stochastic process on a configuration space. We generalize the correspondence by lifting an arbitrary stochastic kernel $\Gamma$ in finite…
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…
Circuits in deterministic decomposable negation normal form (d-DNNF) are representations of Boolean functions that enable linear-time model counting. This paper strengthens our theoretical knowledge of what classes of functions can be…
General Theory of Relativity and Quantum theory gives two different description of the same mother nature in the big and small scale respectively. Mathematical languages of these two theories are entirely different, one is geometric while…
We generalize quantum-classical PCPs, first introduced by Weggemans, Folkertsma and Cade (TQC 2024), to allow for $q$ quantum queries to a polynomially-sized classical proof ($\mathsf{QCPCP}_{Q,c,s}[q]$). Exploiting a connection with the…
A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
Precise rules are developed in order to formalize the reasoning processes involved in standard non-relativistic quantum mechanics, with the help of analogies from classical physics. A classical or quantum description of a mechanical system…
Quantum based systems are a relatively new research area for that different modelling languages including process calculi are currently under development. Encodings are often used to compare process calculi. Quality criteria are used then…
Open quantum systems are governed by both unitary and non-unitary dynamics, with dissipation arising from the latter. Traditional quantum divergence measures, such as quantum relative entropy, fail to account for the non-unitary oriented…
We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly…