Abstract
This paper presents a new approximation methodfor computingarguments or explanations in the context of logic-basedargumentativeor abductive reasoning. The algorithm can be interrupted at anytime returning the solution foundso far. The quality of the approximationincreases monotonically when more computational resources areavailable. The methodis basedon cost functions andreturns lower andupper bounds.1.
Cite
CITATION STYLE
Haenni, R. (2002). A query-driven anytime algorithm for argumentative and abductive reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2311, pp. 114–127). Springer Verlag. https://doi.org/10.1007/3-540-46019-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
