Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query string, also represented as a set of tokens, a weighted string similarity query identifies all strings in the database whose similarity to the query is larger than a user specified threshold. Weighted string similarity q...

A decision maker is asked to express her beliefs by assigning probabilities to certain possible states. We focus on the relationship between her database and her beliefs. We show that, if beliefs given a union of two databases are a convex combination of beliefs given each of the databases, the belief formation process follows a simple formula: beliefs are a similarity-weighted average of the b...

One of the possible semantics of fuzzy sets is in terms of similarity, namely a grade of membership of an item in a fuzzy set can be viewed as the degree of resemblance between this item and prototypes of the fuzzy set. In such a framework, an interesting question is how to devise a logic of similarity, where inference rules can account for the proximity between interpretations. The aim is to c...

to evaluate land suitability of aq-qalla region for rainfed chickpea cropping, boolean logic and analytical hierarchy process (ahp) methods were used in geographic information system (gis). to achieve this, firstly, climatic and agronomical requirements of chickpea,were identified according to scientific resources. then, thematic requirement maps were provided. the studied environmental-compone...

A similarity-based fuzzy logic was proposed by M.S.Ying in [10] and successively investigated in [2]. The basic idea is that we can make ”approximate” reasoning by allowing an inference rule to work also in the case the antecedent clauses match only approximately previously proven formulas. Some tentative to applying such an idea to logic programming was proposed in [1], [6] and [7]. In this no...

Many machine learning applications require the ability to learn from and reason about noisy multi-relational data. To address this, several effective representations have been developed that provide both a language for expressing the structural regularities of a domain, and principled support for probabilistic inference. In addition to these two aspects, however, many applications also involve ...

Evaluating a traditional database query against a data tuple returns a true on match and a false on mismatch. Unfortunately, there are many application scenarios where such an evaluation is not possible or does not adequately meet users needs. A further problematic application area is text retrieval where in general finding a complete match is impossible. Thus, there is a need for incorporating...