Abstract

The FASILL programming language (acronym of “Fuzzy Aggregators and Similarity Into a Logic Language”) combines a weak unification algorithm, based on similarity relations, along with a rich repertoire of fuzzy connectives and aggregators, whose truth functions can be defined on a complete lattice. In this work, we want to provide a unified view of the fundamental concepts and ideas that inspired its construction, jointly with the implementation techniques that made it possible. We detail the implementation of the operational semantics and we describe the overall structure of the FASILL system. The FASILL language is well-suited for a wide range of applications and, specifically, it can help the development of knowledge based systems where to deal with uncertainty is important. After ten years designing and implementing fuzzy logic systems, this work culminates and agglutinates the experience acquired in our research group on the development of this kind of modern programming languages.

Full Text
Paper version not known

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.