SCC-recursiveness: a general schema for argumentation semantics
From MaRDI portal
Publication:2457654
DOI10.1016/j.artint.2005.05.006zbMath1132.68765OpenAlexW2112029595WikidataQ57499584 ScholiaQ57499584MaRDI QIDQ2457654
Pietro Baroni, Massimiliano Giacomin, Giovanni Guida
Publication date: 23 October 2007
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2005.05.006
Related Items
Using arguments for making and explaining decisions, Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack, Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility, Normal and strong expansion equivalence for argumentation frameworks, Toward incremental computation of argumentation semantics: a decomposition-based approach, The first international competition on computational models of argumentation: results and analysis, Equivalence in logic-based argumentation, On the Complexity of Probabilistic Abstract Argumentation Frameworks, Minimal hypotheses: extension-based semantics to argumentation, Logic Programming, Argumentation and Human Reasoning, Dynamics of Fuzzy Argumentation Frameworks, A Bayesian approach to forward and inverse abstract argumentation problems, On the impact of configuration on abstract argumentation automated reasoning, Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks, Characteristics of multiple viewpoints in abstract argumentation, Integrated preference argumentation and applications in consumer behaviour analyses, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Fundamental properties of attack relations in structured argumentation with priorities, A postulate-driven study of logical argumentation, Dynamic epistemic logics for abstract argumentation, Characterizing strong equivalence for argumentation frameworks, Topological conditions and solutions for repairing argumentation frameworks, Collective argumentation with topological restrictions, The choice-preferred semantics for relevance-oriented acceptance of admissible sets of arguments, New weak admissibility semantics for abstract argumentation, The burden of persuasion in abstract argumentation, Comparing Argumentation Semantics with Respect to Skepticism, Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks, On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation, Dynamics of argumentation systems: a division-based method, A QBF-based formalization of abstract argumentation semantics, On the input/output behavior of argumentation frameworks, Postulates for logic-based argumentation systems, On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method, Propositional discourse logic, On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics, Verification in incomplete argumentation frameworks, Principles Of Talmudic Logic, Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability, A Dynamic Approach for Combining Abstract Argumentation Semantics, Acceptance in incomplete argumentation frameworks, Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets, Theory of semi-instantiation in abstract argumentation, Skepticism relations for comparing argumentation semantics, Towards fixed-parameter tractable algorithms for abstract argumentation, I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation, Infinite Argumentation Frameworks, Open Problems in Abstract Argumentation, On the resolution-based family of abstract argumentation semantics and its grounded instance, Evaluation of arguments in weighted bipolar graphs, Initial sets in abstract argumentation frameworks, How we designed winning algorithms for abstract argumentation and which insight we attained, Expressing Extension-Based Semantics Based on Stratified Minimal Models, Evaluation of argument strength in attack graphs: foundations and semantics, Partial Semantics of Argumentation, Encoding Argument Graphs in Logic, On the evaluation of argumentation formalisms, Argumentation in artificial intelligence, On principle-based evaluation of extension-based argumentation semantics, Computational properties of argument systems satisfying graph-theoretic constraints, The carneades model of argument and burden of proof, Handling controversial arguments, Ensuring reference independence and cautious monotony in abstract argumentation, A new approach for preference-based argumentation frameworks, Methods for solving reasoning problems in abstract argumentation -- a survey
Uses Software
Cites Work
- Unnamed Item
- A mathematical treatment of defeasible reasoning and its implementation.
- A logic for default reasoning
- How to reason defeasibly
- The logical foundations of goal-regression planning in autonomous agents
- Justification and defeat
- Abstract argumentation systems
- Extending abstract argumentation systems theory
- A reasoning model based on the production of acceptable arguments
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Inferring from inconsistency in preference-based argumentation frameworks
- Floating conclusions and zombie paths: Two deep difficulties in the ``directly skeptical approach to defeasible inheritance nets
- Argument-based extended logic programming with defeasible priorities
- Directly Sceptical Inheritance Cannot Capture the Intersection of Extensions
- Defeasible logic programming: an argumentative approach
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Defeasible reasoning with variable degrees of justification
- Skepticism and floating conclusions
