Abstract
Approximate reasoning allows inferring with imperfect knowledge. It is based on a generalization of modus ponens (MP) known as generalized modus ponens (GMP). We are interested in approximate reasoning within symbolic multi-valued logic framework. In a previous work, we have proposed a new GMP based on linguistic modifiers in the multi-valued logic framework. The use of linguistic modifiers allows having a gradual reasoning; moreover, it allows checking axiomatics of approximate reasoning. In this paper, we extend our approximate reasoning to hold with complex rules, i.e., rules whose premises are conjunction or disjunction of propositions. For this purpose, we introduce a new operator that aggregates linguistic modifiers and verifies the required properties of logical connectives within the multi-valued logic framework.
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.
