An analysis of Ruspini partitions in Gödel logic

  • Authors:
  • Pietro Codara;Ottavio M. D'Antona;Vincenzo Marra

  • Affiliations:
  • Dipartimento di Matematica F. Enriques, Università degli Studi di Milano, via Saldini 50, I-20133 Milano, Italy;Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, via Comelico 39, I-20135 Milano, Italy;Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, via Comelico 39, I-20135 Milano, Italy

  • Venue:
  • International Journal of Approximate Reasoning
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

By a Ruspini partition we mean a finite family of fuzzy sets {f"1,...,f"n},f"i:[0,1]-[0,1], such that @?"i"="1^nf"i(x)=1 for all x@?[0,1], where [0,1] denotes the real unit interval. We analyze such partitions in the language of Godel logic. Our first main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a constructive procedure to axiomatize a given Ruspini partition by a theory in Godel logic. Our second main result extends this analysis to Ruspini partitions fulfilling the natural additional condition that each f"i has at most one left and one right neighbour, meaning that min"x"@?"["0","1"]{f"i"""1(x),f"i"""2(x),f"i"""3(x)}=0 holds for i"1i"2i"3.