Abstract
Cost-based abduction (CBA) is an important problem in reasoning under uncertainty, and can be considered a generalization of belief revision. CBA is known to be NP-hard and has been a subject of considerable research over the past decade. In this paper, we investigate the fitness landscape for CBA, by looking at fitness–distance correlation for local minima and at landscape ruggedness. Our results indicate that stochastic local search techniques would be promising on this problem. We go on to present an iterated local search algorithm based on hill-climbing, tabu search, and simulated annealing. We compare the performance of our algorithm to simulated annealing, and to Santos' integer linear programming method for CBA.
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 callMore From: Journal of Experimental & Theoretical Artificial Intelligence
Disclaimer: 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.
