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 29 for “"Automatic theorem proving"”.

  1. Ciklais paremta išvedimo paieška tiesinio laiko logikai /

    … of loop-type linear temporal logic automatic theorem prover. It allows the proving of GLT sequent calculus formulas. Linear temporal logic semantics and sintax is described. The chosen data structures for automatic theorem proving are empirically tested for their validity and fit. …

    vilnius Repository record for Ciklais paremta išvedimo paieška tiesinio laiko logikai / (opens in a new tab)

  2. Automatinio įrodymo sistema laiko logikai /

    … resolution, sequent) have been created to derive theorems, and based on the calculi algorythms and automated theorem proving systems have been created. In this work, propositional linear temporal logic (PLTL) is considered: syntax, semantics, theorem proving methods and calculi. Based on the …

    vilnius Repository record for Automatinio įrodymo sistema laiko logikai / (opens in a new tab)

  3. Įrodymo strategijų kūrimas naudojant genetinius algoritmus /

    … find the best possible search strategies for the automatic theorem proving system "E". Individuals of population are coded as search strategies, and they are evaluated using a base of TPTP formulas (problems). Crossing of individuals is performed by transferring clause evaluation functions from …

    vilnius Repository record for Įrodymo strategijų kūrimas naudojant genetinius algoritmus / (opens in a new tab)

  4. Guiding linear deductions with semantics

    Guidance is a central issue in Automatic Theorem Proving systems due to the enormity of the search space that these systems navigate. Semantic guidance uses semantic information to direct the path an ATP system takes through the search space. The use of semantic information is potentially more …

    jamescook Download PDF for Guiding linear deductions with semantics (opens in a new tab)

  5. Automatic sequences from algebraic, dynamical, and computational perspectives

    We investigate some interesting properties of automatic sequences and other relative families of sequences using three broadly distinguished approaches: algebraic, dynamical, and computational. We consider the semigroup associated to a primitive substitution. We use it to construct a minimal …

    the-open-u Download PDF for Automatic sequences from algebraic, dynamical, and computational perspectives (opens in a new tab)

  6. Decision Algorithms for Ostrowski-Automatic Sequences

    We extend the notion of automatic sequences to a broader class, the Ostrowski-automatic sequences. We develop a procedure for computationally deciding certain combinatorial and enumeration questions about such sequences that can be expressed as predicates in first-order logic. In Chapter 1, we …

    waterloo Repository record for Decision Algorithms for Ostrowski-Automatic Sequences (opens in a new tab)

  7. Formal Verification of Relational Model Transformations using an Intermediate Verification Language

    … interested in relational model transformations. Proving the correctness of relational model transformations is our major concern. Typically “correctness” is specified by MTr developers using contracts. Contracts are the annotations on the MTr which express constraints under which the MTr are …

    maynooth Download PDF for Formal Verification of Relational Model Transformations using an Intermediate Verification Language (opens in a new tab)

  8. An Encoding of the Clock Cycle Semantics of Bluespec SystemVerilog in PVS

    … descriptions may be used to generate such models automatically. We further demonstrate the utility of said models, using them to demonstrate non-trivial correctness properties. We also present a method of generating hardware descriptions, logical models, and proofs from a class of tabular …

    mcmaster Repository record for An Encoding of the Clock Cycle Semantics of Bluespec SystemVerilog in PVS (opens in a new tab)

  9. An analysis of Specware and its usefulness in the verification of high assurance systems

    … that can express formal logic, and an automated theorem tool that can be used to verify theorems and conjectures within the specifications. One example of a verification system is Specware. This thesis presents an analysis of Specware against a set of evaluation criteria in order to determine the …

    nps Repository record for An analysis of Specware and its usefulness in the verification of high assurance systems (opens in a new tab)

  10. 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)

  11. Automated reasoning about actions

    The study of reasoning about a tions is an important subarea of the theory of ommonsense reasoning. It is on erned with developing appropriate systems of logi for des ribing a tions and their e e ts on the world. In spite of the fa t that this reasoning is based on ommon sense and does not involve …

    texas Repository record for Automated reasoning about actions (opens in a new tab)

  12. Two Categories of Refutation Decision Procedures for Classical and Intuitionistic Propositional Logic

    An automatic theorem prover is a computer program that proves theorems without the assistance of a human being. Theorem proving is an important basic tool in proving theorems in mathematics, establishing the correctness of computer programs, proving the correctness of communication protocols, and …

    clemson Repository record for Two Categories of Refutation Decision Procedures for Classical and Intuitionistic Propositional Logic (opens in a new tab)

  13. Automated reasoning and machine learning

    This dissertation introduces new theorem-proving strategies and uses these strategies to solve a wide variety of difficult problems requiring logical reasoning. It also shows how to use theorem-proving to solve the problem of learning mathematical concepts. Our first algorithm constructs formulas …

    hawaii Repository record for Automated reasoning and machine learning (opens in a new tab)

  14. Combining advanced formal hardware verification techniques

    … formal verification is to modify general-purpose theorem proving techniques to increase the number of lemma instances considered automatically. Such a modification to the forward chaining proof technique within the ACL2 theorem prover is described. This dissertation identifies a decidable subclass …

    texas Repository record for Combining advanced formal hardware verification techniques (opens in a new tab)

Page 1 of 2