stem cells are of great interest for regenerating disturbed tissues and organs. these cells are commonly isolated from the bone marrow, but there has been interest in other tissues in the recent years. in this study, we evaluated the possibility of isolation of stem cells from oral connective tissue and investigated their characteristics.in this experimental study, sampling from the bone marrow...

Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to combine different expressions; in particular the Gödel and Lukasiewicz fuzzy connectives are usually considered, due to their properties. Although the Gödel conjunction can be easi...

The current trend in the rapid growth of on-line image databases has brought forth several innovative approaches to content-based image retrieval. Most current techniques retrieve images based on an example image or object shapes/features extracted from images. Retrieval based on linguistic queries has not recieved much attention. In this paper, we present a fuzzy connective approach to handle ...

objective: different surgical procedures have been proposed for the treatment of gingival recessions. the goal of this study was to compare the clinical results of gingival recession treatment using subepithelial connective tissue graft and an acellular dermal matrix allograft. materials and methods: the present study was performed on 5 patients with 9 bilateral miller`s class i or ii gingival ...

Discussive logics (also called discursive logics) were introduced in 1948 by Stanis law Jaśkowski and constitute the first family of formal paraconsistent logics. The basic mechanism behind discussive logics is as simple as ingenious. Where L is some modal logic and Γ♦ = {♦A | A ∈ Γ}, a discussive logic DL, associated with L, is obtained by specifying the language L of DL and by stipulating tha...

This paper proposes to use two information retrieval system models (Boolean information retrieval model and extended Boolean (fuzzy) information retrieval model). These models differ by using Boolean queries or fuzzy weighted queries. It also proposes a way for optimizing user query for the two models by using genetic programming and fuzzy logic. And proposes to use more number of Boolean opera...

Several universal approximation and universal representation results are known for non Boolean multi valued logics such as fuzzy logics In this paper we show that similar results can be proven for multi valued Boolean logics as well Introduction The study of Boolean algebras started when G Boole con sidered the simplest Boolean algebra the two valued algebra B f g ffalse trueg In this algebra t...

In the information retrieval field, Fuzzy Information Retrieval Systems (FIRSs) use the potential of fuzzy techniques to improve the retrieval activities. Some models of FIRSs employ weighted queries to enhance the representation of user information needs and fuzzy connectives to evaluate such queries. In our teaching experience we have observed that students have many problems to understand th...

In this paper we consider the theory of fuzzy logic programming without negation. Our results cover logical systems with a wide variety of connectives ranging from t-norm and conorms, through conjunctors and disjunctors and their residuals to aggregation operators. Rules of our programs are many valued implications. We emphasize, that in contrast to other approaches, our logic is truth function...

Fuzzy implications are one of the most important fuzzy logic connectives. In this work, we conduct a systematic algebraic study on the set I of all fuzzy implications. To this end, we propose a binary operation, denoted by ~, which makes (I,~) a non-idempotent monoid. While this operation does not give a group structure, we determine the largest subgroup S of this monoid and using their represe...