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 paper, after recalling the operational semantics of this language, we provide a notion of fuzzy correct answer for a program and a goal and we prove the soundness of FASILL for this operational semantics and the notion of correct answer introduced.

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.