Polynomial solvability of cost-based abduction

DOI10.1016/0004-3702(96)00016-1zbMath1506.68128OpenAlexW2075895304MaRDI QIDQ2676566

Eugene S. Santos, Eugene jun. Santos

Publication date: 27 September 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(96)00016-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions ⋮ An algorithm for finding MAPs for belief networks through cost-based abduction ⋮ Analysis of notions of diagnosis ⋮ Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction ⋮ Approximating cost-based abduction is NP-hard

Cites Work

• A linear constraint satisfaction approach to cost-based abduction
• Cost-based abduction and MAP explanation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial solvability of cost-based abduction