Biological sequence alignment is one of the crucial tasks of computational bioinformatics, and provides base for other tasks of bioinformatics. In this paper, we discuss two different approaches to sequence matching – Boolean algebra and fuzzy logic. First method is a two-valued logic whereas the second is a multi-valued logic. Both the methods perform sequence matching by direct comparison met...

In this paper we present a short history of logics: from particular cases of 2-symbol or numerical valued logic to the general case of n-symbol or numerical valued logic. We show generalizations of 2-valued Boolean logic to fuzzy logic, also from the Kleene’s and Lukasiewicz’ 3-symbol valued logics or Belnap’s 4-symbol valued logic to the most general n-symbol or numerical valued refined neutro...

Kim, M.H., J.H. Lee and Y.J. Lee, Analysis of fuzzy operators for high quality information retrieval. Information Processing Letters 46 (1993) 251-256. It has been argued that the conventional fuzzy set model based on the MIN and MAX operators is not appropriate for a model of information retrieval systems due to the properties of the MIN and MAX operators adverse to retrieval effectiveness. In...

Applying the concept of fuzzy logic (an abstract version of Boolean logic) to well-known algorithms generates an abstract version (i.e., fuzzy algorithm) that often results in computational improvements. Precision may be reduced but counteracted by gaining computational efficiency. The trade-offs (e.g., small increase in space, loss of precision) for a variety of applications are deemed accepta...

Such as other statistical problems, we may confront with uncertain and fuzzy concepts in quality control. One particular case in process capability analysis is a situation in which specification limits are two fuzzy sets. In such a uncertain and vague environment, the produced product is not qualified with a two-valued Boolean view, but to some degree depending on the decision-maker strictness ...

In this paper, we investigate more relations between the symmetric residuated lattices $L$ with their corresponding intuitionistic fuzzy residuated lattice $tilde{L}$. It is shown that some algebraic structures of $L$ such as Heyting algebra, Glivenko residuated lattice and strict residuated lattice are preserved for $tilde{L}$. Examples are given for those structures that do not remain the sam...

On imprecision intuitionistic fuzzy sets & OLAP-the case for KNOLAP p. 11 Algorithm for interpretation of multi-valued taxonomic attributes in similarity-based fuzzy databases p. 23 Flexible location-based spatial queries p. 36 Complex quantified statements evaluated using gradual numbers p. 46 Properties of local andness/orness p. 54 A new approach for Boolean query processing in text informat...

Conventional search techniques for searching a database follow Boolean logic. When a database search is made with a given set of keywords, a minor variation in the keyword due to difference in spelling standard, typographical error or difference in inflection of the same stem, results in failure in getting records from the database. This situation demands a special kind of search technique, whi...