Papers Abstract Argumentation
“Abstract Argumentation” 태그가 달린 논문 131편 · 필터 해제
Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback
We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such …
Abstract ArgumentationChoices and their Provenance: Explaining Stable Solutions of Abstract Argumentation Frameworks
The rule $\mathrm{Defeated}(x) \leftarrow \mathrm{Attacks}(y,x),\, \neg \, \mathrm{Defeated}(y)$, evaluated under the well-founded semantics (WFS), yields a unique 3-valued (skeptical) solution of an abstract argumentati…
Abstract ArgumentationNeuro-Argumentative Learning with Case-Based Reasoning
We introduce Gradual Abstract Argumentation for Case-Based Reasoning (Gradual AA-CBR), a data-driven, neurosymbolic classification model in which the outcome is determined by an argumentation debate structure that is lea…
Abstract ArgumentationMulti-class ClassificationFacets in Argumentation: A Formal Approach to Argument Significance
Argumentation is a central subarea of Artificial Intelligence (AI) for modeling and reasoning about arguments. The semantics of abstract argumentation frameworks (AFs) is given by sets of arguments (extensions) and condi…
Abstract ArgumentationNavigateCombining Abstract Argumentation and Machine Learning for Efficiently Analyzing Low-Level Process Event Streams
Monitoring and analyzing process traces is a critical task for modern companies and organizations. In scenarios where there is a gap between trace events and reference business activities, this entails an interpretation …
Abstract ArgumentationModel OptimizationOn the Boolean Network Theory of Datalog$^\neg$
Datalog$^\neg$ is a central formalism used in a variety of domains ranging from deductive databases and abstract argumentation frameworks to answer set programming. Its model theory is the finite counterpart of the logic…
Abstract ArgumentationDisagree and Commit: Degrees of Argumentation-based Agreements
In cooperative human decision-making, agreements are often not total; a partial degree of agreement is sufficient to commit to a decision and move on, as long as one is somewhat confident that the involved parties are li…
Abstract ArgumentationDecision MakingArgumentation Computation with Large Language Models : A Benchmark Study
In recent years, large language models (LLMs) have made significant advancements in neuro-symbolic computing. However, the combination of LLM with argumentation computation remains an underexplored domain, despite its co…
Abstract ArgumentationAn Extension-Based Argument-Ranking Semantics: Social Rankings in Abstract Argumentation Long Version
In this paper, we introduce a new family of argument-ranking semantics which can be seen as a refinement of the classification of arguments into skeptically accepted, credulously accepted and rejected. To this end we use…
Abstract ArgumentationOn the Structure of Game Provenance and its Applications
Provenance in databases has been thoroughly studied for positive and for recursive queries, then for first-order (FO) queries, i.e., having negation but no recursion. Query evaluation can be understood as a two-player ga…
Abstract ArgumentationNegationAn action language-based formalisation of an abstract argumentation framework
An abstract argumentation framework is a commonly used formalism to provide a static representation of a dialogue. However, the order of enunciation of the arguments in an argumentative dialogue is very important and can…
Abstract ArgumentationAn encoding of argumentation problems using quadratic unconstrained binary optimization
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimi…
Abstract ArgumentationRevisiting Vacuous Reduct Semantics for Abstract Argumentation (Extended Version)
We consider the notion of a vacuous reduct semantics for abstract argumentation frameworks, which, given two abstract argumentation semantics {\sigma} and {\tau}, refines {\sigma} (base condition) by accepting only those…
Abstract ArgumentationRejection in Abstract Argumentation: Harder Than Acceptance?
Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extension…
Abstract ArgumentationCyclic Supports in Recursive Bipolar Argumentation Frameworks: Semantics and LP Mapping
Dung's Abstract Argumentation Framework (AF) has emerged as a key formalism for argumentation in Artificial Intelligence. It has been extended in several directions, including the possibility to express supports, leading…
Abstract ArgumentationPreference-Based Abstract Argumentation for Case-Based Reasoning (with Appendix)
In the pursuit of enhancing the efficacy and flexibility of interpretable, data-driven classification models, this work introduces a novel incorporation of user-defined preferences with Abstract Argumentation and Case-Ba…
Abstract ArgumentationInterpretable Machine LearningOn the Equivalence between Logic Programming and SETAF
A framework with sets of attacking arguments (SETAF) is an extension of the well-known Dung's Abstract Argumentation Frameworks (AAFs) that allows joint attacks on arguments. In this paper, we provide a translation from …
Abstract ArgumentationCounterfactual and Semifactual Explanations in Abstract Argumentation: Formal Foundations, Complexity and Computation
Explainable Artificial Intelligence and Formal Argumentation have received significant attention in recent years. Argumentation-based systems often lack explainability while supporting decision-making processes. Counterf…
Abstract ArgumentationcounterfactualDecision MakingExplainable artificial intelligenceGraph Convolutional Networks and Graph Attention Networks for Approximating Arguments Acceptability -- Technical Report
Various approaches have been proposed for providing efficient computational approaches for abstract argumentation. Among them, neural networks have permitted to solve various decision problems, notably related to argumen…
Abstract ArgumentationGraph AttentionAn Extension-based Approach for Computing and Verifying Preferences in Abstract Argumentation
We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets…
Abstract Argumentation