Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Automated theorem provers"'
Autor:
Krysia Broda, Maximilian Doré
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 290, Iss Proc. ThEdu 2018, Pp 38-55 (2019)
Proving lemmas in synthetic geometry is often a time-consuming endeavour since many intermediate lemmas need to be proven before interesting results can be obtained. Improvements in automated theorem provers (ATP) in recent years now mean they can pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5aebf9ce326782e926f72c254db7c8ce
https://doi.org/10.4204/eptcs.290.4
https://doi.org/10.4204/eptcs.290.4
Publikováno v:
Intelligent Computer Mathematics-14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021, Proceedings
Lecture Notes in Computer Science ISBN: 9783030810962
CICM
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Intelligent Computer Mathematics
Lecture Notes in Computer Science ISBN: 9783030810962
CICM
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Intelligent Computer Mathematics
We present a large set of benchmarks for automated theorem provers that require inductive reasoning. Motivated by the need to compare first-order theorem provers, SMT solvers and inductive theorem provers, the setting of our examples follows the SMT-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c8f0db16191fea20aad0cf8ed526d6c
Autor:
Chandrakana Nandi, Pavel Panchekha, Oliver Flatt, Yisu Remy Wang, Zachary Tatlock, Max Willsey
An e-graph efficiently represents a congruence relation over many expressions. Although they were originally developed in the late 1970s for use in automated theorem provers, a more recent technique known as equality saturation repurposes e-graphs to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb9a5bfb90497b08c2b6f3003808d915
Autor:
Jiang, Yaqing
Over the past few years, machine learning has been successfully combined with automated theorem provers (ATPs) to prove conjectures from various proof assistants. However, such approaches do not usually focus on inductive proofs. In this work, we exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______463::704f50198e21b078ad282cbfbd38a853
https://hdl.handle.net/1842/36234
https://hdl.handle.net/1842/36234
Autor:
Michael Kinyon
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e68933c6d353829748519383bbfc8bd
https://europepmc.org/articles/PMC6365848/
https://europepmc.org/articles/PMC6365848/
Autor:
Pedro Quaresma, Vanda Santos
Publikováno v:
Proof Technology in Mathematics Research and Teaching ISBN: 9783030284824
Given its formal, logical, and spatial properties, geometry is well suited to teaching environments that include dynamic geometry systems (DGSs) , geometry automated theorem provers (GATPs), and repositories of geometric problems. These tools enable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77d061b62f39275d73f1399e5e3ad72c
https://doi.org/10.1007/978-3-030-28483-1_11
https://doi.org/10.1007/978-3-030-28483-1_11
Autor:
Di Long Li, Alwen Tiu
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030294359
CADE
CADE
Symbolic verification of security protocols typically relies on an attacker model called the Dolev-Yao model, which does not model adequately various algebraic properties of cryptographic operators used in many real-world protocols. In this work we d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a317c5cf85826726abeb58591aee70ce
https://doi.org/10.1007/978-3-030-29436-6_21
https://doi.org/10.1007/978-3-030-29436-6_21
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030294359
CADE
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Deduction – CADE 27
Automated Deduction – CADE 27-27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings
CADE
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Automated Deduction – CADE 27
Automated Deduction – CADE 27-27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings
We describe an efficient implementation of given clause selection in saturation-based automated theorem provers, extending the previous ENIGMA approach. Unlike in the first ENIGMA implementation where a fast linear classifier is trained and used toge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bc86355415e125b4da5fc79855bbe4f
https://doi.org/10.1007/978-3-030-29436-6_12
https://doi.org/10.1007/978-3-030-29436-6_12
Autor:
Maximilian Doré, Krysia Broda
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030211509
CSEDU (Selected Papers)
CSEDU (Selected Papers)
In teaching mathematics, theorem provers have been used only seldomly due to their technical nature. Theorem provers like Elfe can bridge the gap between informal and formal reasoning by using automated theorem provers to verify intermediate steps in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::539435ecb48a6e4570b03612dd0cf38a
https://doi.org/10.1007/978-3-030-21151-6_26
https://doi.org/10.1007/978-3-030-21151-6_26
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.