Related papers: A more abstract bounded exploration postulate
Effective exploration in reinforcement learning requires not only tracking where an agent has been, but also understanding how the agent perceives and represents the world. To learn powerful representations, an agent should actively explore…
In this paper we inititate the study of abstract simplicial complexes which are initial segments of qualitative probability orders. This is a natural class that contains the threshold complexes and is contained in the shifted complexes, but…
Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to algorithms design. While each of them being very active in its own, there is an increasing attention to the connection…
The tensor product postulate of quantum mechanics states that the Hilbert space of a composite system is the tensor product of the components' Hilbert spaces. All current formalizations of quantum mechanics that do not contain this…
Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint…
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum…
Bugs in popular distributed protocol implementations have been the source of many downtimes in popular internet services. We describe a randomized testing approach for distributed protocol implementations based on reinforcement learning.…
We consider a discrete time semi-Markov process where the characteristics defining the process depend on a small perturbation parameter. It is assumed that the state space consists of one finite communicating class of states and, in…
We are often interested in identifying the feasible subset of a decision space under multiple constraints to permit effective design exploration. If determining feasibility required computationally expensive simulations, the cost of…
This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats…
The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
This paper proposes a method for abstracting control systems by timed game automata, and is aimed at obtaining automatic controller synthesis. The proposed abstraction is based on partitioning the state space of a control system using…
The theory of quantum states over time extends the density operator formalism into the temporal domain, providing a unified of treatment of timelike and spacelike separated systems in quantum theory. Although recent results have…
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…
The purpose of this paper is to formalize the concept that best synthesizes our intuitive understanding of quantum mechanics -- that the information carried by a system is limited -- and, from this principle, to construct the foundations of…
A common technique to verify complex logic specifications for dynamical systems is the construction of symbolic abstractions: simpler, finite-state models whose behaviour mimics the one of the systems of interest. Typically, abstractions…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
Three basic postulates for Quantum Theory are proposed, namely the Probability, Maximum-Speed and Hilbert-Space postulates. Subsequently we show how these postulates give rise to well-known and widely used quantum results, as the…
Many regenerative arguments in stochastic processes use random times which are akin to stopping times, but which are determined by the future as well as the past behaviour of the process of interest. Such arguments based on "conditioning on…