{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/automated-theorem-proving/papers/2","list_of":"/task/automated-theorem-proving","task":"Automated Theorem Proving","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":288,"counts":{"archive_papers_tagged":288,"with_a_code_link":110,"where_syntology_ran_a_sample":46,"not_listed_spam_title":0,"listed":288,"listed_where_code_ran":46,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":35,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":35,"listed_every_run_a_failure_of_syntologys_instrument":11,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/automated-theorem-proving","prev":"/task/automated-theorem-proving","next":"/task/automated-theorem-proving/papers/3","papers":[{"url":"/paper/guiding-theorem-proving-by-recurrent-neural","slug":"guiding-theorem-proving-by-recurrent-neural","title":"Guiding Inferences in Connection Tableau by Recurrent Neural Networks","date":"2019-05-20","arxiv_id":"1905.07961","repositories_listed":1,"syntology":null},{"url":"/paper/gamepad-a-learning-environment-for-theorem","slug":"gamepad-a-learning-environment-for-theorem","title":"GamePad: A Learning Environment for Theorem Proving","date":"2018-06-02","arxiv_id":"1806.00608","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gamepad-a-learning-environment-for-theorem#ran","syntology_url":"https://syntology.ai/paper/1806.00608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.00608"}},"official":{"repos":["ml4tp/gamepad"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/automated-proof-synthesis-for-propositional","slug":"automated-proof-synthesis-for-propositional","title":"Automated proof synthesis for propositional logic with deep neural networks","date":"2018-05-30","arxiv_id":"1805.11799","repositories_listed":1,"syntology":null},{"url":"/paper/premise-selection-for-theorem-proving-by-deep","slug":"premise-selection-for-theorem-proving-by-deep","title":"Premise Selection for Theorem Proving by Deep Graph Embedding","date":"2017-09-28","arxiv_id":"1709.09994","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/premise-selection-for-theorem-proving-by-deep#ran","syntology_url":"https://syntology.ai/paper/1709.09994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.09994"}},"official":{"repos":["princeton-vl/FormulaNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/langpro-natural-language-theorem-prover","slug":"langpro-natural-language-theorem-prover","title":"LangPro: Natural Language Theorem Prover","date":"2017-08-30","arxiv_id":"1708.09417","repositories_listed":1,"syntology":null},{"url":"/paper/on-demand-injection-of-lexical-knowledge-for","slug":"on-demand-injection-of-lexical-knowledge-for","title":"On-demand Injection of Lexical Knowledge for Recognising Textual Entailment","date":"2017-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/holstep-a-machine-learning-dataset-for-higher","slug":"holstep-a-machine-learning-dataset-for-higher","title":"HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving","date":"2017-03-01","arxiv_id":"1703.00426","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/holstep-a-machine-learning-dataset-for-higher#ran","syntology_url":"https://syntology.ai/paper/1703.00426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.00426"}},"official":null}},{"url":"/paper/solving-geometry-problems-combining-text-and","slug":"solving-geometry-problems-combining-text-and","title":"Solving Geometry Problems: Combining Text and Diagram Interpretation","date":"2015-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/holyhammer-online-atp-service-for-hol-light","slug":"holyhammer-online-atp-service-for-hol-light","title":"HOL(y)Hammer: Online ATP Service for HOL Light","date":"2013-09-19","arxiv_id":"1309.4962","repositories_listed":1,"syntology":null},{"url":"/paper/lectures-on-jacques-herbrand-as-a-logician","slug":"lectures-on-jacques-herbrand-as-a-logician","title":"Lectures on Jacques Herbrand as a Logician","date":"2009-02-26","arxiv_id":"0902.4682","repositories_listed":1,"syntology":null},{"url":null,"slug":"prover-agent-an-agent-based-framework-for","title":"Prover Agent: An Agent-based Framework for Formal Mathematical Proofs","date":"2025-06-24","arxiv_id":"2506.19923","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-advanced-mathematical-reasoning-for","title":"Towards Advanced Mathematical Reasoning for LLMs via First-Order Logic Theorem Proving","date":"2025-06-20","arxiv_id":"2506.17104","repositories_listed":0,"syntology":null},{"url":null,"slug":"matp-bench-can-mllm-be-a-good-automated","title":"MATP-BENCH: Can MLLM Be a Good Automated Theorem Prover for Multimodal Problems?","date":"2025-06-06","arxiv_id":"2506.06034","repositories_listed":0,"syntology":null},{"url":null,"slug":"rewarding-the-unlikely-lifting-grpo-beyond","title":"Rewarding the Unlikely: Lifting GRPO Beyond Distribution Sharpening","date":"2025-06-03","arxiv_id":"2506.02355","repositories_listed":0,"syntology":null},{"url":null,"slug":"faithful-and-robust-llm-driven-theorem","title":"Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations","date":"2025-05-30","arxiv_id":"2505.24264","repositories_listed":0,"syntology":null},{"url":null,"slug":"proofnet-a-neuro-symbolic-system-for-formal","title":"ProofNet++: A Neuro-Symbolic System for Formal Proof Verification with Self-Correction","date":"2025-05-30","arxiv_id":"2505.24230","repositories_listed":0,"syntology":null},{"url":null,"slug":"rocqstar-leveraging-similarity-driven","title":"RocqStar: Leveraging Similarity-driven Retrieval and Agentic Systems for Rocq generation","date":"2025-05-28","arxiv_id":"2505.22846","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybridprover-augmenting-theorem-proving-with","title":"HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement","date":"2025-05-21","arxiv_id":"2505.15740","repositories_listed":0,"syntology":null},{"url":null,"slug":"2505-10962","title":"MPS-Prover: Advancing Stepwise Theorem Proving by Multi-Perspective Search and Data Curation","date":"2025-05-16","arxiv_id":"2505.10962","repositories_listed":0,"syntology":null},{"url":null,"slug":"apollo-automated-llm-and-lean-collaboration","title":"APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoning","date":"2025-05-09","arxiv_id":"2505.05758","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-theorem-proving-formulation-framework","title":"Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-Solving","date":"2025-05-07","arxiv_id":"2505.04528","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-the-13th-international-workshop","title":"Proceedings The 13th International Workshop on Theorem proving components for Educational software","date":"2025-05-07","arxiv_id":"2505.04677","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-limits-of-ai-explainability-an","title":"The Limits of AI Explainability: An Algorithmic Information Theory Approach","date":"2025-04-29","arxiv_id":"2504.20676","repositories_listed":0,"syntology":null},{"url":"/paper/ape-bench-i-towards-file-level-automated","slug":"ape-bench-i-towards-file-level-automated","title":"APE-Bench I: Towards File-level Automated Proof Engineering of Formal Math Libraries","date":"2025-04-27","arxiv_id":"2504.19110","repositories_listed":0,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/ape-bench-i-towards-file-level-automated#ran","syntology_url":"https://syntology.ai/paper/2504.19110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.19110"}},"official":null}},{"url":null,"slug":"hua-chen-new-theory-of-economic-optimization","title":"Hua-Chen New Theory of Economic Optimization","date":"2025-04-27","arxiv_id":"2504.19134","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-theorem-proving-generating-and","title":"Neural Theorem Proving: Generating and Structuring Proofs for Formal Verification","date":"2025-04-23","arxiv_id":"2504.17017","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-models-can-be-effective-without","title":"Reasoning Models Can Be Effective Without Thinking","date":"2025-04-14","arxiv_id":"2504.09858","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-mathematical-reasoning-in-large","title":"Enhancing Mathematical Reasoning in Large Language Models with Self-Consistency-Based Hallucination Detection","date":"2025-04-13","arxiv_id":"2504.09440","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-under-threat-symbolic-and-neural","title":"Reasoning Under Threat: Symbolic and Neural Techniques for Cybersecurity Verification","date":"2025-03-27","arxiv_id":"2503.22755","repositories_listed":0,"syntology":null},{"url":null,"slug":"vulnerability-detection-from-formal","title":"Vulnerability Detection: From Formal Verification to Large Language Models and Hybrid Approaches: A Comprehensive Overview","date":"2025-03-13","arxiv_id":"2503.10784","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-look-ahead-guidance-via-verifier-in-the","title":"Local Look-Ahead Guidance via Verifier-in-the-Loop for Automated Theorem Proving","date":"2025-03-12","arxiv_id":"2503.09730","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-neural-clause-selection","title":"Efficient Neural Clause-Selection Reinforcement","date":"2025-03-10","arxiv_id":"2503.07792","repositories_listed":0,"syntology":null},{"url":null,"slug":"faithful-logic-embeddings-in-hol-a-recipe-to","title":"Faithful Logic Embeddings in HOL -- Deep and Shallow","date":"2025-02-26","arxiv_id":"2502.19311","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-combinatorial-identities-benchmark-for","title":"A Combinatorial Identities Benchmark for Theorem Proving via Automated Theorem Generation","date":"2025-02-25","arxiv_id":"2502.17840","repositories_listed":0,"syntology":null},{"url":null,"slug":"leanprogress-guiding-search-for-neural","title":"LeanProgress: Guiding Search for Neural Theorem Proving via Proof Progress Prediction","date":"2025-02-25","arxiv_id":"2502.17925","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-machine-learning-in-precision","title":"Quantum Machine Learning in Precision Medicine and Drug Discovery -- A Game Changer for Tailored Treatments?","date":"2025-02-25","arxiv_id":"2502.18639","repositories_listed":0,"syntology":null},{"url":null,"slug":"activation-steering-in-neural-theorem-provers","title":"Activation Steering in Neural Theorem Provers","date":"2025-02-21","arxiv_id":"2502.15507","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-millions-of-lean-theorems-with","title":"Generating Millions Of Lean Theorems With Proofs By Exploring State Transition Graphs","date":"2025-02-16","arxiv_id":"2503.04772","repositories_listed":0,"syntology":null},{"url":null,"slug":"proving-the-coding-interview-a-benchmark-for","title":"Proving the Coding Interview: A Benchmark for Formally Verified Code Generation","date":"2025-02-08","arxiv_id":"2502.05714","repositories_listed":0,"syntology":null},{"url":null,"slug":"bfs-prover-scalable-best-first-tree-search","title":"BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Proving","date":"2025-02-05","arxiv_id":"2502.03438","repositories_listed":0,"syntology":null},{"url":null,"slug":"lemmahead-rag-assisted-proof-generation-using","title":"LemmaHead: RAG Assisted Proof Generation Using Large Language Models","date":"2025-01-27","arxiv_id":"2501.15797","repositories_listed":0,"syntology":null},{"url":null,"slug":"chain-of-reasoning-towards-unified","title":"Chain-of-Reasoning: Towards Unified Mathematical Reasoning in Large Language Models via a Multi-Paradigm Perspective","date":"2025-01-19","arxiv_id":"2501.11110","repositories_listed":0,"syntology":null},{"url":null,"slug":"proof-recommendation-system-for-the-hol4","title":"Proof Recommendation System for the HOL4 Theorem Prover","date":"2024-12-31","arxiv_id":"2501.05463","repositories_listed":0,"syntology":null},{"url":null,"slug":"hunyuanprover-a-scalable-data-synthesis","title":"HUNYUANPROVER: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","date":"2024-12-30","arxiv_id":"2412.20735","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-mathematical-reasoning-a-new-frontier","title":"Formal Mathematical Reasoning: A New Frontier in AI","date":"2024-12-20","arxiv_id":"2412.16075","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-scientific-discovery-with-generative","title":"Towards Scientific Discovery with Generative AI: Progress, Opportunities, and Challenges","date":"2024-12-16","arxiv_id":"2412.11427","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-multimodal-llms-ability-in-geometry","title":"Improving Multimodal LLMs Ability In Geometry Problem Solving, Reasoning, And Multistep Scoring","date":"2024-12-01","arxiv_id":"2412.00846","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-theorem-proving-by-rewarding-llms-to","title":"Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchically","date":"2024-11-04","arxiv_id":"2411.01829","repositories_listed":0,"syntology":null},{"url":null,"slug":"proof-flow-preliminary-study-on-generative","title":"Proof Flow: Preliminary Study on Generative Flow Network Language Model Tuning for Formal Reasoning","date":"2024-10-17","arxiv_id":"2410.13224","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-prover-diversity-driven-theorem-proving","title":"3D-Prover: Diversity Driven Theorem Proving With Determinantal Point Processes","date":"2024-10-14","arxiv_id":"2410.11133","repositories_listed":0,"syntology":null},{"url":null,"slug":"revealed-invariant-preference","title":"Revealed Invariant Preference","date":"2024-08-08","arxiv_id":"2408.04573","repositories_listed":0,"syntology":null},{"url":null,"slug":"artifical-intelligence-and-inherent","title":"Artifical intelligence and inherent mathematical difficulty","date":"2024-08-01","arxiv_id":"2408.03345","repositories_listed":0,"syntology":null},{"url":null,"slug":"lean-star-learning-to-interleave-thinking-and","title":"Lean-STaR: Learning to Interleave Thinking and Proving","date":"2024-07-14","arxiv_id":"2407.10040","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-automated-functional-equation-proving","title":"Towards Automated Functional Equation Proving: A Benchmark Dataset and A Domain-Specific In-Context Agent","date":"2024-07-05","arxiv_id":"2407.14521","repositories_listed":0,"syntology":null},{"url":null,"slug":"minicodeprops-a-minimal-benchmark-for-proving","title":"miniCodeProps: a Minimal Benchmark for Proving Code Properties","date":"2024-06-16","arxiv_id":"2406.11915","repositories_listed":0,"syntology":null},{"url":"/paper/deepseek-prover-advancing-theorem-proving-in","slug":"deepseek-prover-advancing-theorem-proving-in","title":"DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data","date":"2024-05-23","arxiv_id":"2405.14333","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-certified-proof-checker-for-deep-neural","title":"A Certified Proof Checker for Deep Neural Network Verification in Imandra","date":"2024-05-17","arxiv_id":"2405.10611","repositories_listed":0,"syntology":null},{"url":null,"slug":"atg-benchmarking-automated-theorem-generation","title":"ATG: Benchmarking Automated Theorem Generation for Generative Language Models","date":"2024-05-05","arxiv_id":"2405.06677","repositories_listed":0,"syntology":null},{"url":null,"slug":"wu-s-method-can-boost-symbolic-ai-to-rival","title":"Wu's Method can Boost Symbolic AI to Rival Silver Medalists and AlphaGeometry to Outperform Gold Medalists at IMO Geometry","date":"2024-04-09","arxiv_id":"2404.06405","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-12th-international-workshop-on-2","title":"Proceedings 12th International Workshop on Theorem proving components for Educational software","date":"2024-04-04","arxiv_id":"2404.03709","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-learning-with-multi-task","title":"Multi-Task Learning with Multi-Task Optimization","date":"2024-03-24","arxiv_id":"2403.16162","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-formal-theorem-proving-a","title":"Enhancing Formal Theorem Proving: A Comprehensive Dataset for Training AI Models on Coq Code","date":"2024-03-19","arxiv_id":"2403.12627","repositories_listed":0,"syntology":null},{"url":"/paper/bait-benchmarking-embedding-architectures-for","slug":"bait-benchmarking-embedding-architectures-for","title":"BAIT: Benchmarking (Embedding) Architectures for Interactive Theorem-Proving","date":"2024-03-06","arxiv_id":"2403.03401","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bait-benchmarking-embedding-architectures-for#ran","syntology_url":"https://syntology.ai/paper/2403.03401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03401"}},"official":null}},{"url":null,"slug":"learning-guided-automated-reasoning-a-brief","title":"Learning Guided Automated Reasoning: A Brief Survey","date":"2024-03-06","arxiv_id":"2403.04017","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-categorization-of-complexity-classes-for","title":"A Categorization of Complexity Classes for Information Retrieval and Synthesis Using Natural Logic","date":"2024-02-28","arxiv_id":"2402.18566","repositories_listed":0,"syntology":null},{"url":null,"slug":"evogpt-f-an-evolutionary-gpt-framework-for","title":"EvoGPT-f: An Evolutionary GPT Framework for Benchmarking Formal Math Languages","date":"2024-02-12","arxiv_id":"2402.16878","repositories_listed":0,"syntology":null},{"url":"/paper/0-1-laws-for-pattern-occurrences-in","slug":"0-1-laws-for-pattern-occurrences-in","title":"0-1 laws for pattern occurrences in phylogenetic trees and networks","date":"2024-02-07","arxiv_id":"2402.04499","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-success-is-not-enough-investigating-the","title":"Task Success is not Enough: Investigating the Use of Video-Language Models as Behavior Critics for Catching Undesirable Agent Behaviors","date":"2024-02-06","arxiv_id":"2402.04210","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph2tac-learning-hierarchical","title":"Graph2Tac: Online Representation Learning of Formal Math Concepts","date":"2024-01-05","arxiv_id":"2401.02949","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-neural-theorem-proving-through-data","title":"Enhancing Neural Theorem Proving through Data Augmentation and Dynamic Sampling Method","date":"2023-12-20","arxiv_id":"2312.14188","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-planning-techniques-for-elementary","title":"Automated Planning Techniques for Elementary Proofs in Abstract Algebra","date":"2023-12-11","arxiv_id":"2312.06490","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-understanding-of-math","title":"Large Language Models' Understanding of Math: Source Criticism and Extrapolation","date":"2023-11-12","arxiv_id":"2311.07618","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-learning-of-continuous-data-by","title":"Generative Learning of Continuous Data by Tensor Networks","date":"2023-10-31","arxiv_id":"2310.20498","repositories_listed":0,"syntology":null},{"url":null,"slug":"math-pvs-a-large-language-model-framework-to","title":"math-PVS: A Large Language Model Framework to Map Scientific Publications to PVS Theories","date":"2023-10-25","arxiv_id":"2310.17064","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-mathematical-game","title":"The Mathematical Game","date":"2023-09-22","arxiv_id":"2309.12711","repositories_listed":0,"syntology":null},{"url":null,"slug":"math-agents-computational-infrastructure","title":"Math Agents: Computational Infrastructure, Mathematical Embedding, and Genomics","date":"2023-07-04","arxiv_id":"2307.02502","repositories_listed":0,"syntology":null},{"url":null,"slug":"translating-sumo-k-to-higher-order-set-theory","title":"Translating SUMO-K to Higher-Order Set Theory","date":"2023-05-13","arxiv_id":"2305.07903","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-as-theorem-proving-with-heuristics","title":"Planning as Theorem Proving with Heuristics","date":"2023-03-23","arxiv_id":"2303.13638","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-relations-for-modelling","title":"Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving","date":"2023-03-16","arxiv_id":"2303.09692","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-neural-networks-do-arithmetic-a-survey-on","title":"Can neural networks do arithmetic? A survey on the elementary numerical skills of state-of-the-art deep learning models","date":"2023-03-14","arxiv_id":"2303.07735","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-11th-international-workshop-on-2","title":"Proceedings 11th International Workshop on Theorem Proving Components for Educational Software","date":"2023-03-09","arxiv_id":"2303.05360","repositories_listed":0,"syntology":null},{"url":null,"slug":"magnushammer-a-transformer-based-approach-to","title":"Magnushammer: A Transformer-Based Approach to Premise Selection","date":"2023-03-08","arxiv_id":"2303.04488","repositories_listed":0,"syntology":null},{"url":null,"slug":"anti-unification-and-generalization-a-survey","title":"Anti-unification and Generalization: A Survey","date":"2023-02-01","arxiv_id":"2302.00277","repositories_listed":0,"syntology":null},{"url":null,"slug":"euclidnet-deep-visual-reasoning-for","title":"EuclidNet: Deep Visual Reasoning for Constructible Problems in Geometry","date":"2022-12-27","arxiv_id":"2301.13007","repositories_listed":0,"syntology":null},{"url":null,"slug":"keyword-based-natural-language-premise","title":"Keyword-based Natural Language Premise Selection for an Automatic Mathematical Statement Proving","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"textgraphs-16-natural-language-premise","title":"TextGraphs-16 Natural Language Premise Selection Task: Zero-Shot Premise Selection with Prompting Generative Language Models","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-compressed-combinatory-proof","title":"Generating Compressed Combinatory Proof Structures -- An Approach to Automated First-Order Theorem Proving","date":"2022-09-26","arxiv_id":"2209.12592","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-38th-international-conference-on","title":"Proceedings 38th International Conference on Logic Programming","date":"2022-08-04","arxiv_id":"2208.02685","repositories_listed":0,"syntology":null},{"url":null,"slug":"cd-tools-condensed-detachment-and-structure","title":"CD Tools -- Condensed Detachment and Structure Generating Theorem Proving (System Description)","date":"2022-07-18","arxiv_id":"2207.08453","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-prove-trigonometric-identities","title":"Learning to Prove Trigonometric Identities","date":"2022-07-14","arxiv_id":"2207.06679","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-length-generalization-in-large","title":"Exploring Length Generalization in Large Language Models","date":"2022-07-11","arxiv_id":"2207.04901","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-training-of-neural-networks-via","title":"Constrained Training of Neural Networks via Theorem Proving","date":"2022-07-08","arxiv_id":"2207.03880","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-specifications-from-natural-language","title":"Formal Specifications from Natural Language","date":"2022-06-04","arxiv_id":"2206.01962","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-find-proofs-and-theorems-by","title":"Learning to Find Proofs and Theorems by Learning to Refine Search Strategies: The Case of Loop Invariant Synthesis","date":"2022-05-27","arxiv_id":"2205.14229","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoformalization-with-large-language-models","title":"Autoformalization with Large Language Models","date":"2022-05-25","arxiv_id":"2205.12615","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-width-based-model-checking-to-width","title":"From Width-Based Model Checking to Width-Based Automated Theorem Proving","date":"2022-05-23","arxiv_id":"2205.10995","repositories_listed":0,"syntology":null},{"url":"/paper/hypertree-proof-search-for-neural-theorem","slug":"hypertree-proof-search-for-neural-theorem","title":"HyperTree Proof Search for Neural Theorem Proving","date":"2022-05-23","arxiv_id":"2205.11491","repositories_listed":0,"syntology":null},{"url":"/paper/thor-wielding-hammers-to-integrate-language","slug":"thor-wielding-hammers-to-integrate-language","title":"Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers","date":"2022-05-22","arxiv_id":"2205.10893","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-learning-to-reason-in-an","title":"Adversarial Learning to Reason in an Arbitrary Logic","date":"2022-04-06","arxiv_id":"2204.02737","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-reasoning-in-non-classical-logics","title":"Automated Reasoning in Non-classical Logics in the TPTP World","date":"2022-02-20","arxiv_id":"2202.09836","repositories_listed":0,"syntology":null}],"record_sha256":"61aea6d87aa74cf3c9327d8dbe2bc256b07c5e4af369a9c91b471c1ed9ca2dd0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}