Search for dissertations about: "proofs"

Showing result 1 - 5 of 146 swedish dissertations containing the word proofs.

  2. 1. Identity of proofs

    Author : Filip Widebäck; Peter Schroeder-Heister; Stockholms universitet; []
    Keywords : Theoretical Philosophy; teoretisk filosofi;

    Abstract : In the early seventies it was conjectured that a certain mathematically well-defined equivalence relation (bh-equivalence) on proofs in natural deduction captures the informal notion of identity of proofs. The conjecture can be divided into two parts, a soundness part and a completeness part. READ MORE

  4. 2. Short Proofs May Be Spacious : Understanding Space in Resolution

    Author : Jakob Nordström; Johan Håstad; Albert Atserias; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Proof complexity; resolution; space; length; width; separation; lower bound; pebble game; pebbling formula; Beviskomplexitet; resolution; minne; längd; bredd; separation; undre gräns; pebblingspel; pebblingformel; Theoretical computer science; Teoretisk datalogi;

    Abstract : Om man ser på de bästa nu kända algoritmerna för att avgöra satisfierbarhet hos logiska formler så är de allra flesta baserade på den så kallade DPLL-metoden utökad med klausulinlärning. De två viktigaste gränssättande faktorerna för sådana algoritmer är hur mycket tid och minne de använder, och att förstå sig på detta är därför en fråga som har stor praktisk betydelse. READ MORE

  5. 3. Formal proofs of combinatorial completeness

    Author : Verónica Gaspes; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : .... READ MORE

  6. 4. Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness

    Author : Sangxia Huang; Johan Håstad; Rishi Saket; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Combinatorial optimization; approximation; inapproximability; hardness; probabilistically checkable proofs; pcp; perfect completeness; boolean constraint satisfaction problem; csp; graph coloring; hypergraph coloring; direct sum; superposition; label cover; Computer Science; Datalogi;

    Abstract : A Probabilistically Checkable Proof (PCP) of a mathematical statement is a proof written in a special manner that allows for efficient probabilistic verification. The celebrated PCP Theorem states that for every family of statements in NP, there is a probabilistic verification procedure that checks the validity of a PCP proof by reading only 3 bits from it. READ MORE

  7. 5. Theory Exploration for Programs and Proofs

    Author : Sólrún Einarsdóttir; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Theorem Proving; Automated Reasoning; Theory Exploration; Property-Based Testing; Functional Programming; Conjecture Generation; Artificial Intelligence; Coinduction;

    Abstract : We have built two theory exploration systems, Cohipster and RoughSpec . Theory exploration is a method of automatically conjecturing properties about the functions and structures that appear in a computer program or a formalization of a mathematical theory. READ MORE