The carneades model of argument and burden of proof

DOI10.1016/J.ARTINT.2007.04.010zbMath1168.68566OpenAlexW2109409153MaRDI QIDQ1028962

Thomas F. Gordon, Henry Prakken, Walton, Douglas

Publication date: 9 July 2009

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

Full work available at URL: https://pure.rug.nl/ws/files/2796516/GordonPrakkenWalton2007a.pdf

zbMATH Keywords

burden of proofargumentation schemesargument evaluationargument graphsargument structurelegal argumentproof standards

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (19)

The first international competition on computational models of argumentation: results and analysis ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Law and logic: a review from an argumentation perspective ⋮ Practical Normative Reasoning with Defeasible Deontic Logic ⋮ Burdens of persuasion and standards of proof in structured argumentation ⋮ A socio-cognitive model of trust using argumentation theory ⋮ Unnamed Item ⋮ Combining Modes of Reasoning: An Application of Abstract Argumentation ⋮ Logic programming and burden of proof in legal reasoning ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ Arguing about the Trustworthiness of the Information Sources ⋮ Reasoning on the Web with Assumption-Based Argumentation ⋮ A normative framework for argument quality: argumentation schemes with a Bayesian foundation ⋮ Assessing the epistemological relevance of Dung-style argumentation theories ⋮ Still Craving a Porsche ⋮ Realizability of three-valued semantics for abstract dialectical frameworks ⋮ Argumentation in artificial intelligence ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey

Uses Software

• Carneades

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical treatment of defeasible reasoning and its implementation.
• Conditional entailment: bridging two approaches to default reasoning.
• Revised report on the algorithmic language scheme
• An abstract, argumentation-theoretic approach to default reasoning
• Argumentation machines. New frontiers in argument and computation.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Floating conclusions and zombie paths: Two deep difficulties in the ``directly skeptical approach to defeasible inheritance nets
• SCC-recursiveness: a general schema for argumentation semantics
• Dynamic Argument Systems: A Formal Model of Argumentation Processes Based on Situation Calculus
• Argument-based extended logic programming with defeasible priorities
• Coherence and Flexibility in Dialogue Games for Argumentation
• Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
• DefLog: on the Logical Interpretation of Prima Facie Justified Assumptions
• Properties and Complexity of Some Formal Inter-agent Dialogues
• Argumentation Semantics for Defeasible Logic

This page was built for publication: The carneades model of argument and burden of proof