Related papers: A process calculus with finitary comprehended term…
We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any…
Quantum operations are the most widely used tool in the theory of quantum information processing, representing elementary transformations of quantum states that are composed to form complex quantum circuits. The class of quantum…
The notion of a generalized product, refining that of a (symmetric and smooth) simplicial space is introduced and shown to imply the existence of an algebra of pseudodifferential operators. This encompasses many constructions of such…
Quantum mechanics contains some strange unphysical concepts. Among these are complex numbers, Hilbert spaces with their unitary and self-adjoint operators, states represented by complex vectors, superpositions of states, collapse of wave…
This paper initiates a study into the century-old issue of market predictability from the perspective of computational complexity. We develop a simple agent-based model for a stock market where the agents are traders equipped with simple…
Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons. In this context, Answer Set Programming (ASP) has been shown to…
Symbolic control techniques aim to satisfy complex logic specifications. A critical step in these techniques is the construction of a symbolic (discrete) abstraction, a finite-state system whose behaviour mimics that of a given…
Starting from an arbitrary endomorphism $\alpha$ of a unital C*-algebra $A$ we construct a bigger C*-algebra $B$ and extend $\alpha$ onto $B$ in such a way that the extended endomorphism $\alpha$ has a unital kernel and a hereditary range,…
In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the…
We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a…
We provide a general construction of quantum generalized master equations with memory kernel leading to well defined, that is completely positive and trace preserving, time evolutions. The approach builds on an operator generalization of…
We consider the problem of formalizing the familiar notion of widening in abstract interpretation in higher-order logic. It turns out that many axioms of widening (e.g. widening sequences are ascending) are not useful for proving…
In this paper, a new axiomatization for unbounded functional calculi is proposed and the associated theory is elaborated comprising, among others, uniqueness and compatibility results and extension theorems of algebraic and topological…
Generic open quantum dynamics can be described by two seemingly very distinct approaches: a top down approach by considering an (unknown) environment coupled to the system and affects the observed dynamics of the system; or a bottom up…
Practically and intrinsically, inclusions of operator algebras are of fundamental interest. The subject of this paper is intermediate operator algebras of inclusions. There are two previously known theorems which naturally and completely…
Addressing uncertainty is critical for autonomous systems to robustly adapt to the real world. We formulate the problem of model uncertainty as a continuous Bayes-Adaptive Markov Decision Process (BAMDP), where an agent maintains a…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
In this paper, we define a Mathematical model of program structure. Mathematical model of program structure defined here provides unified mathematical treatment of program structure, which reveals that a program is a large and finite set of…
Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by…
A new method of deriving comparative statics information using generalized compensated derivatives is presented which yields constraint-free semidefiniteness results for any differentiable, constrained optimization problem. More generally,…