Generating Hasse trees of fuzzy preorder closures: an algorithmic approach

@inproceedings{Naessens1999GeneratingHT,
  title={Generating Hasse trees of fuzzy preorder closures: an algorithmic approach},
  author={Helga Naessens and Bernard De Baets and Hans De Meyer},
  booktitle={EUSFLAT-ESTYLF Joint Conf.},
  year={1999}
}
Mathematical theories are pervaded with the use of partial orders and more general preorders also called quasi orders i e re exive and transitive binary rela tions Preorders also play an important role in appli cations for instance as preference relations in multi criteria decision aid techniques The observation that classical relations do not allow to express partial or graded relationships has led to the introduction of fuzzy relations In preference modelling for instance fuzzy relations are… CONTINUE READING

Topics from this paper.