43,211 research outputs found

    Bipolar Proof Nets for MALL

    Full text link
    In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious refinement of Classical Logic. Moreover, we set a correspon- dence between this paradigm and those more pragmatic ones inspired to transactional or distributed systems. In particular we show that the construction of additive proof nets can be interpreted as a model for super-ACID (or co-operative) transactions over distributed transactional systems (typi- cally, multi-databases).Comment: Proceedings of the "Proof, Computation, Complexity" International Workshop, 17-18 August 2012, University of Copenhagen, Denmar

    A Proof-Theoretic Approach to Scope Ambiguity in Compositional Vector Space Models

    Full text link
    We investigate the extent to which compositional vector space models can be used to account for scope ambiguity in quantified sentences (of the form "Every man loves some woman"). Such sentences containing two quantifiers introduce two readings, a direct scope reading and an inverse scope reading. This ambiguity has been treated in a vector space model using bialgebras by (Hedges and Sadrzadeh, 2016) and (Sadrzadeh, 2016), though without an explanation of the mechanism by which the ambiguity arises. We combine a polarised focussed sequent calculus for the non-associative Lambek calculus NL, as described in (Moortgat and Moot, 2011), with the vector based approach to quantifier scope ambiguity. In particular, we establish a procedure for obtaining a vector space model for quantifier scope ambiguity in a derivational way.Comment: This is a preprint of a paper to appear in: Journal of Language Modelling, 201

    A Quantum Bousso Bound

    Get PDF
    The Bousso bound requires that one quarter the area of a closed codimension two spacelike surface exceeds the entropy flux across a certain lightsheet terminating on the surface. The bound can be violated by quantum effects such as Hawking radiation. It is proposed that at the quantum level the bound be modified by adding to the area the quantum entanglement entropy across the surface. The validity of this quantum Bousso bound is proven in a two-dimensional large N dilaton gravity theory.Comment: 17 page

    Polarities & Focussing: a journey from Realisability to Automated Reasoning

    No full text
    This dissertation explores the roles of polarities and focussing in various aspects of Computational Logic.These concepts play a key role in the the interpretation of proofs as programs, a.k.a. the Curry-Howard correspondence, in the context of classical logic. Arising from linear logic, they allow the construction of meaningful semantics for cut-elimination in classical logic, some of which relate to the Call-by-Name and Call-by-Value disciplines of functional programming. The first part of this dissertation provides an introduction to these interpretations, highlighting the roles of polarities and focussing. For instance: proofs of positive formulae provide structured data, while proofs of negative formulae consume such data; focussing allows the description of the interaction between the two kinds of proofs as pure pattern-matching. This idea is pushed further in the second part of this dissertation, and connected to realisability semantics, where the structured data is interpreted algebraically, and the consumption of such data is modelled with the use of an orthogonality relation. Most of this part has been proved in the Coq proof assistant.Polarities and focussing were also introduced with applications to logic programming in mind, where computation is proof-search. In the third part of this dissertation, we push this idea further by exploring the roles that these concepts can play in other applications of proof-search, such as theorem proving and more particularly automated reasoning. We use these concepts to describe the main algorithm of SAT-solvers and SMT-solvers: DPLL. We then describe the implementation of a proof-search engine called Psyche. Its architecture, based on the concept of focussing, offers a platform where smart techniques from automated reasoning (or a user interface) can safely and trustworthily be implemented via the use of an API

    Design of a (mini) wide plate specimen for strain-based weld integrity assessment

    Get PDF
    Wide plate tension tests are commonly executed to investigate the integrity of defective welds under a uniaxial load. The specimen can be flat or curved, depending on the geometry from which it has been extracted (plate or pipe). Despite its usefulness, the design of the (curved) wide plate test is still not standardized up-to-date. This paper compares two specimen designs with a different length-to-width ratio through finite element analysis, using a design-of-experiments approach to account for different influential factors. The results reveal significant differences between the interpretation of tests with net section collapse and gross section collapse, promoted by weld strength overmatch. Further, both investigated designs tend to provide similar estimates of failure mode, strain capacity and crack driving force. Hence, the shorter specimen is considered an acceptable alternative to the slightly more representative longer specimen
    corecore