An efficient LP-based admissible heuristic for cost-based abduction

DOI10.1080/09528130500283642zbMath1101.68877OpenAlexW2041724781MaRDI QIDQ5704534

Ashraf M. Abdelbar, Mohamed Hefny

Publication date: 15 November 2005

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130500283642

zbMATH Keywords

belief revisionreasoning under uncertaintyhypothetical reasoning

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (2)

Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference ⋮ Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction

Cites Work

• A linear constraint satisfaction approach to cost-based abduction
• Cost-based abduction and MAP explanation
• Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions

This page was built for publication: An efficient LP-based admissible heuristic for cost-based abduction