Pollock s undercutting defeat
|
|
- Kimberly Willis
- 6 years ago
- Views:
Transcription
1 Argumentation in Artificial Intelligence, With Alications in the Law Course at the Institute of Logic and Cognition, Sun Yat-Sen University Ib Abstract Argumentation and Argument Structure Bart Verheij CodeX, Stanford University Artificial Intelligence, University of Groningen IA Introduction Toics: Argumentation in Artificial Intelligence Historical Background Goals: Get an overview of the course and its subject matter Acquire insight about the historical background Literature: Van Eemeren et al. (in rearation). Sections IB Abstract Argumentation, Argument Structure Pollock s undercutting defeat Toics: Abstract Argumentation Argument Structure q q Goals: Acquire knowledge of abstract argumentation and its semantics Acquire insight into the relation between argument structure and abstract argumentation r Literature: Van Eemeren et al. (in rearation). Sections q is warranted by the argument from q is not warranted by the argument from A hilosohical uzzle (Pollock) Pollock s research question q q r r ( q) is a rima facie reason for q q is a rima facie reason for r r is an excetion that undercuts the suort of q by How is argumentative warrant determined by the structure of the available arguments and counterarguments? He roduced a series of roosals, amongst other things driven by hilosohical uzzles. Is q warranted by the argument from? 1
2 ung 1995 The attack relation as a directed grah (ung) On the accetability of arguments and its fundamental role in non-monotonic reasoning, logic rogramming and n-erson games Artificial Intelligence journal Pollock s research question, revisited Pollock s research question, revisited How is argumentative warrant determined by the structure of the available arguments and counterarguments? How is argumentative warrant determined by the structure of the available arguments and counterarguments? of the attack relation between arguments? - Mathematically clean - More abstract, so simler structure ung s basic rincile of argument accetability ung s basic rincile of argument accetability The one who has the last word laughs best. The one who has the last word laughs best. 2
3 ung s basic rincile of argument accetability ung s basic rincile of argument accetability The one who has the last word laughs best. The one who has the last word laughs best. Admissible sets Admissible sets ζ α β δ η A set of arguments A is admissible if 1. it is conflict-free: There are no arguments α and β in A, such that α attacks β. γ ε 2. the arguments in A are accetable with resect to A: For all arguments α in A, such that there is an argument β that attacks α, there is an argument γ in A that attacks β. Admissible, e.g.: {α, γ}, {α, γ, δ, ζ, η} Not admissible, e.g.: {α, β}, {γ} ung s referred and stable extensions Admissible sets An admissible set of arguments is a referred extension if it is an admissible set that is maximal with resect to set inclusion. A conflict-free set of arguments is a stable extension if all arguments that are not in the set are attacked by an argument in the set. ζ α β γ δ η ε Preferred and stable extension: {α, γ, δ, ζ, η} 3
4 Even-length attack cycles Odd-length attack cycles α β α 1 α 3 α 2 Preferred extensions: (the emty set) Preferred and stable extensions: {α}, {β} Stable extensions: none Basic roerties of ung s extensions A stable extension is a referred extension, but not the other way around. An attack relation always has a referred extension. Not all attack relations have a stable extension. An attack relation can have more than one referred/stable extension. A well-founded attack relation has a unique stable extension. ung s grounded and comlete extensions A set of arguments is a comlete extension if it is an admissible set that contains all arguments of which all attackers are attacked by the set. A set of arguments is a (the) grounded extension if it is a minimal comlete extension. ung s four semantics Labelings Preferred Stable Comlete Grounded 4
5 Labelings Stable labeling: Stages α η An argument α is labelled efeated if and only if There is an argument β that attacks α and that is labelled Justified. β δ ζ γ ε Stages, e.g.: β (γ), α (β) γ, α (β) γ δ (ε) ζ η Non-stages, e.g.:β γ, β (δ ε) Labelings 1. Using labelings instead of sets simlifies the formal analysis and increases its transarency. 2. Labelings allow a new natural idea of maximal interretation: maximize the set of labeled nodes. Stage extensions Semi-stable semantics A set of arguments is a semi-stable extension if it is an admissible set, for which the union of the set with the set of arguments attacked by it is maximal. Notion introduced by Verheij (1996) Term coined by Caminada (2006) 3. Some referred extensions are better than others. Semi-stable extensions Verheij (1996). Two Aroaches to ialectical Argumentation: Admissible Sets and Argumentation Stages. Proerties 1. Stable extensions are semi-stable. 2. Semi-stable extensions are referred. 3. Preferred extensions are not always semi-stable. 4. Semi-stable extensions are not always stable. Preferred extensions always exist, but stable extensions do not. o all attack grahs have a semi-stable extension? Answered negatively by Verheij (2000, 2003) Proerties 1. There exist attack grahs without a semi-stable extension. 2. Finite attack grahs always have a semi-stable extension. 3. An attack grah with a finite number of referred extensions has a semi-stable extension. 4. An attack grah with a stable extension has a semi-stable extension. 5. If an attack grah has no semi-stable extension, then there is an infinite sequence of referred extensions with strictly increasing ranges. 5
6 Abstract argumentation semantics (1995) Stable extension Abstract argumentation semantics (1996) Stable extension Semi-stable extension Stage extension Grounded extension Preferred extension Grounded extension Preferred extension Comlete extension ung 1995 Comlete extension ung 1995 Verheij 1996 Pollock s research question, revisited How is argumentative warrant determined by the structure of the available arguments and counterarguments? of the attack relation between arguments? What haens if we add structure? Not just attack, also suort - Mathematically clean - More abstract, so simler structure - Philosohically still comlex Secificity Conclusive force 1. Conflict by inconsistency 2. efeat by secificity 1.Conflict by inconsistency 2. efeat by conclusive force Simari & Loui 1992 Vreeswijk
7 Combining suort and attack Aroach 1: ung s abstract arguments have internal structure Combining suort and attack Aroach 2: Arguments can attack or suort Abstract version: ASPIC+ Prakken 2010 Nute 1994, eflog Verheij 2003 Arguing about suort and attack eflog Verheij 2003 ArguMed software Verheij 2003 eflog A conditional ~> that validates Modus onens A connective that exresses negation as defeat (dialectical negation) ro: ϕ ~> ψ con: ϕ ~> ψ warrant: ϕ ~> (ψ ~> χ) undercutter: ϕ ~> (ψ ~> χ) rebutter: ((ϕ ~> ψ) ϕ) ~> (χ ~> not-ψ) or ψ ~> (χ ~> not-ψ) eflog Attack I (no warrants) J conflict-free attacked by J naturalized American A defeasible theory is divided in a justified art J and a defeated art. 7
8 Attack I (no warrants) Attack I (no warrants) C ~> C C R naturalized American R ~> x( ~> C) R naturalized American Attack I (no warrants) Attack I (no warrants) ~> C C ~> C C R ~> x( ~> C) R naturalized American R ~> x( ~> C) R naturalized American = { ~> C, R ~> x( ~> C), R, } = { ~> C, R ~> x( ~> C), R, } eflog Undercutting & rebutting 's closure under Modus onens J xϕ ϕ Some assumtions are attacked Some artitions are stable Undercutting-1: Attacking the connection between a reason and its conclusion Undercutting-2: Attacking an assumtion of an argument Rebutting: Attacking by giving a reason against a conclusion 8
9 Undercutting-1 in eflog Attacking a conditional assumtion Undercutting-2 in eflog Passim : ~> q e ~> x( ~> q) e J J J q e Rebutting in eflog Side-ste: No stable extension in eflog Kevin testifies that he saw Peter assaulting Jack Rebutting in eflog Modelled using undercutting-1 Kevin testifies that he saw Peter assaulting Jack 9
10 Wait a minute: we didn't get the oosite conclusion! not Kevin testifies that he saw Peter assaulting Jack Kevin testifies that he saw Peter assaulting Jack [Negation-as-contradiction vs. negation-as-defeat] Attack II (with warrants) in Bermuda naturalized American A man born will generally be a British subject Harry has become a naturalized American A man born will generally be a British subject Rebutting in eflog Also the weighing of reasons (cf. Reason-Based Logic) can be modeled using undercutting-1. Miriam testifies that s Kevin testifies that he saw Peter assaulting Jack 10
11 Abstract argumentation semantics (1996) not Stable extension Miriam testifies that s did not assault Jack Kevin testifies that he saw Peter assaulting Jack Grounded extension Semi-stable extension Preferred extension Comlete extension Stage extension ung 1995 Verheij 1996 Argumentation semantics (2003) Argumentation semantics (2003) Stage Stable Stable Semi-stable Preferred eflog Verheij 2003 eflog Verheij 2003 Pollock s research question, revisited We return to the original version (attack + suort) : How is argumentative warrant determined by the structure of the available arguments and counterarguments? - Mathematically clean (still) - Less abstract, less simle structure - Philosohically very comlex Argumentation in Artificial Intelligence, With Alications in the Law Course at the Institute of Logic and Cognition, Sun Yat-Sen University Ib Abstract Argumentation and Argument Structure Bart Verheij CodeX, Stanford University Artificial Intelligence, University of Groningen
Argumentation and rules with exceptions
Argumentation and rules with exceptions Bart VERHEIJ Artificial Intelligence, University of Groningen Abstract. Models of argumentation often take a given set of rules or conditionals as a starting point.
More informationSmall experiment. Netherlands Criminal Courts Prediction Machine. Netherlands Criminal Courts Prediction Machine
Arguments for Structured Hypotheses: A Logico-Probabilistic Perspective Bart Verheij Artificial Intelligence, University of Groningen www.ai.rug.nl/~verheij Legal tech exists, but is it disruptive? Disruption
More informationAn abstract framework for argumentation with structured arguments
An abstract framework for argumentation with structured arguments Henry Prakken Technical Report UU-CS-2009-019 September 2009 Department of Information and Computing Sciences Utrecht University, Utrecht,
More informationArgumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred
Argumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred Sanjay Modgil November 17, 2017 Abstract A number of argumentation formalisms provide dialectical
More informationContamination in Formal Argumentation Systems
Contamination in Formal Argumentation Systems Martin Caminada a a Utrecht University, P.O.Box 80089, 3508TB Utrecht Abstract Over the last decennia, many systems for formal argumentation have been defined.
More informationIntroduction to Structured Argumentation
Introduction to Structured Argumentation Anthony Hunter Department of Computer Science, University College London, UK April 15, 2016 1 / 42 Computational models of argument Abstract argumentation Structured
More informationArgumentation-Based Models of Agent Reasoning and Communication
Argumentation-Based Models of Agent Reasoning and Communication Sanjay Modgil Department of Informatics, King s College London Outline Logic and Argumentation - Dung s Theory of Argumentation - The Added
More informationIdentifying the Class of Maxi-Consistent Operators in Argumentation
Journal of Artificial Intelligence Research 47 (2013) 71-93 Submitted 11/12; published 05/13 Identifying the Class of Maxi-Consistent Operators in Argumentation Srdjan Vesic CRIL - CNRS Rue Jean Souvraz
More informationESSENCE 2014: Argumentation-Based Models of Agent Reasoning and Communication
ESSENCE 2014: Argumentation-Based Models of Agent Reasoning and Communication Sanjay Modgil Department of Informatics, King s College London Outline Logic, Argumentation and Reasoning - Dung s Theory of
More informationIntroduction to Structural Argumentation
Introduction to Structural Argumentation Anthony Hunter Department of Computer Science, University College London, UK July 8, 2014 1 / 28 Approaches to structured argumentation Some frameworks for structured
More informationTaking the A-chain: Strict and Defeasible Implication in Argumentation Frameworks
Taking the A-chain: Strict and Defeasible Implication in Argumentation Frameworks Adam Zachary Wyner and Trevor Bench-Capon University of Liverpool Department of Computer Science Ashton Building Liverpool,
More informationProof With and Without Probabilities
Artificial Intelligence and Law manuscript No. (will be inserted by the editor) Proof With and Without Probabilities Correct Evidential Reasoning with Presumptive Arguments, Coherent Hypotheses and Degrees
More informationTowards an integrated theory of causal scenarios and evidential arguments
Towards an integrated theory of causal scenarios and evidential arguments Floris BEX Department of Information and Computing Sciences, Utrecht University Abstract. The process of proof is one of inference
More informationA Study of Accrual of Arguments, with Applications to Evidential Reasoning
A Study of Accrual of Arguments, with Applications to Evidential Reasoning Henry Prakken Institute of Information and Computing Sciences, Utrecht University Faculty of Law, University of Groningen The
More informationA Sequent-Based Representation of Logical Argumentation
A Sequent-Based Representation of Logical Argumentation Ofer Arieli School of Computer Science, The Academic College of Tel-Aviv, Israel. oarieli@mta.ac.il Abstract. In this paper we propose a new presentation
More informationOn the Relationship of Defeasible Argumentation and Answer Set Programming
On the Relationship of Defeasible Argumentation and Answer Set Programming Matthias Thimm a Gabriele Kern-Isberner a a Information Engineering Group, Department of Computer Science University of Dortmund,
More informationAbstract Rule-Based Argumentation
1 Abstract Rule-Based Argumentation Sanjay Modgil, Henry Prakken abstract. This chapter reviews abstract rule-based approaches to argumentation, in particular the ASPIC + framework. In ASPIC + and its
More informationOn the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks
On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks Adam Wyner 1, Trevor Bench-Capon 2, and Paul Dunne 2 1 Department of Computing Science, University of Aberdeen, Aberdeen, United
More informationComplete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming
Complete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming Martin Caminada a Yining Wu a a University of Luxembourg Abstract In this paper, we prove the correspondence
More informationOn Warranted Inference in Possibilistic Defeasible Logic Programming 1
On Warranted Inference in Possibilistic Defeasible Logic Programming 1 Carlos Chesñevar a,2, Guillermo Simari b Lluís Godo c and Teresa Alsinet a a Department of Computer Science. University of Lleida,
More informationarxiv: v2 [cs.ai] 1 Jul 2015
Argumentation Semantics for Prioritised Default Logic arxiv:1506.08813v2 [cs.ai] 1 Jul 2015 Anthony P. Young, Sanjay Modgil, Odinaldo Rodrigues 1st July 2015 Abstract We endow prioritised default logic
More informationAn approach for an algebra applied to a Defeasible Logic Programming
An approach for an algebra applied to a Defeasible Logic Programming Maximiliano C. D. Budán, Mauro J. Gómez Lucero, Guillermo R. Simari Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET)
More informationCorrigendum for: A General Account of Argumentation with Preferences
Corrigendum for: A General Account of Argumentation with Preferences Sanjay Modgil 1 and Henry Prakken 2 1. Department of Infomatics, King s College London (sanjay.modgil@kcl.ac.uk) 2. Department of Information
More informationCOMP310 Multi-Agent Systems Chapter 16 - Argumentation. Dr Terry R. Payne Department of Computer Science
COMP310 Multi-Agent Systems Chapter 16 - Argumentation Dr Terry R. Payne Department of Computer Science Overview How do agents agree on what to believe? In a court of law, barristers present a rationally
More informationReasoning by Cases in Structured Argumentation.
. Jesse Heyninck, Mathieu Beirlaen and Christian Straßer Workgroup for Non-Monotonic Logics and Formal Argumentation Institute for Philosophy II Ruhr University Bochum The 32nd ACM SIGAPP Symposium On
More informationPostulates for logic-based argumentation systems
Postulates for logic-based argumentation systems Leila Amgoud IRIT CNRS Toulouse France Abstract Logic-based argumentation systems are developed for reasoning with inconsistent information. Starting from
More informationFrom Arguments to Constraints on a Bayesian Network
From Arguments to Constraints on a Bayesian Network Floris BEX a, Silja RENOOIJ a a Information and Computing Sciences, Utrecht University, The Netherlands Abstract. In this paper, we propose a way to
More informationCharacterization of Semantics for Argument Systems
Characterization of Semantics for Argument Systems Philippe Besnard and Sylvie Doutre IRIT Université Paul Sabatier 118, route de Narbonne 31062 Toulouse Cedex 4 France besnard, doutre}@irit.fr Abstract
More informationMaximal ideal recursive semantics for defeasible argumentation
Maximal ideal recursive semantics for defeasible argumentation Teresa Alsinet 1, Ramón Béjar 1, Lluis Godo 2, and Francesc Guitart 1 1 Department of Computer Science University of Lleida Jaume II, 69 251
More informationFormalising a legal opinion on a legislative proposal in the ASPIC + framework
Formalising a legal opinion on a legislative proposal in the ASPIC + framework Henry Prakken Department of Information and Computing Sciences, University of Utrecht and Faculty of Law, University of Groningen,
More informationArgumentation among Agents
Argumentation among Agents Iyad Rahwan 1 Masdar Institute of Science & Technology, UAE 2 University of Edinburgh, UK 3 Massachusetts Institute of Technology, USA I. Rahwan. Argumentation among Agents.
More informationThe Role of Dialectics in Defeasible Argumentation 1 2
The Role of Dialectics in Defeasible Argumentation 1 2 Guillermo R. Simari Carlos I. Chesñevar Alejandro J. García Grupo de Investigación en Inteligencia Artificial (GIIA) Departamento de Matemática, Universidad
More informationProbabilistic Strength of Arguments with Structure
Probabilistic Strength of Arguments with Structure Henry Prakken Department of Information and Computing Sciences, Utrecht University & Faculty of Law, University of Groningen The Netherlands Abstract
More informationRevisiting Unrestricted Rebut and Preferences in Structured Argumentation.
Revisiting Unrestricted Rebut and Preferences in Structured Argumentation. Jesse Heyninck and Christian Straßer Ruhr University Bochum, Germany jesse.heyninck@rub.de, christian.strasser@rub.de Abstract
More informationResolutions in Structured Argumentation
Resolutions in Structured Argumentation Sanjay Modgil a Henry Prakken b a Department of Informatics, King s ollege London, UK b Department of Information and omputing Sciences, University of Utrecht and
More informationA Review of Argumentation Based on Deductive Arguments
1 A Review of Argumentation Based on Deductive Arguments Philippe Besnard, Anthony Hunter abstract. A deductive argument is a pair where the first item is a set of premises, the second item is a claim,
More informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationConflict Resolution in Assumption-Based Frameworks
Conflict Resolution in Assumption-Based Frameworks Martin Baláž 1, Jozef Frtús 1, Giorgos Flouris 2, Martin Homola 1, and Ján Šefránek 1 1 Comenius University in Bratislava, Slovakia 2 FORTH-ICS, Greece
More informationAn Argumentation-Theoretic Characterization of Defeasible Logic
An Argumentation-Theoretic Characterization of Defeasible Logic G. Governatori and M.J. Maher 1 Abstract. Defeasible logic is an efficient non-monotonic logic that is defined only proof-theoretically.
More informationTHE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN
INTERNATIONAL JOURNAL OF GEOMETRY Vol. 5 (2016), No. 1, 31-38 THE ERDÖS - MORDELL THEOREM IN THE EXTERIOR DOMAIN PETER WALKER Abstract. We show that in the Erd½os-Mordell theorem, the art of the region
More informationCombining Modes of Reasoning: an Application of Abstract Argumentation
Combining Modes of Reasoning: an Application of Abstract Argumentation Henry Prakken Department of Information and Computing Sciences, Faculty of Science, Utrecht University & Faculty of Law, University
More informationArgument-based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Argument-based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties 2 Carlos I. Chesñevar 1, Guillermo R. Simari 2, Lluis Godo 3, and Teresa Alsinet
More informationOn ASPIC + and Defeasible Logic
On ASPIC + and Defeasible Logic Ho-Pun LAM 1, Guido GOVERNATORI and Régis RIVERET Data61, CSIRO NICTA, Australia 2 Abstract. Dung-like argumentation framework ASPIC + and Defeasible Logic (DL) are both
More informationImproving the Reliability of Causal Discovery from Small Data Sets using the Argumentation Framework
Computer Science Technical Reports Computer Science -27 Improving the Reliability of Causal Discovery from Small Data Sets using the Argumentation Framework Facundo Bromberg Iowa State University Dimitris
More informationTutorial: Nonmonotonic Logic
Tutorial: Nonmonotonic Logic PhDs in Logic (2017) Christian Straßer May 2, 2017 Outline Defeasible Reasoning Scratching the Surface of Nonmonotonic Logic 1/52 Defeasible Reasoning What is defeasible reasoning?
More informationMAKING ARGUMENT SYSTEMS COMPUTATIONALLY ATTRACTIVE Argument Construction and Maintenance 1
MAKING ARGUMENT SYSTEMS COMPUTATIONALLY ATTRACTIVE Argument Construction and Maintenance 1 Alejandro J. García, Carlos I. Chesñevar, and Guillermo R. Simari 2 Departamento de Matemática, Universidad Nacional
More informationAbstract Dialectical Frameworks
Abstract Dialectical Frameworks Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with Stefan Woltran G. Brewka (Leipzig) KR 2010 1 / 18 Outline
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationDebate Games in Logic Programming
Debate Games in Logic Programming Chiaki Sakama Department of Computer and Communication Sciences Wakayama University, Sakaedani, Wakayama 640-8510, Japan sakama@sys.wakayama-u.ac.jp Abstract. A debate
More informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
More informationInstantiating Knowledge Bases in Abstract Dialectical Frameworks
Instantiating Knowledge Bases in Abstract Dialectical Frameworks Hannes Strass Computer Science Institute, Leipzig University Abstract We present a translation from defeasible theory bases to abstract
More informationThe Principle-Based Approach to Abstract Argumentation Semantics
The Principle-Based Approach to Abstract Argumentation Semantics Leendert van der Torre University of Luxembourg leon.vandertorre@uni.lu Srdjan Vesic CRIL, CNRS Univ. Artois, France vesic@cril.fr Abstract
More informationProof with and without probabilities
Artif Intell Law (2017) 25:127 154 DOI 10.1007/s10506-017-9199-4 Proof with and without probabilities Correct evidential reasoning with presumptive arguments, coherent hypotheses and degrees of uncertainty
More informationRelevance in Structured Argumentation
Relevance in Structured Argumentation AnneMarie Borg and Christian Straßer, Ruhr-University Bochum, Germany annemarie.borg@rub.de, christian.strasser@rub.de Abstract We study properties related to relevance
More information2. PROPOSITIONAL LOGIC
2. PROPOSITIONAL LOGIC Contents 2.1: Informal roositional logic 2.2: Syntax of roositional logic 2.3: Semantics of roositional logic 2.4: Logical equivalence 2.5: An examle 2.6: Adequate sets of connectives
More informationOn Logical Reifications of the Argument Interchange Format
On Logical Reifications of the Argument Interchange Format Floris Bex a, Sanjay Modgil b Henry Prakken c Chris Reed a a School of Computing, University of Dundee b Department of Informatics, King s College
More informationJustified argument revision in agent dialogue
Justified argument revision in agent dialogue Mark Snaith and Chris Reed School of Computing, University of Dundee, Dundee, DD1 4HN, UK {marksnaith,chris}@computing.dundee.ac.uk Abstract. In certain dialogue
More informationRP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
Journal of Logic and Computation Advance Access published February 14, 2014 RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics TERESA ALSINET, Department of Computer
More informationParaconsistent Logics in Argumentation Systems
UTRECHT UNIVERSITY Paraconsistent Logics in Argumentation Systems by Diana Grooters ICA-3470857 Supervised by Henry Prakken A thesis submitted in partial fulfilment for the degree of Master of Science
More informationOn the Complexity of Linking Deductive and Abstract Argument Systems
On the Complexity of Linking Deductive and Abstract Argument Systems Michael Wooldridge and Paul E. Dunne Dept of Computer Science University of Liverpool Liverpool L69 3BX, UK mjw,ped@csc.liv.ac.uk Simon
More informationAn axiomatic approach for persuasion dialogs
An axiomatic approach for persuasion dialogs Leila Amgoud IRIT - CNRS 118, route de Narbonne, 31062 Toulouse Cedex 9 France amgoud@irit.fr Florence Dupin de Saint-Cyr IRIT - Université de Toulouse 118,
More informationARGUMENTATION is a reasoning process which can
A quantitative preference-based structured argumentation system for decision support Nouredine Tamani, Madalina Croitoru Abstract We introduce in this paper a quantitative preference based argumentation
More informationTopic 7: Using identity types
Toic 7: Using identity tyes June 10, 2014 Now we would like to learn how to use identity tyes and how to do some actual mathematics with them. By now we have essentially introduced all inference rules
More informationArguing with Preferences in EcoBioCap
Arguing with Preferences in EcoBioCap Madalina CROITORU a,1, Jerome FORTIN b, Nir OREN c a University Montpellier 2, France b University Montpellier 2, France c Dept. of Computing Science, University of
More informationResolving Incompatibilities among Procedural Goals under Uncertainty
Resolving Incompatibilities among Procedural Goals under Uncertainty Mariela Morveli-Espinoza 1, Juan Carlos Nieves 2, Ayslan Possebom 1, and Cesar Augusto Tacla 1 1 Federal University of Technology -
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationDialectical Theory for Multi-Agent Assumption-based Planning
Dialectical Theory for Multi-Agent Assumtion-based Planning Damien Pellier, Humbert Fiorino Laboratoire Leibniz, 46 avenue Félix Viallet F-38000 Grenboble, France {Damien.Pellier,Humbert.Fiorino}.imag.fr
More informationCOMP310 MultiAgent Systems. Chapter 16 - Argumentation
COMP310 MultiAgent Systems Chapter 16 - Argumentation Argumentation Argumentation is the process of attempting to agree about what to believe. Only a question when information or beliefs are contradictory.
More informationTackling Defeasible Reasoning in Bochum:
Tackling Defeasible Reasoning in Bochum: the Research Group for Non-Monotonic Logic and Formal Argumentation Christian Straßer and Dunja Šešelja April 10, 2017 Outline The NMLFA Reasoning by Cases Unrestricted
More informationJohn Weatherwax. Analysis of Parallel Depth First Search Algorithms
Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel
More informationCTL, the branching-time temporal logic
CTL, the branching-time temoral logic Cătălin Dima Université Paris-Est Créteil Cătălin Dima (UPEC) CTL 1 / 29 Temoral roerties CNIL Safety, termination, mutual exclusion LTL. Liveness, reactiveness, resonsiveness,
More information[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics
400 lecture note #2 [Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 1) Basics An argument is a sequence of statements ( s1, s2,, sn). All statements in an argument, excet for
More informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationDialectical Frameworks: Argumentation Beyond Dung
Dialectical Frameworks: Argumentation Beyond Dung Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with Stefan Woltran G. Brewka (Leipzig) NMR
More informationDecidable Reasoning in a Logic of Limited Belief with Function Symbols
Proceedings, Fifteenth International Conference on Princiles of Knowledge Reresentation and Reasoning (KR 2016) Decidable Reasoning in a Logic of Limited Belief with Function Symbols Gerhard Lakemeyer
More informationFurther Applications of the Gabbay-Rodrigues Iteration Schema in Argumentation and Revision Theories
Further Applications of the Gabbay-Rodrigues Iteration Schema in Argumentation and Revision Theories D. M. Gabbay and O. Rodrigues 2 Department of Informatics, King s College London, Bar Ilan University,
More information2. Sample representativeness. That means some type of probability/random sampling.
1 Neuendorf Cluster Analysis Assumes: 1. Actually, any level of measurement (nominal, ordinal, interval/ratio) is accetable for certain tyes of clustering. The tyical methods, though, require metric (I/R)
More informationA Two-phase Method for Extracting Explanatory Arguments from Bayesian Networks
A Two-phase Method for Extracting Explanatory Arguments from Bayesian Networks Sjoerd T. Timmer a,, John-Jules Ch. Meyer a, Henry Prakken a,b, Silja Renooij a, Bart Verheij c a Utrecht University, Department
More informationCommonsense Reasoning and Argumentation
DEPARTMENT OF INFORMATION AND COMPUTING SCIENCES UTRECHT UNIVERSITY FEBRUARY 2018 Commonsense Reasoning and Argumentation Author: HENRY PRAKKEN Contents 1 Circumscription 9 1.1 The basic idea: model preference.....................
More informationFormalizing Arguments, Rules and Cases
Formalizing Arguments, Rules and Cases Artificial Intelligence, University of Groningen bart.verheij@rug.nl ABSTRACT Legal argument is typically backed by two kinds of sources: cases and rules. In much
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationAggregating Alternative Extensions of Abstract Argumentation Frameworks: Preservation Results for Quota Rules
Aggregating Alternative Extensions of Abstract Argumentation Frameworks: Preservation Results for Quota Rules Weiwei Chen a,b, Ulle Endriss b a Institute of Logic and Cognition and Department of Philosophy
More informationEvaluation and comparison criteria for extension-based argumentation semantics
Evaluation and comparison criteria for extension-based argumentation semantics Pietro BARONI a,1 and Massimiliano GIACOMIN a a Dip. Elettronica per l Automazione, Univ. of Brescia, Italy Abstract. In the
More informationDRAFT - do not circulate
An Introduction to Proofs about Concurrent Programs K. V. S. Prasad (for the course TDA383/DIT390) Deartment of Comuter Science Chalmers University Setember 26, 2016 Rough sketch of notes released since
More informationNonmonotonic Tools for Argumentation
Nonmonotonic Tools for Argumentation Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with Stefan Woltran G. Brewka (Leipzig) CILC 2010 1 / 38
More informationComputing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming
Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming Carlos I. Chesñevar 1, Guillermo R. Simari 2, and Lluis Godo 3 1 Departament of Computer Science Universitat de Lleida
More informationSuccess chances in argument games: a probabilistic approach to legal disputes. 1
Success chances in argument games: a probabilistic approach to legal disputes. 1 Régis RIVERET a, Antonino ROTOLO a, Giovanni SARTOR b, Henry PRAKKEN c, Bram ROTH a CIRSFID, University of Bologna, Italy
More informationAn argumentation system for defeasible reasoning 1
An argumentation system for defeasible reasoning 1 Leila Amgoud 1 Farid Nouioua 2 1 IRIT CNRS, France 2 LSIS Aix-Marseille University, France Abstract Rule-based argumentation systems are developed for
More informationPrioritized Norms and Defaults in Formal Argumentation
Prioritized Norms and Defaults in Formal Argumentation Beishui Liao Zhejiang University, China baiseliao@zju.edu.cn Nir Oren University of Aberdeen, UK n.oren@abdn.ac.uk Leendert van der Torre University
More informationExplaining Predictions from Data Argumentatively
Explaining Predictions from Data Argumentatively Explain AI@Imperial Workshop Ken Satoh 1 Oana Cocarascu Kristijonas Čyras Francesca Toni April 25, 2018 Department of Computing, Imperial College London,
More informationWeighted Abstract Dialectical Frameworks
Weighted Abstract Dialectical Frameworks Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with H. Strass, J. Wallner, S. Woltran G. Brewka (Leipzig)
More informationSCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence 168 (2005) 162 210 www.elsevier.com/locate/artint SCC-recursiveness: a general schema for argumentation semantics Pietro Baroni, Massimiliano Giacomin, Giovanni Guida Dipartimento
More informationOn the Equivalence between Assumption-Based Argumentation and Logic Programming
Journal of Artificial Intelligence Research 60 (2017) 779-825 Submitted 06/17; published 12/17 On the Equivalence between Assumption-Based Argumentation and Logic Programming Martin Caminada Cardiff School
More informationIntegrating Dialectical and Accrual Modes of Argumentation
Integrating Dialectical and Accrual Modes of Argumentation Sanjay Modgil a, Trevor Bench-Capon b a Department of Computing, Imperial College, London b Department of Computer Science, University of Liverpool
More informationAssumption-Based Argumentation: Disputes, Explanations, Preferences
7 Assumption-Based Argumentation: Disputes, Explanations, Preferences Kristijonas Čyras, Xiuyi Fan, Claudia Schulz, Francesca Toni abstract. Assumption-Based Argumentation (ABA) is a form of structured
More informationAn argumentation system for reasoning with LPm
ECAI 2014 T. Schaub et al. (Eds.) 2014 The Authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial
More informationIt seems to be a common view that von Neumann and Morgenstern (1944, 1947, 1953), and the host of axiomatic theories that have appeared in their
PER-ERIK MALMNÄS AXIOMATIC JUSTIFICATIONS OF THE UTILITY PRINCIPLE A FORMAL INVESTIGATION 1. INTRODUCTION It seems to be a common view that von Neumann and Morgenstern (1944, 1947, 1953, and the host of
More informationIntroduction to Computational Argumentation
Introduction to Computational Argumentation Anthony Hunter Department of Computer Science University College London London, UK September 21, 2018 1 / 45 Overview 1 What is argumentation? 2 Key dimensions
More informationHARMONIC EXTENSION ON NETWORKS
HARMONIC EXTENSION ON NETWORKS MING X. LI Abstract. We study the imlication of geometric roerties of the grah of a network in the extendibility of all γ-harmonic germs at an interior node. We rove that
More informationOnline Appendix for The Timing and Method of Payment in Mergers when Acquirers Are Financially Constrained
Online Aendix for The Timing and Method of Payment in Mergers when Acquirers Are Financially Constrained Alexander S. Gorbenko USC Marshall School of Business Andrey Malenko MIT Sloan School of Management
More information