메뉴 건너뛰기




Volumn 68, Issue 2, 1994, Pages 399-410

Finding MAPs for belief networks is NP-hard

Author keywords

Abductive reasoning; Complexity; Diagnosis; Explanation; Probabilistic reasoning

Indexed keywords

COMPUTATIONAL COMPLEXITY; DIAGNOSIS; GRAPH THEORY; MATHEMATICAL MODELS; MODIFICATION; PROBABILITY; TOPOLOGY;

EID: 0028483915     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)90072-8     Document Type: Article
Times cited : (257)

References (15)
  • 2
    • 0025401005 scopus 로고
    • The computational complexity of probabilistic inference using Bayesian belief networks
    • (1990) Artif. Intell. , vol.42 , Issue.2-3 – , pp. 393-405
    • Cooper1
  • 3
    • 0027560587 scopus 로고
    • Approximating probabilistic inference in Bayesian belief networks is NP-hard
    • (1993) Artif. Intell. , vol.60 , Issue.1 , pp. 141-153
    • Dagum1    Luby2
  • 6
  • 12
    • 0028257241 scopus 로고
    • A linear constraint satisfaction approach to cost-based abduction
    • (1994) Artif. Intell. , vol.65 , Issue.1 , pp. 1-27
    • Santos1
  • 13
    • 0022818911 scopus 로고
    • Evaluating influence diagrams
    • (1986) Oper. Res. , vol.34 , Issue.6 , pp. 871-882
    • Shachter1
  • 14
    • 26144456861 scopus 로고
    • A probabilistic framework for explanation
    • Tech. Report CS-91-57, Brown University, Providence, RI
    • (1991) Ph.D. Thesis
    • Shimony1
  • 15
    • 84911309039 scopus 로고    scopus 로고
    • S.E. Shimony, Finding MAP for Markov networks is NP-hard, Tech. Report, Mathematics and Computer Science Department, Ben-Gurion University, Beer-Sheva, Israel (in preparation).


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.