{"total":23,"rows":[{"id":"2310.19791","title":"LILO: Learning Interpretable Libraries by Compressing and Documenting Code","created":"2023-10-30","cited_by_count":49,"area":null},{"id":"2312.08566","title":"Learning adaptive planning representations with natural language guidance","created":"2023-12-13","cited_by_count":36,"area":null},{"id":"2305.05661","title":"ShapeCoder: Discovering Abstractions for Visual Programs from Unstructured Primitives","created":"2023-05-09","cited_by_count":23,"area":null},{"id":"2309.14972","title":"Improving Unsupervised Visual Program Inference with Code Rewriting Families","created":"2023-09-26","cited_by_count":10,"area":null},{"id":"2302.00277","title":"Anti-unification and Generalization: A Survey","created":"2023-02-01","cited_by_count":7,"area":null},{"id":"2309.03651","title":"Learning of Generalizable and Interpretable Knowledge in Grid-Based Reinforcement Learning Environments","created":"2023-09-07","cited_by_count":5,"area":null},{"id":"2405.05431","title":"Searching for Programmatic Policies in Semantic Spaces","created":"2024-05-08","cited_by_count":5,"area":null},{"id":"2502.08884","title":"ShapeLib: Designing a library of programmatic 3D shape abstractions with Large Language Models","created":"2025-02-13","cited_by_count":5,"area":null},{"id":"2506.11058","title":"Refactoring Codebases through Library Design","created":"2025-05-26","cited_by_count":4,"area":null},{"id":"2306.07856","title":"Bayesian Program Learning by Decompiling Amortized Knowledge","created":"2023-06-13","cited_by_count":2,"area":null},{"id":"2405.17514","title":"AbstractBeam: Enhancing Bottom-Up Program Synthesis using Library Learning","created":"2024-05-27","cited_by_count":2,"area":null},{"id":"2507.22069","title":"A Compute-Matched Re-Evaluation of TroVE on MATH","created":"2025-07-16","cited_by_count":2,"area":null},{"id":"2508.13020","title":"e-boost: Boosted E-Graph Extraction with Adaptive Heuristics and Exact Solving","created":"2025-08-18","cited_by_count":2,"area":null},{"id":"2308.08334","title":"Learning logic programs by discovering higher-order abstractions","created":"2023-08-16","cited_by_count":1,"area":null},{"id":"2407.01567","title":"MeMo: Meaningful, Modular Controllers via Noise Injection","created":"2024-05-24","cited_by_count":1,"area":null},{"id":"2603.23244","title":"Online library learning in human visual puzzle solving","created":"2026-03-24","cited_by_count":1,"area":null},{"id":"2605.04622","title":"Library learning with e-graphs on jazz harmony","created":"2026-05-06","cited_by_count":1,"area":null},{"id":"2407.15510","title":"Algebraic anti-unification","created":"2024-07-22","cited_by_count":0,"area":null},{"id":"2506.14162","title":"Common Benchmarks Undervalue the Generalization Power of Programmatic Policies","created":"2025-06-17","cited_by_count":0,"area":null},{"id":"2604.17364","title":"LLM-Guided Strategy Synthesis for Scalable Equality Saturation","created":"2026-04-19","cited_by_count":0,"area":null},{"id":"2605.09985","title":"Prospective Compression in Human Abstraction Learning","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2607.18357","title":"Decode-Time Grammars: Constrained LLM Generation over a Refinement Order of Grammar Fragments","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2610.15290","title":"Co-DSL: Human-LLM Co-design of Reusable Spatial Concepts for Layout Generation","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}