{"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/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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":153,"of_with_code":54,"tagged_in_all":153,"counts":{"archive_papers_tagged":153,"with_a_code_link":54,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":153,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/paper/clutrr-a-diagnostic-benchmark-for-inductive","slug":"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_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":1,"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/clutrr-a-diagnostic-benchmark-for-inductive#ran","syntology_url":"https://syntology.ai/paper/1908.06177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06177"}},"official":{"repos":["facebookresearch/clutrr"],"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/inductive-logic-programming-at-30-a-new","slug":"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","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-explanatory-rules-from-noisy-data#ran","syntology_url":"https://syntology.ai/paper/1711.04574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04574"}},"official":null}},{"url":"/paper/differentiable-inductive-logic-programming-in","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"neural-logic-machines-1","title":"Neural Logic Machines","date":"2019-04-26","arxiv_id":"1904.11694","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-logic-machines-1#ran","syntology_url":"https://syntology.ai/paper/1904.11694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11694"}},"official":null}},{"url":"/paper/inductive-learning-of-robot-task-knowledge","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-robust-reward-machines-from-noisy#ran","syntology_url":"https://syntology.ai/paper/2408.14871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14871"}},"official":{"repos":["rparac/prob-irm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/relational-decomposition-for-program","slug":"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_constructed":0,"n_ran_checked":6,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/relational-decomposition-for-program#ran","syntology_url":"https://syntology.ai/paper/2408.12212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.12212"}},"official":{"repos":["celinehocquette/ijcai25-relational-decomposition"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/autocoder-enhancing-code-large-language-model","slug":"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","slug":"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_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":4,"n_honours":4,"n_violates":0,"n_no_contract":5,"n_pointer_only":17,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 4 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-big-logical-rules-by-joining-small#ran","syntology_url":"https://syntology.ai/paper/2401.16215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16215"}},"official":{"repos":["celinehocquette/ijcai24-joiner"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-one-shot-learning-for-text","slug":"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","slug":"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_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-mdl-logic-programs-from-noisy-data#ran","syntology_url":"https://syntology.ai/paper/2308.09393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09393"}},"official":{"repos":["celinehocquette/aaai24-maxsynth"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-logic-programs-by-discovering-higher","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"url":"/paper/neuro-symbolic-inductive-logic-programming","slug":"neuro-symbolic-inductive-logic-programming","title":"Neuro-Symbolic Inductive Logic Programming with Logical Neural Networks","date":"2021-12-06","arxiv_id":"2112.03324","repositories_listed":1,"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/neuro-symbolic-inductive-logic-programming#ran","syntology_url":"https://syntology.ai/paper/2112.03324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.03324"}},"official":{"repos":["shehzaadzd/MINERVA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-rules-with-stratified-negation-in","slug":"learning-rules-with-stratified-negation-in","title":"Learning Rules with Stratified Negation in Differentiable ILP.","date":"2021-10-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-logic-programs-through-divide","slug":"learning-logic-programs-through-divide","title":"Learning logic programs through divide, constrain, and conquer","date":"2021-09-16","arxiv_id":"2109.07818","repositories_listed":1,"syntology":null},{"url":"/paper/ff-nsl-feed-forward-neural-symbolic-learner","slug":"ff-nsl-feed-forward-neural-symbolic-learner","title":"FF-NSL: Feed-Forward Neural-Symbolic Learner","date":"2021-06-24","arxiv_id":"2106.13103","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ff-nsl-feed-forward-neural-symbolic-learner#ran","syntology_url":"https://syntology.ai/paper/2106.13103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13103"}},"official":{"repos":["dancunnington/ffnsl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inclusion-of-domain-knowledge-into-gnns-using","slug":"inclusion-of-domain-knowledge-into-gnns-using","title":"Inclusion of Domain-Knowledge into GNNs using Mode-Directed Inverse Entailment","date":"2021-05-22","arxiv_id":"2105.10709","repositories_listed":1,"syntology":null},{"url":"/paper/expressive-explanations-of-dnns-by-combining","slug":"expressive-explanations-of-dnns-by-combining","title":"Expressive Explanations of DNNs by Combining Concept Analysis with ILP","date":"2021-05-16","arxiv_id":"2105.07371","repositories_listed":1,"syntology":null},{"url":"/paper/predicate-invention-by-learning-from-failures","slug":"predicate-invention-by-learning-from-failures","title":"Predicate Invention by Learning From Failures","date":"2021-04-29","arxiv_id":"2104.14426","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/predicate-invention-by-learning-from-failures#ran","syntology_url":"https://syntology.ai/paper/2104.14426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14426"}},"official":null}},{"url":"/paper/differentiable-inductive-logic-programming","slug":"differentiable-inductive-logic-programming","title":"Differentiable Inductive Logic Programming for Structured Examples","date":"2021-03-02","arxiv_id":"2103.01719","repositories_listed":1,"syntology":{"n":23,"n_ran":9,"n_constructed":4,"n_ran_checked":7,"n_instrument":2,"n_unverified":14,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"9 ran (of which 4 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/differentiable-inductive-logic-programming#ran","syntology_url":"https://syntology.ai/paper/2103.01719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01719"}},"official":{"repos":["hkrsnd/dilp-st"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":4,"n_ran_no_instrument_failure":7,"n_unverified":14,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-programs-by-learning-from-failures","slug":"learning-programs-by-learning-from-failures","title":"Learning programs by learning from failures","date":"2020-05-05","arxiv_id":"2005.02259","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-refactoring-for-program-induction","slug":"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/user-friendly-automatic-construction-of","slug":"user-friendly-automatic-construction-of","title":"User Friendly Automatic Construction of Background Knowledge: Mode Construction from ER Diagrams","date":"2019-12-16","arxiv_id":"1912.07650","repositories_listed":1,"syntology":null},{"url":"/paper/191013314","slug":"191013314","title":"Symbolic Graph Embedding using Frequent Pattern Mining","date":"2019-10-29","arxiv_id":"1910.13314","repositories_listed":1,"syntology":null},{"url":"/paper/learn-to-explain-efficiently-via-neural-logic","slug":"learn-to-explain-efficiently-via-neural-logic","title":"Learn to Explain Efficiently via Neural Logic Inductive Learning","date":"2019-10-06","arxiv_id":"1910.02481","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learn-to-explain-efficiently-via-neural-logic#ran","syntology_url":"https://syntology.ai/paper/1910.02481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02481"}},"official":{"repos":["gblackout/NLIL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rudas-synthetic-datasets-for-rule-learning","slug":"rudas-synthetic-datasets-for-rule-learning","title":"RuDaS: Synthetic Datasets for Rule Learning and Evaluation Tools","date":"2019-09-16","arxiv_id":"1909.07095","repositories_listed":1,"syntology":null},{"url":"/paper/towards-meta-interpretive-learning-of","slug":"towards-meta-interpretive-learning-of","title":"Towards meta-interpretive learning of programming language semantics","date":"2019-07-20","arxiv_id":"1907.08834","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-logic-programming-via","slug":"inductive-logic-programming-via","title":"Inductive Logic Programming via Differentiable Deep Neural Logic Networks","date":"2019-06-08","arxiv_id":"1906.03523","repositories_listed":1,"syntology":null},{"url":"/paper/induction-of-non-monotonic-rules-from","slug":"induction-of-non-monotonic-rules-from","title":"Induction of Non-Monotonic Rules From Statistical Learning Models Using High-Utility Itemset Mining","date":"2019-05-24","arxiv_id":"1905.11226","repositories_listed":1,"syntology":null},{"url":"/paper/neural-logic-reinforcement-learning","slug":"neural-logic-reinforcement-learning","title":"Neural Logic Reinforcement Learning","date":"2019-04-24","arxiv_id":"1904.10729","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-logic-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/1904.10729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10729"}},"official":{"repos":["ZhengyaoJiang/NLRL"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/playgol-learning-programs-through-play","slug":"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/incremental-and-iterative-learning-of-answer","slug":"incremental-and-iterative-learning-of-answer","title":"Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples","date":"2018-02-22","arxiv_id":"1802.07966","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-online-learning-of-event","slug":"distributed-online-learning-of-event","title":"Distributed Online Learning of Event Definitions","date":"2017-05-05","arxiv_id":"1705.02175","repositories_listed":1,"syntology":null},{"url":"/paper/online-learning-of-event-definitions","slug":"online-learning-of-event-definitions","title":"Online Learning of Event Definitions","date":"2016-07-30","arxiv_id":"1608.00100","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-inductive-logic-programming","slug":"probabilistic-inductive-logic-programming","title":"Probabilistic Inductive Logic Programming Based on Answer Set Programming","date":"2014-05-04","arxiv_id":"1405.0720","repositories_listed":1,"syntology":null},{"url":"/paper/incremental-learning-of-event-definitions","slug":"incremental-learning-of-event-definitions","title":"Incremental Learning of Event Definitions with Inductive Logic Programming","date":"2014-02-24","arxiv_id":"1402.5988","repositories_listed":1,"syntology":null},{"url":null,"slug":"learning-symbolic-persistent-macro-actions","title":"Learning Symbolic Persistent Macro-Actions for POMDP Solving Over Time","date":"2025-05-06","arxiv_id":"2505.03668","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-weak-supervision-theory-and","title":"Neuro-symbolic Weak Supervision: Theory and Semantics","date":"2025-03-24","arxiv_id":"2503.18509","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-comparison-of-cost-functions-in","title":"An Empirical Comparison of Cost Functions in Inductive Logic Programming","date":"2025-03-10","arxiv_id":"2503.07554","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-contrastive-learning-for-cross","title":"Neuro-Symbolic Contrastive Learning for Cross-domain Inference","date":"2025-02-13","arxiv_id":"2502.09213","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-40th-international-conference-on","title":"Proceedings 40th International Conference on Logic Programming","date":"2025-02-11","arxiv_id":"2502.08453","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-inductive-learning-from-answer-sets","title":"Online inductive learning from answer sets for efficient reinforcement learning exploration","date":"2025-01-13","arxiv_id":"2501.07445","repositories_listed":0,"syntology":null},{"url":null,"slug":"ht-hedl-high-throughput-hypothesis-evaluation","title":"HT-HEDL: High-Throughput Hypothesis Evaluation in Description Logic","date":"2024-12-01","arxiv_id":"2412.00802","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-inductive-logic-programming-1","title":"Differentiable Inductive Logic Programming for Fraud Detection","date":"2024-10-29","arxiv_id":"2410.21928","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-augmented-symbolic-reinforcement-learning","title":"LLM-Augmented Symbolic Reinforcement Learning with Landmark-Based Task Decomposition","date":"2024-10-02","arxiv_id":"2410.01929","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-probabilistic-inductive-logic","title":"Towards Probabilistic Inductive Logic Programming with Neurosymbolic Inference and Relaxation","date":"2024-08-21","arxiv_id":"2408.11367","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-learning-of-logical-theories-with","title":"Inductive Learning of Logical Theories with LLMs: An Expressivity-Graded Analysis","date":"2024-08-15","arxiv_id":"2408.16779","repositories_listed":0,"syntology":null},{"url":null,"slug":"neurosymbolic-methods-for-rule-mining","title":"Neurosymbolic Methods for Rule Mining","date":"2024-08-11","arxiv_id":"2408.05773","repositories_listed":0,"syntology":null},{"url":null,"slug":"algebraic-anti-unification","title":"Algebraic anti-unification","date":"2024-07-22","arxiv_id":"2407.15510","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-synthesis-using-inductive-logic","title":"Program Synthesis using Inductive Logic Programming for the Abstraction and Reasoning Corpus","date":"2024-05-10","arxiv_id":"2405.06399","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-logic-specifications-for-policy","title":"Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approach","date":"2024-02-29","arxiv_id":"2402.19265","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-logic-programs-by-finding-minimal","title":"Learning logic programs by finding minimal unsatisfiable subprograms","date":"2024-01-29","arxiv_id":"2401.16383","repositories_listed":0,"syntology":null},{"url":null,"slug":"llms-for-relational-reasoning-how-far-are-we","title":"LLMs for Relational Reasoning: How Far are We?","date":"2024-01-17","arxiv_id":"2401.09042","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unifying-framework-for-learning","title":"A Unifying Framework for Learning Argumentation Semantics","date":"2023-10-18","arxiv_id":"2310.12309","repositories_listed":0,"syntology":null},{"url":null,"slug":"symbolic-imitation-learning-from-black-box-to","title":"Symbolic Imitation Learning: From Black-Box to Explainable Driving Policies","date":"2023-09-27","arxiv_id":"2309.16025","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-inductive-logic-programming-meets","title":"Deep Inductive Logic Programming meets Reinforcement Learning","date":"2023-08-30","arxiv_id":"2308.16210","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainable-and-trustworthy-traffic-sign","title":"Explainable and Trustworthy Traffic Sign Detection for Safe Autonomous Driving: An Inductive Logic Programming Approach","date":"2023-08-30","arxiv_id":"2309.03215","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-learning-of-declarative-domain","title":"Inductive Learning of Declarative Domain-Specific Heuristics for ASP","date":"2023-08-30","arxiv_id":"2308.15863","repositories_listed":0,"syntology":null},{"url":null,"slug":"would-life-be-more-interesting-if-i-were-in","title":"\"Would life be more interesting if I were in AI?\" Answering Counterfactuals based on Probabilistic Inductive Logic Programming","date":"2023-08-30","arxiv_id":"2308.15883","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-comprehensible-active-learning-of","title":"Human Comprehensible Active Learning of Genome-Scale Metabolic Networks","date":"2023-08-24","arxiv_id":"2308.12740","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-divide-align-conquer-strategy-for-program","title":"A Divide-Align-Conquer Strategy for Program Synthesis","date":"2023-01-08","arxiv_id":"2301.03094","repositories_listed":0,"syntology":null},{"url":null,"slug":"constraint-driven-multi-task-learning","title":"Constraint-driven multi-task learning","date":"2022-08-24","arxiv_id":"2208.11656","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-model-oriented-approach-for-lifting","title":"A Model-Oriented Approach for Lifting Symmetries in Answer Set Programming","date":"2022-08-05","arxiv_id":"2208.03095","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-first-order-rules-with","title":"Learning First-Order Rules with Differentiable Logic Program Semantics","date":"2022-04-28","arxiv_id":"2204.13570","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interactive-explanatory-ai-system-for","title":"An Interactive Explanatory AI System for Industrial Quality Control","date":"2022-03-17","arxiv_id":"2203.09181","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-critical-review-of-inductive-logic","title":"A Critical Review of Inductive Logic Programming Techniques for Explainable AI","date":"2021-12-31","arxiv_id":"2112.15319","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-higher-order-programs-without-meta","title":"Learning Higher-Order Programs without Meta-Interpretive Learning","date":"2021-12-29","arxiv_id":"2112.14603","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-logic-programs-from-noisy-failures","title":"Learning Logic Programs From Noisy Failures","date":"2021-12-28","arxiv_id":"2201.03702","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-hierarchical-rule-induction","title":"Neuro-Symbolic Hierarchical Rule Induction","date":"2021-12-26","arxiv_id":"2112.13418","repositories_listed":0,"syntology":null},{"url":null,"slug":"preprocessing-in-inductive-logic-programming","title":"Preprocessing in Inductive Logic Programming","date":"2021-12-21","arxiv_id":"2112.12551","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-boltzmann-machines","title":"Logical Boltzmann Machines","date":"2021-12-10","arxiv_id":"2112.05841","repositories_listed":0,"syntology":null},{"url":null,"slug":"ontology-based-skill-description-learning-for","title":"Ontology-Based Skill Description Learning for Flexible Production Systems","date":"2021-11-25","arxiv_id":"2111.13142","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-neuro-symbolic-approach-for-text","title":"A Hybrid Neuro-Symbolic approach for Text-Based Games using Inductive Logic Programming","date":"2021-11-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"using-program-synthesis-and-inductive-logic","title":"Using Program Synthesis and Inductive Logic Programming to solve Bongard Problems","date":"2021-10-19","arxiv_id":"2110.09947","repositories_listed":0,"syntology":null},{"url":null,"slug":"explanation-as-a-process-user-centric","title":"Explanation as a process: user-centric construction of multi-level and multi-modal explanations","date":"2021-10-07","arxiv_id":"2110.03759","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-complexity-of-inductively-learning","title":"On the Complexity of Inductively Learning Guarded Rules","date":"2021-10-07","arxiv_id":"2110.03624","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clustering-and-demotion-based-algorithm-for","title":"A Clustering and Demotion Based Algorithm for Inductive Learning of Default Theories","date":"2021-09-26","arxiv_id":"2109.12624","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-rules-and-embeddings-via-neuro","title":"Combining Rules and Embeddings via Neuro-Symbolic AI for Knowledge Base Completion","date":"2021-09-16","arxiv_id":"2109.09566","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-constraint-driven-inductive-logic","title":"Parallel Constraint-Driven Inductive Logic Programming","date":"2021-09-15","arxiv_id":"2109.07132","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-model-based-hierarchical","title":"Interpretable Model-based Hierarchical Reinforcement Learning using Inductive Logic Programming","date":"2021-06-21","arxiv_id":"2106.11417","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-contrastive-explanations-for","title":"Generating Contrastive Explanations for Inductive Logic Programming Based on a Near Miss Approach","date":"2021-06-15","arxiv_id":"2106.08064","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-description-logic-ontologies-five","title":"Learning Description Logic Ontologies. Five Approaches. Where Do They Stand?","date":"2021-04-02","arxiv_id":"2104.01193","repositories_listed":0,"syntology":null}],"syntology_records":13,"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"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":12,"papers_where_code_ran_first_page":"/task/inductive-logic-programming/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/inductive-logic-programming/papers/2","json":"/task/inductive-logic-programming/papers/2.json","rows":53},{"order":"ran","page":1,"of":1,"url":"/task/inductive-logic-programming/papers/ran/1","json":"/task/inductive-logic-programming/papers/ran/1.json","rows":12}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"067b3409b83d94b07401f9ab524ea1eba4966a3d32ae5632610b230afd1e472a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}