{"id":"https://openalex.org/W3047271088","doi":"https://doi.org/10.1017/s1471068420000174","title":"MAP Inference for Probabilistic Logic Programming","display_name":"MAP Inference for Probabilistic Logic Programming","publication_year":2020,"publication_date":"2020-09-01","ids":{"openalex":"https://openalex.org/W3047271088","doi":"https://doi.org/10.1017/s1471068420000174","mag":"3047271088"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068420000174","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068420000174","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/2008.01394","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 Universit\u00e0 di Ferrara"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria \u2013 Universit\u00e0 di Ferrara","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"middle","author":{"id":null,"display_name":"MARCO ALBERTI","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":"MARCO ALBERTI","raw_affiliation_strings":["Dipartimento di Matematica e Informatica \u2013 Universit\u00e0 di Ferrara Via Saragat 1, 44122, Ferrara, Italy (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica \u2013 Universit\u00e0 di Ferrara Via Saragat 1, 44122, Ferrara, Italy (e-mail:","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"middle","author":{"id":null,"display_name":"FABRIZIO RIGUZZI","orcid":"https://orcid.org/0000-0003-1654-9703"},"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 Universit\u00e0 di Ferrara Via Saragat 1, 44122, Ferrara, Italy (e-mail:"],"raw_orcid":"https://orcid.org/0000-0003-1654-9703","affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica \u2013 Universit\u00e0 di Ferrara Via Saragat 1, 44122, Ferrara, Italy (e-mail:","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"last","author":{"id":null,"display_name":"RICCARDO ZESE","orcid":"https://orcid.org/0000-0001-8352-6304"},"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":"RICCARDO ZESE","raw_affiliation_strings":["Dipartimento di Ingegneria \u2013 Universit\u00e0 di Ferrara"],"raw_orcid":"https://orcid.org/0000-0001-8352-6304","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria \u2013 Universit\u00e0 di Ferrara","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":0.6708,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77269863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"20","issue":"5","first_page":"641","last_page":"655"},"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.7325000166893005,"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.7325000166893005,"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.20890000462532043,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.013100000098347664,"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/inference","display_name":"Inference","score":0.6779000163078308},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6693000197410583},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5795999765396118},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5188000202178955},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5019000172615051},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4650999903678894},{"id":"https://openalex.org/keywords/variable-elimination","display_name":"Variable elimination","score":0.4410000145435333},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.3549000024795532}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.781000018119812},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6779000163078308},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6693000197410583},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5795999765396118},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5188000202178955},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5019000172615051},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4650999903678894},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.444599986076355},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.4410000145435333},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4108000099658966},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3490999937057495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3386000096797943},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.32249999046325684},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.31119999289512634},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C20837028","wikidata":"https://www.wikidata.org/wiki/Q623966","display_name":"Influence diagram","level":3,"score":0.2745000123977661},{"id":"https://openalex.org/C18998212","wikidata":"https://www.wikidata.org/wiki/Q7246856","display_name":"Probabilistic logic network","level":5,"score":0.2619999945163727},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.25769999623298645},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.25279998779296875}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068420000174","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068420000174","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:2008.01394","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.01394","pdf_url":"https://arxiv.org/pdf/2008.01394","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/2422538","is_oa":true,"landing_page_url":"http://hdl.handle.net/11392/2422538","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:2008.01394","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2008.01394","pdf_url":"https://arxiv.org/pdf/2008.01394","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":10,"referenced_works":["https://openalex.org/W212786159","https://openalex.org/W1983128223","https://openalex.org/W2008620264","https://openalex.org/W2058110750","https://openalex.org/W2084943080","https://openalex.org/W2102506621","https://openalex.org/W2105197197","https://openalex.org/W2115826669","https://openalex.org/W2963676309","https://openalex.org/W6716718503"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1,24],"Probabilistic":[2],"Logic":[3],"Programming":[4],"(PLP)":[5],"the":[6,15,34,37,44,52,61,67,72,76,79,89,118],"most":[7,45],"commonly":[8],"studied":[9],"inference":[10,40],"task":[11],"is":[12],"to":[13],"compute":[14],"marginal":[16],"probability":[17],"of":[18,51,69,78,120],"a":[19,22,49,84,101,107],"query":[20,73],"given":[21,55],"program.":[23],"this":[25],"paper,":[26],"we":[27],"consider":[28],"two":[29],"other":[30,58],"important":[31],"tasks":[32,95],"in":[33,88,143],"PLP":[35],"setting:":[36],"Maximum-A-Posteriori":[38],"(MAP)":[39],"task,":[41,66],"which":[42,92],"determines":[43],"likely":[46],"values":[47],"for":[48],"subset":[50],"random":[53],"variables":[54,74],"evidence":[56,80],"on":[57,111,134],"variables,":[59],"and":[60,105,126,130],"Most":[62],"Probable":[63],"Explanation":[64],"(MPE)":[65],"instance":[68],"MAP":[70,129],"where":[71],"are":[75],"complement":[77],"variables.":[81],"We":[82,113],"present":[83],"novel":[85],"algorithm,":[86],"included":[87],"PITA":[90,140],"reasoner,":[91],"tackles":[93],"these":[94],"by":[96],"representing":[97],"each":[98],"problem":[99],"as":[100],"Binary":[102],"Decision":[103],"Diagram":[104],"applying":[106],"dynamic":[108],"programming":[109],"procedure":[110],"it.":[112],"compare":[114],"our":[115],"algorithm":[116],"with":[117],"version":[119],"ProbLog":[121,142],"that":[122,139],"admits":[123],"annotated":[124],"disjunctions":[125],"can":[127],"perform":[128],"MPE":[131],"inference.":[132],"Experiments":[133],"several":[135],"synthetic":[136],"datasets":[137],"show":[138],"outperforms":[141],"many":[144],"cases.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2020-08-10T00:00:00"}