Abstract

Confluence and termination are essential properties of relations connected to the idea of rewriting and substituting which appear in abstract rewriting systems. This paper presents a preliminary study of confluence, termination, and related properties from the point of view of fuzzy logic leaving the ordinary notions a particular case when the underlying structure of truth degrees is the two-valued Boolean algebra. The main motivation of this study is the fact that there are natural examples where the notion of substitutability is inherently fuzzy rather than crisp.

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 call

Disclaimer: 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.