Search for dissertations about: "theorem-proving."
Showing result 1 - 5 of 30 swedish dissertations containing the word theorem-proving..
-
1. Verification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving
Abstract : Software infiltrates every aspect of modern society. Production, transportation, entertainment, and almost every other sphere that influences modern living are either directly or indirectly dependent on software systems. READ MORE
-
2. Automated Theorem Proving with Extensions of First-Order Logic
Abstract : Automated theorem provers are computer programs that check whether a logical conjecture follows from a set of logical statements. The conjecture and the statements are expressed in the language of some formal logic, such as first-order logic. READ MORE
-
3. Theory Exploration and Inductive Theorem Proving
Abstract : We have built two state-of-the-art inductive theorem provers named HipSpec and Hipster. The main issue when automating proofs by induction is to discover essential helper lemmas. Our theorem provers use the technique theory exploration, which is a method to systematically discover interesting conclusions about a mathematical theory. READ MORE
-
4. Stålmarck's Method for Automated Theorem Proving in First Order Logic
Abstract : We present an extension of Stålmarck's method to classical first order predicate logic. Stålmarck's method is a satisfiability checking method for propositional logic, and it resembles tableaux and KE. Its most distinctive feature is the dilemma rule, which is an extended branching rule, that allows branches to be recombined. READ MORE
-
5. Automated Theorem Proving in a First-Order Logic with First class Boolean Sort
Abstract : Automated theorem proving is one of the central areas of computer mathematics. It studies methods and techniques for establishing validity of mathematical problems using a computer. The problems are expressed in a variety of formal logics, including first-order logic. READ MORE