Stochastic Constraint Programming with And-Or Branch-and-Bound release_bonaixzrmnhjbpokfidnuhokom

by Behrouz Babaki, Tias Guns, Luc de Raedt

Published in International Joint Conference on Artificial Intelligence by International Joint Conferences on Artificial Intelligence Organization.

2017   p539-545

Abstract

Complex multi-stage decision making problems often involve uncertainty, for example, regarding demand or processing times. Stochastic constraint programming was proposed as a way to formulate and solve such decision problems, involving arbitrary constraints over both decision and random variables. What stochastic constraint programming still lacks is support for the use of factorized probabilistic models that are popular in the graphical model community. We show how a state-of-the-art probabilistic inference engine can be integrated into standard constraint solvers. The resulting approach searches over the And-Or search tree directly, and we investigate tight bounds on the expected utility objective. This significantly improves search efficiency and outperforms scenario-based methods that ground out the possible worlds.
In application/xml+jats format

Archived Files and Locations

application/pdf  181.4 kB
file_ethmzarqufdkjjkll4b2wv5f6y
web.archive.org (webarchive)
www.ijcai.org (web)
Read Archived PDF
Preserved and Accessible
Type  paper-conference
Stage   published
Year   2017
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 64fa5c8f-4108-4889-aaac-590e06a8cbb6
API URL: JSON