Anytime argumentative and abductive reasoning
This article presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm can be interrupted at any time returning the solution found so far. The quality of the approximation increases monotonically when more computational resources are available. The method is based on cost functions and returns lower and upper bounds.
abduction probabilistic argumentation cost-bounded approximation anytime algorithms