{"url":"/task/program-induction","name":"Program induction","slug":"program-induction","description_markdown":"Generating program code for domain-specific tasks","categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":67,"papers_with_code":24,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/aqua-rat","name":"AQUA-RAT","full_name":"Algebra Question Answering with Rationales","num_papers_in_archive":64}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":24,"of":24,"tagged_in_all":67,"items":[{"url":"/paper/deepproblog-neural-probabilistic-logic","title":"DeepProbLog: Neural Probabilistic Logic Programming","date":"2018-05-28","arxiv_id":"1805.10872","repositories_listed":4,"syntology":null},{"url":"/paper/dreamcoder-growing-generalizable","title":"DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learning","date":"2020-06-15","arxiv_id":"2006.08381","repositories_listed":3,"syntology":{"n":11,"n_ran":1,"n_unverified":10,"n_pointer_only":11}},{"url":"/paper/robustfill-neural-program-learning-under","title":"RobustFill: Neural Program Learning under Noisy I/O","date":"2017-03-21","arxiv_id":"1703.07469","repositories_listed":3,"syntology":{"n":8,"n_ran":2,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/llm-sr-scientific-equation-discovery-via","title":"LLM-SR: Scientific Equation Discovery via Programming with Large Language Models","date":"2024-04-29","arxiv_id":"2404.18400","repositories_listed":2,"syntology":null},{"url":"/paper/forgetting-to-learn-logic-programs","title":"Forgetting to learn logic programs","date":"2019-11-15","arxiv_id":"1911.06643","repositories_listed":2,"syntology":null},{"url":"/paper/learning-a-natural-language-interface-with","title":"Learning a Natural Language Interface with Neural Programmer","date":"2016-11-28","arxiv_id":"1611.08945","repositories_listed":2,"syntology":null},{"url":"/paper/searching-latent-program-spaces","title":"Searching Latent Program Spaces","date":"2024-11-13","arxiv_id":"2411.08706","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/kb-plugin-a-plug-and-play-framework-for-large","title":"KB-Plugin: A Plug-and-play Framework for Large Language Models to Induce Programs over Low-resourced Knowledge Bases","date":"2024-02-02","arxiv_id":"2402.01619","repositories_listed":1,"syntology":null},{"url":"/paper/learning-differentiable-logic-programs-for","title":"Learning Differentiable Logic Programs for Abstract Visual Reasoning","date":"2023-07-03","arxiv_id":"2307.00928","repositories_listed":1,"syntology":{"n":12,"n_ran":0,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/using-natural-language-and-program","title":"Using Natural Language and Program Abstractions to Instill Human Inductive Biases in Machines","date":"2022-05-23","arxiv_id":"2205.11558","repositories_listed":1,"syntology":null},{"url":"/paper/arcaneqa-dynamic-program-induction-and","title":"ArcaneQA: Dynamic Program Induction and Contextualized Encoding for Knowledge Base Question Answering","date":"2022-04-17","arxiv_id":"2204.08109","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/think-big-teach-small-do-language-models","title":"Think Big, Teach Small: Do Language Models Distil Occam’s Razor?","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/map-induction-compositional-spatial-submap-1","title":"Map Induction: Compositional spatial submap learning for efficient exploration in novel environments","date":"2021-10-23","arxiv_id":"2110.12301","repositories_listed":1,"syntology":null},{"url":"/paper/program-transfer-and-ontology-awareness-for","title":"Program Transfer for Answering Complex Questions over Knowledge Bases","date":"2021-10-12","arxiv_id":"2110.05743","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-deep-generative-model-like-a","title":"Learning a Deep Generative Model like a Program: the Free Category Prior","date":"2020-11-22","arxiv_id":"2011.11063","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-complex-knowledge-base-question","title":"Few-Shot Complex Knowledge Base Question Answering via Meta Reinforcement Learning","date":"2020-10-29","arxiv_id":"2010.15877","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/strong-generalization-and-efficiency-in","title":"Strong Generalization and Efficiency in Neural Programs","date":"2020-07-07","arxiv_id":"2007.03629","repositories_listed":1,"syntology":{"n":9,"n_ran":0,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/automatic-discovery-of-interpretable-planning","title":"Automatic Discovery of Interpretable Planning Strategies","date":"2020-05-24","arxiv_id":"2005.11730","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-refactoring-for-program-induction","title":"Knowledge Refactoring for Inductive Program Synthesis","date":"2020-04-21","arxiv_id":"2004.09931","repositories_listed":1,"syntology":null},{"url":"/paper/playgol-learning-programs-through-play","title":"Playgol: learning programs through play","date":"2019-04-18","arxiv_id":"1904.08993","repositories_listed":1,"syntology":null},{"url":"/paper/recent-advances-in-neural-program-synthesis","title":"Recent Advances in Neural Program Synthesis","date":"2018-02-07","arxiv_id":"1802.02353","repositories_listed":1,"syntology":null},{"url":"/paper/neural-task-programming-learning-to","title":"Neural Task Programming: Learning to Generalize Across Hierarchical Tasks","date":"2017-10-04","arxiv_id":"1710.01813","repositories_listed":1,"syntology":null},{"url":"/paper/p-tree-programming","title":"P-Tree Programming","date":"2017-07-12","arxiv_id":"1707.03744","repositories_listed":1,"syntology":null},{"url":"/paper/program-induction-by-rationale-generation","title":"Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problems","date":"2017-05-11","arxiv_id":"1705.04146","repositories_listed":1,"syntology":null}],"syntology_records":7,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}