A logic-based theory of deductive arguments
From MaRDI portal
Publication:5941137
DOI10.1016/S0004-3702(01)00071-6zbMath0971.68143WikidataQ56551820 ScholiaQ56551820MaRDI QIDQ5941137
Philippe Besnard, Anthony Hunter
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items (81)
Argumentation update in YALLA (yet another logic language for argumentation) ⋮ A logic programming framework for possibilistic argumentation: Formalization and logical properties ⋮ Using arguments for making and explaining decisions ⋮ An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies ⋮ Similarity measures based on compiled arguments ⋮ Combining argumentation and Bayesian nets for breast cancer prognosis ⋮ Probabilistic argumentation ⋮ Normal and strong expansion equivalence for argumentation frameworks ⋮ Rethinking specificity in defeasible reasoning and its effect in argument reinstatement ⋮ Labellings for assumption-based and abstract argumentation ⋮ Complexity Classifications for Logic-Based Argumentation ⋮ Broadening Label-Based Argumentation Semantics with May-Must Scales ⋮ Logic, arguments and inconsistencies: an introduction to the festschrift in honour of Philippe Besnard ⋮ When is argumentation deductive? ⋮ RAFDivider : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks ⋮ An empirical and axiomatic comparison of ranking-based semantics for abstract argumentation ⋮ Merging operators on stratified belief bases equipped with argumentative inference ⋮ Simple contrapositive assumption-based argumentation frameworks ⋮ A general approach to extension-based semantics in abstract argumentation ⋮ Belief revision and computational argumentation: a critical comparison ⋮ Explaining black-box classifiers: properties and functions ⋮ Equilibrium states in numerical argumentation networks ⋮ Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework ⋮ Logical argumentation by dynamic proof systems ⋮ A postulate-driven study of logical argumentation ⋮ An approach to abstract argumentation with recursive attack and support ⋮ Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments ⋮ Audience irrelevance in strategic argumentation games ⋮ Fuzzy labeling semantics for quantitative argumentation ⋮ Presumptive Reasoning in a Paraconsistent Setting ⋮ Stratified belief bases revision with argumentative inference ⋮ Argumentation Framework Based on Evidence Theory ⋮ On restricting the impact of self-attacking arguments in gradual semantics ⋮ A multi attack argumentation framework ⋮ The Logical Handling of Threats, Rewards, Tips, and Warnings ⋮ On the Acceptability of Incompatible Arguments ⋮ 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 ⋮ Probabilistic argumentation systems. A new way to combine logic with probability. ⋮ On bipolarity in argumentation frameworks ⋮ Postulates for logic-based argumentation systems ⋮ From fine-grained properties to broad principles for gradual argumentation: a principled spectrum ⋮ Open-Mindedness of Gradual Argumentation Semantics ⋮ Computational Hermeneutics: An Integrated Approach for the Logical Analysis of Natural-Language Arguments ⋮ Deductive argumentation by enhanced sequent calculi and dynamic derivations ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ Modeling time and valuation in structured argumentation frameworks ⋮ An approach to characterize graded entailment of arguments through a label-based framework ⋮ A characterization of types of support between structured arguments and their relationship with support in abstract argumentation ⋮ A general semi-structured formalism for computational argumentation: definition, properties, and examples of application ⋮ Using argument strength for building dialectical bonsai ⋮ A series of revisions of David Poole's specificity ⋮ A formal account of Socratic-style argumentation ⋮ Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ Evaluation of arguments in weighted bipolar graphs ⋮ On the measure of conflicts: an argumentation-based framework ⋮ Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach ⋮ A Comparative Study of Some Central Notions of ASPIC+ and DeLP ⋮ A review of the relations between logical argumentation and reasoning with maximal consistency ⋮ A polynomial-time fragment of epistemic probabilistic argumentation ⋮ Epistemic graphs for representing and reasoning with positive and negative influences of arguments ⋮ An Algorithm for Generating Arguments in Classical Predicate Logic ⋮ Modelling Argument Accrual in Possibilistic Defeasible Logic Programming ⋮ Evaluation of argument strength in attack graphs: foundations and semantics ⋮ On the evaluation of argumentation formalisms ⋮ Argumentation in artificial intelligence ⋮ On the merging of Dung's argumentation systems ⋮ Handling controversial arguments ⋮ A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions ⋮ Correct Grounded Reasoning with Presumptive Arguments ⋮ On the graded acceptability of arguments in abstract and instantiated argumentation ⋮ Encoding deductive argumentation in quantified Boolean formulae ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Graded labellings for abstract argumentation ⋮ Paraconsistent inference relations induced from inconsistency measures ⋮ Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence ⋮ Policy-based inconsistency management in relational databases ⋮ Rich preference-based argumentation frameworks ⋮ Probabilistic qualification of attack in abstract argumentation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical treatment of defeasible reasoning and its implementation.
- How to reason defeasibly
- Abstract argumentation systems
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On inference from inconsistent premisses
- A skeptical theory of inheritance in nonmonotonic semantic networks
- Argumentative logics: Reasoning with classically inconsistent information
- Merging potentially inconsistent items of structured text
This page was built for publication: A logic-based theory of deductive arguments
