{"url":"/task/inductive-logic-programming","name":"Inductive logic programming","slug":"inductive-logic-programming","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":153,"papers_with_code":54,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":2,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/inductive-logic-programming-on-rudas","slug":"inductive-logic-programming-on-rudas","dataset":"RuDaS","dataset_url":"/dataset/rudas","rows_in_archive":4,"metrics":["H-Score","R-Score"],"first_row_in_archive_order":{"model":"AMIE+","paper_title":"RuDaS: Synthetic Datasets for Rule Learning and Evaluation Tools","paper_url":"/paper/rudas-synthetic-datasets-for-rule-learning","paper_date":"2019-09-16","arxiv_id":"1909.07095","code_links":[{"title":"IBM/RuDaS","url":"https://github.com/IBM/RuDaS"}],"syntology":null}}],"datasets":[{"url":"/dataset/kinship","name":"Kinship","full_name":null,"num_papers_in_archive":10},{"url":"/dataset/rudas","name":"RuDaS","full_name":"Synthetic Datasets for Rule Learning","num_papers_in_archive":1}],"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":30,"of":54,"tagged_in_all":153,"items":[{"url":"/paper/clutrr-a-diagnostic-benchmark-for-inductive","title":"CLUTRR: A Diagnostic Benchmark for Inductive Reasoning from Text","date":"2019-08-16","arxiv_id":"1908.06177","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/inductive-logic-programming-at-30-a-new","title":"Inductive logic programming at 30: a new introduction","date":"2020-08-18","arxiv_id":"2008.07912","repositories_listed":3,"syntology":null},{"url":"/paper/learning-explanatory-rules-from-noisy-data","title":"Learning Explanatory Rules from Noisy Data","date":"2017-11-13","arxiv_id":"1711.04574","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/differentiable-inductive-logic-programming-in","title":"Differentiable Inductive Logic Programming in High-Dimensional Space","date":"2022-08-13","arxiv_id":"2208.06652","repositories_listed":2,"syntology":null},{"url":"/paper/learning-programs-with-magic-values","title":"Learning programs with magic values","date":"2022-08-05","arxiv_id":"2208.03238","repositories_listed":2,"syntology":null},{"url":"/paper/incorporating-symbolic-domain-knowledge-into","title":"Incorporating Symbolic Domain Knowledge into Graph Neural Networks","date":"2020-10-23","arxiv_id":"2010.13900","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-higher-order-logic-programs","title":"Learning higher-order logic programs","date":"2019-07-25","arxiv_id":"1907.10953","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-general-game-playing","title":"Inductive general game playing","date":"2019-06-23","arxiv_id":"1906.09627","repositories_listed":2,"syntology":null},{"url":"/paper/neural-logic-machines-1","title":"Neural Logic Machines","date":"2019-04-26","arxiv_id":"1904.11694","repositories_listed":2,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/inductive-learning-of-robot-task-knowledge","title":"Inductive Learning of Robot Task Knowledge from Raw Data and Online Expert Feedback","date":"2025-01-13","arxiv_id":"2501.07507","repositories_listed":1,"syntology":null},{"url":"/paper/learning-rules-explaining-interactive-theorem","title":"Learning Rules Explaining Interactive Theorem Proving Tactic Prediction","date":"2024-11-02","arxiv_id":"2411.01188","repositories_listed":1,"syntology":null},{"url":"/paper/learning-robust-reward-machines-from-noisy","title":"Learning Robust Reward Machines from Noisy Labels","date":"2024-08-27","arxiv_id":"2408.14871","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/relational-decomposition-for-program","title":"Relational decomposition for program synthesis","date":"2024-08-22","arxiv_id":"2408.12212","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_unverified":3,"n_pointer_only":14}},{"url":"/paper/autocoder-enhancing-code-large-language-model","title":"AutoCoder: Enhancing Code Large Language Model with \\textsc{AIEV-Instruct}","date":"2024-05-23","arxiv_id":"2405.14906","repositories_listed":1,"syntology":null},{"url":"/paper/learning-big-logical-rules-by-joining-small","title":"Learning big logical rules by joining small rules","date":"2024-01-29","arxiv_id":"2401.16215","repositories_listed":1,"syntology":{"n":17,"n_ran":13,"n_unverified":4,"n_pointer_only":17}},{"url":"/paper/towards-one-shot-learning-for-text","title":"Towards One-Shot Learning for Text Classification using Inductive Logic Programming","date":"2023-08-30","arxiv_id":"2308.15885","repositories_listed":1,"syntology":null},{"url":"/paper/learning-mdl-logic-programs-from-noisy-data","title":"Learning MDL logic programs from noisy data","date":"2023-08-18","arxiv_id":"2308.09393","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_unverified":3,"n_pointer_only":16}},{"url":"/paper/learning-logic-programs-by-discovering-higher","title":"Learning logic programs by discovering higher-order abstractions","date":"2023-08-16","arxiv_id":"2308.08334","repositories_listed":1,"syntology":null},{"url":"/paper/learning-logic-specifications-for-soft-policy","title":"Learning Logic Specifications for Soft Policy Guidance in POMCP","date":"2023-03-16","arxiv_id":"2303.09172","repositories_listed":1,"syntology":null},{"url":"/paper/generalisation-through-negation-and-predicate","title":"Generalisation Through Negation and Predicate Invention","date":"2023-01-18","arxiv_id":"2301.07629","repositories_listed":1,"syntology":null},{"url":"/paper/a-protocol-for-intelligible-interaction","title":"A Model for Intelligible Interaction Between Agents That Predict and Explain","date":"2023-01-04","arxiv_id":"2301.01819","repositories_listed":1,"syntology":null},{"url":"/paper/relational-program-synthesis-with-numerical","title":"Relational program synthesis with numerical reasoning","date":"2022-10-03","arxiv_id":"2210.00764","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-inductive-logic-reasoning","title":"Temporal Inductive Logic Reasoning over Hypergraphs","date":"2022-06-09","arxiv_id":"2206.05051","repositories_listed":1,"syntology":null},{"url":"/paper/composition-of-relational-features-with-an","title":"Composition of Relational Features with an Application to Explaining Black-Box Predictors","date":"2022-06-01","arxiv_id":"2206.00738","repositories_listed":1,"syntology":null},{"url":"/paper/learning-programs-by-combining-programs","title":"Learning logic programs by combining programs","date":"2022-06-01","arxiv_id":"2206.01614","repositories_listed":1,"syntology":null},{"url":"/paper/explanatory-machine-learning-for-sequential","title":"Explanatory machine learning for sequential human teaching","date":"2022-05-20","arxiv_id":"2205.10250","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-lifting-of-symmetry-breaking","title":"Efficient lifting of symmetry breaking constraints for complex combinatorial problems","date":"2022-05-14","arxiv_id":"2205.07129","repositories_listed":1,"syntology":null},{"url":"/paper/learning-logic-programs-by-discovering-where","title":"Learning logic programs by discovering where not to search","date":"2022-02-20","arxiv_id":"2202.09806","repositories_listed":1,"syntology":null},{"url":"/paper/lifting-symmetry-breaking-constraints-with","title":"Lifting Symmetry Breaking Constraints with Inductive Logic Programming","date":"2021-12-22","arxiv_id":"2112.11806","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"}}