{"id":"https://openalex.org/W3198214717","doi":"https://doi.org/10.1017/s1471068421000144","title":"Learning Distributional Programs for Relational Autocompletion","display_name":"Learning Distributional Programs for Relational Autocompletion","publication_year":2021,"publication_date":"2021-08-26","ids":{"openalex":"https://openalex.org/W3198214717","doi":"https://doi.org/10.1017/s1471068421000144","mag":"3198214717"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068421000144","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068421000144","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3455FF80738DFFCA0DD3B8BBBB58AB0/S1471068421000144a.pdf/div-class-title-learning-distributional-programs-for-relational-autocompletion-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3455FF80738DFFCA0DD3B8BBBB58AB0/S1471068421000144a.pdf/div-class-title-learning-distributional-programs-for-relational-autocompletion-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103106614","display_name":"Nitesh Kumar","orcid":"https://orcid.org/0000-0002-9301-3876"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"NITESH KUMAR","raw_affiliation_strings":["Department of Computer Science, KU Leuven, Belgium"],"raw_orcid":"https://orcid.org/0000-0002-9301-3876","affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021262042","display_name":"Ond\u0159ej Ku\u017eelka","orcid":"https://orcid.org/0000-0002-6523-9114"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"OND\u0158EJ KU\u017dELKA","raw_affiliation_strings":["Department of Computer Science, Czech Technical University in Prague, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Czech Technical University in Prague, Czechia","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078136609","display_name":"Luc De Raedt","orcid":"https://orcid.org/0000-0002-6860-6303"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"LUC DE RAEDT","raw_affiliation_strings":["Department of Computer Science, KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1399,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56129677,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"22","issue":"1","first_page":"81","last_page":"114"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.833020806312561},{"id":"https://openalex.org/keywords/statistical-relational-learning","display_name":"Statistical relational learning","score":0.831267237663269},{"id":"https://openalex.org/keywords/missing-data","display_name":"Missing data","score":0.7882705926895142},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.7406833171844482},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6622234582901001},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6360920071601868},{"id":"https://openalex.org/keywords/relational-calculus","display_name":"Relational calculus","score":0.5456186532974243},{"id":"https://openalex.org/keywords/relational-model","display_name":"Relational model","score":0.5344948172569275},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4663001596927643},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4501117765903473},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44834089279174805},{"id":"https://openalex.org/keywords/statistical-model","display_name":"Statistical model","score":0.4237218499183655},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.37070560455322266},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.33687156438827515},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10575103759765625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08541926741600037}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.833020806312561},{"id":"https://openalex.org/C177877439","wikidata":"https://www.wikidata.org/wiki/Q7604413","display_name":"Statistical relational learning","level":3,"score":0.831267237663269},{"id":"https://openalex.org/C9357733","wikidata":"https://www.wikidata.org/wiki/Q6878417","display_name":"Missing data","level":2,"score":0.7882705926895142},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.7406833171844482},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6622234582901001},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6360920071601868},{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.5456186532974243},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.5344948172569275},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4663001596927643},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4501117765903473},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44834089279174805},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.4237218499183655},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.37070560455322266},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.33687156438827515},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10575103759765625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08541926741600037},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068421000144","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068421000144","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3455FF80738DFFCA0DD3B8BBBB58AB0/S1471068421000144a.pdf/div-class-title-learning-distributional-programs-for-relational-autocompletion-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:https://orca.cardiff.ac.uk:173173","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401195","display_name":"ORCA Online Research @Cardiff (Cardiff University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79510175","host_organization_name":"Cardiff University","host_organization_lineage":["https://openalex.org/I79510175"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/672768","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/bitstream/123456789/672768/4/LearningDistributionalPrograms.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory And Practice Of Logic Programming, vol. 22 (1), (81-114)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1017/s1471068421000144","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068421000144","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3455FF80738DFFCA0DD3B8BBBB58AB0/S1471068421000144a.pdf/div-class-title-learning-distributional-programs-for-relational-autocompletion-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G12500569","display_name":null,"funder_award_id":"CZ.02.1.01/0.0","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G4131035492","display_name":null,"funder_award_id":"CZ.02.1.01","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G4818322051","display_name":null,"funder_award_id":"019/0000765","funder_id":"https://openalex.org/F4320334253","funder_display_name":"Research Center for Informatics, Czech Technical University in Prague"},{"id":"https://openalex.org/G6076044179","display_name":null,"funder_award_id":"20-19104Y","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320322308","display_name":"KU Leuven","ror":"https://ror.org/05f950310"},{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null},{"id":"https://openalex.org/F4320334253","display_name":"Research Center for Informatics, Czech Technical University in Prague","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3198214717.pdf","grobid_xml":"https://content.openalex.org/works/W3198214717.grobid-xml"},"referenced_works_count":78,"referenced_works":["https://openalex.org/W62269236","https://openalex.org/W92973652","https://openalex.org/W216635998","https://openalex.org/W1494598192","https://openalex.org/W1501299699","https://openalex.org/W1509515766","https://openalex.org/W1514973146","https://openalex.org/W1515653062","https://openalex.org/W1523680690","https://openalex.org/W1529041941","https://openalex.org/W1544444076","https://openalex.org/W1563950057","https://openalex.org/W1585529040","https://openalex.org/W1597657898","https://openalex.org/W1601600618","https://openalex.org/W1698663318","https://openalex.org/W1824971879","https://openalex.org/W1864566053","https://openalex.org/W1922870332","https://openalex.org/W1977970897","https://openalex.org/W1986263554","https://openalex.org/W2000805332","https://openalex.org/W2028137574","https://openalex.org/W2033072307","https://openalex.org/W2041479715","https://openalex.org/W2045373010","https://openalex.org/W2049633694","https://openalex.org/W2052148895","https://openalex.org/W2054860584","https://openalex.org/W2065606385","https://openalex.org/W2087214618","https://openalex.org/W2089206172","https://openalex.org/W2101234009","https://openalex.org/W2101335378","https://openalex.org/W2101705355","https://openalex.org/W2110325612","https://openalex.org/W2117892888","https://openalex.org/W2119831128","https://openalex.org/W2121075864","https://openalex.org/W2121906195","https://openalex.org/W2126185296","https://openalex.org/W2137213923","https://openalex.org/W2158292827","https://openalex.org/W2159080219","https://openalex.org/W2168175751","https://openalex.org/W2187164964","https://openalex.org/W2225666389","https://openalex.org/W2341971562","https://openalex.org/W2505264607","https://openalex.org/W2520858206","https://openalex.org/W2525811808","https://openalex.org/W2531563875","https://openalex.org/W2555890010","https://openalex.org/W2576680543","https://openalex.org/W2591700809","https://openalex.org/W2606309900","https://openalex.org/W2610357341","https://openalex.org/W2754595813","https://openalex.org/W2806157329","https://openalex.org/W2899867782","https://openalex.org/W2904757977","https://openalex.org/W2917101430","https://openalex.org/W2962735828","https://openalex.org/W2963975801","https://openalex.org/W2964097724","https://openalex.org/W2982175401","https://openalex.org/W3046728625","https://openalex.org/W3101215053","https://openalex.org/W3101488456","https://openalex.org/W3104798428","https://openalex.org/W4229758624","https://openalex.org/W4293582904","https://openalex.org/W6603669155","https://openalex.org/W6630626424","https://openalex.org/W6635963527","https://openalex.org/W6640016188","https://openalex.org/W6675204935","https://openalex.org/W6724906694"],"related_works":["https://openalex.org/W2085988990","https://openalex.org/W2005835473","https://openalex.org/W60748262","https://openalex.org/W2056340443","https://openalex.org/W2378275298","https://openalex.org/W1510134535","https://openalex.org/W1487241321","https://openalex.org/W2156787493","https://openalex.org/W1974998563","https://openalex.org/W3181676408"],"abstract_inverted_index":{"Abstract":[0],"Relational":[1],"autocompletion":[2,87],"is":[3,135],"the":[4,21,50,53,127,130],"problem":[5,19],"of":[6,26,55,80,129],"automatically":[7],"filling":[8],"out":[9],"some":[10],"missing":[11,63,121,136],"values":[12],"in":[13,88],"multi-relational":[14],"data.":[15,122,137],"We":[16],"tackle":[17],"this":[18,39],"within":[20],"probabilistic":[22],"logic":[23],"programming":[24],"framework":[25],"Distributional":[27],"Clauses":[28],"(DCs),":[29],"which":[30],"supports":[31],"both":[32,49,101],"discrete":[33,102],"and":[34,52,72,103,111],"continuous":[35,104],"probability":[36],"distributions.":[37],"Within":[38],"framework,":[40],"we":[41],"introduce":[42],"DiceML":[43,68,81],"\u2013":[44],"an":[45,114],"approach":[46],"to":[47,118],"learn":[48],"structure":[51],"parameters":[54],"DC":[56],"programs":[57],"from":[58],"relational":[59,89],"data":[60],"(with":[61],"possibly":[62],"data).":[64],"To":[65],"realize":[66],"this,":[67],"integrates":[69],"statistical":[70,96],"modeling":[71],"DCs":[73,93],"with":[74,95,100,120],"rule":[75],"learning.":[76],"The":[77,123],"distinguishing":[78],"features":[79],"are":[82],"that":[83],"it":[84],"(1)":[85],"tackles":[86],"data,":[90],"(2)":[91],"learns":[92],"extended":[94],"models,":[97],"(3)":[98],"deals":[99],"distributions,":[105],"(4)":[106],"can":[107],"exploit":[108],"background":[109],"knowledge,":[110],"(5)":[112],"uses":[113],"expectation\u2013maximization-based":[115],"(EM)":[116],"algorithm":[117],"cope":[119],"empirical":[124],"results":[125],"show":[126],"promise":[128],"approach,":[131],"even":[132],"when":[133],"there":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}