Abstract
This work proposes a declarative semantics based on a fuzzy variant of the classical notion of least Herbrand model for the so-called FASILL programming language (acronym of “Fuzzy Aggregators and Similarity Into a Logic Language”) which has been recently designed and implemented for coping with implicit/explicit truth degree annotations, a great variety of connectives and unification by similarity. Also, we define an immediate consequence operator that allows us to give a fixpoint characterization of the least Herbrand model for a FASILL program. A remarkable aspect of our declarative and fixpoint semantics is the fact that both have been enriched with the use of thresholds thanks to the natural ability of the underlying fuzzy language for managing such constructs. Moreover, we have connected both semantics with an operational one, which also manages thresholds in an efficient way, by proving the correctness of the whole semantic 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 callMore From: Journal of Logical and Algebraic Methods in Programming
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.
