A reasoning model based on the production of acceptable arguments
From MaRDI portal
Publication:1601892
DOI10.1023/A:1014490210693zbMath1002.68172OpenAlexW2171853123MaRDI QIDQ1601892
Leila Amgoud, Claudette Cayrol
Publication date: 27 June 2002
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014490210693
Related Items (79)
Using arguments for making and explaining decisions ⋮ Reasoning about preferences in argumentation frameworks ⋮ Preferences in artificial intelligence ⋮ Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack ⋮ Probabilistic argumentation ⋮ Argumentation for Practical Reasoning: An Axiomatic Approach ⋮ Weighted argumentation for analysis of discussions in Twitter ⋮ Inference procedures and engine for probabilistic argumentation ⋮ Admissibility in Probabilistic Argumentation ⋮ Equivalence in logic-based argumentation ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Minimal hypotheses: extension-based semantics to argumentation ⋮ AFRA: argumentation framework with recursive attacks ⋮ Syntactic reasoning with conditional probabilities in deductive argumentation ⋮ Integrated preference argumentation and applications in consumer behaviour analyses ⋮ Fundamental properties of attack relations in structured argumentation with priorities ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ Value-based argumentation framework built from prioritized qualitative choice logic ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ On incompleteness in abstract argumentation: complexity and expressiveness ⋮ Extension-based semantics for incomplete argumentation frameworks ⋮ Intrinsic argument strength in structured argumentation: a principled approach ⋮ How Dirty Is Your Relational Database? An Axiomatic Approach ⋮ The Logical Handling of Threats, Rewards, Tips, and Warnings ⋮ On the Acceptability of Incompatible Arguments ⋮ Dialectical Proof Theories for the Credulous Prudent Preferred Semantics of Argumentation ⋮ Classical logic, argument and dialectic ⋮ Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations ⋮ Instantiating abstract argumentation with classical logic arguments: postulates and properties ⋮ Algorithms for generating arguments and counterarguments in propositional logic ⋮ On bipolarity in argumentation frameworks ⋮ Postulates for logic-based argumentation systems ⋮ Preferences and Assumption-Based Argumentation for Conflict-Free Normative Agents ⋮ Defeasible Argumentation Support for an Extended BDI Architecture ⋮ Where logic and agents meet ⋮ SCC-recursiveness: a general schema for argumentation semantics ⋮ On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics ⋮ Algorithms for decision problems in argument systems under preferred semantics ⋮ Revealed preference in argumentation: algorithms and applications ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ Two Roles of Preferences in Argumentation Frameworks ⋮ 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 ⋮ t-DeLP: an argumentation-based temporal defeasible logic programming framework ⋮ Argumentation frameworks as constraint satisfaction problems ⋮ A Metamathematical Model for A/O Opposition in Scientific Inquiry ⋮ Assessing the epistemological relevance of Dung-style argumentation theories ⋮ Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ On the resolution-based family of abstract argumentation semantics and its grounded instance ⋮ Meta-argumentation modelling. I: Methodology and techniques ⋮ Evaluation of arguments in weighted bipolar graphs ⋮ Towards Context Sensitive Defeasible Rules ⋮ Unnamed Item ⋮ Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach ⋮ Valid attacks in argumentation frameworks with recursive attacks ⋮ An argumentation framework for merging conflicting knowledge bases ⋮ Practical reasoning using values: an argumentative approach based on a hierarchy of values ⋮ A formal framework for deliberated judgment ⋮ On the Gradual Acceptability of Arguments in Bipolar Weighted Argumentation Frameworks with Degrees of Trust ⋮ Extracting the Core of a Persuasion Dialog to Evaluate Its Quality ⋮ An Algorithm for Generating Arguments in Classical Predicate Logic ⋮ Evaluation of argument strength in attack graphs: foundations and semantics ⋮ Audiences in argumentation frameworks ⋮ 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 ⋮ On the merging of Dung's argumentation systems ⋮ A new approach for preference-based argumentation frameworks ⋮ Understanding the Abstract Dialectical Framework ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ On the graded acceptability of arguments in abstract and instantiated argumentation ⋮ A formal analysis of interest-based negotiation ⋮ Encoding deductive argumentation in quantified Boolean formulae ⋮ Bipolarity in argumentation graphs: towards a better understanding ⋮ Policy-based inconsistency management in relational databases ⋮ Rich preference-based argumentation frameworks ⋮ Probabilistic qualification of attack in abstract argumentation
This page was built for publication: A reasoning model based on the production of acceptable arguments