Abstract
Cost-based abduction (CBA) is an important problem in reasoning under uncertainty. Finding Least-Cost Proofs (LCPs) for CBA systems is known to be NP-hard and has been a subject of considerable research over the past decade. In this paper, we show that approximating LCPs, within a fixed ratio bound of the optimal solution, is NP-hard, even for quite restricted subclasses of CBAs. We also consider a related problem concerned with the fine-tuning of a CBA's cost function.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
