Results 21 to 30 of about 39,214 (275)

The "never-proved" triangle inequality: A GeoGebra & CAS approach

open access: yesAIMS Mathematics, 2023
We use a quite simple, yet challenging, elementary geometry statement, the so-called "never proved" (by a mathematician) theorem, introduced by Prof.
Zoltán Kovács   +3 more
doaj   +1 more source

Simplification Method for Contradiction Separation Clause in First-order Logic AutomatedTheorem Prover CSE [PDF]

open access: yesJisuanji kexue
First-order logic automated theorem proving has the capacity to resolve a multitude of practical problems after formalization,and thus holds considerable practical value.As an advancement in automated theorem proving,contradiction separation deduction ...
WU Xin, CHEN Shuwei, JIANG Shipan
doaj   +1 more source

Another look at automated theorem-proving II

open access: yesJournal of Mathematical Cryptology, 2012
I continue the discussion initiated in part I (published in this journal in 2007) of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments.
Koblitz Neal
doaj   +1 more source

Hammering towards QED

open access: yesJournal of Formalized Reasoning, 2016
This paper surveys the emerging methods to automate reasoning over large libraries developed with formal proof assistants. We call these methods hammers.
Jasmin C. Blanchette   +3 more
doaj   +1 more source

Smarter Features, Simpler Learning? [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2019
Earlier work on machine learning for automated reasoning mostly relied on simple, syntactic features combined with sophisticated learning techniques. Using ideas adopted in the software verification community, we propose the investigation of more complex,
Sarah Winkler, Georg Moser
doaj   +1 more source

A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics

open access: yesMathematics, 2023
The increasing significance of theorem proving-based formalization in mathematics and computer science highlights the necessity for formalizing foundational mathematical theories. In this work, we employ the Coq interactive theorem prover to methodically
Dakai Guo, Wensheng Yu
doaj   +1 more source

Proof Pad: A New Development Environment for ACL2 [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
Most software development projects rely on Integrated Development Environments (IDEs) based on the desktop paradigm, with an interactive, mouse-driven user interface.
Caleb Eggensperger
doaj   +1 more source

Alternation-Trading Proofs, Linear Programming, and Lower Bounds [PDF]

open access: yes, 2010
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models.
Williams, Ryan
core   +6 more sources

Reinforcement Learning for Guiding the E Theorem Prover

open access: yesProceedings of the International Florida Artificial Intelligence Research Society Conference, 2023
Automated Theorem Proving (ATP) systems search for a proof in a rapidly growing space of possibilities. Heuristics have a profound impact on search, and ATP systems make heavy use of heuristics.
Jack McKeown, Geoff Sutcliffe
doaj   +1 more source

ConSIT: A conditioned program slicer [PDF]

open access: yes, 2000
Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including reuse, reengineering and program comprehension.
Danicic, S   +3 more
core   +3 more sources

Home - About - Disclaimer - Privacy