princeton-vl / FormulaNet
Code for FormulaNet in NIPS 2017
☆30Updated 7 years ago
Alternatives and similar repositories for FormulaNet:
Users that are interested in FormulaNet are comparing it to the libraries listed below
- Code for the paper "Learning to Prove Theorems by Learning to Generate Theorems"☆32Updated 4 years ago
- Patched version of HOL Light with tactic logging for machine learning purposes☆34Updated 5 years ago
- NaturalProofs: Mathematical Theorem Proving in Natural Language (NeurIPS 2021 Datasets & Benchmarks)☆128Updated 2 years ago
- deep learning for math☆29Updated 6 years ago
- ☆43Updated 2 years ago
- Combining Symbolic and Function Evaluation Expressions In Neural Programs☆33Updated 5 years ago
- Code for "Learning Compositional Rules via Neural Program Synthesis"☆60Updated 4 years ago
- Neural-Grammar-Symbolic Learning with Back-Search☆54Updated 9 months ago
- Proof recording for Lean 3☆26Updated 3 years ago
- ☆21Updated 3 years ago
- Proof artifact co-training for Lean☆44Updated 2 years ago
- Official code for paper: INT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving☆39Updated 2 years ago
- ☆38Updated 4 years ago
- The Lean Theorem Proving Environment☆13Updated last year
- A simple REPL for Lean 4, returning information about errors and sorries.☆10Updated last year
- ☆34Updated 4 months ago
- Code for the benchmark containing dataset, models and metrics for productive concept learning -- a kind of compositional reasoning task t…☆17Updated 3 years ago
- Conditional Theorem Proving☆53Updated 4 years ago
- Interesting ATP Proofs☆13Updated 3 years ago
- Compositional generalization through meta sequence-to-sequence learning☆83Updated 5 years ago
- End-to-End Differentiable Proving☆89Updated 6 years ago
- Code for the paper "The Surprising Computational Power of Nondeterministic Stack RNNs" (DuSell and Chiang, 2023)☆18Updated last year
- ☆43Updated 7 years ago
- Code for the 2-simplicial Transformer paper☆18Updated 5 years ago
- Symbolic Brittleness in Sequence Models: on Systematic Generalization in Symbolic Mathematics (AAAI 2022)☆14Updated 3 years ago
- ☆50Updated 4 years ago
- Code for the paper "Decomposing the Enigma: Subgoal-based Demonstration Learning for Formal Theorem Proving"☆19Updated last year
- EMNLP 2020: On the Ability and Limitations of Transformers to Recognize Formal Languages☆23Updated 4 years ago
- Neural Unification for Logic Reasoning over Language☆22Updated 3 years ago
- PyTorch implementation for the Deep Symbolic Simplification Without Human Knowledge☆14Updated 4 years ago