lfst

L-Fuzzy Set Theory implementation in Haskell https://github.com/ci-fst/lfst

Latest on Hackage:1.0.2

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

GPL-3 licensed and maintained by Marco Di Pietro, Claudio Greco, Corrado Mencar, Alessandro Suglia

If X is a collection of objects denoted generically by x, then a fuzzy set F(A) in X is a set of ordered pairs. Each of them consists of an element x and a membership function which maps x to the membership space M. The current implementation is inspired by the work of Goguen, Joseph A. "L-fuzzy sets." Journal of mathematical analysis and applications 18.1 (1967).

comments powered byDisqus