Deductive and abductive argumentation based on information graphs
In this paper, we propose an argumentation formalism that allows for both deductive and abductive argumentation, where ‘deduction’ is used as an umbrella term for both defeasible and strict ‘forward’ inference. Our formalism is based on an extended version of our previously proposed informatio...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOS Press
2022-02-01
|
| Series: | Argument & Computation |
| Online Access: | https://doi.org/10.3233/AAC-200539 |
| _version_ | 1797860904907309056 |
|---|---|
| author | Remi Wieten Floris Bex Henry Prakken Silja Renooij |
| author_facet | Remi Wieten Floris Bex Henry Prakken Silja Renooij |
| author_sort | Remi Wieten |
| collection | DOAJ |
| description |
In this paper, we propose an argumentation formalism that allows for both deductive and abductive argumentation, where ‘deduction’ is used as an umbrella term for both defeasible and strict ‘forward’ inference. Our formalism is based on an extended version of our previously proposed information graph (IG) formalism, which provides a precise account of the interplay between deductive and abductive inference and causal and evidential information. In the current version, we consider additional types of information such as abstractions which allow domain experts to be more expressive in stating their knowledge, where we identify and impose constraints on the types of inferences that may be performed with the different types of information. A new notion of attack is defined that captures a crucial aspect of abductive reasoning, namely that of competition between abductively inferred alternative explanations. Our argumentation formalism generates an abstract argumentation framework and thus allows arguments to be formally evaluated. We prove that instantiations of our argumentation formalism satisfy key rationality postulates. |
| first_indexed | 2024-04-09T21:54:36Z |
| format | Article |
| id | doaj.art-c370b2d41ea44337824be48d42c4cbc7 |
| institution | Directory Open Access Journal |
| issn | 1946-2166 1946-2174 |
| language | English |
| last_indexed | 2024-04-09T21:54:36Z |
| publishDate | 2022-02-01 |
| publisher | IOS Press |
| record_format | Article |
| series | Argument & Computation |
| spelling | doaj.art-c370b2d41ea44337824be48d42c4cbc72023-03-24T09:48:02ZengIOS PressArgument & Computation1946-21661946-21742022-02-01131499110.3233/AAC-200539Deductive and abductive argumentation based on information graphsRemi Wieten0Floris Bex1Henry Prakken2Silja Renooij3Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The NetherlandsDepartment of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The NetherlandsDepartment of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The NetherlandsDepartment of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The Netherlands In this paper, we propose an argumentation formalism that allows for both deductive and abductive argumentation, where ‘deduction’ is used as an umbrella term for both defeasible and strict ‘forward’ inference. Our formalism is based on an extended version of our previously proposed information graph (IG) formalism, which provides a precise account of the interplay between deductive and abductive inference and causal and evidential information. In the current version, we consider additional types of information such as abstractions which allow domain experts to be more expressive in stating their knowledge, where we identify and impose constraints on the types of inferences that may be performed with the different types of information. A new notion of attack is defined that captures a crucial aspect of abductive reasoning, namely that of competition between abductively inferred alternative explanations. Our argumentation formalism generates an abstract argumentation framework and thus allows arguments to be formally evaluated. We prove that instantiations of our argumentation formalism satisfy key rationality postulates.https://doi.org/10.3233/AAC-200539 |
| spellingShingle | Remi Wieten Floris Bex Henry Prakken Silja Renooij Deductive and abductive argumentation based on information graphs Argument & Computation |
| title | Deductive and abductive argumentation based on information graphs |
| title_full | Deductive and abductive argumentation based on information graphs |
| title_fullStr | Deductive and abductive argumentation based on information graphs |
| title_full_unstemmed | Deductive and abductive argumentation based on information graphs |
| title_short | Deductive and abductive argumentation based on information graphs |
| title_sort | deductive and abductive argumentation based on information graphs |
| url | https://doi.org/10.3233/AAC-200539 |
| work_keys_str_mv | AT remiwieten deductiveandabductiveargumentationbasedoninformationgraphs AT florisbex deductiveandabductiveargumentationbasedoninformationgraphs AT henryprakken deductiveandabductiveargumentationbasedoninformationgraphs AT siljarenooij deductiveandabductiveargumentationbasedoninformationgraphs |