Approximate Reasoning in Fuzzy Resolution ()

Banibrata Mondal, Swapan Raha

Department of Mathematics, Visva-Bharati University, Santiniketan, West Bengal, India.

**DOI: **10.4236/ijis.2013.32010
PDF
HTML
4,492
Downloads
8,197
Views
Citations

Department of Mathematics, Visva-Bharati University, Santiniketan, West Bengal, India.

Resolution is an useful tool for mechanical theorem proving in modelling the refutation proof procedure, which is mostly used in constructing a “proof” of a “theorem”. An attempt is made to utilize approximate reasoning methodology in fuzzy resolution. Approximate reasoning is a methodology which can deduce a specific information from general knowledge and specific observation. It is dependent on the form of general knowledge and the corresponding deductive mechanism. In ordinary approximate reasoning, we derive from *A*→*B* and by some mechanism. In inverse approximate reasoning, we conclude from *A*→*B* and using an altogether different mechanism. An important observation is that similarity is inherent in fuzzy set theory. In approximate reasoning methodology-similarity relation is used in fuzzification while, similarity measure is used in fuzzy inference mechanism. This research proposes that similarity based approximate reasoning-modelling generalised modus ponens/generalised modus tollens—can be used to derive a resolution—like inference pattern in fuzzy logic. The proposal is well-illustrated with artificial examples.

Share and Cite:

Mondal, B. and Raha, S. (2013) Approximate Reasoning in Fuzzy Resolution. *International Journal of Intelligence Science*, **3**, 86-98. doi: 10.4236/ijis.2013.32010.

1. Introduction

In automated theorem proving, resolution is a rule of inference leading to a refutation theorem-proving technique. Applying the resolution rule in a suitable way, it is possible to check whether a propositional formula is satisfiable and construct a proof that a first-order formula is satisfiable/unsatisfiable. In 1965, J. A. Robinson [1] introduced the resolution principle for first-order logic. A resolvent of two clauses containing the complementary literals and respectively, is defined as is understood as the disjunction of the literals present in them. It is also a logical consequence of. A resolution deduction of a clause C from a set of clauses is a finite sequence of clauses such that, each is either a member of or is a resolvent of two clauses taken from From the resolution principle in propositional logic we deduce that, if is true under some truth valuation, then v(C_{i}) = TRUE for all i, and in particular, [2].

Example 1: Here, is a derivation of a clause from a set of clauses presented by means of a resolution Tree in Figure 1.

In first order logic, resolution condenses the traditional syllogism of logical inference down to single rule. To

Figure 1. Resolution Tree.

A simple resoluion scheme is:

recast the logical inference using the resolution technique, first the formulae are represented in conjunctive normal form. In this form, all quantification becomes implicit: universal quantifiers on variables are simply omitted as understood, while existentially quantified variables are replaced with Skolem functions.

The first step in automated deduction in fuzzy logic was taken by Lee and Chang [3]. Lee’s works [3,4] were continued and implemented by many researchers. Lee’s fuzzy formulae are syntactically defined as classical first-order formulae, but they differ semantically as the formulae have a truth value in [0,1]. An interpretation is defined by an assignment of a truth value to each atomic formula, from which truth values of compounded formulae are computed [5]. Interpretation is said to satisfy (or falsify) a formula, if, the truth value of under, is at least 0.5 (or at most 0.5). A formula is said to be unsatisfiable if and only if, it is falsified by all its interpretations. A set of clauses is unsatisfiable in fuzzy logic if and only if, it is unsatisfiable in binary logic [3]. Mukaidono [6,7] has generalized Lee’s result in the following way:

For two clauses in fuzzy logic, let

where and do not contain the literal and respectively as a factor and have no pair of complementary variables. Then the clause is said to be a classical resolvent of written as whose keyword is and the contradictory degree of the keyword is. A fuzzy resolvent of is written as where is the contradictory degree of the keyword or the confidence associated with the resolvent. They have computed the truth value of from the truth value of and the truth values of the atomic formulae. Then, it is proved a set of fuzzy clauses is unsatisfiable if and only if, there is a deduction of empty clause with its confidence of resolvent from Dubois and Prade [8] established fuzzy resolution principle in the case of uncertain proposition. In [9], antonym-based fuzzy hyper-resolution was introduced and its completeness was proved. S nchez et al. [10] proposed a fuzzy temporal constraint logic and introduced a valid resolution principle in order to explain/clarity some queries in this logic. Fontana and Formato [11] introduced a fuzzy resolution rule based on an extended most general unifier supplied by the extended unification algorithm. S. Raha and K. S. Ray [12] presented a generalised resolution principle that handles the inexact situation effectively and is applicable for both well-defined and undefined propositions. They associated a truth value to every proposition. We assume the fuzzy propositions to be completely true and, hence, do not associate partial truth value to the propositions. Our idea is to present, a generalised resolution principle that deals with the fuzzy propositions by the technique of inverse approximate reasoning. The advantage is that, it executes effective resolution and shows its flexibility for automated reasoning. To avoid the generic problem in handling generalised modus ponens (GMP) we use inverse approximate reasoning in fuzzy resolution. We also define fuzzy resolution on the basis of similarity/ dissimilarity measure of fuzzy sets, which is inherent in approximate reasoning.

Let us consider two clauses and . Resolvent of and denoted by if and only if similarity between and is greater than or equivalently, dissimilarity between and is less than, being pre-defined threshold. Instead of complementary literal, we introduce similar/dissimilar literal here. The argument form of simple Fuzzy Resolution is as follows.

The scheme for Generalised Fuzzy Resolution is given in Table 1.

In this case, we can say that the Disjunctive Syllogism holds if is close to is close to

The scheme in Inverse Approximate Reasoning looks like as given in the following Table 2.

Here, fuzzy sets and are defined over the universe of discourse and fuzzy sets and are defined over the universe of discourse

We shall transform the disjunction form of rule into fuzzy implication or fuzzy relation and apply the method of inverse approximate reasoning to get the required resolvent. However, in the case of complex set of clauses the method is not suitable. Hence, we investigate for another method of approximate reasoning based on similarity to get the fuzzy resolvent.

This paper consists of eight sections. In Section 2, we define and dicuss some basic concepts which are used in our paper. We briefly describe two methods of inverse approximate reasoning proposed in [13], in Section 3, and apply the method of inverse approximate reasoning towards fuzzy resolution in Section 4. Another method for fuzzy resolution in the case of complex clauses, is applied in Section 5. Section 6 is devoted with some artificial examples to illustrate the method. At last, in Section 7 some conclusions are made, follwed by some references.

Table 1. Generalised fuzzy resolution.

Table 2. Inverse approximate reasoning.

2. Preliminaries

To study ordinary approximate reasoning as well as inverse approximate reasoning, we have to deal with fuzzy sets, fuzzy relations and operations on fuzzy sets, fuzzy connectives not, and and. These are represented by the well known classes of negation functions (to model complement operators), continuous triangular norms (t-norms to model conjunction) and triangular conorms (t-conorms to model disjunction) respectively.

Some well-known t-norms and correlated t-conorms are listed in Table 3, where M, P, B indicate minimum, product, bounded product and drastic product respectively for t-norms, and maximum, algebraic sum and bounded sum respectively, for the correlated t-conorms.

Typically, a fuzzy rule “If is then is” (and are fuzzy sets) is expressed as, where is a fuzzy implication and and are membership grades of and respectively. From an algebraic point of view, some implication operators basically identified in [14] are classified with four families, where, known as QLimplication, is based on classical logic form and logical operators are substituted by fuzzy operators. Family, often named S-implication, derives from classical logic form Families and reflect a partial ordering on propositions and are based on a generalisation of modus ponens and modus tollens, respectively. Family is known as R-implication. With reference to the t-norms and t-conorms in Table 3, the explicit expressions of fuzzy implication operators are presented in Table 4.

Table 3. t-norms and t-conorms.

Table 4. Expression of fuzzy implication operators.

Here, some of the most popular implications such as the Kleene-Dienes, Reichenbach, Lukaseiwicz, Gödel and Gaines implication operators correspond to respectively.

The notion of similarity plays a fundamental role in theories of knowledge and behaviour and has been dealt with extensively in psychology and philosophy. If we study the behaviour pattern of children we find that, children have a natural sense to recognize regularities in the world and to mimic the behavior of competent members of their community. Children thus make decisions on similarity matching. The similarity between two objects suggests, the degree to which properties of one may be inferred from those of the other. The measure of similarity provided, depends mostly on the perceptions of different observers. Emphasis should also be given to different members of the sets, so that no one member can influence the ultimate result. Many measures of similarity have been proposed in the existing literature [15,16]. A careful analysis of the different similarity measures reveals, that it is impossible to single out one particular similarity measure that works well for all purposes.

Suppose U be an arbitrary finite set, and F(U) be the collection of all fuzzy subsets of U. For, a similarity index between the pair {A,B} is denoted as S(A,B;U) or simply S(A,B) which can also be considered as a function S:. In order to provide a definition for similarity index, a number of factors must be considered. We expect a similarity measure to satisfy the following axioms:

P1., not A being some negation of.

P2.

P3. if and only if.

P4. For two fuzzy sets and, simultaneously not null, if then for all, i.e.,.

P5. If either or then .

A similarity measure between two fuzzy sets satisfying these axioms can also be termed as a f-near-degree. For, if, we say that the two fuzzy sets and are -similar. We now consider a definition of measure of similarity which has been proposed in [17,18].

Definition 1—Similarity Indices: Let and be two fuzzy sets defined over the same universe of discourse The similarity index of pair is defined by

where is the cardinality of the universe of discourse and is the family parameter. Here, is a real number such that a large always gives a large similarity measure. It is left to the user to set for a problem. It is easy to say that the similarity measure referred to in the Definition 1 satisfies axioms P1, P2, P3, P4 and P5.

implies that “is at least as close to as is to”. as given in Definition 1 is quite sensitive-every change in or will be reflected in. Detailed clarification of choice of the definition is described in [18].

Measure of dissimilarity is another measure of comparison of objects in literature. Many authors like B. Meunier et al. [15] have defined measure of dissimilarity in different way. However, we use the dissimilarity measure in the context of similarity measure and consider measure of dissimilarity of two fuzzy subsets and defined over, denoted by as Moreover, we assume Through out the paper, we use this concept of dissimilarity. In the next section, method of inverse approximate reasoning is discussed briefly.

3. Inverse Approximate Reasoning

Let there be a fuzzy rule: “If flow rate is LOW then heating power is LOW”. Let us suppose that the “heating power is rather LOW”. Then, by the method of inverse approximate reasoning with a single rule, we may construct hypotheses which would explain the causes of observation by fuzzy mathematical method. Let us consider a second example as considered in [19]. Let there be two fuzzy rules: “if the traffic is crowded then the flow is low” and “if the visibility is weak then the flow is low”. Suppose, we observe “the flow is very low”. According to these two linguistic rules and the corresponding observation, we first construct hypotheses by abduction such as “the traffic is very crowded” or “the visibility is very weak” or “the traffic is very crowded and the visibility is very weak”. It is difficult to decide which are possible explanations for this observation. N. Mellouli and B. Bouchon-Meunier [20] have used generalised modus ponens (GMP) to construct abductive hypotheses and used the measure of similitude to construct the best possible explanation. Here, we consider a single rule for the method of inverse approximate reasoning.

Definition 2—Inverse Approximate Reasoning: Let

(1)

be a given rule, where and are fuzzy subsets defined over the universes of discourse and respectively. From a given fact “is”, where

is a fuzzy subset of we can conclude that “is”, where is a fuzzy subset of, by applying some method of approximate reasoning. This is called forward approximate reasoning. Now for given “is”, we consider be the set of all fuzzy subsets of such that for given “is” we can conclude “is” by the method of approximate reasoning. We have to choose the best member/s of (not empty) in some sense and define some inverse mapping from fuzzy subsets of into fuzzy subsets of, which we refer here as inverse approximate reasoning. We shall discuss briefly two methods of inverse approximate reasoning presented in [13] to establish fuzzy resolution principle.

3.1. Similarity Based Inverse Approximate Reasoning

Our aim, in [13], was to feed the method of similaritybased approximate reasoning [17] to inverse approximate reasoning by writing the rule into its equivalent form. Let, be two linguistic variables and, be their respective universes of discourse. Two typical propositions “p” and “q” are given in scheme as presented in Table 2 and we may derive a conclusion according to similarity based inference method [17] of the scheme in Table 2. The membership values of and are defined as before. Unlike the existing similarity based methods, a convenient way to represent a rule given by premise “p” is in the form of a fuzzy relation. The rule in premise “p” may be transformed into its equivalent form “” of the given premise “p”. We represent this equivalent rule by a fuzzy relation [21]. Usually, is defined on the basis of one of the operation, where is associative, commutative and the conjunction operator in the GL-monoid. is the residuation operation associated with the conjunction and can be viewed as the valuation function for the implication; is an alternative to the lattice operation (in this case simply the “min” operation) for the valuation of the conjunction. Then for a given fact, the similarity between the fact and the antecedent of the equivalent form of the given rule denoted by “p” is computed and is used to modify the relation. Here, every change in the concept, as it appears in the conditional equivalent premise and in the fact, is incorporated into the induced fuzzy relation (say,). The conclusion may then be drawn using the projection operation, valuating the existential quantifier by the supremum and the conjunction by the operation. We obtain the definition of the composition of a fuzzy relation and a fuzzy set as

In order to avoid the use of rule-misfiring, we modify the inference scheme in such a way that significant change will make the conclusion less specific. This is done by choosing an expansion type of inference scheme. Here, the “UNKNOWN” case, i.e., the fuzzy set, is to be taken as the limit of non-specificity. Explicitly, when the similarity value becomes low, i.e., when and differ significantly, the inference should be As for, we expect that and for all other, the relation holds. This in turn implies that, nothing better than what the rule says, should be allowed as a valid conclusion. In view of the above observation we propose a scheme for computation of in the following algorithm.

ALGORITHM-SIAR:

Step 1. Translate given premise and compute using some suitable translating rule (possibly, a t-norm).

Step 2. Compute similarity measure using some suitable definition .

Step 3. Modify with to obtain the modified conditional relation using some scheme C.

Step 4. Use sup-projection operation on to obtain as

(2)

In [17,18], authors have proposed two schemes for computation of the modified conditional relation as given in Step 3, the general form of which is given by:

Scheme C:

where is any implication function. As previously done in [13], We have

(3)

and when the conditional relation is interpreted as a t-norm we get

Otherwise, by SIAR could be anything. From (2) and (3) it is found that when we have In other words, it is impossible to conclude anything when are completely dissimilar, i.e., are completely similar. When is close to unity, is close to . Hence, the inferred fuzzy set will be close to, i.e., is close to unity. Scheme also ensures that a small change in the input produces a small change in the output and hence, in this sense the above mechanism of inference is reasonable. Let us consider the model as in Table 2 and a theorem is established as follows:

Theorem 1: For all and,

We have investigated another method to deal with fuzzy implication operators in inverse approximate reasoning.

3.2. Method Using Cylindrical Extension and Projection—INAR

We now consider the scheme given in Table 2 and investigate the scheme for generalised modus tollens (GMT). We describe the method simply by an algorithm.

ALGORITHM-INAR:

Step 1. Translate the rule into a fuzzy relation or implication operator.

Step 2. Take the of fuzzy subset in on and let it be.

Step 3. Construct, where is defined by any fuzzy conjunction operator.

Step 4. Obtain.

Symbolically, we get,

is a t-norm

by definition of cylindrical extension, which establishes the CRI in the form of GMT. We have to select an appropriate fuzzy implication for the fuzzy relation in Step 1 so as to model GMT. Also the standard negation of the resulted fuzzy set obtained by GMT also gives the given observation by applying GMP. Hence, mathematical formulation of the above algorithm is:

(4)

We now deduce some theorems from which we can establish the reasonableness of the method in which negation operator is taken as standard strong negation.

Theorem 2: Let be normal and. Then, whenever the following implications satisfy the Equation (4) for any t-norm T:

1) Reichenbach S-implication; 2) Kleene-Dienes S-implication and 3) Lukasiewicz R and S-implication.

Theorem 3: Let be normal and. Then, whenever both the relation and conjunction in the Equation (4) are defined by any t-norm.

Theorem 4: Let be normal and. Then, whenever the Rescher-Gaines R-implication satisfies the Equation (4) for any t-norm T.

Theorem 5: Let be normal and. Then, if and, if, whenever Gödel R-implication and Gougen R-implication satisfy the Equation (4) for any t-norm T.

We observe in the above theorems that if then either will be or close to, that is, we may use GMT in the case of inverse approximate reasoning to get an output in the antecedent part of the given rule and the negation of this output may give by applying GMP. So, we first consider the similarity between and. If the similarity measure between these two is very very low, i.e., then we expect similarity between and to be very low, i.e.,. If the similarity measure between these two is very very high, i.e., then we cannot make any specific conclusion about the similarity between and. Therefore, the method of inverse approximate reasoning demands dissimilarity between the specific observation and the consequent of the given rule. So we can apply the method in fuzzy resolution.

4. Fuzzy Resolution Based on Inverse Approximate Reasoning

Lately researchers discuss and explore the validity of many classical logic tautologies in fuzzy logic, especially those that involve fuzzy implications. We attempt to exploit such a classical logic equivalence to deal with fuzzy resolution in the framework of inverse approximate reasoning methodology. In classical logic

(5)

when extending this classical logic equivalence to fuzzy logic, we interpret the disjunction and negation as a fuzzy union (t-conorm) and a fuzzy complement, respectively. Fuzzy implication thus obtained is usually referred to in the literature as S-implication.

We now consider the classical logic tautology which is obtained from (5).

(6)

Therefore, we can extend the classical equivalence (6) into fuzzy logic where fuzzy union is transformed to fuzzy implication.

In fuzzy resolution we deal with the rule of the type “is A or Y is B”. Like classical logic, we may transform the rule into “If is then is” into fuzzy logic. Then the rule is executed in the method of Inverse Approximate Reasoning described in [13] to obtain the disjunct. The equivalent scheme of Table 1 that conforms fuzzy resolution is given in the Table 5.

We have demonstrated earlier in [13] that—if the give data is sufficiently dissimilar to the consequent part of a

Table 5. Equivalent scheme conforms fuzzy resolution.

given rule then one may conclude that the resulting fuzzy set is sufficiently dissimilar to the antecedent part of the rule. Applying this method in the scheme given in Table 5, we get the required resolvent which establishes the fuzzy resolution principle. So the algorithm is as follows.

ALGORITHM-FRIAR:

Step 1. Translate the rule into fuzzy implication as

where is an implication operator.

Step 2. Take cylindrical extension of in on say, defined by

Step 3. Construct

where denotes any fuzzy conjunction operator.

Step 4. Obtain on defined by

Mathematically, we get

(7)

where is a t-norm used to describe fuzzy conjunction operator.

It is expected that, for the observation “is” and the given premise “is or is” we can conclude “is” by fuzzy resolution. However, for the the observation “is” no conclusion can be drawn. We establish the above criteria by the following theorems.

Theorem 6: Let be normal and be interpreted by any S-implication satisfying Equation (7). Then for any t-norm.

Proof: We prove the theorem only for Reichenbach S-implication and Proofs for other implications are same as it.

Corollary: Let be normal and be interpreted by any S-implication satisfying Equation (7). Then for Lukasiewicz t-norm.

wang#title3_4:spProof:

Example 2: Consider the premises

in which and are defined over the universes and respectively and fuzzy sets labelled by, and are defined by

The similarity between fuzzy sets and is, i.e., fuzzy set in observation is dissimilar to fuzzy set in the disjunctive form of rule.

Again, by INAR, we study the shape of the resolvent for data given in above with different S-implications and different t-norms, which is described in the Tables 6-8.

The result shows that the dissimilarity between and B assures the similarity between and A when the reasoning mechanism is handled using inverse approximate reasoning.

“given a disjunction and the negation of one of the disjuncts, the other may be inferred” is established in fuzzy logic.

Example 3: Now, we consider the scheme and data of Example 2 except. Consider in Equation (4). We shall observe the results for the given premise “”and data in Example 2.

In this case, , i.e., fuzzy sets and are dissimilar.

Table 6. for Reichenbach S-implication.

Table 7. for Kleene-Dienes S-implication.

Table 8. for Lukasiewicz S-implication.

Let us execute the reasoning mechanism by INAR. The results are shown in Tables 9-11 respectively for different implications and t-norms.

That is, if is not exactly match with but these are dissimilar, the fuzzy resolvent can be obtained through inverse approximate reasoning method. The technique is very new one.

Theorem 7: Let be normal and be interpreted by any implication satisfying Equation (7). Then for any t-norm.

wang#title3_4:spProof:

Hence,.

We prove the theorem for Reichenbach S-implication and only, but the above theorem can be proved for any other implications and any other t-norms in the similar way.

Example 4: In Example 2, if we take

in Equation (4) then either by SIAR or by INAR we get, for

Table 9. Another for Reichenbach S-implication.

Table 10. Another for Kleene-Dienes S-implication.

Table 11. Another for Lukasiewicz S-implication.

all of the cases.

Theorem 8: Let be normal and be interpreted by Rescher-Gaines R-implication satisfying Equation (7). Then for any t-norm.

Proof:

Example 5: For the data given in Example 2, applying INAR for Recher-Gaines R-implication combined with any t-norm, we get the fuzzy resolvent as

which is a subset of A and It establishes Theorem 8.

Observation: In Example 2, for another

, we also get the fuzzy resolvent

when we apply INAR with Rescher-Gaines R-implication. However, considering other R-implications, except, Lukasiewicz R-implication we cannot get such a fuzzy resolvent which is a subset of for the same input data, although the fuzzy resolvent obtained is significant.

We are now going to aplpply another method SIAR [13] to obtain fuzzy resolvent for the scheme given in Table 1. Let us consider another classical logic equivalence

(8)

The classical logic equivalence (8) can be extended in fuzzy logic with implication and negation function. Then we transform the rule in Table 1 into its equivalent form “If is then is” over the domain of. A fuzzy rule may be defined by means of a conjunction for defining a fuzzy Cartesian product rather than in terms of a multivalued logic implication [13,22].

Therefore, the rule in is transformed into fuzzy relation as

(9)

where is a t-norm describing a fuzzy conjunction.

Now we can apply our method SIAR described in [13]. The algorithm is as follows:

ALGORITHM-FRSIAR:

Step 1. Translate given premise and compute by Equation (9).

Step 2. Compute similarity measure using some suitable definition .

Step 3. Modify with to obtain the modified conditional relation using in (3).

Step 4. Use sup-projection operation on to obtain as

(10)

We shall illustrate the method applied here by some suitable examples.

Example 6: Let us consider the data in Example 2. For completely dissimilar B^{*} with B and for different t-norms, the shapes of fuzzy resolvent in are studied here, when we apply SIAR. The subsequent results are shown in Table 12. In each case, it turns out exacltly the fuzzy set which corresponds.

Example 7: Consider the data in Example 2 where is not completely dissimilar with, but dissimilarity exceeds certain threshold. Then, applying SIAR we observe the shapes of and compare it with given for different t-norms, which is shown in Table 13.

Since, i.e., is almost similar to, it establishes fuzzy resolution in reasoning.

In the above methods, we apllied INAR or SIAR when the disjunctive knoledge can be transformed into fuzzy implication. However, it may not always be the case. Moreover, when the expert knowledge is in complex form of disjunction it is difficult to apply INAR or SIAR. So, we extend our method in such a way that can deal with complex premises.

Table 12. Fuzzy resolvent.

Table 13. for another.

5. Fuzzy Resolution with Complex Clauses

In this section, we shall extend the scheme given in Table 1. Let, and be three linguistic variables that take values from the domain U, V and W respectively. We consider the derivation of an inexact conclusion “” from two typical knowledge (premises) “” and “” acording to the scheme given in Table 14, where’s,’s and’s are approximations of possibly inexact concepts by fuzzy sets over U, V and W respectively.

In 1993, Raha and Ray [12] applied Zadeh’s [23] concept of approximate reasoning with the application of possibility theory to model a deductive process “Generalised Disjunctive Syllogism”. They used projection principle and conjunction principle to deduce fuzzy resolvent. However, the method could not reduce the shortfall of Zadeh’s Compositional rule inference. We have found the shortfalls in [12] as follows:

1) Let fuzzy resolvent be for in the scheme given in Table 14, by the method of Raha and Ray [12]. The fuzzy resolvent also be same for taking as either or

2) If we interchange and the same fuzzy resolvent will be produced.

Therefore, firing a rule on the basis of the observation could be harmful. So, it is necessary to modify the relation generated by the two given premises, with the similarity measure of two fuzzy sets involved in the disjunctive form of rules so that the shortfall can be removed. If a pair of fuzzy sets involved having dissimilarity greater than certain pre-defined threshold value, we get our expected fuzzy resolvent using some deductive reasoning. Hence, we investigate another method which is described in the following algorithm.

ALGORITHM-FRCEP:

Step 1. Translate the premise into fuzzy relation

Table 14. Generalised fuzzy resolution—extended form.

as

Step 2. Translate the premise into fuzzy relation

as

Step 3. Take cylindrical extension of in on say, defined by

Step 4. Take cylindrical extension of in on say, defined by

Step 5. Construct where denotes any fuzzy conjunction operator;

Step 6. Compute and, say,;

Step 7. Modify with by Scheme in (3) and, say,;

Step 8. Obtain on defined by

Step 9. Obtain and by projecting R separately on U and W such that and

Symbolically, the fuzzy resolvent is obtained by, for, and,

This derivation can be achieved if there is a such that and which is possible if the fuzzy sets and are dissimilar, i.e., and are similar for any implication in derivation. We observe two criteria here.

Criterion 1: Taking we get

Criterion 2: Taking we get

From above two criteria we observe that when, i.e., when and are completely similar Therefore, fuzzy resolvent could be anything. However, if is close to unity, i.e., if and are almost dissimilar we have is close to

which, after re-translation, gives “If is or is”. Again, we observe that a small change in produces a small change in fuzzy resolvent—which ensures our method is resonable one.

Let us now investigate another method to find a fuzzy resolvent from a complex set of clauses. It is observed that, to obtain a fuzzy resolvent from two clauses containing a pair of complementary literals defined over the same domain. If the dissimilarity measure of the complementary literals is unity then we get the resolvent by the disjunction of remaining literals and subsequent removal of the complementary literals. The keyword of the fuzzy resolvent is any one of the complementary literals, the degree of confidence of which is measured by the dissimilarity measure of the complementary literals. However, in the case of almost complementary literals for which dissimilarity value does not attain unity, but exceeds a certain pre-defined threshold, we modify the remaining literals with the measure of dissimilarity in such a way that dissimilarity measure of complementary literals tends to unity and we obtain the resolvent by taking the disjunction of modified literals removing the complementary literals. If the dissimilarity measure of a pair of literals is either zero or close to zero, we cannot obtain a fuzzy resolvent. In this way, we can proceed for a method to find out the derivation of the empty clause and establish the refutation method for the proof of a theorem. The degree of confidence of the empty clause is measured by the degree of confidence of keyword that generated the empty clause and, thus, a sort of completeness of fuzzy resolution principle is established.

Let us consider a scheme given in Table 15 where

Table 15. Generalised fuzzy resolution—another extension.

variables and the respective fuzzy subsets are defined on universe repectively; variables and the respective fuzzy subsets are defined on universe repectively. is almost complementary over the same universe with the degree of confidence of keyword is and the corresponding are defined over respectively.

To show the method we set up an algorithm FRAE as follows:

ALGORITHM-FRAE:

Step 1. Check the domain of pair of literals, from clauses and;

Step 2. If the pair remains in the same domain, say, then measure the dissimilarity of; Otherwise, there is no fuzzy resolvent;

Step 3. Dissimilarity of, i.e., is computed by

Step 4. If is very very high, i.e., is pre-defined threshold then go to the next step and say, is keyword; Otherwise, there is no fuzzy resolvent;

Step 5. Modify B_{i} either by or by

Step 6. Fuzzy resolvent is

and

which is measured as

Step 7. Repeat the process until empty clause, with the confidence, is derived for more than two clauses.

Hence, we prove the (un)satisfiability of a theorem by the deduction of empty clause from a set of fuzzy clauses.

6. Artificial Examples

We consider examples to illustrate the models presented in this paper. Let us consider variables that range over finite sets or can be approximated by variables ranging over such sets.

Example 8: Consider the premises

in which, and are defined over the respective universes, and and fuzzy sets labelled by , and are defined by

The similarity between fuzzy sets and is, i.e.,. Therefore, in two clauses, fuzzy sets in observation is dissimilar to fuzzy set. Hence, we can resolve upon dissimilar pair. We apply ALGORITHM-FRCEP to get the resolvent.

We construct where denotes any fuzzy conjunction operator and

We modify with as we get (using Scheme and in Table 3) and we get

We can also obtain and by

which are same as and respectively, since the dissimilarity between and is zero.

Again, it is observed that same, and are obtained for different fuzzy conjunctions (t-norms, here) described in Table 3. However, for different in premise, it yields different results.

Let us consider . Similarity between and is i.e., dissimilarity between and is very low, being less than pre-defined threshold value 0.34(). By applying ALGORITHM-FRCEP, we get the fuzzy resolvent as

for t-norms M, P and B in Table 3, and by projection we obtain

Similarity between and is and similarity between and is which is our expected result.

Now, if we consider another , similarity of which with is i.e., dissimilarity of it with is less than then, we find the resolvent as

for different t-norms in Table 3 and

with and

Another example can be illustrated whenever number of premises is more than two.

Example 9: Let us consider the premises

where, , and all the fuzzy sets are defined as earlier. Here, is defined by

Selection of keywords: Since, in premise p and in premise q are fuzzy subsets in the same universe U and similarity between and, i.e., , we resolve upon the keyword, taking the premises p and q together as and completely dissimilar. Again, in premise p and in premise r are fuzzy subsets over the same universe V and. Therefore, after resolving with and we resolve upon the keyword B with taking and together. Next, we execute the following steps with the given data, using ALGORITHMFRCEP.

Execution:

Step 1: Compute the fuzzy relation by

Step 2: Extend in U cylindrically on as

Step 3: Compute by

taking fuzzy conjunction as t-norm;

Step 4: Modify with to get as

Step 5: Project on such that

Step 6: Extend in cylindrically on as

Step 7: Compute

by

taking fuzzy conjunction as t-norm;

Step 8: Modify with to get as

Step 9: Project on such that

which is completely similar to, i.e.,.

Even if and in the respective premises and, are not completely dissimilar to and respectively, but the dissimilarity measures attain values greater than certain pre-defined threshold then we can get a fuzzy resolvent which is almost similar to, using FRCEP.

Suppose,

are computed.

Then, it yields

with

Therefore, it is possible to get a fuzzy resolvent from a set of fuzzy clauses if there is a pair of dissimilar literals contained in the respective clauses.

7. Conclusion

This paper presented a resolution principle for fuzzy formulae based on similarity and approximate reasoning methodology. Similarity is inherent in approximate resoning and resolution deduction can be used as a rule of inference to generate new clause from a given set of clauses. The essential idea of resolution of two clauses is to search for a literal in a clausal formula that is almost complementary to a literal in the other form. The clause formed by the disjunction of the remaining literals and subsequent removal of the pair of almost complementary literals is a logical consequence. If we put the resolvents in the set of clauses its behaviour (satisfiability) never changes. It can be applied directly to any set S of clausal formulae (not necessarily to ground clauses) to test the (un)satisfiability of S. To test the unsatisfiability it checks whether S contains the empty clause (as a resolution deduction). This could be a powerful technique in constructing a proof of a theorem using refutation procedure. Examples cited in the paper attempted to demonstrate how resolution can be effectively used to construct a proof of a theorem. Inverse approximate reasoning may be applied to model different goal-directed search techniques. We apply inverse approximate reasoning method to avoid the inherent problem of GMP. Instead of testing complementary literals we use dissimilarity concept of fuzzy literals.

8. Acknowledgements

This research has been partially supported by the UGC SAP (DRS) Phase-II project under the Department of Mathematics, Visva-Bharati.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | J. A. Robinson, “A Machine Oriented Logic Based on the Resolution Principle,” Journal of the ACM, Vol. 12, No. 1, 1965, pp. 23-41. doi:10.1145/321250.321253 |

[2] | J. J. Kelly, “The Essence of Logic,” Prentice-Hall, New Delhi, 1997. |

[3] | R. C. T. Lee and C. L. Chang, “Some Properties of Fuzzy Logic,” Information and Control, Vol. 19, No. 1, 1971, pp. 417-431. doi:10.1016/S0019-9958(71)90684-X |

[4] | R. C. T. Lee, “Fuzzy Logic and the Resolution Principle,” Journal of the ACM, Vol. 19, No. 1, 1972, pp. 109-119. doi:10.1145/321679.321688 |

[5] | D. Dubois, J. Lang and H. Prade, “Fuzzy Sets in Approximate Reasoning, Part 2: Logical Approaches,” Fuzzy Sets and Systems, Vol. 40, No. 1, 1991, pp. 203-244. doi:10.1016/0165-0114(91)90051-Q |

[6] | Z. Shen, L. Ding and M. Mukaidono, “Fuzzy Resolution Principle,” Proceedings of the 18th International Symposium on Multivalued Logic, Palma de Mallorca, 24-26 May 1988, pp. 210-215. doi:10.1109/ISMVL.1988.5176 |

[7] | M. Mukaidono, “Fuzzy Inference of Resolution Style,” In: R. R. Yager, Ed., Fuzzy Set and Possibility Theory, Per- gamon Press, New York, 1988, pp. 224-231. |

[8] | D. Dubois and H. Prade, “Necessity and the Resolution Principle,” IEEE Transactions on Systems, Man and Cybernetics, Vol. 17, No. 3, pp. 474-478. |

[9] | C. S. Kim, D. S. Kim and J. Park, “A New Fuzzy Resolution Principle Based on the Antonym,” Fuzzy Sets and Systems, Vol. 113, No. 2, 2000, pp. 299-307. doi:10.1016/S0165-0114(98)00063-3 |

[10] | M. A. C. Viedma, R. M. Morales and I. N. Sanchez, “Fuzzy Temporal Constraint Logic: A Valid Resolution Principle,” Fuzzy Sets and Systems, Vol. 117, No. 2, 2001, pp. 231-250. doi:10.1016/S0165-0114(99)00099-8 |

[11] | F. A. Fontana and F. Formato, “A Similarity-Based Resolution Principle,” International Journal of Intelligent Systems, Vol. 17, No. 9, 2002, pp. 853-872. doi:10.1002/int.10067 |

[12] | S. Raha and K. S. Ray, “Approximate Reasoning Based on Generalised Disjunctive Syllogism,” Fuzzy Sets and Systems, Vol. 61, No. 2, 1994, pp. 143-151. |

[13] | B. Mondal and S. Raha, “Similarity-Based Inverse Approximate Reasoning,” IEEE Transaction on Fuzzy Systems, Vol. 19, No. 6, 2011, pp. 1058-1071. doi:10.1109/TFUZZ.2011.2159981 |

[14] | B. Lazzerini and F. Marcelloni, “Some Considerations on Input and Output Partitions to Produce Meaningful Conclusions in Fuzzy Inference,” Fuzzy Sets and Systems, Vol. 113, No. 2, 2000, pp. 221-235. doi:10.1016/S0165-0114(98)00096-7 |

[15] | B. Bouchon-Meunier, M. Rifqi and S. Bothorel, “Towards General Measures of Comparison of Objects,” Fuzzy Sets and Systems, Vol. 84, No. 2, 1996, pp. 143-153. doi:10.1016/0165-0114(96)00067-X |

[16] | R. Zwick, E. Carlstein and D. V. Budescu, “Measures of Similarity among Fuzzy Concepts: A Comparative Analysis,” International Journal of Approximate Reasoning, Vol. 1, No. 2, 1987, pp. 221-242. doi:10.1016/0888-613X(87)90015-6 |

[17] | B. Mondal, D. Mazumdar and S. Raha, “Similarity in Approximate Reasoning,” International Journal of Computational Cognition, Vol. 4, No. 3, 2006, pp. 46-56. |

[18] | S. Raha, N. R. Pal and K. S. Ray, “Similarity Based Approximate Reasoning: Methodology and Application,” IEEE Transactions on Systems, Man and Cybernatics, Part A: Systems and Humans, Vol. 32, No. 4, 2002, pp. 541-547. doi:10.1109/TSMCA.2002.804787 |

[19] | N. Mellouli and B. Bouchon-Meunier, “Fuzzy Approaches of Abductive Inference,” Proceedings of the 8th International Workshop Non-Monotonic Reasoning, Breikenridge, 2000. |

[20] | N. Mellouli and B. Bouchon-Meunier, “Abductive Reasoning and Measure of Similitude in the Presence of Fuzzy Rules,” Fuzzy Sets and Systems, Vol. 137, No. 1, 2003, pp. 177-188. doi:10.1016/S0165-0114(02)00439-6 |

[21] | F. Klawonn and J. L. Castro, “Similarity in Fuzzy Reasoning,” Mathware and Soft Computing, Vol. 3, 1995, pp. 197-228. |

[22] | L. Ughetto, D. Dubois and H. Prade, “Implicative and Conjunctive Fuzzy Rule—A Tool for Reasoning from Knowledge and Examples,” Proceedings of the 16th National Conference on Artificial Intelligence and the 11th Innovative Applications of Artificial Intelligence Conference, American Association for Artificial Intelligence, Menlo Park, 1999, pp. 214-219. |

[23] | L. A. Zadeh, “A Theory of Approximate Reasoning,” In: J. E. Hayes, D. Michie and L. I. Mikulich, Eds., Machine Intelligence, Vol. 9, Elsevier, New York, 1979, pp. 149-194. |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.