Propositional plausible logic: Introduction and implementation

Studia Logica 67 (2):243-269 (2001)
Plausible Logic allows defeasible deduction with arbitrary propositions, and yet when sufficiently simplified it is very similar to the Defeasible Logics of Billington and Nute. This paper presents Plausible Logic, explains some of the ideas behind the definitions, applies Plausible Logic to an example, and proves a coherence result which indicates that Plausible Logic is well behaved. We also report the first complete implementation of propositional Plausible Logic. The implementation has a web interface which makes it available to researchers and students everywhere. The implementation is evaluated experimentally, and is shown to be capable of handling tens of thousands of rules and sufficiently many disjunctions for realistic problems.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/A:1010551204574
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,674
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

33 ( #144,283 of 1,903,118 )

Recent downloads (6 months)

7 ( #128,437 of 1,903,118 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.