Abstract
This paper presents a new method for cognitive-map-based decision analysis based on negative-positive-neutral (NPN) logics, where an efficient algorithm is proposed for performing interval-based inexact reasoning automatically. The algorithm performs inexact reasoning via constructing a sprouting tree. The time complexity of the proposed algorithm is O( nm), which n is the number of cognitive units in the cognitive map, m is the length of a closure path, and max( m) = 2 n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
