|
| 1 | +% SPDX-License-Identifier: PMPL-1.0-or-later |
| 2 | +% Bibliography for "Neurosymbolic Theorem Proving" (ECHIDNA) |
| 3 | +% All references are real, verifiable publications. |
| 4 | +
|
| 5 | +@manual{coq, |
| 6 | + author = {Bruno Barras and Thierry Coquand and {The Coq Development Team}}, |
| 7 | + title = {The {Coq} Proof Assistant Reference Manual, Version 8.18}, |
| 8 | + organization = {INRIA}, |
| 9 | + year = {2023}, |
| 10 | + url = {https://coq.inria.fr/refman/}, |
| 11 | +} |
| 12 | + |
| 13 | +@inproceedings{lean4, |
| 14 | + author = {Leonardo de Moura and Sebastian Ullrich}, |
| 15 | + title = {The {Lean~4} Theorem Prover and Programming Language}, |
| 16 | + booktitle = {Automated Deduction -- {CADE-28}}, |
| 17 | + series = {Lecture Notes in Artificial Intelligence}, |
| 18 | + volume = {12699}, |
| 19 | + pages = {625--635}, |
| 20 | + publisher = {Springer}, |
| 21 | + year = {2021}, |
| 22 | + doi = {10.1007/978-3-030-79876-5_37}, |
| 23 | +} |
| 24 | + |
| 25 | +@inproceedings{isabelle, |
| 26 | + author = {Makarius Wenzel and Lawrence C. Paulson and Tobias Nipkow}, |
| 27 | + title = {The {Isabelle} Framework}, |
| 28 | + booktitle = {Theorem Proving in Higher Order Logics}, |
| 29 | + series = {Lecture Notes in Computer Science}, |
| 30 | + volume = {2152}, |
| 31 | + pages = {33--38}, |
| 32 | + publisher = {Springer}, |
| 33 | + year = {2008}, |
| 34 | + doi = {10.1007/3-540-44659-1_2}, |
| 35 | +} |
| 36 | + |
| 37 | +@misc{alphaproof, |
| 38 | + author = {{AlphaProof Team}}, |
| 39 | + title = {{AI} Achieves Silver-Medal Standard Solving {International Mathematical Olympiad} Problems}, |
| 40 | + year = {2024}, |
| 41 | + note = {Google DeepMind Blog}, |
| 42 | + url = {https://deepmind.google/discover/blog/ai-solves-imo-problems-at-silver-medal-level/}, |
| 43 | +} |
| 44 | + |
| 45 | +@article{leancopilot, |
| 46 | + author = {Peiyang Song and Tianyi Yang and Adarsh Anand}, |
| 47 | + title = {{LeanCopilot}: {LLMs} as Copilots for Theorem Proving in {Lean}}, |
| 48 | + journal = {arXiv preprint arXiv:2404.12534}, |
| 49 | + year = {2024}, |
| 50 | + doi = {10.48550/arXiv.2404.12534}, |
| 51 | +} |
| 52 | + |
| 53 | +@inproceedings{baldur, |
| 54 | + author = {Emily First and Markus N. Rabe and Talia Ringer and Yuriy Brun}, |
| 55 | + title = {{Baldur}: Whole-Proof Generation and Repair with Large Language Models}, |
| 56 | + booktitle = {{ESEC/FSE} 2023}, |
| 57 | + pages = {1229--1241}, |
| 58 | + year = {2023}, |
| 59 | + doi = {10.1145/3611643.3616243}, |
| 60 | + publisher = {ACM}, |
| 61 | +} |
| 62 | + |
| 63 | +@inproceedings{dsp, |
| 64 | + author = {Albert Qiaochu Jiang and Sean Welleck and Jin Peng Zhou and Wenda Li and Jiacheng Liu and Mateja Jamnik and Timoth{\'{e}}e Lacroix and Yuhuai Wu and Guillaume Lample}, |
| 65 | + title = {Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs}, |
| 66 | + booktitle = {{ICLR} 2023}, |
| 67 | + year = {2023}, |
| 68 | + url = {https://openreview.net/forum?id=SMa9EAovKMC}, |
| 69 | +} |
| 70 | + |
| 71 | +@inproceedings{magnushammer, |
| 72 | + author = {Maciej Mikula and Szymon Antoniak and Szymon Tworkowski and Albert Qiaochu Jiang and Jin Peng Zhou and Christian Szegedy and {\L}ukasz Kuci{\'{n}}ski and Piotr Mi{\l}o{\'{s}} and Yuhuai Wu}, |
| 73 | + title = {Magnushammer: A Transformer-Based Approach to Premise Selection}, |
| 74 | + booktitle = {{ICLR} 2024}, |
| 75 | + year = {2024}, |
| 76 | + url = {https://openreview.net/forum?id=aBGFvsHh7h}, |
| 77 | +} |
| 78 | + |
| 79 | +@inproceedings{reprover, |
| 80 | + author = {Kaiyu Yang and Aidan M. Swope and Alex Gu and Rahul Chaez and Jason Ansel and Joshua B. Tenenbaum and Saining Xia}, |
| 81 | + title = {{LeanDojo}: Theorem Proving with Retrieval-Augmented Language Models}, |
| 82 | + booktitle = {{NeurIPS} 2023}, |
| 83 | + year = {2023}, |
| 84 | + url = {https://arxiv.org/abs/2306.15626}, |
| 85 | +} |
| 86 | + |
| 87 | +@article{gptf, |
| 88 | + author = {Stanislas Polu and Ilya Sutskever}, |
| 89 | + title = {Generative Language Modeling for Automated Theorem Proving}, |
| 90 | + journal = {arXiv preprint arXiv:2009.03393}, |
| 91 | + year = {2020}, |
| 92 | + doi = {10.48550/arXiv.2009.03393}, |
| 93 | +} |
| 94 | + |
| 95 | +@article{vampire, |
| 96 | + author = {Alexandre Riazanov and Andrei Voronkov}, |
| 97 | + title = {The Design and Implementation of {Vampire}}, |
| 98 | + journal = {AI Communications}, |
| 99 | + volume = {15}, |
| 100 | + number = {2--3}, |
| 101 | + pages = {91--110}, |
| 102 | + year = {2002}, |
| 103 | +} |
| 104 | + |
| 105 | +@article{eprover, |
| 106 | + author = {Stephan Schulz}, |
| 107 | + title = {{E}---A Brainiac Theorem Prover}, |
| 108 | + journal = {AI Communications}, |
| 109 | + volume = {15}, |
| 110 | + number = {2--3}, |
| 111 | + pages = {111--126}, |
| 112 | + year = {2002}, |
| 113 | +} |
| 114 | + |
| 115 | +@inproceedings{spass, |
| 116 | + author = {Christoph Weidenbach and Dilyana Dimova and Arnaud Fietzke and Rohit Kumar and Martin Suda and Patrick Wischnewski}, |
| 117 | + title = {{SPASS} Version 3.5}, |
| 118 | + booktitle = {Automated Deduction -- {CADE-22}}, |
| 119 | + series = {Lecture Notes in Artificial Intelligence}, |
| 120 | + volume = {5663}, |
| 121 | + pages = {140--145}, |
| 122 | + publisher = {Springer}, |
| 123 | + year = {2009}, |
| 124 | + doi = {10.1007/978-3-642-02959-2_10}, |
| 125 | +} |
| 126 | + |
| 127 | +@inproceedings{z3, |
| 128 | + author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, |
| 129 | + title = {{Z3}: An Efficient {SMT} Solver}, |
| 130 | + booktitle = {Tools and Algorithms for the Construction and Analysis of Systems ({TACAS} 2008)}, |
| 131 | + series = {Lecture Notes in Computer Science}, |
| 132 | + volume = {4963}, |
| 133 | + pages = {337--340}, |
| 134 | + publisher = {Springer}, |
| 135 | + year = {2008}, |
| 136 | + doi = {10.1007/978-3-540-78800-3_24}, |
| 137 | +} |
| 138 | + |
| 139 | +@inproceedings{cvc5, |
| 140 | + author = {Haniel Barbosa and Clark W. Barrett and Martin Brain and Gereon Kremer and Hanna Lachnitt and Makai Mann and Abdalrhman Mohamed and Mudathir Mohamed and Aina Niemetz and Andres N{\"{o}}tzli and others}, |
| 141 | + title = {{cvc5}: A Versatile and Industrial-Strength {SMT} Solver}, |
| 142 | + booktitle = {Tools and Algorithms for the Construction and Analysis of Systems ({TACAS} 2022)}, |
| 143 | + series = {Lecture Notes in Computer Science}, |
| 144 | + volume = {13243}, |
| 145 | + pages = {415--442}, |
| 146 | + publisher = {Springer}, |
| 147 | + year = {2022}, |
| 148 | + doi = {10.1007/978-3-030-99524-9_24}, |
| 149 | +} |
| 150 | + |
| 151 | +@inproceedings{altergo, |
| 152 | + author = {Sylvain Conchon and Albin Coquereau and Mohamed Iguernlala and Alain Mebsout}, |
| 153 | + title = {{Alt-Ergo} 2.2}, |
| 154 | + booktitle = {{SMT} Workshop 2018}, |
| 155 | + year = {2018}, |
| 156 | +} |
| 157 | + |
| 158 | +@inproceedings{dafny, |
| 159 | + author = {K. Rustan M. Leino}, |
| 160 | + title = {{Dafny}: An Automatic Program Verifier for Functional Correctness}, |
| 161 | + booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning ({LPAR-16})}, |
| 162 | + series = {Lecture Notes in Computer Science}, |
| 163 | + volume = {6355}, |
| 164 | + pages = {348--370}, |
| 165 | + publisher = {Springer}, |
| 166 | + year = {2010}, |
| 167 | + doi = {10.1007/978-3-642-17511-4_20}, |
| 168 | +} |
| 169 | + |
| 170 | +@inproceedings{why3, |
| 171 | + author = {Jean-Christophe Filli{\^{a}}tre and Andrei Paskevich}, |
| 172 | + title = {{Why3}---Where Programs Meet Provers}, |
| 173 | + booktitle = {European Symposium on Programming ({ESOP} 2013)}, |
| 174 | + series = {Lecture Notes in Computer Science}, |
| 175 | + volume = {7792}, |
| 176 | + pages = {125--128}, |
| 177 | + publisher = {Springer}, |
| 178 | + year = {2013}, |
| 179 | + doi = {10.1007/978-3-642-37036-6_8}, |
| 180 | +} |
| 181 | + |
| 182 | +@inproceedings{dedukti, |
| 183 | + author = {Ali Assaf and Guillaume Burel}, |
| 184 | + title = {Translating {HOL} to {Dedukti}}, |
| 185 | + booktitle = {Proof Exchange for Theorem Proving ({PxTP} 2015)}, |
| 186 | + series = {EPTCS}, |
| 187 | + volume = {186}, |
| 188 | + pages = {74--88}, |
| 189 | + year = {2015}, |
| 190 | + doi = {10.4204/EPTCS.186.8}, |
| 191 | +} |
| 192 | + |
| 193 | +@inproceedings{opentheory, |
| 194 | + author = {Joe Hurd}, |
| 195 | + title = {The {OpenTheory} Standard Theory Library}, |
| 196 | + booktitle = {{NASA} Formal Methods ({NFM} 2011)}, |
| 197 | + series = {Lecture Notes in Computer Science}, |
| 198 | + volume = {6617}, |
| 199 | + pages = {177--191}, |
| 200 | + publisher = {Springer}, |
| 201 | + year = {2011}, |
| 202 | + doi = {10.1007/978-3-642-20398-5_14}, |
| 203 | +} |
| 204 | + |
| 205 | +@inproceedings{alethe, |
| 206 | + author = {Hans-J{\"{o}}rg Schurr and Mathias Fleury and Haniel Barbosa and Pascal Fontaine}, |
| 207 | + title = {{Alethe}: Towards a Generic {SMT} Proof Format}, |
| 208 | + booktitle = {Proof Exchange for Theorem Proving ({PxTP} 2021)}, |
| 209 | + year = {2021}, |
| 210 | +} |
| 211 | + |
| 212 | +@inproceedings{drat, |
| 213 | + author = {Lu{\'{\i}}s Cruz-Filipe and Marijn J. H. Heule and Warren A. Hunt Jr. and Matt Kaufmann and Peter Schneider-Kamp}, |
| 214 | + title = {Efficient Certified {RAT} Verification}, |
| 215 | + booktitle = {Automated Deduction -- {CADE-26}}, |
| 216 | + series = {Lecture Notes in Artificial Intelligence}, |
| 217 | + volume = {10395}, |
| 218 | + pages = {220--236}, |
| 219 | + publisher = {Springer}, |
| 220 | + year = {2017}, |
| 221 | + doi = {10.1007/978-3-319-63046-5_14}, |
| 222 | +} |
| 223 | + |
| 224 | +@article{tptp, |
| 225 | + author = {Geoff Sutcliffe}, |
| 226 | + title = {The {TPTP} Problem Library and Associated Infrastructure: From {CNF} to {TH0}, {TPTP} v6.4.0}, |
| 227 | + journal = {Journal of Automated Reasoning}, |
| 228 | + volume = {59}, |
| 229 | + number = {4}, |
| 230 | + pages = {483--502}, |
| 231 | + year = {2017}, |
| 232 | + doi = {10.1007/s10817-017-9407-7}, |
| 233 | +} |
| 234 | + |
| 235 | +@inproceedings{tstp, |
| 236 | + author = {Geoff Sutcliffe}, |
| 237 | + title = {The {TPTP} World---Infrastructure for Automated Reasoning}, |
| 238 | + booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning ({LPAR-16})}, |
| 239 | + series = {Lecture Notes in Computer Science}, |
| 240 | + volume = {6355}, |
| 241 | + pages = {1--12}, |
| 242 | + publisher = {Springer}, |
| 243 | + year = {2009}, |
| 244 | + doi = {10.1007/978-3-642-17511-4_1}, |
| 245 | +} |
| 246 | + |
| 247 | +@article{sledgehammer, |
| 248 | + author = {Jasmin Christian Blanchette and Sascha B{\"{o}}hme and Lawrence C. Paulson}, |
| 249 | + title = {Extending {Sledgehammer} with {SMT} Solvers}, |
| 250 | + journal = {Journal of Automated Reasoning}, |
| 251 | + volume = {51}, |
| 252 | + number = {1}, |
| 253 | + pages = {109--128}, |
| 254 | + year = {2013}, |
| 255 | + doi = {10.1007/s10817-013-9278-5}, |
| 256 | +} |
| 257 | + |
| 258 | +@article{portfolio, |
| 259 | + author = {Lin Xu and Frank Hutter and Holger H. Hoos and Kevin Leyton-Brown}, |
| 260 | + title = {{SATzilla}: Portfolio-Based Algorithm Selection for {SAT}}, |
| 261 | + journal = {Journal of Artificial Intelligence Research}, |
| 262 | + volume = {32}, |
| 263 | + pages = {565--606}, |
| 264 | + year = {2008}, |
| 265 | + doi = {10.1613/jair.2490}, |
| 266 | +} |
| 267 | + |
| 268 | +@article{verified-coq, |
| 269 | + author = {Bruno Barras}, |
| 270 | + title = {Sets in {Coq}, {Coq} in Sets}, |
| 271 | + journal = {Journal of Formalized Reasoning}, |
| 272 | + volume = {3}, |
| 273 | + number = {1}, |
| 274 | + pages = {29--48}, |
| 275 | + year = {2010}, |
| 276 | + doi = {10.6092/issn.1972-5787/1695}, |
| 277 | +} |
0 commit comments