Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks

DOI10.1093/LOGCOM/EXAG025MaRDI QIDQ7286320zbMATH OpenFDO

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

Publication date 23 June 2026

Published in Journal of Logic and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAG025

Mathematics Subject Classification ID

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

Cites work

• A general account of argumentation with preferences
• Abstract argumentation frameworks with strong and weak constraints
• Acceptance in incomplete argumentation frameworks
• An approach to abstract argumentation with recursive attack and support
• Argumentation in artificial intelligence
• Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations
• Coherence in finite argument systems.
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
• Complexity of nonemptiness in control argumentation frameworks
• Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• Computing ideal sceptical argumentation
• Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
• Constraints and lifting-based (conditional) preferences in abstract argumentation
• Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
• Credulous and skeptical acceptance in incomplete argumentation frameworks
• Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
• Graph theoretical structures in logic programs and default theories
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 7368407 (Why is no real title available?)
• Incremental computation for structured argumentation over dynamic DeLP knowledge bases
• Incremental computation of deterministic extensions for dynamic argumentation frameworks
• Modelling defeasible and prioritized support in bipolar argumentation
• Multiple total stable models are definitely needed to solve unique solution problems
• On efficiently estimating the probability of extensions in abstract argumentation frameworks
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the complexity of probabilistic abstract argumentation frameworks
• On the equivalence between logic programming semantics and argumentation semantics
• On the merging of Dung's argumentation systems
• Possible controllability of control argumentation frameworks
• Probabilistic abstract argumentation frameworks, a possible world view
• Relevance for stability of verification status of a set of arguments in incomplete argumentation frameworks
• Revisiting the notions of extension and acceptance over incomplete abstract argumentation frameworks
• Stability of extensions in incomplete argumentation frameworks
• Structure-based semantics of argumentation frameworks with higher-order attacks and supports
• The complexity of computing the permanent
• Verification in incomplete argumentation frameworks

This page was built for publication: Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks

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