For an effective and efficient information search of databases, various issues should be solved. A very important one, though still usually neglected by traditional database management systems, is related to a proper representation of user preferences and intentions, and then their representation in querying languages. In many scenarios, they are not clear-cut, and often have their original for...

Moreover the term predicate fuzzy logic L∀ will denote the predicate calculus obtained from the propositional core fuzzy logic L by adding the “classical” quantifiers (∀ and ∃) together with the same axioms and rule of generalization used by Hàjek in his book [7] when defining BL∀. On the other hand, given a left-continuous t-norm ∗, if L∗ denotes the (propositional) fuzzy logic which is standa...

Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...

We consider linguistic database summaries in the sense of Yager (1982), in an implementable form proposed by Kacprzyk & Yager (2001) and Kacprzyk, Yager & Zadrożny (2000), exemplified by, for a personnel database, “most employees are young and well paid” (with some degree of truth) and their extensions as a very general tool for a human consistent summarization of large data sets. We advocate t...

Employing estimation models in software engineering help in envisaging some essential traits of future entities like software development effort, software reliability and programmers productivity. Of these models, the one that supports the estimation of software effort has drawn substantial attention currently to carry out researches. Estimation by analogy is one among the interesting technique...

In [28] Yager and Filev introduced the Induced Ordered Weighted Averaging (IOWA) operator. In this paper, we provide some IOWA operators to aggregate fuzzy preference relations in group decision-making (GDM) problems. These IOWA operators when guided by fuzzy linguistic quantifiers allow the introduction of some semantics or meaning in the aggregation, and therefore allow for a better control o...

In his pioneering work Mostowski (1957) made the very insightful suggestion that quantifiers are special higher order relations, relations between relations (where sets are unary relations). This move led eventually to the generalised quantifier theory (GQT). In particular it made it possible to study ”classical” quantifiers using familiar tools of the elementary theory of relations. This simpl...