Logical computation of evidential reasoning in a hierarchical structure

Junzo Watada

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)

    Abstract

    The objective of this paper is to employ Demster-Shafer theory into analyzing the hierarchical and logical structure with logical operations AND & OR such as a fault tree. One of main differences of the Dempster-Shafer theory from Baysian one is that it enables us to take the lack of knowledge or information into account in its analyses. The considered set of hypothesis must he mutual exclusive and exhaustive in the Dempster-Shafer theory. In this paper, we define state patterns in order to satisfy the mutual exclusiveness and exhaustiveness. The method using state patterns requires us much computational time to solve the evidential reasoning. In order to overcome this difficulty, we also propose the improved method in terms of logical relations of the events in the fault tree.

    Original languageEnglish
    Title of host publication2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages167-172
    Number of pages6
    ISBN (Print)0780378644, 9780780378643
    DOIs
    Publication statusPublished - 2003
    Event3rd IEEE International Symposium on Intelligent Signal Processing, WISP 2003 - Budapest, Hungary
    Duration: 2003 Sep 6 → …

    Other

    Other3rd IEEE International Symposium on Intelligent Signal Processing, WISP 2003
    CountryHungary
    CityBudapest
    Period03/9/6 → …

    Fingerprint

    Evidential Reasoning
    Fault Tree
    Dempster-Shafer Theory
    Hierarchical Structure
    Knowledge

    Keywords

    • Dempster-Shafer theory
    • Evidential reasoning
    • Hierarchical structure

    ASJC Scopus subject areas

    • Signal Processing
    • Electrical and Electronic Engineering
    • Mathematics(all)
    • Software
    • Computer Science Applications

    Cite this

    Watada, J. (2003). Logical computation of evidential reasoning in a hierarchical structure. In 2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings (pp. 167-172). [1275833] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISP.2003.1275833

    Logical computation of evidential reasoning in a hierarchical structure. / Watada, Junzo.

    2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2003. p. 167-172 1275833.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Watada, J 2003, Logical computation of evidential reasoning in a hierarchical structure. in 2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings., 1275833, Institute of Electrical and Electronics Engineers Inc., pp. 167-172, 3rd IEEE International Symposium on Intelligent Signal Processing, WISP 2003, Budapest, Hungary, 03/9/6. https://doi.org/10.1109/ISP.2003.1275833
    Watada J. Logical computation of evidential reasoning in a hierarchical structure. In 2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2003. p. 167-172. 1275833 https://doi.org/10.1109/ISP.2003.1275833
    Watada, Junzo. / Logical computation of evidential reasoning in a hierarchical structure. 2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 167-172
    @inproceedings{7d124716243a414a852a8308544b5816,
    title = "Logical computation of evidential reasoning in a hierarchical structure",
    abstract = "The objective of this paper is to employ Demster-Shafer theory into analyzing the hierarchical and logical structure with logical operations AND & OR such as a fault tree. One of main differences of the Dempster-Shafer theory from Baysian one is that it enables us to take the lack of knowledge or information into account in its analyses. The considered set of hypothesis must he mutual exclusive and exhaustive in the Dempster-Shafer theory. In this paper, we define state patterns in order to satisfy the mutual exclusiveness and exhaustiveness. The method using state patterns requires us much computational time to solve the evidential reasoning. In order to overcome this difficulty, we also propose the improved method in terms of logical relations of the events in the fault tree.",
    keywords = "Dempster-Shafer theory, Evidential reasoning, Hierarchical structure",
    author = "Junzo Watada",
    year = "2003",
    doi = "10.1109/ISP.2003.1275833",
    language = "English",
    isbn = "0780378644",
    pages = "167--172",
    booktitle = "2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - GEN

    T1 - Logical computation of evidential reasoning in a hierarchical structure

    AU - Watada, Junzo

    PY - 2003

    Y1 - 2003

    N2 - The objective of this paper is to employ Demster-Shafer theory into analyzing the hierarchical and logical structure with logical operations AND & OR such as a fault tree. One of main differences of the Dempster-Shafer theory from Baysian one is that it enables us to take the lack of knowledge or information into account in its analyses. The considered set of hypothesis must he mutual exclusive and exhaustive in the Dempster-Shafer theory. In this paper, we define state patterns in order to satisfy the mutual exclusiveness and exhaustiveness. The method using state patterns requires us much computational time to solve the evidential reasoning. In order to overcome this difficulty, we also propose the improved method in terms of logical relations of the events in the fault tree.

    AB - The objective of this paper is to employ Demster-Shafer theory into analyzing the hierarchical and logical structure with logical operations AND & OR such as a fault tree. One of main differences of the Dempster-Shafer theory from Baysian one is that it enables us to take the lack of knowledge or information into account in its analyses. The considered set of hypothesis must he mutual exclusive and exhaustive in the Dempster-Shafer theory. In this paper, we define state patterns in order to satisfy the mutual exclusiveness and exhaustiveness. The method using state patterns requires us much computational time to solve the evidential reasoning. In order to overcome this difficulty, we also propose the improved method in terms of logical relations of the events in the fault tree.

    KW - Dempster-Shafer theory

    KW - Evidential reasoning

    KW - Hierarchical structure

    UR - http://www.scopus.com/inward/record.url?scp=84856549604&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84856549604&partnerID=8YFLogxK

    U2 - 10.1109/ISP.2003.1275833

    DO - 10.1109/ISP.2003.1275833

    M3 - Conference contribution

    AN - SCOPUS:84856549604

    SN - 0780378644

    SN - 9780780378643

    SP - 167

    EP - 172

    BT - 2003 IEEE International Symposium on Intelligent Signal Processing: From Classical Measurement to Computing with Perceptions, WISP 2003 - Proceedings

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -