Avancerad sökning
Visar resultat 1 - 5 av 16 avhandlingar som matchar ovanstående sökkriterier.
1. Automated Theorem Proving with Extensions of First-Order Logic
Sammanfattning : 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. LÄS MER
2. Stålmarck's Method for Automated Theorem Proving in First Order Logic
Sammanfattning : 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. LÄS MER
3. Automated Theorem Proving in a First-Order Logic with First class Boolean Sort
Sammanfattning : 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. LÄS MER
4. Deductive Program Analysis with First-Order Theorem Provers
Sammanfattning : Software is ubiquitous in nearly all aspects of human life, including safety-critical activities. It is therefore crucial to analyze programs and provide strong guarantees that they perform as expected. LÄS MER
5. Safety Proofs for Automated Driving using Formal Methods
Sammanfattning : The introduction of driving automation in road vehicles can potentially reduce road traffic crashes and significantly improve road safety. Automation in road vehicles also brings other benefits such as the possibility to provide independent mobility for people who cannot and/or should not drive. LÄS MER