The SCC-recursiveness Principle in Fuzzy Argumentation Frameworks
- URL: http://arxiv.org/abs/2006.08880v1
- Date: Tue, 16 Jun 2020 02:33:06 GMT
- Title: The SCC-recursiveness Principle in Fuzzy Argumentation Frameworks
- Authors: Zongshun Wang and Jiachao Wu
- Abstract summary: SCC-recursiveness principle is a property of extensions which relies on the graph-theoretical notion of strongly connected components.
This paper is an exploration of the SCC-recursive theory in fuzzy argumentation frameworks (FAFs), which add numbers as fuzzy degrees to the arguments and attacks.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Dung's abstract argumentation theory plays a guiding role in the field of
formal argumentation. The properties of argumentation semantics have been
deeply explored in the previous literature. The SCC-recursiveness principle is
a property of the extensions which relies on the graph-theoretical notion of
strongly connected components. It provides a general recursive schema for
argumentation semantics, which is an efficient and incremental algorithm for
computing the argumentation semantics. However, in argumentation frameworks
with uncertain arguments and uncertain attack relation, the SCC-recursive
theory is absence. This paper is an exploration of the SCC-recursive theory in
fuzzy argumentation frameworks (FAFs), which add numbers as fuzzy degrees to
the arguments and attacks. In this paper, in order to extend the
SCC-recursiveness principle to FAFs, we first modify the reinstatement
principle and directionality principle to fit the FAFs. Then the
SCC-recursiveness principle in FAFs is formalized by the modified principles.
Additionally, some illustrating examples show that the SCC-recursiveness
principle also provides an efficient and incremental algorithm for simplify the
computation of argumentation semantics in FAFs.
Related papers
- Towards Generalizable and Faithful Logic Reasoning over Natural Language via Resolution Refutation [24.584926992534346]
We propose a novel framework, named Generalizable and Faithful Reasoner (GFaiR), which introduces the paradigm of resolution refutation.
Resolution refutation has the capability to solve all first-order logic reasoning problems by extending reasoning rules and employing the principle of proof by contradiction.
Our system outperforms previous works by achieving state-of-the-art performances in complex scenarios while maintaining performances in simple scenarios.
arXiv Detail & Related papers (2024-04-02T06:28:44Z) - Can LLMs Reason with Rules? Logic Scaffolding for Stress-Testing and Improving LLMs [87.34281749422756]
Large language models (LLMs) have achieved impressive human-like performance across various reasoning tasks.
However, their mastery of underlying inferential rules still falls short of human capabilities.
We propose a logic scaffolding inferential rule generation framework, to construct an inferential rule base, ULogic.
arXiv Detail & Related papers (2024-02-18T03:38:51Z) - A Unifying Framework for Learning Argumentation Semantics [50.69905074548764]
We present a novel framework, which uses an Inductive Logic Programming approach to learn the acceptability semantics for several abstract and structured argumentation frameworks in an interpretable way.
Our framework outperforms existing argumentation solvers, thus opening up new future research directions in the area of formal argumentation and human-machine dialogues.
arXiv Detail & Related papers (2023-10-18T20:18:05Z) - Answering Causal Queries at Layer 3 with DiscoSCMs-Embracing
Heterogeneity [0.0]
This paper advocates for the Distribution-consistency Structural Causal Models (DiscoSCM) framework as a pioneering approach to counterfactual inference.
arXiv Detail & Related papers (2023-09-17T17:01:05Z) - Ranking-based Argumentation Semantics Applied to Logical Argumentation
(full version) [2.9005223064604078]
We investigate the behaviour of ranking-based semantics for structured argumentation.
We show that a wide class of ranking-based semantics gives rise to so-called culpability measures.
arXiv Detail & Related papers (2023-07-31T15:44:33Z) - Rediscovering Argumentation Principles Utilizing Collective Attacks [26.186171927678874]
We extend the principle-based approach to Argumentation Frameworks with Collective Attacks (SETAFs)
Our analysis shows that investigating principles based on decomposing the given SETAF (e.g. directionality or SCC-recursiveness) poses additional challenges in comparison to usual AFs.
arXiv Detail & Related papers (2022-05-06T11:41:23Z) - Causal Inference Principles for Reasoning about Commonsense Causality [93.19149325083968]
Commonsense causality reasoning aims at identifying plausible causes and effects in natural language descriptions that are deemed reasonable by an average person.
Existing work usually relies on deep language models wholeheartedly, and is potentially susceptible to confounding co-occurrences.
Motivated by classical causal principles, we articulate the central question of CCR and draw parallels between human subjects in observational studies and natural languages.
We propose a novel framework, ROCK, to Reason O(A)bout Commonsense K(C)ausality, which utilizes temporal signals as incidental supervision.
arXiv Detail & Related papers (2022-01-31T06:12:39Z) - A Formalisation of Abstract Argumentation in Higher-Order Logic [77.34726150561087]
We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic.
This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools.
arXiv Detail & Related papers (2021-10-18T10:45:59Z) - A Topological Perspective on Causal Inference [10.965065178451104]
We show that substantive assumption-free causal inference is possible only in a meager set of structural causal models.
Our results show that inductive assumptions sufficient to license valid causal inferences are statistically unverifiable in principle.
An additional benefit of our topological approach is that it easily accommodates SCMs with infinitely many variables.
arXiv Detail & Related papers (2021-07-18T23:09:03Z) - Exploring Discourse Structures for Argument Impact Classification [48.909640432326654]
This paper empirically shows that the discourse relations between two arguments along the context path are essential factors for identifying the persuasive power of an argument.
We propose DisCOC to inject and fuse the sentence-level structural information with contextualized features derived from large-scale language models.
arXiv Detail & Related papers (2021-06-02T06:49:19Z) - LRA: an accelerated rough set framework based on local redundancy of
attribute for feature selection [81.19294803707648]
We propose the LRA framework for accelerating rough set algorithms.
It is a general-purpose framework which can be applied to almost all rough set methods significantly.
arXiv Detail & Related papers (2020-10-31T08:50:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.