{"total":30,"rows":[{"id":"2312.11143","title":"Learning Domain-Independent Heuristics for Grounded and Lifted Planning","created":"2023-12-18","cited_by_count":31,"area":null},{"id":"2205.06002","title":"Learning Generalized Policies Without Supervision Using GNNs","created":"2022-05-12","cited_by_count":22,"area":null},{"id":"2403.16508","title":"Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning","created":"2024-03-25","cited_by_count":19,"area":null},{"id":"2503.18809","title":"Classical Planning with LLM-Generated Heuristics: Challenging the State of the Art with Python Code","created":"2025-03-24","cited_by_count":18,"area":null},{"id":"2409.15892","title":"Symmetries and Expressive Requirements for Learning General Policies","created":"2024-09-24","cited_by_count":7,"area":null},{"id":"2402.02287","title":"Future Directions in the Theory of Graph Machine Learning","created":"2024-02-03","cited_by_count":6,"area":null},{"id":"2410.24080","title":"Graph Learning for Numeric Planning","created":"2024-10-31","cited_by_count":5,"area":null},{"id":"2508.07743","title":"Symmetry-Aware Transformer Training for Automated Planning","created":"2025-08-11","cited_by_count":5,"area":null},{"id":"2504.20318","title":"Leveraging Action Relational Structures for Integrated Learning and Planning","created":"2025-04-29","cited_by_count":4,"area":null},{"id":"2211.13316","title":"Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning","created":"2022-11-23","cited_by_count":3,"area":null},{"id":"2412.04752","title":"Graph Neural Network Based Action Ranking for Planning","created":"2024-12-06","cited_by_count":3,"area":null},{"id":"2505.00439","title":"Per-Domain Generalizing Policies: On Validation Instances and Scaling Behavior","created":"2025-05-01","cited_by_count":3,"area":null},{"id":"2410.07923","title":"Deep Learning for Generalised Planning with Background Knowledge","created":"2024-10-10","cited_by_count":2,"area":null},{"id":"2504.19738","title":"Learning Efficiency Meets Symmetry Breaking","created":"2025-04-28","cited_by_count":2,"area":null},{"id":"2508.18515","title":"Weisfeiler-Leman Features for Planning: A 1,000,000 Sample Size Hyperparameter Study","created":"2025-08-25","cited_by_count":2,"area":null},{"id":"2403.16824","title":"On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies","created":"2024-03-25","cited_by_count":1,"area":null},{"id":"2404.02499","title":"Learning Generalized Policies for Fully Observable Non-Deterministic Planning Domains","created":"2024-04-03","cited_by_count":1,"area":null},{"id":"2409.20259","title":"Learning to Ground Existentially Quantified Goals","created":"2024-09-30","cited_by_count":1,"area":null},{"id":"2411.00577","title":"WLPlan: Relational Features for Symbolic Planning","created":"2024-11-01","cited_by_count":1,"area":null},{"id":"2605.29649","title":"LLM-Evolved Domain-Independent Heuristics for Symbolic AI Planning","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2609.27105","title":"Provably Complete Generalized Planning with LLMs","created":"2026-09-22","cited_by_count":1,"area":null},{"id":"2207.05259","title":"Language-Based Causal Representation Learning","created":"2022-07-12","cited_by_count":0,"area":null},{"id":"2412.02136","title":"Graph Learning for Planning: The Story Thus Far and Open Challenges","created":"2024-12-03","cited_by_count":0,"area":null},{"id":"2506.11721","title":"Relational GNNs Cannot Learn $C_2$ Features for Planning","created":"2025-06-13","cited_by_count":0,"area":null},{"id":"2602.04557","title":"Textual Planning with Explicit Latent Transitions","created":"2026-02-04","cited_by_count":0,"area":null},{"id":"2603.17544","title":"Per-Domain Generalizing Policies: On Learning Efficient and Robust Q-Value Functions (Extended Version with Technical Appendix)","created":"2026-03-18","cited_by_count":0,"area":null},{"id":"2605.16142","title":"Property-Guided LLM Program Synthesis for Planning","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2605.18674","title":"Efficient Lookahead Encoding and Abstracted Width for Learning General Policies in Classical Planning","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2606.04597","title":"Learning Admissible Heuristics via Cost Partitioning","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2609.06071","title":"Generating Instance Generators in PDDL Planning","created":"2026-09-05","cited_by_count":0,"area":null}],"next_cursor":null}