{"id":"https://openalex.org/W2740498871","doi":"https://doi.org/10.24963/ijcai.2017/76","title":"Stochastic Constraint Programming with And-Or Branch-and-Bound","display_name":"Stochastic Constraint Programming with And-Or Branch-and-Bound","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2740498871","doi":"https://doi.org/10.24963/ijcai.2017/76","mag":"2740498871"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/76","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/76","pdf_url":"https://www.ijcai.org/proceedings/2017/0076.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth 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/2017/0076.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078729992","display_name":"Behrouz Babaki","orcid":"https://orcid.org/0000-0002-0512-4323"},"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":"Behrouz Babaki","raw_affiliation_strings":["Department of Computer Science, KU Leuven","Department of Computer Science, KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041230402","display_name":"Tias Guns","orcid":"https://orcid.org/0000-0002-2156-2155"},"institutions":[{"id":"https://openalex.org/I13469542","display_name":"Vrije Universiteit Brussel","ror":"https://ror.org/006e5kg04","country_code":"BE","type":"education","lineage":["https://openalex.org/I13469542"]},{"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":"Tias Guns","raw_affiliation_strings":["Department of Business Technology and Operations, Vrije Universiteit Brussel","Department of Computer Science, KU Leuven","Department of Computer Science, KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Business Technology and Operations, Vrije Universiteit Brussel","institution_ids":["https://openalex.org/I13469542"]},{"raw_affiliation_string":"Department of Computer Science, KU Leuven","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"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","Department of Computer Science, KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9966,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82444255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"539","last_page":"545"},"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.9995999932289124,"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.9995999932289124,"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.9983000159263611,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9932000041007996,"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/constraint-programming","display_name":"Constraint programming","score":0.78106689453125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.669714629650116},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6599849462509155},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.6363947987556458},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6339606046676636},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5622837543487549},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.511319637298584},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.48758214712142944},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4563470780849457},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4558786451816559},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4187145531177521},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.4121400713920593},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3949222266674042},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2640235424041748},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23277834057807922},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2272282838821411},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22275397181510925}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.78106689453125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.669714629650116},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6599849462509155},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.6363947987556458},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6339606046676636},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5622837543487549},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.511319637298584},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.48758214712142944},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4563470780849457},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4558786451816559},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4187145531177521},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.4121400713920593},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3949222266674042},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2640235424041748},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23277834057807922},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2272282838821411},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22275397181510925},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.24963/ijcai.2017/76","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/76","pdf_url":"https://www.ijcai.org/proceedings/2017/0076.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/592070","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/592070","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"IJCAI, Melbourne, 19-25 August 2017","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:113480","is_oa":false,"landing_page_url":"https://biblio.vub.ac.be/vubir/stochastic-constraint-programming-with-and-or-branchandbound(2aefaba6-ca43-4954-8385-34da12121861).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"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":"article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/76","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/76","pdf_url":"https://www.ijcai.org/proceedings/2017/0076.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2740498871.pdf","grobid_xml":"https://content.openalex.org/works/W2740498871.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W36707155","https://openalex.org/W51621564","https://openalex.org/W1487055506","https://openalex.org/W1511986666","https://openalex.org/W1514055328","https://openalex.org/W1548246675","https://openalex.org/W1580809199","https://openalex.org/W1590986876","https://openalex.org/W1752785500","https://openalex.org/W1885487684","https://openalex.org/W2062818807","https://openalex.org/W2109325056","https://openalex.org/W2123773628","https://openalex.org/W2143313502","https://openalex.org/W2153074847","https://openalex.org/W2159080219","https://openalex.org/W3122281388","https://openalex.org/W4298304770"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1531664660","https://openalex.org/W1496100162","https://openalex.org/W1980681296","https://openalex.org/W1514298554","https://openalex.org/W1597500234","https://openalex.org/W4303044088","https://openalex.org/W1570648367","https://openalex.org/W2097523953"],"abstract_inverted_index":{"Complex":[0],"multi-stage":[1],"decision":[2,28,35],"making":[3],"problems":[4],"often":[5],"involve":[6],"uncertainty,":[7],"for":[8,47],"example,":[9],"regarding":[10],"demand":[11],"or":[12],"processing":[13],"times.":[14],"Stochastic":[15],"constraint":[16,41,75],"programming":[17,42],"was":[18],"proposed":[19],"as":[20],"a":[21,65],"way":[22],"to":[23],"formulate":[24],"and":[25,36,87,102],"solve":[26],"such":[27],"problems,":[29],"involving":[30],"arbitrary":[31],"constraints":[32],"over":[33,81],"both":[34],"random":[37],"variables.":[38],"What":[39],"stochastic":[40],"still":[43],"lacks":[44],"is":[45],"support":[46],"the":[48,58,82,93,109],"use":[49],"of":[50],"factorized":[51],"probabilistic":[52,67],"models":[53],"that":[54,106],"are":[55],"popular":[56],"in":[57],"graphical":[59],"model":[60],"community.":[61],"We":[62],"show":[63],"how":[64],"state-of-the-art":[66],"inference":[68],"engine":[69],"can":[70],"be":[71],"integrated":[72],"into":[73],"standard":[74],"solvers.":[76],"The":[77],"resulting":[78],"approach":[79],"searches":[80],"And-Or":[83],"search":[84,100],"tree":[85],"directly,":[86],"we":[88],"investigate":[89],"tight":[90],"bounds":[91],"on":[92],"expected":[94],"utility":[95],"objective.":[96],"This":[97],"significantly":[98],"improves":[99],"efficiency":[101],"outperforms":[103],"scenario-based":[104],"methods":[105],"ground":[107],"out":[108],"possible":[110],"worlds.":[111]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}