On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
From MaRDI portal
Publication:5140009
DOI10.1017/S1471068420000253zbMath1468.68211arXiv2008.02550OpenAlexW3087868991MaRDI QIDQ5140009
Francesco Parisi, Gianvincenzo Alfano, Irina Trubitsyna, Sergio Greco
Publication date: 13 December 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.02550
Related Items (3)
Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ Probabilistic causal bipolar abstract argumentation: an approach based on credal networks ⋮ Incremental computation for structured argumentation over dynamic DeLP knowledge bases
Uses Software
Cites Work
- Argument graphs and assumption-based argumentation
- AFRA: argumentation framework with recursive attacks
- A new approach for preference-based argumentation frameworks
- Reasoning about preferences in argumentation frameworks
- An approach to abstract argumentation with recursive attack and support
- Argumentation in artificial intelligence
- The expressive powers of stable models for bound and unbound DATALOG queries
- An abstract, argumentation-theoretic approach to default reasoning
- Argumentation frameworks with recursive attacks and evidence-based supports
- A novel weighted defence and its relaxation in abstract argumentation
- Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Modelling defeasible and prioritized support in bipolar argumentation
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- On the equivalence between logic programming semantics and argumentation semantics
- Bipolarity in argumentation graphs: towards a better understanding
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- Improved answer-set programming encodings for abstract argumentation
- Representing Argumentation Frameworks in Answer Set Programming
- On the Equivalence between Assumption-Based Argumentation and Logic Programming
- On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs
- Structure-Based Semantics of Argumentation Frameworks with Higher-Order Attacks and Supports
- Unfolding partiality and disjunctions in stable model semantics
This page was built for publication: On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
