On acceptance conditions in abstract argumentation frameworks

DOI10.1016/J.INS.2022.12.116MaRDI QIDQ6494661zbMATH OpenFDO

Authors Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Irina Trubitsyna

Publication date 30 April 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2022.12.116

zbMATH Keywords

formal argumentationacceptance conditionspartial stable model semantics

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 1158762 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 6747882 (Why is no real title available?)
• A novel weighted defence and its relaxation in abstract argumentation
• A three-valued semantics for querying and repairing inconsistent databases
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• Case-based strategies for argumentation dialogues in agent societies
• Defeasible logic programming: an argumentative approach
• Extrema predicates in deductive databases
• Greedy algorithms in Datalog
• Higher-order interactions (bipolar or not) in abstract argumentation: a state of the art
• Incremental computation for structured argumentation over dynamic DeLP knowledge bases
• Monotonic aggregation in deductive databases
• Multi-shot ASP solving with clingo
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the correctness of unfold/fold transformation of normal and extended logic programs
• On the equivalence between logic programming semantics and argumentation semantics
• On the semantics of abstract argumentation frameworks: a logic programming approach
• Optimization of bound disjunctive queries with constraints
• Proximity semantics for topic-based abstract argumentation
• Solving Advanced Argumentation Problems with Answer Set Programming
• The expressive powers of stable models for bound and unbound DATALOG queries
• Unfolding partiality and disjunctions in stable model semantics
• Using arguments for making and explaining decisions
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Well-founded and stable semantics of logic programs with aggregates
• Well-foundedness in weighted argumentation frameworks

Cited in

(3)

• Simple contrapositive assumption-based argumentation frameworks with preferences: partial orders and collective attacks
• Abstract argumentation frameworks with strong and weak constraints
• Constraints and lifting-based (conditional) preferences in abstract argumentation

This page was built for publication: On acceptance conditions in abstract argumentation frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494661)