Approximating cost-based abduction is NP-hard
type: Item
instance of: scholarly article
title: Approximating cost-based abduction is NP-hard
zbMATH Open document ID: 1086.68132
author: Ashraf M. Abdelbar
published in: Artificial Intelligence
publication date: 2006-02-07T00:00:00Z
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5003982
zbMATH Keywords: Explanation
zbMATH Keywords: Complexity
zbMATH Keywords: Uncertainty
zbMATH Keywords: Belief revision
zbMATH Keywords: Diagnosis
MaRDI profile type: Publication
full work available at URL: j.artint.2004.06.001
OpenAlex ID: W2012523515
cites work: An algorithm for finding MAPs for belief networks through cost-based abduction
cites work: Efficient probabilistically checkable proofs and applications to approximations
cites work: Q3979383
cites work: Cost-based abduction and MAP explanation
cites work: The complexity of logic-based abduction
cites work: Q4198056
cites work: Q4708204
cites work: Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
cites work: Q4527015
cites work: A linear constraint satisfaction approach to cost-based abduction
cites work: Polynomial solvability of cost-based abduction
DOI: 10.1016/J.ARTINT.2004.06.001
description: scientific article; zbMATH DE number 5003982