{"type":"ScholarlyArticle","title":"A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT","authors":[{"name":"Knot Pipatsrisawat","slug":"knot-pipatsrisawat","given":"Knot","family":"Pipatsrisawat","affiliation":""},{"name":"Adnan Darwiche","slug":"adnan-darwiche","given":"Adnan","family":"Darwiche","affiliation":""}],"abstract":"We present a new algorithm for computing upper bounds for an optimization version of the EMAJSAT problem called functional E-MAJSAT. The algorithm utilizes the compilation language d- DNNF which underlies several state-of-the-art algorithms for solving related problems. This bound computation can be used in a branch-and-bound solver for solving functional E-MAJSAT. We then present a technique for pruning values from the branch-and-bound search tree based on the information available after each bound computation. We evaluated the proposed techniques in a MAP solver and a probabilistic conformant planner. In both cases, our experiments showed that the new techniques improved the efficiency of state-of-the-art solvers by orders of magnitude.Knot Pipatsrisawat, Adnan Darwiche","doi":null,"url":"https://ijcai.org/proceedings/2009/104","pdf":"https://ijcai.org/proceedings/2009/0104.pdf","markdown":"https://ijcai.org/proceedings/2009/104.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/104","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":104,"pages":{"first":590,"last":594},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}