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 34 for “"Automated theorem proving"”.
-
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 …
-
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 …
-
Temporal Logic Model Checking as Automated Theorem Proving
… or abstraction 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 …
-
Topics in Automated Theorem Proving and Program Generation
This thesis contains two parts, each deals with a different subject.
-
Automate Reasoning: Computer Assisted Proofs in Set Theory Using Godel's Algorithm for Class Formation
Automated reasoning, and in particular automated theorem proving, has become a very important research field within the world of mathematics. Besides being used to verify proofs of theorems, it has also been used to discover proofs of theorems which were previously open problems. In this thesis, an …
-
Nelson Oppen combination as a rewrite theory
… and integer matrices to demonstrate its use in automated theorem proving, and with hereditarily finite sets with reals to show its use with non-convex theories. This is done using both SMT solvers written in Maude itself via reflection (Variant-based satisfiability) and using external solvers …
-
Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic (Clause Form, Discrimination Networks, Heuristic Search, Locking Resolution)
This thesis describes a resolution based theorem prover designed for users with little or no knowledge of automated theorem proving. The prover is intended for high speed solution of small to moderate sized problems, usually with no user guidance. This contrasts with many provers designed to use …
-
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 …
-
Analysis of artificial neural networks for solving reasoning tasks /
… the use of artificial neural networks for automated theorem proving in the Lean 4 formal proof assistant. The central problem is semantic hallucination: models often produce proof steps that are syntactically correct but logically incorrect. A formal error probability framework is presented …
-
Kanoniczne i dualne rachunki erotetyczne dla logiki I-rzędu
W swojej książce First-Order Logic and Automated Theorem Proving Fitting wprowadził pojęcie własności niesprzeczności (CP), blisko spokrewnione z pojęciem zbioru Hintikki. Własność niesprzeczności jest rodziną formuł spełniającą pewne kryteria. Główne twierdzenie dotyczące CP głosi, że każdy …
-
Enumerating Query Plans via Conditional Tableau Interpolation
… approaches to query optimization leverage automated theorem proving and Craig interpolation to enumerate query plans that are correct and performance-optimal. In this thesis, we investigate and improve one of the state-of-the-art logic-based query optimizers – the Interpolation Test Bed …
-
Towards the automated modelling and formal verification of analog designs
… two formal verification methods, one based on automated theorem proving with MetiTarski, the other on predicate abstraction based model checking with HybridSal, are then used to verify functional properties on the extracted models. The methodology proposed is mechanical in nature and can be …
-
Computing relatively large algebraic structures by automated theory exploration
Automated reasoning technology provides means for inference in a formal context via a multitude of disparate reasoning techniques. Combining different techniques not only increases the effectiveness of single systems but also provides a more powerful approach to solving hard problems. Consequently …
-
New Models for Expert System Design
… is more expressive than first order logic. New automated theorem proving methods were developed for the belief logic. The new methods were implemented to form the 'inference engine' of the expert system. The new expert system compared favourably with systems which perform a similar task. The use …
-
A Proof-Theoretic Approach to Mathematical Knowledge Management
… research that is forever growing. Definitions, theorems, axioms, and proofs are integral part of every area of mathematics. The relationships between these elements bring to light the elegant abstractions that bind even the most intricate aspects of math and science. As the body of mathematics …
-
Algebraic Principles for Program Correctness Tools in Isabelle/HOL
… It is programmed in the Isabelle/HOL interactive theorem prover and yields simple lightweight mathematical components as well as program construction and verification tools that are themselves correct by construction. First, a simple tool is implemented using Kleeene algebra with tests (KAT) for …
-
Plural semantics for natural language understanding — a computational proof-theoretic approach
… formal semantics, computational linguistics and automated theorem proving and is based on the following main ideas. Whereas many existing approaches to plural semantics work on a model-theoretic basis using higher-order representation languages I propose a proof-theoretic approach to plural …
Page 1 of 2