{"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/papers/ran/1","list_of":"/task/inductive-logic-programming","task":"Inductive logic programming","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,12],"of":12,"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"},"first_page":"/task/inductive-logic-programming/papers/ran/1","prev":null,"next":null,"papers":[{"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":3,"n_instrument":0,"n_unverified":1,"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) · 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":3,"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":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 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":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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":13,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":17,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 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":13,"n_unverified":4,"ran_from_kinds":["official"]}}},{"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":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 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":13,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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/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":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"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) · 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/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/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/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/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/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}}],"record_sha256":"8cef6b302910265b5726887a046b16b7c54b01bdd1791437e8b43d9738d084fb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}