Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"Proof Complexity"”.

  1. QBF Proof Complexity

    Quantified Boolean Formulas (QBF) and their proof complexity are not as well understood as propositional formulas, yet remain an area of interest due to their relation to QBF solving. Proof systems for QBF provide a theoretical underpinning for the performance of these solvers. We define a novel …

    whiterose Download PDF for QBF Proof Complexity (opens in a new tab)

  2. Proof Complexity: A Tableau Perspective

    Η μέθοδος των σημασιολογικών tableaux (ή απλά tableaux) είναι αναμφίβολα ένα από τα πιο κομψά αποδεικτικά συστήματα. Δυστυχώς, δεν έχει λάβει την απαραίτητη προσοχή στην βιβλιογραφία της πολυπλοκότητας αποδείξεων, κυρίως λόγω αρνητικών αποτελεσμάτων που αφορούν την πολυπλοκότητα των χωρίς-τομών …

    athens Repository record for Proof Complexity: A Tableau Perspective (opens in a new tab)

  3. Uniformity and Nonuniformity in Proof Complexity

    … of the relations between uniform and nonuniform proof complexity and computational complexity. Nonuniform proof complexity studies the lengths of proofs in various propositional proof systems such as Frege . Uniform proof complexity studies the provability strength of bounded arithmetic theories …

    toronto-retro Repository record for Uniformity and Nonuniformity in Proof Complexity (opens in a new tab)

  4. The Proof Complexity of Integer Programming

    Proof complexity provides a promising approach aimed at resolving the P versus NP question by establishing the nonexistence of propositional proof systems which admit short proofs of every tautology. Proof complexity suggests an incremental program of proving lower bounds on the size of proofs in …

    toronto-retro Repository record for The Proof Complexity of Integer Programming (opens in a new tab)

  5. Proof Complexity for Quantified Boolean Formulas

    … problems can be expressed as QBFs. QBF proof complexity is the theoretical analysis of algorithmic techniques for solving QBFs. We make a detailed comparison of the proof systems Q-Res, QU-Res, and ∀Exp + Res which extend propositional Resolution with different rules for reasoning about …

    whiterose Download PDF for Proof Complexity for Quantified Boolean Formulas (opens in a new tab)

  6. Proof Complexity of Modal Resolution Systems

    In this thesis we initiate the study of the proof complexity of modal resolution systems. To our knowledge there is no previous work on the proof complexity of such systems. This is in sharp contrast to the situation for propositional logic where resolution is the most studied proof system, in part …

    whiterose Download PDF for Proof Complexity of Modal Resolution Systems (opens in a new tab)

  7. Algorithmic applications of propositional proof complexity

    This thesis explores algorithmic applications of proof complexity theory to the areas of exact and approximation algorithms for graph problems as well as propositional reasoning systems studied commonly by the artificial intelligence and formal verification communities. On the theoretical side, our …

    washington Repository record for Algorithmic applications of propositional proof complexity (opens in a new tab)

  8. Applications of Games to Propositional Proof Complexity

    … help prove results in the area of propositional proof complexity. The results in this thesis can be divided into two sets, the first being dedicated to the study of Resolution space (memory) requirements, whereas the second is centered on formalizing the notion of `dangerous' reductions. The …

    toronto-retro Repository record for Applications of Games to Propositional Proof Complexity (opens in a new tab)

  9. Power of Non-uniformity in Proof Complexity

    … concerned with the strength of non-uniformity in proof complexity. The non-uniform part is there because we look at quantified propositional proof systems. With these proof systems we are interested in the minimum size of proofs that prove a family of tautologies. Like circuits, these proofs are …

    toronto-retro Repository record for Power of Non-uniformity in Proof Complexity (opens in a new tab)

  10. Algebraic Methods in Query and Proof Complexity

    … have become a powerful tool for analyzing the complexity of various computational models, including low-depth circuits, algebraic proofs, and quantum query algorithms. In particular, the complexity of computing a function in these models is related to whether or not the function admits a …

    toronto-retro Repository record for Algebraic Methods in Query and Proof Complexity (opens in a new tab)

  11. Proof complexity of systems of branching programs

    This work investigates the proof complexity of multiple systems about deterministic and non-deterministic branching programs (BPs and NBPs respectively). It is based on work by Buss, Das and Knop, where they defined the systems eLpNqDT reasoning with (N)BPs by using extension variables/axioms to …

    birmingham Download PDF for Proof complexity of systems of branching programs (opens in a new tab)

  12. Reasons for Hardness in QBF Proof Complexity

    … has much wider applications in practice. QBF proof complexity forms the theoretical basis for understanding QBF solving, as well as providing insights into more general complexity theory, but is less well understood than propositional proof complexity. We begin this thesis by looking at the …

    whiterose Download PDF for Reasons for Hardness in QBF Proof Complexity (opens in a new tab)

  13. On the Algebraic Proof Complexity of Constraint Satisfaction

    … thesis comprises three papers in the field of proof complexity, in which the objects of study are certificates of unsatisfiability. In algebraic proof complexity, the aim is to prove lower bounds on the complexity of certifying that there is no common root of a given set of polynomials. We will …

    lund Repository record for On the Algebraic Proof Complexity of Constraint Satisfaction (opens in a new tab) Download PDF for On the Algebraic Proof Complexity of Constraint Satisfaction (opens in a new tab)

  14. Quantified Boolean Formulas: Proof Complexity and Models of Solving

    … introducing new lower-bound techniques for QBF proof systems, we study the relative strengths of models of dependency-aware solving, including the proposal of new, stronger models. Proof Complexity: Using the strategy extraction paradigm, we introduce new lower-bound techniques that apply to …

    whiterose Download PDF for Quantified Boolean Formulas: Proof Complexity and Models of Solving (opens in a new tab)

  15. Understanding and Improving SAT Solvers via Proof Complexity and Reinforcement Learning

    … capturing solver behavior and thus prove tighter complexity bounds; and second, to further experimentally verify the soundness of the theory thus developed via rigorous empirical analysis and design theory-inspired techniques to improve solver performance. This interplay between theory and …

    waterloo Repository record for Understanding and Improving SAT Solvers via Proof Complexity and Reinforcement Learning (opens in a new tab)

  16. A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic

    … software verification. In this thesis, we use proof complexity to pave a new path towards verifying nonlinear integer arithmetic. We propose that pseudo-Boolean solvers equipped with cutting planes reasoning have the potential to combine the complementary strengths of the existing SAT and …

    washington Repository record for A Path Paved by Proof Complexity Towards Verifying Nonlinear Integer Arithmetic (opens in a new tab)

  17. Complexities of Proof-Theoretical Reductions

    … Weiermann to give a general method to study the proof-complexity of Pi_2 sentences. This general method uses the generalised ordinal-analysis that was given by Buchholz, Rueede and Strahm as well as the generalised characterisation of provable-recursive functions of PA with axioms for transfinite …

    whiterose Download PDF for Complexities of Proof-Theoretical Reductions (opens in a new tab)

  18. A Generalization of Square-free Strings

    … the problem, ranging from patterns in strings to Proof Complexity. We also study the shuffle property (analogous to shuffling a deck of cards labeled with symbols) of strings, and explore the relationship between string shuffle and graphs, and show that large classes of graphs can be represented …

    mcmaster Repository record for A Generalization of Square-free Strings (opens in a new tab)

  19. Structure-based satisfiability checking : analyzing and harnessing the potential

    … search methods for SAT. Both experimental and proof complexity theoretic approaches are applied. The main contributions are three-fold. The work contributes to the analysis of structure-based branching heuristics. A proof complexity theoretic power hierarchy is established for DPLL and clause …

    aalto Repository record for Structure-based satisfiability checking : analyzing and harnessing the potential (opens in a new tab)

  20. Formalizing Combinatorial Matrix Theory

    <p>In this thesis we are concerned with the complexity of formalizing reasoning in Combinatorial Matrix Theory (CMT). We are interested in the strength of the bounded arithmetic theories necessary in order to prove the fundamental results of this field. Bounded Arithmetic can be seen as the uniform …

    mcmaster Repository record for Formalizing Combinatorial Matrix Theory (opens in a new tab)

Page 1 of 2