Related papers: A Simplified and Improved Free-Variable Framework …
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…
The variation of word meaning according to the context leads us to enrich the type system of our syntactical and semantic analyser of French based on categorial grammars and Montague semantics (or lambda-DRT). The main advantage of a deep…
Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full…
In the recent years, a number of parameter-free algorithms have been developed for online linear optimization over Hilbert spaces and for learning with expert advice. These algorithms achieve optimal regret bounds that depend on the unknown…
Verification of higher-order probabilistic programs is a challenging problem. We present a verification method that supports several quantitative properties of higher-order probabilistic programs. Usually, extending verification methods to…
We propose a notion of quantum control in a quantum programming language which permits the superposition of finitely many quantum operations without performing a measurement. This notion takes the form of a conditional construct similar to…
The formalism for non-Hermitian quantum systems sometimes blurs the underlying physics. We present a systematic study of the vielbein-like formalism which transforms the Hilbert space bundles of non-Hermitian systems into the conventional…
We describe a simple method to derive high performance semidefinite programming relaxations for optimizations over complex and real operator algebras in finite dimensional Hilbert spaces. The method is very flexible, easy to program and…
In this paper we consider energy operator (a free Hamiltonian), in the second-quantized approach, for the multiparameter quon algebras: $a_{i}a_{j}^{\dagger}-q_{ij}a_{j}^{\dagger}a_{i} = \delta_{ij}, i,j\in I$ with $(q_{ij})_{i,j\in I}$ any…
In the context of kernel optimization, we prove a result that yields new factorizations and realizations. Our initial context is that of general positive operator-valued kernels. We further present implications for Hilbert space-valued…
Simulations of specifications are introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward simulations. A specification implements another specification…
In this paper, we study computational complexity and expressive power of modal operators for definite descriptions, which correspond to statements `the modal world which satisfies formula \(varphi\)'. We show that adding such operators to…
We study the quantum dynamics of a time reparametrization invariant system with a vanishing Hamiltonian. The evolution of the physical degrees of freedom of the system is described, both at the classical and at the quantum level, in…
Motivated by applications, we introduce a general and new framework for operator valued positive definite kernels. We further give applications both to operator theory and to stochastic processes. The first one yields several dilation…
Substitutions play a crucial role in a wide range of contexts, from analyzing the dynamics of social opinions and conducting mathematical computations to engaging in game-theoretical analysis. For many situations, considering one-step…
We present a general logical framework for reasoning about agents' cognitive attitudes of both epistemic type and motivational type. We show that it allows us to express a variety of relevant concepts for qualitative decision theory…
The problems of optimally estimating a phase, a direction, and the orientation of a Cartesian frame (or trihedron) with general pure states are addressed. Special emphasis is put on estimation schemes that allow for inconclusive answers or…
In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition…
We prove that all valid Herbrand equalities can be inter-procedurally inferred for programs where all assignments whose right-hand sides depend on at most one variable are taken into account. The analysis is based on procedure summaries…
New explicit velocity- and position-Verlet-like algorithms of the second order are proposed to integrate the equations of motion in many-body systems. The algorithms are derived on the basis of an extended decomposition scheme at the…