An algorithm for rinding MAPs for belief networks through cost-based abduction

Artificial Intelligence 104 (1-2):331-338 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(98)00074-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,774

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Polynomial solvability of cost-based abduction.Eugene Santos & Eugene S. Santos - 1996 - Artificial Intelligence 86 (1):157-170.
Cost-based abduction and MAP explanation.Eugene Charniak & Solomon Eyal Shimony - 1994 - Artificial Intelligence 66 (2):345-374.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
A linear constraint satisfaction approach to cost-based abduction.Eugene Santos - 1994 - Artificial Intelligence 65 (1):1-27.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
The complexity of approximating MAPs for belief networks with bounded probabilities.Ashraf M. Abdelbar, Stephen T. Hedetniemi & Sandra M. Hedetniemi - 2000 - Artificial Intelligence 124 (2):283-288.
Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.
Abduction to plausible causes: an event-based model of belief update.Craig Boutilier - 1996 - Artificial Intelligence 83 (1):143-166.
Large-Scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference.Naoya Inoue & Kentaro Inui - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 281--293.
Probabilistic Horn abduction and Bayesian networks.David Poole - 1993 - Artificial Intelligence 64 (1):81-129.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,450,151)

6 months
1 (#1,912,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.

Add more citations

References found in this work

Interpretation as abduction.Jerry R. Hobbs, Mark E. Stickel, Douglas E. Appelt & Paul Martin - 1993 - Artificial Intelligence 63 (1-2):69-142.
Fusion, propagation, and structuring in belief networks.Judea Pearl - 1986 - Artificial Intelligence 29 (3):241-288.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
Cost-based abduction and MAP explanation.Eugene Charniak & Solomon Eyal Shimony - 1994 - Artificial Intelligence 66 (2):345-374.

View all 7 references / Add more references