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 236 for “"Theorem Proving"”.

  1. Theorem Proving in Elementary Analysis

    We describe how the theorem prover Marcel, a program written by Randall Holmes, can be used to prove a result from introductory analysis. We were given the axioms for an ordered field, and we completed a proof of the theorem that every positive real number has a square root. Marcel implements …

    boise Repository record for Theorem Proving in Elementary Analysis (opens in a new tab)

  2. Mechanical Theorem Proving in Number Theory

    No abstract prepared.

    texas-state Repository record for Mechanical Theorem Proving in Number Theory (opens in a new tab)

  3. Learning Systems for Interactive Theorem Proving

    Interactive theorem proving is a great tool to establish correctness of programs and mathematics. Despite the well-known undecidability of any fairly expressive system, it is possible to leverage machine learning to help find proofs in a humanlike way. This thesis focuses on interactive theorem …

    anu Repository record for Learning Systems for Interactive Theorem Proving (opens in a new tab)

  4. A unit resolution theorem proving system

    A unit resolution theorem proving system is developed and compared with the previous work of C.L. Chang. This thesis includes a description of a particular approach to unit resolution and a description of the resulting program and its effectiveness.

    ubc Repository record for A unit resolution theorem proving system (opens in a new tab) Download PDF for A unit resolution theorem proving system (opens in a new tab)

  5. Formal probabilistic analysis using theorem proving

    … and statistical properties in a computer based theorem prover. The analysis carried out in this way is free from any approximation or precision issues due to the mathematical nature of the models and the inherent soundness of the theorem proving approach. The thesis mainly targets the two most …

    concordia Download PDF for Formal probabilistic analysis using theorem proving (opens in a new tab)

  6. Information-Theoretic Analysis using Theorem Proving

    … the trusted kernel of a higher-order-logic (HOL) theorem prover. For this purpose, we provide HOL formalizations of the fundamental theories of measure, Lebesgue integration and probability and use them to formalize some of the most widely used information-theoretic principles. We use the …

    concordia Download PDF for Information-Theoretic Analysis using Theorem Proving (opens in a new tab)

  7. Dependently Sorted Theorem Proving for Mathematical Foundations

    … we start with a picture of current existing theorem-proving systems. Then we describe our new meta-logical system (named DiaToM) for mechanizing foundations of mathematics. Using dependent sorts and first-order logic, our system (implemented as an LCF- style theorem-prover) improves on the …

    anu Repository record for Dependently Sorted Theorem Proving for Mathematical Foundations (opens in a new tab)

  8. Machine−Assisted Theorem−Proving for Software Engineering

    oxford Restricted access

  9. Automated Theorem Proving for General Game Playing

    While automated game playing systems like Deep Blue perform excellent within their domain, handling a different game or even a slight change of rules is impossible without intervention of the programmer. Considered a great challenge for Artificial Intelligence, General Game Playing is concerned …

    qucosa-diss

  10. Guiding Automated Theorem Proving with Machine Learning

    … can perform proof steps and recognise when a theorem has been proved. Computer systems that automate mathematics are called automated theorem provers (ATPs). ATPs have rules for valid inference, which prescribe how axioms and statements may be treated when searching for a proof. The number of …

    radboud Repository record for Guiding Automated Theorem Proving with Machine Learning (opens in a new tab) Download PDF for Guiding Automated Theorem Proving with Machine Learning (opens in a new tab)

  11. Using BDDs for non-classical propositional theorem proving

    … Tree Logic against other state of the art theorem provers and find that with appropriate optimisations the decision procedures are competitive. In particular we apply algorithmic optimisations such as early termination or converting a question of validity to a question of global logical …

    anu Repository record for Using BDDs for non-classical propositional theorem proving (opens in a new tab)

  12. Temporal Logic Model Checking as Automated Theorem Proving

    … is considered beyond the realm of automated FOL theorem provers. In this thesis, we focus on formulating the temporal logic model checking problem as a FOL theorem proving problem and use automated tools, such as SAT/SMT solvers to directly model check a system without the need for a fixed-point …

    waterloo Repository record for Temporal Logic Model Checking as Automated Theorem Proving (opens in a new tab)

  13. Building trustworthy smart contracts using interactive theorem proving

    … the real bytecode executed on-chain. Interactive theorem proving can provide the foundation for developing provably correct smart contracts. Due to the immutable nature of smart contracts and their potential to manage highly valuable assets and tokens representing power, techniques to ensure their …

    waikato-masters Repository record for Building trustworthy smart contracts using interactive theorem proving (opens in a new tab) Download file for Building trustworthy smart contracts using interactive theorem proving (opens in a new tab)

  14. Proof: an implementation of theorem-proving with equality

    Mechanical theorem-proving has, in the past, been hindered by the lack of an efficient method of treating the equality relation. A system (developed by E. E. Sibert) of first-order logic has been defined based on the structure of the equality relation. The program PROOF implements this system on …

    rice Repository record for Proof: an implementation of theorem-proving with equality (opens in a new tab)

  15. Geometric theorem proving using the Groebner basis algorithm

    The purpose fo this project is to study ideals in polynomial rings and affine varieties in order to establish a connection between these two different concepts. Doing so will lead to an in depth examination of Groebner bases. Once this has been defined, step will be outlined that will enable the …

    csusb Repository record for Geometric theorem proving using the Groebner basis algorithm (opens in a new tab)

  16. Geometric theorem proving using the Groebner basis algorithm

    The purpose fo this project is to study ideals in polynomial rings and affine varieties in order to establish a connection between these two different concepts. Doing so will lead to an in depth examination of Groebner bases. Once this has been defined, step will be outlined that will enable the …

    csusb-retro Repository record for Geometric theorem proving using the Groebner basis algorithm (opens in a new tab)

Page 1 of 12