SCC-recursiveness in infinite argumentation (extended version)
Argumentation frameworks (AFs) are a foundational tool in artificial intelligence for modeling structured reasoning and conflict. SCC-recursiveness is a well-known design principle in which the evaluation of arguments is decomposed according to the strongly connected components (SCCs) of the attack graph, proceeding recursively from "higher" to "lower" components. While SCC-recursive semantics such as \cft and \stgt have proven effective for finite AFs, Baumann and Spanring showed the failure of SCC-recursive semantics to generalize reliably to infinite AFs due to issues with well-foundedness. We propose two approaches to extending SCC-recursiveness to the infinite setting. We systematically evaluate these semantics using Baroni and Giacomin's established criteria, showing in particular that directionality fails in general. We then examine these semantics' behavior in finitary frameworks, where we find some of our semantics satisfy directionality. These results advance the theory of infinite argumentation and lay the groundwork for reasoning systems capable of handling unbounded or evolving domains.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On SCC-recursiveness in Quantitative Argumentation
Abstract argumentation is a reasoning model for evaluating arguments based on various semantics. SCC-recursiveness is a sophisticated property of semantics that provides a general schema for characterizing semantics thro…
Abstract ArgumentationComplexity in finitary argumentation (extended version)
Abstract argumentation frameworks (AFs) provide a formal setting to analyze many forms of reasoning with conflicting information. While the expressiveness of general infinite AFs make them a tempting tool for modeling ma…
Rediscovering Argumentation Principles Utilizing Collective Attacks
Argumentation Frameworks (AFs) are a key formalism in AI research. Their semantics have been investigated in terms of principles, which define characteristic properties in order to deliver guidance for analysing establis…
Possible Controllability of Control Argumentation Frameworks -- Extended Version
The recent Control Argumentation Framework (CAF) is a generalization of Dung's Argumentation Framework which handles argumentation dynamics under uncertainty; especially it can be used to model the behavior of an agent w…
What is the plausibility of probability?(revised 2003, 2015)
We present and examine a result related to uncertainty reasoning, namely that a certain plausibility space of Cox's type can be uniquely embedded in a minimal ordered field. This, although a purely mathematical result, c…