Monotonicity and Noise-Tolerance in Case-Based Reasoning with Abstract Argumentation (with Appendix)

Recently, abstract argumentation-based models of case-based reasoning (AAtext - 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 AAtext - CBR as a reasoning system remain largely unexplored. In this paper, we focus on analysing the non-monotonicity properties of a regular version of AAtext - CBR (that we call AAtext - CBRsucceq). Specifically, we prove that AAtext - CBRsucceq is not cautiously monotonic, a property frequently considered desirable in the literature. We then define a variation of AAtext - CBRsucceq which is cautiously monotonic. Further, we prove that such variation is equivalent to using AAtext - CBRsucceq 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 AAtext - CBRsucceq is cumulative, rationally monotonic, and empowers a principled treatment of noise in "incoherent" casebases. Finally, we illustrate AAtext - CBR and cautious monotonicity questions on a case study on the U.S. Trade Secrets domain, a legal casebase.