loading...
An Implementation of Propositional Plausible Logic
Canberra, Australia January 31-February 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ACSC.2000.824404Australasian Computer Science Conference
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Andrew Rock, Griffith University
David Billington, Griffith University
We report the first complete implementation of propositional Plausible Logic. Plausible Logic is an extension of Defeasible Logic that overcomes the latter's inability to represent or prove disjunctions. This advantage is significant in dealing with practical applications such as the modeling of regulations. The system has a web interface, which makes it available to researchers and students everywhere. The implementation language chosen was Haskell and some advantages and consequences of this choice are discussed.
Index Terms:
Plausible logic, Implementation, Defeasible logic, Non-monotonic reasoning, Haskell, Artificial intelligence
Citation:
Andrew Rock, David Billington, "An Implementation of Propositional Plausible Logic," acsc, pp.204, Australasian Computer Science Conference, 2000
Usage of this product signifies your acceptance of the Terms of Use.