Analysis of the Talmudic Argumentum A Fortiori Inference Rule (Kal Vachomer) using Matrix Abduction
| Autor: | Dov M. Gabbay, Uri J. Schild, Michael Abraham |
|---|---|
| Rok vydání: | 2009 |
| Předmět: |
Computer science [C05] [Engineering
computing & technology] Computer science Logic business.industry media_common.quotation_subject Judgement Analogy Argumentum a fortiori Talmud Sciences informatiques [C05] [Ingénierie informatique & technologie] Blank Argumentation theory Practical reason Algebra Matrix (mathematics) History and Philosophy of Science Voting Artificial intelligence Computational linguistics business Rule of inference media_common Mathematics |
| Zdroj: | Studia Logica, 92(3), 281–364. Berlin, Germany: Springer (2009). |
| ISSN: | 1572-8730 0039-3215 |
| DOI: | 10.1007/s11225-009-9202-5 |
| Popis: | We motivate and introduce a new method of abduction, Matrix Abduction, and apply it to modelling the use of non-deductive inferences in the Talmud such as Analogy and the rule of Argumentum A Fortiori. Given a matrix \({\mathbb {A}}\) with entries in {0, 1}, we allow for one or more blank squares in the matrix, say ai,j =?. The method allows us to decide whether to declare ai,j = 0 or ai,j = 1 or ai,j =? undecided. This algorithmic method is then applied to modelling several legal and practical reasoning situations including the Talmudic rule of Kal-Vachomer. We add an Appendix showing that this new rule of Matrix Abduction, arising from the Talmud, can also be applied to the analysis of paradoxes in voting and judgement aggregation. In fact we have here a general method for executing non-deductive inferences. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink