Efficient Algorithms for Approximate Reasoning

P.M. van den Broek

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    5 Citations (Scopus)
    40 Downloads (Pure)

    Abstract

    We present algorithms for approximate reasoning computations, for some intersection and implication functions, which are as efficient as Mamdani's interpolation method. Implementations of the algorithms are given in the functional language Miranda.
    Original languageUndefined
    Title of host publication6th International Conference on Neural Information Processing (ICONIP)
    EditorsT. Gedeon, P. Wong, S. Halgamuge, N. Kasabov, D. Nauck, K. Fukushima
    Place of PublicationPerth, Western Australia
    PublisherIEEE
    Pages292-297
    Number of pages6
    ISBN (Print)0780358716
    DOIs
    Publication statusPublished - 1999

    Publication series

    Name
    PublisherIEEE
    Volume1

    Keywords

    • EWI-10084
    • METIS-119326
    • IR-18804

    Cite this

    van den Broek, P. M. (1999). Efficient Algorithms for Approximate Reasoning. In T. Gedeon, P. Wong, S. Halgamuge, N. Kasabov, D. Nauck, & K. Fukushima (Eds.), 6th International Conference on Neural Information Processing (ICONIP) (pp. 292-297). Perth, Western Australia: IEEE. https://doi.org/10.1109/ICONIP.1999.844002