{"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":"/method/symbolic-rule-learning","slug":"symbolic-rule-learning","name":"Symbolic rule learning","full_name":"Symbolic rule learning","full_name_withheld":false,"description_markdown":"Symbolic rule learning methods find regularities in data that can be expressed in the form of 'if-then' rules based on symbolic representations of the data.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Scalable and interpretable rule-based link prediction for large heterogeneous knowledge graphs","paper":"/paper/scalable-and-interpretable-rule-based-link","first_author":"Simon Ott","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/scalable-and-interpretable-rule-based-link"},"source":{"url":"https://arxiv.org/abs/2012.05750v1","title":"Scalable and interpretable rule-based link prediction for large heterogeneous knowledge graphs","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Rule-based systems","url":"/methods/category/rule-based-systems","pwc_aliases":[]}],"n_papers_tagged":4,"archive_num_papers":4,"papers_newest_first":[{"paper":"/paper/pix2rule-end-to-end-neuro-symbolic-rule","slug":"pix2rule-end-to-end-neuro-symbolic-rule","title":"pix2rule: End-to-end Neuro-symbolic Rule Learning","date":"2021-06-14","arxiv_id":"2106.07487","n_code_links":3,"syntology":null},{"paper":"/paper/scalable-and-interpretable-rule-based-link","slug":"scalable-and-interpretable-rule-based-link","title":"Scalable and interpretable rule-based link prediction for large heterogeneous knowledge graphs","date":"2020-12-10","arxiv_id":"2012.05750","n_code_links":1,"syntology":null},{"paper":"/paper/discovering-outstanding-subgroup-lists-for","slug":"discovering-outstanding-subgroup-lists-for","title":"Discovering outstanding subgroup lists for numeric targets using MDL","date":"2020-06-16","arxiv_id":"2006.09186","n_code_links":3,"syntology":null},{"paper":"/paper/drum-end-to-end-differentiable-rule-mining-on","slug":"drum-end-to-end-differentiable-rule-mining-on","title":"DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs","date":"2019-10-31","arxiv_id":"1911.00055","n_code_links":1,"syntology":null}],"papers_shown":4,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":4,"with_a_code_link":4,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":4,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/knowledge-graphs","name":"Knowledge Graphs","papers":2},{"task":"/task/link-prediction","name":"Link Prediction","papers":2},{"task":"/task/prediction","name":"Prediction","papers":2},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/inductive-link-prediction","name":"Inductive Link Prediction","papers":1},{"task":"/task/inductive-knowledge-graph-completion","name":"Inductive knowledge graph completion","papers":1},{"task":"/task/subgroup-discovery","name":"Subgroup Discovery","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":10,"n_tasks":10,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":2},{"year":"2021","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/symbolic-rule-learning"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Symbolic%20rule%20learning","read_at":"2026-10-05T01:02:50+00:00","query":"Symbolic rule learning","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2012.05750","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Symbolic rule learning' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["neurosymbolic framework for rule application","coverage-aware retriever with symbolic rule-based reasoning","RULE","RULE","Rule-TVM","Safe-RULE","Symbolic-KAN","Rule of Thumb"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"fe003c73935f2b952b7412f30d419ead66e475ad7574a2a97b07b37605bba0f7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}