An Efficient Algorithm for Approximate Reasoning with Multiple Antecedents

P.M. van den Broek

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

    10 Downloads (Pure)

    Abstract

    We present an efficient algorithm for approximate reasoning with multiple antecedents. This algorithm computes its result by aggregating results from single antecedent rules. We prove its correctness, implement it in the functional programming language Miranda, and show its effectiveness with an example.
    Original languageUndefined
    Title of host publication2001 International Conference on Computational Mopdelling, Control & Automation - CIMCA 2001
    EditorsMasoud Mohammadian
    Place of PublicationCanberra, Australia
    PublisherUniversity of Canberra, Australia
    Pages332-338
    Number of pages7
    ISBN (Print)0858898470
    Publication statusPublished - Jul 2001

    Publication series

    Name
    PublisherUniversity of Canberra, Australia

    Keywords

    • EWI-10082
    • IR-61731
    • METIS-204179

    Cite this