Results 1 to 10 of about 1,423 (254)

Another look at automated theorem-proving [PDF]

open access: bronzeJournal of Mathematical Cryptology, 2007
I examine the use of automated theorem-proving for reductionist security arguments in cryptography and discuss three papers that purport to show the potential of computer-assisted proof-writing and proof-checking.
Koblitz Neal
doaj   +3 more sources

Dealing with Degeneracies in Automated Theorem Proving in Geometry [PDF]

open access: yesMathematics, 2021
We report, through different examples, the current development in GeoGebra, a widespread Dynamic Geometry software, of geometric automated reasoning tools by means of computational algebraic geometry algorithms.
Zoltán Kovács   +3 more
doaj   +3 more sources

Proof simplification and automated theorem proving. [PDF]

open access: yesPhilos Trans A Math Phys Eng Sci, 2019
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper, I describe a technique for simplifying automated proofs. Hopefully, this discussion will stimulate interest in the larger, still open, question of what reasonable measures of proof simplicity might be. This article is part
Kinyon M.
europepmc   +7 more sources

Theory links: Applications to automated theorem proving

open access: bronzeJournal of Symbolic Computation, 1987
We develop the notion of theory link, which is a generalization of ordinary link to a set of literals that are simultaneously unsatisfiable relative to a given set of clauses. We show that theory links may be ‘activated‘ in much the same manner as ordinary links when inferencing with respect to the given set of clauses.
Neil V. Murray, Erik Rosenthal
openalex   +3 more sources

Automated Theorem Proving with Spider Diagrams

open access: goldElectronic Notes in Theoretical Computer Science, 2004
AbstractSpider diagrams are a visual notation for expressing logical statements. In this paper we describe a tool that supports reasoning with a sound and complete spider diagram system. The tool allows the construction of diagrams and proofs by users.
Jean Flower, Gem Stapleton
openalex   +3 more sources

Automated theorem proving reveals a lengthy Andrews–Curtis trivialization for a Miller-Schupp trivial group presentation

open access: goldExamples and Counterexamples
We present an independently discovered Andrews–Curtis trivialization of the balanced trivial group presentation MS9(w∗)=〈a,b∣a−1b9ab−10,a−1b−1aba−1〉 obtained through automated theorem proving.
Alexei Lisitsa
doaj   +2 more sources

Canonical for Automated Theorem Proving in Lean [PDF]

open access: green
Canonical is a solver for type inhabitation in dependent type theory, that is, the problem of producing a term of a given type. We present a Lean tactic which invokes Canonical to generate proof terms and synthesize programs. The tactic supports higher-order and dependently-typed goals, structural recursion over indexed inductive types, and ...
Chase Norman, Jeremy Avigad
openalex   +3 more sources

Automated Theorem Proving in GeoGebra: Current Achievements [PDF]

open access: greenJournal of Automated Reasoning, 2015
GeoGebra is an open-source educational mathematics software tool, with millions of users worldwide. It has a number of features (integration of computer algebra, dynamic geometry, spreadsheet, etc.), primarily focused on facilitating student experiments, and not on formal reasoning.
Francisco Botana   +6 more
openalex   +4 more sources

An ensemble novel architecture for Bangla Mathematical Entity Recognition (MER) using transformer based learning [PDF]

open access: yesHeliyon
Mathematical entity recognition is indispensable for machines to accurately explain and depict mathematical content and to enable adequate mathematical operations and reasoning. It expedites automated theorem proving, speeds up the analysis and retrieval
Tanjim Taharat Aurpa, Md Shoaib Ahmed
doaj   +2 more sources

On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic [PDF]

open access: yesJournal of Universal Computer Science, 2021
There are three main problems for theorem proving with a standard cut-free system for the first order minimal logic. The first problem is the possibility of looping. Secondly, it might generate proofs which are permutations of each other. Finally, during
Ashot Baghdasaryan, Hovhannes Bolibekyan
doaj   +3 more sources

Home - About - Disclaimer - Privacy