Online event. November 3-12, 2021.
Copyright © 2021 International Joint Conferences on Artificial Intelligence Organization
Recently, abstract argumentation-based models of case-based reasoning (AA-CBR in short) have been proposed, originally inspired by the legal domain, but also applicable as classifiers in different scenarios. However, the formal properties of AA-CBR as a reasoning system remain largely unexplored. In this paper, we focus on analysing the non-monotonicity properties of a regular version of AA-CBR (that we call AA-CBR_>). Specifically, we prove that AA-CBR_> is not cautiously monotonic, a property frequently considered desirable in the literature. We then define a variation of AA-CBR_> which is cautiously monotonic. Further, we prove that such variation is equivalent to using AA-CBR_> with a restricted casebase consisting of all "surprising" and "sufficient" cases in the original casebase. As a by-product, we prove that this variation of AA-CBR_> is cumulative, rationally monotonic, and empowers a principled treatment of noise in "incoherent" casebases. Finally, we illustrate AA-CBR and cautious monotonicity questions on a case study on the U.S. Trade Secrets domain, a legal casebase.