40 research outputs found
FLACOS’08 Workshop proceedings
The 2nd Workshop on Formal Languages and Analysis of Contract-Oriented Software (FLACOS’08) is held in Malta. The aim of the workshop is to bring together researchers and practitioners working on language-based solutions to contract-oriented software development. The workshop is partially funded by the Nordunet3 project “COSoDIS” (Contract-Oriented Software Development for Internet Services) and it attracted 25 participants. The program consists of 4 regular papers and 10 invited participant presentations
Pseudo-contractions as Gentle Repairs
Updating a knowledge base to remove an unwanted consequence is a challenging task. Some of the original sentences must be either deleted or weakened in such a way that the sentence to be removed is no longer entailed by the resulting set. On the other hand, it is desirable that the existing knowledge be preserved as much as possible, minimising the loss of information. Several approaches to this problem can be found in the literature. In particular, when the knowledge is represented by an ontology, two different families of frameworks have been developed in the literature in the past decades with numerous ideas in common but with little interaction between the communities: applications of AGM-like Belief Change and justification-based Ontology Repair. In this paper, we investigate the relationship between pseudo-contraction operations and gentle repairs. Both aim to avoid the complete deletion of sentences when replacing them with weaker versions is enough to prevent the entailment of the unwanted formula. We show the correspondence between concepts on both sides and investigate under which conditions they are equivalent. Furthermore, we propose a unified notation for the two approaches, which might contribute to the integration of the two areas
Compositional Models in Valuation-Based Systems
This is the author final draft. Copyright 2014 ElsevierCompositional models were initially described for discrete probability theory, and later extended for possibility theory and for belief functions in Dempster–Shafer (D–S) theory of evidence. Valuation-based system (VBS) is an unifying theoretical framework generalizing some of the well known and frequently used uncertainty calculi. This generalization enables us to not only highlight the most important theoretical properties necessary for efficient inference (analogous to Bayesian inference in the framework of Bayesian network), but also to design efficient computational procedures. Some of the specific calculi covered by VBS are probability theory, a version of possibility theory where combination is the product t-norm, Spohn’s epistemic belief theory, and D–S belief function theory. In this paper, we describe compositional models in the general framework of VBS using the semantics of no-double counting, which is central to the VBS framework. Also, we show that conditioning can be expressed using the composition operator. We define a special case of compositional models called decomposable models, again in the VBS framework, and demonstrate that for the class of decomposable compositional models, conditioning can be done using local computation. As all results are obtained for the VBS framework, they hold in all calculi that fit in the VBS framework. For the D–S theory of belief functions, the compositional model defined here differs from the one studied by Jiroušek, Vejnarová, and Daniel. The latter model can also be described in the VBS framework, but with a combination operator that is different from Dempster’s rule of combination. For the version of possibility theory in which combination is the product t-norm, the compositional model defined here reduces to the one studied by Vejnarová
Categorical Quantum Dynamics
We use strong complementarity to introduce dynamics and symmetries within the
framework of CQM, which we also extend to infinite-dimensional separable
Hilbert spaces: these were long-missing features, which open the way to a
wealth of new applications. The coherent treatment presented in this work also
provides a variety of novel insights into the dynamics and symmetries of
quantum systems: examples include the extremely simple characterisation of
symmetry-observable duality, the connection of strong complementarity with the
Weyl Canonical Commutation Relations, the generalisations of Feynman's clock
construction, the existence of time observables and the emergence of quantum
clocks.
Furthermore, we show that strong complementarity is a key resource for
quantum algorithms and protocols. We provide the first fully diagrammatic,
theory-independent proof of correctness for the quantum algorithm solving the
Hidden Subgroup Problem, and show that strong complementarity is the feature
providing the quantum advantage. In quantum foundations, we use strong
complementarity to derive the exact conditions relating non-locality to the
structure of phase groups, within the context of Mermin-type non-locality
arguments. Our non-locality results find further application to quantum
cryptography, where we use them to define a quantum-classical secret sharing
scheme with provable device-independent security guarantees.
All in all, we argue that strong complementarity is a truly powerful and
versatile building block for quantum theory and its applications, and one that
should draw a lot more attention in the future.Comment: Thesis submitted for the degree of Doctor of Philosophy, Oxford
University, Michaelmas Term 2016 (273 pages