An implementation of propositional plausible logic

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