Most Likely Instantiations

Adnan DarwicheCambridge 2009 · DOI · OpenAlex

Abstract

We consider in this chapter the problem of finding variable instantiations that have maximal probability under some given evidence. We present two classes of exact algorithms for this problem, one based on variable elimination and the other based on systematic search. We also present approximate algorithms based on local search.
BibTeX
@inproceedings{darwiche2009most,
  author = {Adnan Darwiche},
  title = {{Most Likely Instantiations}},
  booktitle = {Cambridge},
  year = {2009},
  doi = {10.1017/cbo9780511811357.011},
}

Loading related content...

Figure