scientific article; zbMATH DE number 486959
From MaRDI portal
Publication:4275502
Recommendations
- Efficient computation of transitive closures
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
- The simplest method of ascending value to find fuzzy transitive closure
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
Cited in
(8)- An algorithm for computing the transitive closure of a fuzzy similarity matrix
- The simplest method of ascending value to find fuzzy transitive closure
- S-K-Q critical theorems for fuzzy transitive closure R^* and fuzzy classifying matrix R_
- A fast algorithm for computing transitive relation
- Transitive openings
- Modeling Decisions for Artificial Intelligence
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275502)