Propositional Plausible Logic: Introduction and Implementation

Authors: Billington, D.; Rock, A.

Source: Studia Logica, Volume 67, Number 2, 20 March 2001 , pp. 243-269(27)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

Abstract:

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: Artificial intelligence; Defeasible Logic; Haskell; Implementation; Non-monotonic reasoning; Plausible Logic

Document Type: Regular Paper

Affiliations: School of Computing and Information Technology Griffith University Nathan, Queensland, 4111, Australia {D.Billington,A.Rock}@cit.gu.edu.au

Publication date: March 20, 2001

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page