Sciweavers

SOFTWARE
2002

A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning

13 years 2 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper 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.1
Rolf Haenni
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where SOFTWARE
Authors Rolf Haenni
Comments (0)