{"id":"https://openalex.org/W2989754355","doi":"https://doi.org/10.24963/ijcai.2019/159","title":"Stochastic Constraint Propagation for Mining Probabilistic Networks","display_name":"Stochastic Constraint Propagation for Mining Probabilistic Networks","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2989754355","doi":"https://doi.org/10.24963/ijcai.2019/159","mag":"2989754355"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/159","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/159","pdf_url":"https://www.ijcai.org/proceedings/2019/0159.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0159.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085460956","display_name":"Anna L. D. Latour","orcid":"https://orcid.org/0000-0002-5802-8271"},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Anna Louise D. Latour","raw_affiliation_strings":["Leiden University, Leiden, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Leiden University, Leiden, The Netherlands","institution_ids":["https://openalex.org/I121797337"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078729992","display_name":"Behrouz Babaki","orcid":"https://orcid.org/0000-0002-0512-4323"},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Behrouz Babaki","raw_affiliation_strings":["Polytechnique Montr\u00e9al, Montreal, Canada"],"affiliations":[{"raw_affiliation_string":"Polytechnique Montr\u00e9al, Montreal, Canada","institution_ids":["https://openalex.org/I45683168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046889112","display_name":"Siegfried Nijssen","orcid":"https://orcid.org/0000-0003-2678-1266"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Siegfried Nijssen","raw_affiliation_strings":["UCLouvain, Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"UCLouvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085460956"],"corresponding_institution_ids":["https://openalex.org/I121797337"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14670294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1137","last_page":"1145"},"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.9990000128746033,"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.9990000128746033,"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.9984999895095825,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.6588274836540222},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6538052558898926},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6291455626487732},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.592825174331665},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5812872648239136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.563685953617096},{"id":"https://openalex.org/keywords/propagator","display_name":"Propagator","score":0.543030858039856},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.45050859451293945},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.44732731580734253},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.43398919701576233},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.42362987995147705},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.41789472103118896},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.4177926480770111},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35259026288986206},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.348460853099823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3207436203956604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13928920030593872},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13366946578025818}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6588274836540222},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6538052558898926},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6291455626487732},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.592825174331665},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5812872648239136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.563685953617096},{"id":"https://openalex.org/C104416048","wikidata":"https://www.wikidata.org/wiki/Q302518","display_name":"Propagator","level":2,"score":0.543030858039856},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.45050859451293945},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.44732731580734253},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.43398919701576233},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.42362987995147705},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.41789472103118896},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.4177926480770111},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35259026288986206},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.348460853099823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3207436203956604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13928920030593872},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13366946578025818},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.24963/ijcai.2019/159","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/159","pdf_url":"https://www.ijcai.org/proceedings/2019/0159.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:dial.uclouvain.be:boreal:223393","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/223393","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"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/conferenceObject"},{"id":"pmh:oai:openaccess.leidenuniv.nl:1887/85966","is_oa":true,"landing_page_url":"http://hdl.handle.net/1887/85966","pdf_url":null,"source":{"id":"https://openalex.org/S4306400850","display_name":"Leiden Repository (Leiden University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121797337","host_organization_name":"Leiden University","host_organization_lineage":["https://openalex.org/I121797337"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ceur-ws.org/Vol-2491/abstract79.pdf","raw_type":"Article in monograph or in proceedings"},{"id":"pmh:oai:publications.polymtl.ca:44269","is_oa":false,"landing_page_url":"https://www.ijcai.org/proceedings/2019/159","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication de conf\u00e9rence"},{"id":"pmh:oai:scholarlypublications.universiteitleiden.nl:item_2984557","is_oa":true,"landing_page_url":"https://hdl.handle.net/1887/85966","pdf_url":null,"source":{"id":"https://openalex.org/S4306400850","display_name":"Leiden Repository (Leiden University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121797337","host_organization_name":"Leiden University","host_organization_lineage":["https://openalex.org/I121797337"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 31st Benelux Conference on Artificial Intelligence (BNAIC 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019) -- BNAIC/BENELEARN 2019. Proceedings of the Reference AL & ML Conference for Belglium, Netherlands & Luxemburg","raw_type":"Article in monograph or in proceedings"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/159","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/159","pdf_url":"https://www.ijcai.org/proceedings/2019/0159.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G309424589","display_name":null,"funder_award_id":"IVADO","funder_id":"https://openalex.org/F4320326644","funder_display_name":"Canada First Research Excellence Fund"},{"id":"https://openalex.org/G5401686217","display_name":null,"funder_award_id":"(CFREF)","funder_id":"https://openalex.org/F4320326644","funder_display_name":"Canada First Research Excellence Fund"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320326644","display_name":"Canada First Research Excellence Fund","ror":null},{"id":"https://openalex.org/F4320330273","display_name":"Institut de Valorisation des Donn\u00e9es","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2989754355.pdf","grobid_xml":"https://content.openalex.org/works/W2989754355.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W1536596338","https://openalex.org/W1752785500","https://openalex.org/W1824971879","https://openalex.org/W1964821516","https://openalex.org/W1980251859","https://openalex.org/W2010438070","https://openalex.org/W2049606892","https://openalex.org/W2080267935","https://openalex.org/W2111292628","https://openalex.org/W2125315567","https://openalex.org/W2137896695","https://openalex.org/W2148550253","https://openalex.org/W2153074847","https://openalex.org/W2163483175","https://openalex.org/W2402839980","https://openalex.org/W2604440257","https://openalex.org/W2604466026","https://openalex.org/W2605208702","https://openalex.org/W2748112878","https://openalex.org/W2749449796","https://openalex.org/W2788746932","https://openalex.org/W2808410647","https://openalex.org/W3104376605","https://openalex.org/W4232212779"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2141935412","https://openalex.org/W1536604285","https://openalex.org/W96881443","https://openalex.org/W1781240162","https://openalex.org/W2032348095","https://openalex.org/W1519282274","https://openalex.org/W1490262345","https://openalex.org/W2952340783","https://openalex.org/W4298270231"],"abstract_inverted_index":{"A":[0],"number":[1],"of":[2,53,72,98,110],"data":[3,132,148],"mining":[4,133,149],"problems":[5,20,35,145],"on":[6,45],"probabilistic":[7],"networks":[8],"can":[9,125],"be":[10,126],"modeled":[11],"as":[12],"Stochastic":[13],"Constraint":[14,59],"Optimization":[15],"and":[16,56,101,120],"Satisfaction":[17],"Problems,":[18],"i.e.,":[19],"that":[21,90],"involve":[22],"objectives":[23],"or":[24,62],"constraints":[25,44,55],"with":[26,130],"a":[27,80,84],"stochastic":[28],"component.":[29],"Earlier":[30],"methods":[31],"for":[32,83],"solving":[33],"these":[34],"used":[36,127],"Ordered":[37],"Binary":[38],"Decision":[39],"Diagrams":[40],"(OBDDs)":[41],"to":[42,116],"represent":[43],"probability":[46],"distributions,":[47,74],"which":[48],"were":[49],"decomposed":[50],"into":[51],"sets":[52],"smaller":[54],"solved":[57],"by":[58],"Programming":[60,65],"(CP)":[61],"Mixed":[63],"Integer":[64],"(MIP)":[66],"solvers.":[67],"For":[68],"the":[69,96,99,108,147],"specific":[70,134],"case":[71],"monotonic":[73],"we":[75,143],"propose":[76],"an":[77],"alternative":[78],"method:":[79],"new":[81],"propagator":[82,92,124],"global":[85,112],"OBDD-based":[86],"constraint.":[87],"We":[88,105],"show":[89,121],"this":[91,111,123],"is":[93],"(sub-)linear":[94],"in":[95,114,128,137],"size":[97],"OBDD,":[100],"maintains":[102],"domain":[103],"consistency.":[104],"experimentally":[106],"evaluate":[107],"effectiveness":[109],"constraint":[113,135],"comparison":[115],"existing":[117],"decomposition-based":[118],"approaches,":[119],"how":[122],"combination":[129],"another":[131],"present":[136],"CP":[138],"systems.":[139],"As":[140],"test":[141],"cases":[142],"use":[144],"from":[146],"literature.":[150]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}