On the evaluation of argumentation formalisms

From MaRDI portal
Publication:1028909

DOI10.1016/j.artint.2007.02.003zbMath1168.68562OpenAlexW2015899729WikidataQ62044311 ScholiaQ62044311MaRDI QIDQ1028909

Leila Amgoud, Martin Caminada

Publication date: 9 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2007.02.003



Related Items

A logic programming framework for possibilistic argumentation: Formalization and logical properties, A two-phase method for extracting explanatory arguments from Bayesian networks, An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies, Preferences in artificial intelligence, Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack, A paraconsistent approach to deal with epistemic inconsistencies in argumentation, Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights, Beyond Maxi-Consistent Argumentation Operators, On rejected arguments and implicit conflicts: the hidden power of argumentation semantics, Normal and strong expansion equivalence for argumentation frameworks, Rethinking specificity in defeasible reasoning and its effect in argument reinstatement, Argumentation for Practical Reasoning: An Axiomatic Approach, Balancing Rationality and Utility in Logic-Based Argumentation with Classical Logic Sentences and Belief Contraction, An argumentation system for defeasible reasoning, Logic-based argumentation with existential rules, Logical limits of abstract argumentation frameworks, Minimal hypotheses: extension-based semantics to argumentation, A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness, A logic of argumentation for specification and verification of abstract argumentation frameworks, Improved answer-set programming encodings for abstract argumentation, A general approach to extension-based semantics in abstract argumentation, Belief revision and computational argumentation: a critical comparison, Integrated preference argumentation and applications in consumer behaviour analyses, Fundamental properties of attack relations in structured argumentation with priorities, Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory, A postulate-driven study of logical argumentation, Semantic-based construction of arguments: an answer set programming approach, Value-based argumentation framework built from prioritized qualitative choice logic, An axiomatic analysis of structured argumentation with priorities, Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger, Generating possible intentions with constrained argumentation systems, Burdens of persuasion and standards of proof in structured argumentation, Base argumentation as an abstraction of deductive argumentation, A probabilistic deontic argumentation framework, Classical logic, argument and dialectic, Instantiating abstract argumentation with classical logic arguments: postulates and properties, Unnamed Item, A QBF-based formalization of abstract argumentation semantics, A neural cognitive model of argumentation with application to legal inference and decision making, Postulates for logic-based argumentation systems, An argumentation-based approach for identifying and dealing with incompatibilities among procedural goals, Corrigendum to: ``A general account of argumentation with preferences, Approximating operators and semantics for abstract dialectical frameworks, Principles Of Talmudic Logic, Revealed preference in argumentation: algorithms and applications, Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets, Backing and Undercutting in Defeasible Logic Programming, Modeling time and valuation in structured argumentation frameworks, A characterization of types of support between structured arguments and their relationship with support in abstract argumentation, Reasoning on the Web with Assumption-Based Argumentation, A general semi-structured formalism for computational argumentation: definition, properties, and examples of application, t-DeLP: an argumentation-based temporal defeasible logic programming framework, Assessing the epistemological relevance of Dung-style argumentation theories, Theory of semi-instantiation in abstract argumentation, What Is a Reasonable Argumentation Semantics?, On the resolution-based family of abstract argumentation semantics and its grounded instance, Modal and Temporal Argumentation Networks, Complete extensions in argumentation coincide with 3-valued stable models in logic programming, Meta-argumentation modelling. I: Methodology and techniques, Logical modes of attack in argumentation networks, A logical account of formal argumentation, Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification, A generalized proof-theoretic approach to logical argumentation based on hypersequents, Assumption-Based Argumentation for Selection and Composition of Services, A Comparative Study of Some Central Notions of ASPIC+ and DeLP, A review of the relations between logical argumentation and reasoning with maximal consistency, EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface, A polynomial-time fragment of epistemic probabilistic argumentation, Normality, non-contamination and logical depth in classical natural deduction, Simple contrapositive assumption-based argumentation. II: Reasoning with preferences, Argumentation in artificial intelligence, A new approach for preference-based argumentation frameworks, Connecting fuzzy logic and argumentation frames via logical attack principles, Opposition Frameworks, Correct Grounded Reasoning with Presumptive Arguments, Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks, On the graded acceptability of arguments in abstract and instantiated argumentation, A general notion of equivalence for abstract argumentation, Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction, Complexity of abstract argumentation under a claim-centric view, Methods for solving reasoning problems in abstract argumentation -- a survey, On the equivalence between logic programming semantics and argumentation semantics, Assumption-based argumentation for extended disjunctive logic programming, Five Weaknesses of ASPIC +, Rich preference-based argumentation frameworks


Uses Software


Cites Work