Automated fuzzy and probabilistic inference

From MaRDI portal





The author explains how his FRIL-system (Fuzzy Relational Inferene Language) can be used to perform probabilistic inference following a Prolog-style proof procedure. It is further illustrated how the second inference mechanism available in FRIL, following a relational algebraic approach, can be adapted to compute transitive closures in graphs.











This page was built for publication: Automated fuzzy and probabilistic inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083872)