English
Related papers

Related papers: Dynamic Conjunctive Queries

200 papers

A generalization of the results of Rasetti and Zanardi concerning avoiding errors in quantum computers by using states preserved by evolution is presented. The concept of the dynamical symmetry is generalized from the level of classical Lie…

Quantum Physics · Physics 2016-09-08 M. Durdevich , H. E. Makaruk , R. Owczarek

Partially ordered automata are automata where the transition relation induces a partial order on states. The expressive power of partially ordered automata is closely related to the expressivity of fragments of first-order logic on finite…

Logic in Computer Science · Computer Science 2023-06-22 Tomáš Masopust , Markus Krötzsch

Bottom-up knowledge compilation is a paradigm for generating representations of functions by iteratively conjoining constraints using a so-called apply function. When the input is not efficiently compilable into a language - generally a…

Computational Complexity · Computer Science 2021-12-24 Alexis de Colnet , Stefan Mengel

We show that first order logic (FO) and first order logic extended with modulo counting quantifiers (FOMOD) over purely functional vocabularies which extend addition, satisfy the Crane beach property (CBP) if the logic satisfies a normal…

Logic in Computer Science · Computer Science 2025-02-04 A. Baskar , A. V. Sreejith , R. S. Thinniyam

We develop dynamical non-Markovian description of quantum computing in weak coupling limit, in lowest order approximation. We show that long range memory of quantum reservoir produces strong interrelation between structure of noise and…

Quantum Physics · Physics 2009-11-07 Robert Alicki , Michal Horodecki , Pawel Horodecki , Ryszard Horodecki

We show that quantum oracles provide an advantage over classical oracles for answering classical counterfactual questions in causal models, or equivalently, for identifying unknown causal parameters such as distributions over functional…

Quantum Physics · Physics 2025-12-16 Ciarán M. Gilligan-Lee , Yìlè Yīng , Jonathan Richens , David Schmid

Natural language allows us to refer to novel composite concepts by combining expressions denoting their parts according to systematic rules, a property known as \emph{compositionality}. In this paper, we study whether the language emerging…

Computation and Language · Computer Science 2020-04-21 Rahma Chaabouni , Eugene Kharitonov , Diane Bouchacourt , Emmanuel Dupoux , Marco Baroni

This essay advocates the view that any problem that has a meaningful empirical content, can be formulated in constructive, more definitely, finite terms. We consider combinatorial models of dynamical systems and approaches to statistical…

Quantum Physics · Physics 2015-07-21 Vladimir V. Kornyak

Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…

Logic in Computer Science · Computer Science 2017-04-10 Marco Voigt

The dynamical structure factor is one of the experimental quantities crucial in scrutinizing the validity of the microscopic description of strongly correlated systems. However, despite its long-standing importance, it is exceedingly…

Strongly Correlated Electrons · Physics 2020-10-22 Maria Laura Baez , Marcel Goihl , Jonas Haferkamp , Juani Bermejo-Vega , Marek Gluza , Jens Eisert

We investigate conjunctive normal form (CNF) encodings of a function represented with a decomposable negation normal form (DNNF). Several encodings of DNNFs and decision diagrams were considered by (Abio et al. 2016). The authors…

Artificial Intelligence · Computer Science 2021-09-09 Petr Kučera , Petr Savický

In this paper, we consider first-order logic over unary functions and study the complexity of the evaluation problem for conjunctive queries described by such kind of formulas. A natural notion of query acyclicity for this language is…

Logic in Computer Science · Computer Science 2007-05-23 Arnaud Durand , Etienne Grandjean

Given a dynamical twist for a finite dimensional Hopf algebra we construct two weak Hopf algebras, using methods of Xu and Etingof-Varchenko, and show that they are dual to each other. We generalize the theory of dynamical quantum groups to…

Quantum Algebra · Mathematics 2007-05-23 Pavel Etingof , Dmitri Nikshych

We consider the interaction dynamics of a classical oscillator and a quantum two-level system for different pure-dephasing Hamiltonians of the type $\widehat{H}(q,p)=H_C(q,p)\boldsymbol{1}+H_I(q,p)\widehat\sigma_z$. This type of systems…

Chemical Physics · Physics 2023-03-15 Giovanni Manfredi , Antoine Rittaud , Cesare Tronci

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an…

Computational Complexity · Computer Science 2015-07-13 Abuzer Yakaryilmaz , A. C. Cem Say , H. Gökalp Demirci

Semantic degeneracy represents a fundamental property of natural language that extends beyond simple polysemy to encompass the combinatorial explosion of potential interpretations that emerges as semantic expressions increase in complexity.…

Computation and Language · Computer Science 2025-07-16 Christopher J. Agostino , Quan Le Thien , Molly Apsel , Denizhan Pak , Elina Lesyk , Ashabari Majumdar

These lecture notes survey some joint work with Samson Abramsky. Somewhat informally I will discuss the main results in a pedestrian not too technical way. These include: (1) `The logic of entanglement', that is, the identification and…

Quantum Physics · Physics 2009-11-11 Bob Coecke

Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…

Artificial Intelligence · Computer Science 2026-02-10 Quentin Cohen-Solal , Alexandre Niveau , Maroua Bouzid

For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a non-regular language, PDL[L] can express non-regular…

Logic in Computer Science · Computer Science 2011-06-08 Markus Latte

This study investigates the entanglement properties of quantum dots (QDs) under a universal Hamiltonian where the Coulomb interaction between particles (electrons or holes) decouples into a charging energy and an exchange coupling term.…

Quantum Physics · Physics 2024-08-13 Jahanfar Abouie , Daryoosh Vashaee
‹ Prev 1 8 9 10 Next ›