Rules for Plausible Reasoning

Informal Logic 14 (1) (1992)
  Copy   BIBTEX

Abstract

This article evaluates whether Rescher's rules for plausible reasoning or other rules used in artificial intelligence for "confidence factors" can be extended to deal with arguments where the linked-convergent distinction is important

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The TRUE Test of Linkage.Mark Vorobej - 1994 - Informal Logic 16 (3):147-157.
Self-defeating arguments.John L. Pollock - 1991 - Minds and Machines 1 (4):367-392.
Burden of proof.DouglasN Walton - 1988 - Argumentation 2 (2):233-254.
Argumentation Without Arguments.Henry Prakken - 2011 - Argumentation 25 (2):171-184.
A theory of legal reasoning and a logic to match.Jaap Hage - 1996 - Artificial Intelligence and Law 4 (3-4):199-273.
Hybrid Arguments.Mark Vorobej - 1995 - Informal Logic 17 (2).

Analytics

Added to PP
2013-11-24

Downloads
25 (#627,007)

6 months
5 (#629,992)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Douglas Walton
Last affiliation: University of Windsor

References found in this work

Games, graphs and circular arguments.Douglas N. Walton & Lynn M. Batten - 1984 - Logique Et Analyse 106 (6):133-164.

Add more references