Abstract
Reductants are a special kind of fuzzy rules which constitute an essential theoretical tool for proving correctness properties. As it has been reported, when interpreted on a partially ordered structure, a multi-adjoint logic program has to include all its reductants in order to preserve the approximate completeness property. After a short survey of the different notions of reductant that have been developed for multi-adjoint logic programs, we introduce a new and more adequate notion of reductant in the multi-adjoint framework. We study some of its properties and its relationships with other notions of reductants, and provide an algorithm for computing all the reductants associated with a multi-adjoint logic program.
Sign-in/Register to access full text options 
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.
