{"id":"https://openalex.org/W2086351973","doi":"https://doi.org/10.1017/s1471068413000689","title":"Structure learning of probabilistic logic programs by searching the clause space","display_name":"Structure learning of probabilistic logic programs by searching the clause space","publication_year":2014,"publication_date":"2014-01-15","ids":{"openalex":"https://openalex.org/W2086351973","doi":"https://doi.org/10.1017/s1471068413000689","mag":"2086351973"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068413000689","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000689","pdf_url":null,"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":null,"license_id":null,"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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1309.2080","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"ELENA BELLODI","orcid":null},"institutions":[{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"ELENA BELLODI","raw_affiliation_strings":["Dipartimento di Ingegneria \u2013 University of Ferrara, Via Saragat 1, 44122, Ferrara, Italy (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria \u2013 University of Ferrara, Via Saragat 1, 44122, Ferrara, Italy (e-mail:","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"last","author":{"id":null,"display_name":"FABRIZIO RIGUZZI","orcid":null},"institutions":[{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"FABRIZIO RIGUZZI","raw_affiliation_strings":["Dipartimento di Matematica e Informatica \u2013 University of Ferrara, Via Saragat 1, 44122, Ferrara, Italy (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica \u2013 University of Ferrara, Via Saragat 1, 44122, Ferrara, Italy (e-mail:","institution_ids":["https://openalex.org/I201324441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I201324441"],"apc_list":null,"apc_paid":null,"fwci":4.4001,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.94584059,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"2","first_page":"169","last_page":"212"},"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.8537999987602234,"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.8537999987602234,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.06949999928474426,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.017000000923871994,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.741599977016449},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.6895999908447266},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5063999891281128},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.435699999332428},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.43529999256134033},{"id":"https://openalex.org/keywords/inductive-logic-programming","display_name":"Inductive logic programming","score":0.423799991607666},{"id":"https://openalex.org/keywords/probabilistic-logic-network","display_name":"Probabilistic logic network","score":0.40619999170303345},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.39469999074935913}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.741599977016449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7253999710083008},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.6895999908447266},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5063999891281128},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5023000240325928},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4986000061035156},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.435699999332428},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C2779382394","wikidata":"https://www.wikidata.org/wiki/Q1464197","display_name":"Inductive logic programming","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C18998212","wikidata":"https://www.wikidata.org/wiki/Q7246856","display_name":"Probabilistic logic network","level":5,"score":0.40619999170303345},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.40470001101493835},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3882000148296356},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.3698999881744385},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3474999964237213},{"id":"https://openalex.org/C143017306","wikidata":"https://www.wikidata.org/wiki/Q3318133","display_name":"Probabilistic relevance model","level":4,"score":0.3075999915599823},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.29989999532699585},{"id":"https://openalex.org/C128828806","wikidata":"https://www.wikidata.org/wiki/Q7246848","display_name":"Probabilistic argumentation","level":3,"score":0.28600001335144043},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.2743000090122223},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.2551000118255615}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068413000689","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000689","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1309.2080","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.2080","pdf_url":"https://arxiv.org/pdf/1309.2080","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:iris.unife.it:11392/2269014","is_oa":true,"landing_page_url":"http://hdl.handle.net/11392/2269014","pdf_url":null,"source":{"id":"https://openalex.org/S4306400369","display_name":"Institutional Research Information System University of Ferrara (University of Ferrara)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201324441","host_organization_name":"University of Ferrara","host_organization_lineage":["https://openalex.org/I201324441"],"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1309.2080","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.2080","pdf_url":"https://arxiv.org/pdf/1309.2080","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1215345351","https://openalex.org/W1426178689","https://openalex.org/W1508922218","https://openalex.org/W1517360117","https://openalex.org/W1518043585","https://openalex.org/W1521867855","https://openalex.org/W1523817461","https://openalex.org/W1585529040","https://openalex.org/W1601957265","https://openalex.org/W1675599478","https://openalex.org/W1948942933","https://openalex.org/W1968513265","https://openalex.org/W1976526581","https://openalex.org/W1977970897","https://openalex.org/W1981149018","https://openalex.org/W1983128223","https://openalex.org/W1984187667","https://openalex.org/W1996824494","https://openalex.org/W2000437271","https://openalex.org/W2012979684","https://openalex.org/W2031868932","https://openalex.org/W2039400313","https://openalex.org/W2042996829","https://openalex.org/W2052451171","https://openalex.org/W2084943080","https://openalex.org/W2085544069","https://openalex.org/W2101335378","https://openalex.org/W2119831128","https://openalex.org/W2121075864","https://openalex.org/W2137027418","https://openalex.org/W2144429462","https://openalex.org/W2148550253","https://openalex.org/W2150678881","https://openalex.org/W2151286458","https://openalex.org/W2155800811","https://openalex.org/W2158698691","https://openalex.org/W2165520550","https://openalex.org/W2168175751","https://openalex.org/W2169992051","https://openalex.org/W2375970338","https://openalex.org/W2610167300","https://openalex.org/W2963676309","https://openalex.org/W4243550141","https://openalex.org/W6670293775","https://openalex.org/W6672203487","https://openalex.org/W6679342896"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Learning":[1],"probabilistic":[2,65],"logic":[3,48],"programming":[4],"languages":[5],"is":[6],"receiving":[7],"an":[8],"increasing":[9],"attention,":[10],"and":[11,22,27,30,67,108,114,127,136],"systems":[12],"are":[13],"available":[14],"for":[15,43,117],"learning":[16,118],"the":[17,40,53,62,72,77,81,84,89,134],"parameters":[18,28],"(PRISM,":[19],"LeProbLog,":[20],"LFI-ProbLog":[21],"EMBLEM)":[23],"or":[24],"both":[25],"structure":[26],"(SEM-CP-logic":[29],"SLIPCASE)":[31],"of":[32,46,64,74,80],"these":[33],"languages.":[34],"In":[35],"this":[36],"paper":[37],"we":[38],"present":[39],"algorithm":[41,99],"SLIPCOVER":[42,92,129],"\u201cStructure":[44],"LearnIng":[45],"Probabilistic":[47],"programs":[49],"by":[50],"searChing":[51],"OVER":[52],"clause":[54],"space.\u201d":[55],"It":[56],"performs":[57,93],"a":[58,68],"beam":[59],"search":[60,70],"in":[61,71,141],"space":[63,73],"clauses":[66],"greedy":[69],"theories":[75],"using":[76,123],"log":[78,90],"likelihood":[79],"data":[82],"as":[83],"guiding":[85],"heuristics.":[86],"To":[87],"estimate":[88],"likelihood,":[91],"Expectation":[94],"Maximization":[95],"with":[96,110],"EMBLEM.":[97],"The":[98],"has":[100],"been":[101],"tested":[102],"on":[103],"five":[104],"real":[105],"world":[106],"datasets":[107],"compared":[109],"SLIPCASE,":[111],"SEM-CP-logic,":[112],"Aleph":[113],"two":[115],"algorithms":[116],"Markov":[119],"Logic":[120],"Networks":[121],"(Learning":[122],"Structural":[124],"Motifs":[125],"(LSM)":[126],"ALEPH++ExactL1).":[128],"achieves":[130],"higher":[131],"areas":[132],"under":[133],"precision-recall":[135],"receiver":[137],"operating":[138],"characteristic":[139],"curves":[140],"most":[142],"cases.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2016-06-24T00:00:00"}