Switch to: References

Add citations

You must login to add citations.
  1. Turing L -machines and recursive computability for L -maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
    We propose the notion of partial recursiveness and strong partial recursiveness for fuzzy maps. We prove that a fuzzy map f is partial recursive if and only if it is computable by a Turing fuzzy machine and that f is strongly partial recursive and deterministic if and only if it is computable via a deterministic Turing fuzzy machine. This gives a simple and manageable tool to investigate about the properties of the fuzzy machines.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • TuringL-machines and recursive computability forL-maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179-192.
    We propose the notion of partial recursiveness and strong partial recursiveness for fuzzy maps. We prove that a fuzzy map f is partial recursive if and only if it is computable by a Turing fuzzy machine and that f is strongly partial recursive and deterministic if and only if it is computable via a deterministic Turing fuzzy machine. This gives a simple and manageable tool to investigate about the properties of the fuzzy machines.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Fuzzy Logic Programming and Fuzzy Control.Giangiacomo Gerla - 2005 - Studia Logica 79 (2):231-254.
    We show that it is possible to base fuzzy control on fuzzy logic programming. Indeed, we observe that the class of fuzzy Herbrand interpretations gives a semantics for fuzzy programs and we show that the fuzzy function associated with a fuzzy system of IF-THEN rules is the fuzzy Herbrand interpretation associated with a suitable fuzzy program.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations