Bipolar Queries Using Various Interpretations of Logical Connectives

  • Authors:
  • Sławomir Zadrożny;Janusz Kacprzyk

  • Affiliations:
  • Systems Research Institute, Polish Academy of Sciences, Warszawa, Poland and WIT --- Warsaw School of Information Technology, Warszawa, Poland;Systems Research Institute, Polish Academy of Sciences, Warszawa, Poland

  • Venue:
  • IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

In [1,2] we studied various concepts of bipolar queries (cf. Dubois and Prade [3]). We advocated the use of a fuzzified version of the original crisp definition by Lacroix and Lavency [4]. However, the general fuzzification proposed leaves open the choice of a representation of logical connectives and quantifiers. In the present paper we study the influence of the choice some representations that are popular in fuzzy logic on matching degrees of the tuples and their resulting ordering.