Dynamic MAP Calculations for Abduction
Abstract
We present a dynamic algorithm for MAP calculations. The algorithm is based upon Santos 's technique (Santos 1991b) of transforming minimal-cost-proof problems into linearprogramming problems. The algorithm is dynamic in the sense that it is able to use the results from an earlier, near by, problem to lessen its search time. Results are presented which clearly suggest that this is a powerful technique for dynamic abduction problems.
Cite
Text
Charniak and Jr.. "Dynamic MAP Calculations for Abduction." AAAI Conference on Artificial Intelligence, 1992.Markdown
[Charniak and Jr.. "Dynamic MAP Calculations for Abduction." AAAI Conference on Artificial Intelligence, 1992.](https://mlanthology.org/aaai/1992/charniak1992aaai-dynamic/)BibTeX
@inproceedings{charniak1992aaai-dynamic,
title = {{Dynamic MAP Calculations for Abduction}},
author = {Charniak, Eugene and Jr., Eugene Santos},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1992},
pages = {552-557},
url = {https://mlanthology.org/aaai/1992/charniak1992aaai-dynamic/}
}