Patent Publication Number: US-2023142543-A1

Title: Augmented knowledge base and reasoning with uncertainties and/or incompleteness

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application is a continuation application of U.S. patent application Ser. No. 17/127,030, filed on Dec. 18, 2020, which is a continuation application of U.S. patent application Ser. No. 15/587,917, filed on May 5, 2017, now U.S. Pat. No. 10,878,326, which is a continuation application of U.S. patent application Ser. No. 14/994,635, filed on Jan. 13, 2016, now U.S. Pat. No. 9,679,251, which is a continuation of U.S. patent application Ser. No. 13/836,637, filed Mar. 15, 2013, now U.S. Pat. No. 9,275,333, and which is based upon and claims priority to prior US Provisional Patent Application No. 61/645,241 filed on May 10, 2012 in the US Patent and Trademark Office, the entire contents of which are incorporated herein by reference. 
    
    
     FIELD 
     The embodiments of the present invention relate to a computer implemented knowledge-based system and reasoning with uncertainties and/or incompleteness. 
     BACKGROUND 
     Reasoning with uncertainties and/or incompleteness refers to the various processes leading from evidences or clues to conclusions or guesses using uncertain, vague, partial, incomplete and/or limited information. Reasoning with uncertainties mostly refers to information which are uncertain, vague and/or inexact; while reasoning with incompleteness refers to information which are incomplete, partial and/or limited. A knowledge-based system under uncertainties and/or incompleteness is a knowledge base where reasoning with uncertainties and/or incompleteness are involved. 
     Knowledge-based systems involving uncertainties and/or incompleteness have been studied widely in the literature. Many approaches have been introduced to model such knowledge bases, but none are satisfactory in general. 
     The basic building blocks of knowledge bases are knowledge, which are usually represented as rules, propositions, or other equivalent means. 
     Moreover, in most traditional knowledge bases with uncertainties and/or incompleteness, each piece of knowledge in the knowledge base is associated with or mapped to a number, variably referred to as belief, certainty factor, likelihood, weight, etc. 
     To perform reasoning/inferences, either an extension scheme for the mapping mentioned above, or a conditioning/composition rule must be specified. 
     SUMMARY 
     According to embodiments of the invention, a new knowledge-based system under uncertainties and/or incompleteness, referred to as augmented knowledge base (AKB) is provided; and methods for constructing, reasoning, analyzing and applying AKBs are provided. In addition, a new method for reasoning under uncertainties and/or incompleteness is provided. This method will be referred to as augmented reasoning (AR). Advantages and powers of are described herein. 
     According to an aspect of an embodiment, a method and apparatus are provided for representing a knowledge base by creating objects in the form E→A, where A is a rule in the knowledge base, and E is a set of evidences that supports the rule A; and determining, by deductive reasoning using the knowledge in the knowledge base and/or inducting or extracting new knowledge from the knowledge base; and constructing higher order knowledge bases to insure that the knowledge base is consistent. Such knowledge base will be referred to as augmented knowledge base. For example, a composite set of evidences G is computed, the composite set of evidences G is a combination of sets of evidences E in the knowledge base in support of a target rule L that is implied by a combination of rules in the knowledge base. 
     These and other embodiments, together with other aspects and advantages which will be subsequently apparent, reside in the details of construction and operation as more fully hereinafter described and claimed, reference being had to the accompanying drawings forming a part hereof, wherein like numerals refer to like parts throughout. 
    
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         FIG.  1    is a functional block diagram of an augmented knowledge base (AKB) computer system, according to an embodiment of the present invention. 
         FIG.  2    is an example data structure of an AKB with example data entries, according to an embodiment of the present invention. 
         FIG.  3    provides the basic mechanism for deductive reasoning on an AKB, according to an embodiment of the present invention. 
         FIG.  4    is a flow diagram of an example unification algorithm, according to an aspect of an embodiment of the invention. 
         FIG.  5    provides types of measures for representing the strength of a body of evidences, according to an embodiment of the present invention. 
         FIG.  6    is a flow diagram of deductive inference in AKB, according to an embodiment of the present invention. 
         FIG.  7    is a table of methods for testing and ensuring properties of AKB, according to an embodiment of the present invention. 
         FIG.  8    is a flow diagram of inductive inference in AKB, according to an embodiment of the present invention. 
         FIG.  9    is a flow diagram of constructing consistent higher order AKBs, according to an embodiment of the present invention. 
         FIG.  10    is a diagram for illustrating the relations for generating a free-form database, augmented relational database, augmented deductive database and augmented inductive database, according to an embodiment of the present invention. 
         FIG.  11    is a flow diagram for generating graph representations of constraints for bodies of evidences, according to an embodiment of the present invention. 
         FIG.  12    is a flow diagram of checking for admissibility, according to an embodiment of the present invention. 
         FIG.  13    is a flow diagram of checking for compatibility between the measure and the collection of constraints, according to an embodiment of the present invention. 
         FIG.  14    is a flow diagram of guaranteeing compatibility, according to an embodiment of the present invention. 
         FIG.  15    is a flow diagram of preprocessing, according to an embodiment of the present invention. 
         FIG.  16    is a functional block diagram of a computer, which is a machine, for implementing embodiments of the present invention. 
     
    
    
     DETAILED DESCRIPTION OF EMBODIMENT(S) 
     Section 1. Augmented Knowledge Base 
     According to an aspect of an embodiment, a knowledge based system refers to a system comprising a knowledge base for representing knowledge, acquisition mechanisms and inference mechanisms, an augmented knowledge base κ includes one or more objects of the form E→A, where A is a logical sentence in a first-order logic, a proposition and/or a rule (referred to collectively herein as ‘a rule’) in the traditional sense; and E is a set of evidences (a plurality of evidences) as a body of evidences that supports A. Moreover, each given body of evidences (not each rule as in a typical knowledge base) is mapped to or associated with a value. 
     Since bodies of evidences are sets, in an aspect of an embodiment, the relations among the bodies of evidences are considered. The ability of AKBs to deal with relationships among the bodies of evidences, or its capability to take into account constraints imposed on the bodies of evidences, is a unique feature of AKB, which can lead to more powerful, robust, accurate and/or refined characterizations of the knowledge base. 
     In an embodiment of the present invention, inference or reasoning in an AKB is done in two separate phases: Form the body of evidences that supports the target rule, and then determine the value associated with the resulting body of evidences. The second phase can be done in many different ways, including the reasoning scheme AR based on constraint stochastic independence method, which is part of this invention. AR provides a clear probabilistic semantics, resulting in the elimination of virtually all known anomalies associated with existing formalisms of uncertain reasoning and knowledge bases. 
     In addition, in an aspect of an embodiment, we provide methods for testing and ensuring certain properties of AKBs, including consistency, completeness, monotonicity, contribution, vulnerability, deception, etc. 
     Moreover, in an aspect of an embodiment, we show how AKBs can be used for inductive inference. Indeed, we show that inductive inference can be used to extract meaningful new knowledge from AKBs provided certain consistency conditions are met. 
     Furthermore, in an aspect of an embodiment, we provide methods to guarantee (also referred to herein as a substantial guarantee) a required (or specified) consistency via higher order AKBs. 
     Lastly, in an aspect of an embodiment, we show how AKBs can be used to build free-form database (FFDB). We then show how FFDB can be used to formulate augmented relational databases, augmented deductive databases and augmented inductive databases. The latter can be used for extracting new information from relational databases (e.g. data mining). 
     In an embodiment of the present invention, a method for solving the following aged-old problem is provided: Given two arbitrary sets A and B, if the probabilities, p(A) and p(B), of both sets are known, what is the probability of their intersection, i.e., p(A∩B)? This problem could be trivial if the probability is defined over the entire probability space. However, in many important applications, such as reasoning with uncertainty, which is one of the main concerns of this invention, the probabilities of only a few sets are given and there is a need to determine the probabilities of other sets formed from these sets, i.e., extending the probability measure from a given collection of sets to a larger collection of sets formed from the given sets. Knowing how to compute p(A∩B) from p(A) and p(B) provides the cornerstone for the extension schemes. 
     The extension scheme given in an embodiment of the present invention uses an average method to determine the probability of the new set. It has a clear probabilistic semantics, and therefore not subject to the anomalies that are usually associated with other extension schemes. 
     Moreover, in an aspect of an embodiment, the present invention is capable of dealing with constraints imposed on the sets that are given. 
     Furthermore, in an aspect of an embodiment, necessary and sufficient conditions for the extension to be well-defined, as well as, necessary and sufficient conditions for compatibility are provided. 
     Lastly, in an embodiment of the present invention, a preprocessing algorithm is provided so that the extension can be computed more efficiently. 
     Let κ be an AKB. The A in (E→A) is a rule in κ, which can be a logical sentence in a first-order logic, a proposition and/or a rule in a traditional knowledge base. In this case, we say that Aϵ , i.e., A is a member of  , where    
     is the collection of all knowledge of interest. On the other hand, the E in (E→A) is a set, representing a body of evidences, and is not a rule. In this case, we say that E⊆U, i.e., E is a subset of U, where U is a universal set of evidences. Moreover, the (E→A) is not a rule either. It specifies that the body of evidences E supports the rule A. More precisely, if E is established or true, then A is true. This signifies that the full force of E devolves on A. Associating a body of evidences (i.e., a set of evidences) with a rule is a novel feature of this invention and is a central characteristic of augmented knowledge bases. The bodies of evidences supporting a rule can be obtained from many different sources (including expert opinions, scientific literature, news articles, blogs, etc.) and can be determined either subjectively or objectively. 
     In the rest of this document, ⊆ will always denote ‘is a subset of’, while ϵ will denote ‘is a member of’ or ‘belonging to’. 
     In most traditional knowledge-based systems that deal with uncertainties and/or incompleteness, rules are associated with numbers. These numbers are variably referred to as beliefs, certainty factors, likelihood, weight, etc. On the other hand, as illustrated in  FIG.  1   , in an AKB computer system 100, each rule A in an AKB is associated with a ‘set’ E—the body of evidences (plural or two or more evidences) that supports the rule. In addition, in contrast to typical knowledge bases, according to an embodiment of, a set of evidences E as a given body of evidences (not each rule) is mapped to or associated with a value (e.g., weight) (see also  FIG.  2   ). These are several unique features of AKB. In  FIG.  1   , a computer 120 is configured to provide the described augmented knowledge base functions, including storing an augmented knowledge base  130 . Experts and other sources  110  refer to one or more processing devices (e.g., computer, mobile device, mobile phone, etc.) as sources of evidences (E) and/or rules (A) to the AKB computer 120  over one or more data communication technologies, such as Internet, wire, wireless, cellular phone network, etc. The form of information of the experts and other sources  110  can be a database, blog, chat rooms data, social network website databases, other knowledge bases, etc. The  FIG.  2    is an example data structure of an augmented knowledge base (AKB)  150  with example data entries for the AKB, according to an embodiment of the present invention. The embodiments utilize entries of the AKB, such as  FIG.  2   , to further augment a knowledgebase of rules in    154  by determining (outputting or computing) support for a desired (target) rule L, namely an unknown rule that would like to be established. According to an aspect of an embodiment a target rule L can be added to the rules in    154  in the AKB  150 . 
     In  FIG.  2   , for example,  154  is  , which is the collection of all knowledge in form of rules A  155  of interest. The body of evidences  160  (E) support the respective rules  155  (A) (i.e., (E→A)). In  FIG.  2   , the body of evidences  160  (E) is mapped to a number  160 , variably referred to as belief, certainty factor, likelihood, weight, etc. Sources  110  for the evidences are also provided. The constraints  165  are relationships among the bodies of evidences Es  156  (the capability to take into account constraints  165  imposed on the bodies of evidences Es  156 ), which is a feature of AKB to derive more powerful, robust, accurate and/or refined characterizations of the knowledgebase rules  . For example, in  FIG.  2   , E106 is a subset of E104, since the pH level in E106 contains that of E104. 
     An object generated includes a set of evidences E156 and the rule A156 supported by E156. According to an aspect of an embodiment, an object in the form of E→A may be implemented as a data object (a data structure, a class) for electronically storing a set of evidences E156 and a rule A156 supported by E156. The data object may be associable or include links to (a) value (e.g., weight) for E160, (b) sources in support of E110, and (c) constraints for E165, as discussed in more detail herein. 
     An apparatus is provided including a computer readable storage medium configured to support managing (by way of storing) objects in the form E→A, where A is a rule in the knowledge base, and E is a set of evidence that supports the rule A; and a hardware processor (for example, computer processor and/or circuitry) to execute computing a composite set of evidences G, the composite set of evidences G being a combination of sets of evidences E in the knowledge base in support of a target rule L implied by a combination of rules in the knowledge base. E and A are electronically represented in computer readable media as data values (identifiers), including other values associated with E and/or A, such as weight values assigned to E, for processing, for example, generation (formation), computations or determinations of set(s) of data values and relations among the sets to deduce and/or induce target rule L as well as indicate validity or strength of target rule L. 
     Since bodies of evidences are sets, AKB could explicitly consider the relations among the bodies of evidences. The ability of AKBs to deal explicitly with relationships among the bodies of evidences, or its capability to take into account constraints imposed on the bodies of evidences, is another unique feature of AKB, which can lead to more powerful, robust, accurate and/or refined characterizations of the knowledge base. 
     In an AKB, evidences (the Es) and rules (the As) can represent completely different objects and each play an essential but separate role in the operations of an AKB. The dichotomy between rules and evidences is a novel approach, and is one of the critical differences between AKB and all the known models of knowledge bases. The power and flexibility offered by such a separation is yet another unique feature of AKB. 
     In an AKB, for example, no conditions are imposed on either E or A. Therefore, for example, it is further possible to have both E 1 →A and E 2 →A in the AKB. This means two or more sets (a set being two or more evidences Es also referred to as ‘body of evidences’) of evidences can support the same rule, thereby allowing, among other things, multiple experts/sources to be involved in designing a single AKB. Since typical knowledge bases do not associate evidences with rules, they would not be readily capable of dealing with multiple experts/sources for consolidating rules from different experts/sources. On the other hand, AKBs allow experts/sources to interact freely and completely, if necessary. AKBs could even monitor the experts/sources to determine their reliabilities and possible deceptions (see Sections 4). This is another unique feature of AKB. 
     Let κ be an AKB. The extension of κ, denoted by {circumflex over (κ)}, is defined recursively as follows:
         1. (Ø→ κ F), (U→ κ T)ϵ{circumflex over (κ)}, where T and F represent the logical constants TRUE and FALSE, respectively.   2. if ω=(E→L)ϵκ then (E→ κ L)ϵ{circumflex over (κ)}.   3. if ω 1 =(E 1 → κ L 1 ), ω 2 =(E 2 → κ L 2 )ϵ{circumflex over (κ)} then ω 1 ∨ω 2 =((E 1 ∪E 2 )→ κ (L 1 ∨L 2 ))ϵ{circumflex over (κ)} and ω 1 ∧ω 2 =((E 1 ∩E 2 )→ κ (L 1 ∧L 2 ))ϵ{circumflex over (κ)}.
 
{circumflex over (κ)} extends κ so that AKBs can deal with composite objects co, associated with combinations of sets of evidences E in the knowledge base and combinations of rules in the knowledge base. Therefore, the embodiments utilize both composite evidences and composite rules to establish support for a target rule.
       

     In the rest of this document, u and n denote ‘set union’ and ‘set intersection’, respectively, while ∨ and ∧ denote ‘logical or’ and ‘logical and’, respectively. 
     Let κ be an AKB. 
     If ω=(α→ κ β)ϵ{circumflex over (κ)}, then l (ω)=α and τ(ω)=β.
 
ωis a composite object, l (ω) denotes a composite set of evidences associated with ω, and τ(ω) denotes the composite rules associated with ω.This enable {circumflex over (κ)} to extract the rule portion and the associated set of evidences portion from ω, where ωrepresents a composite object of a plurality of E→A.
 
     Let κ be an AKB, G⊆U (G is a body of evidences from universal set of evidences U) and Lϵ→ , where   is the collection of knowledge or rules (given or otherwise) which we are interested in. In  FIG.  3   , the basic operation at  210  for deductive reasoning is 
     
       
         
           
             
               G 
               
                 
                   
                     → 
                     &#34;\[Rule]&#34; 
                   
                   d 
                 
                 κ 
               
               L 
             
             , 
           
         
       
     
     where G is a composite set of evidences and L is a target rule. A target rule L refers to a rule in   or an unknown rule that would like to be established. More detail explanations can be found throughout this section. 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             L 
           
         
       
     
     where, d denotes deductive reasoning, if and only if there exists ωϵ{circumflex over (κ)} such that l (ω)=G and r(ω)⇒L.
 
l(ω)=G means that G is the composite set of evidences that supports r(ω), ω being a composite object of a plurality of E→A, and r( ) L means that the if the composite rule r(ω) is true, then the target rule L is true. In other words, ⇒ stands for ‘logical implication.’
 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             L 
           
         
       
     
     is one of the key concepts for dealing with deductive reasoning and other aspects of AKBs. Among other things, it provides a natural way to show how a given Lϵ  is deductively related to κ. (See also  FIG.  3   ). To put it in another way, 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             L 
           
         
       
     
     means there exists a composite object ω in the AKB κ (ω is formed from objects of a plurality of E→A, in κ), where G is the composite set of evidences associated with ω, and the composite rule associated with ω implies (inferred by) L. 
     As an example, consider the partial AKB given in  FIG.  2   . Assume the target rule L is:
         Velvet disease is TRUE or the fish color is yellowish.       

     To determine G, we will use the following objects in the AKB:
         1. (E101→A101) where A101 is the rule ‘water pH level less than 6.0’ and the weight of E101 is 0.0014.   2. (E102→A102) where A102 is the rule ‘water pH level is in [6.0, 7.0), i.e., the water pH level is greater than or equal to 6.0 but less than 7.0’ and the weight of E102 is 0.1930.   3. (E121→A121) where A121 is the rule ‘water condition is acidic when water pH level is less that 6.0 or (6.0, 7.0)’ and weight of E121 is 1.0000.   4. (E133→A133) where A133 is the rule ‘fish color is discolored—yellowish when water condition is acidic and velvet disease is false and weight of E133 is 0.3028.       

     Since L=(A101∨ A102) ∧ A121∧ A133, therefore 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             L 
           
         
       
     
     where G=(E101∪E102) ∩E121∩E133. It is possible to have many other G where 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             
               L 
               . 
             
           
         
       
     
     . For example, it is not necessary to use both objects 1 and 2. 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             L 
           
         
       
     
     holds by using only one or the other alone. Following the line of reasoning given above, if we observed that ‘the fish color is not yellowish’, then we can show that any G, where 
     
       
         
           
             
               G 
               
                 
                   
                     → 
                     &#34;\[Rule]&#34; 
                   
                   d 
                 
                 κ 
               
               L 
             
             , 
           
         
       
     
     is a set of evidences that supports the target rule ‘velvet disease is TRUE’. 
     Let κ be an AKB and Lϵ .
         At  220 , the “support” of a target rule L with respect to the augmented knowledge base, (also denoted by σ κ (L)), is equal to the largest G⊆U where       

     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             
               L 
               . 
             
           
         
       
         
         
           
             At  230 , the “plausibility” of target rule L with respect to the augmented knowledge base, (also denoted by  σ   κ (L)), is equal to [σ κ (L′)]′. 
           
         
       
    
     At  220 , the concept of “Support” of L provides a natural way to determine the set of evidences included in and derivable from κ that deductively supports L. While at  230  the concept of “plausibility” of L determines the set of evidences included in and derivable from κ that does not deductively support (not L.) (See also  FIG.  3   ). At  210 , whether “support” of L and/or “plausibility” of L should be taken into account can depend upon whether strict and/or plausible support is sought. 
       240  and  250  are alternative determinations of the “support” of a target rule L and a “plausibility” of a target rule L. If G is a set or a subset of some universal set U, then G′ will denote the complement of the set G, i.e., G′ contains all the elements in U that is not in G. 
     Let κ be an AKB and L E→ . One way of determining the support and plausibility are:
         σ κ (L)=σ κ     0   (F) where κ 0 =κ∪{U→L′} ( 240 ), and     σ   κ (L)= σ   κ     0   (T) where κ 0 =κ∪{U→L} ( 250 ).       

     In other words, to compute the support of L with respect to the AKB κ, add the object U→L′ (where L′ is a negated target rule L) to the AKB κ, and then compute the support of F with respect to the expanded AKB. The plausibility can be computed in a similar manner. 
     Thus, the above methods ( 240  and  250 ) can be used to determine the support and plausibility of any Lϵ  by extending the original AKB κ. It is a universal method since it is only necessary to know how to determine the support of F or the plausibility of T for any AKBs. (See also  FIG.  3   ) 
     Various algorithms for determining σ κ (F), some polynomial and some non-polynomial, are given in Section 15 (Unification Algorithms) below (see  FIG.  4    which is a flow diagram of an example unification algorithm, according to an aspect of an embodiment of the invention). In light of the above results, these algorithms can be used to determine the body of evidences that supports any L in an AKB. 
     In the above definition of AKB, we assume that it is universally accepted that E→A is true. If that is not the case, then E→A is supported by some body of evidences, say G 0 . In other words, G 0 →(E→A). If the latter is universally accepted, then we can stop there. Otherwise, it in turn is supported by yet another body of evidences, ad infinitum. The latter are clearly higher order AKB. Since G 0 →(E→A) is equivalent to (G 0 ∩E)→A, thus, in most cases, it is only necessary to consider first-order AKB, the one defined above (see Section 7 for more detail discussions of higher order AKBs, as well as, the role of higher order AKBs). It is worthwhile to observe that if E=U for all (E→A) ϵκ, then we have a deterministic knowledge base, or a knowledge base without uncertainty. 
     According to an aspect of an embodiment, the way uncertainties and/or incompleteness is dealt with by  220 ,  230 ,  240  and/or  250  for deductive reasoning is unique and new, because both the composite rules and the composite sets of evidences are involved providing a more general, vigorous and stronger reasoning scheme. 
     Section 2. Evidences, Measures and Extensions 
     Any collection of sets is partially ordered by ⊆. Therefore the support function σ, or the plausibility function  σ , induced a partial ordering on  . Using this partial ordering, if L 1 , L 2  ϵ  and σ(L 1 )⊆σ(L 2 ), we can say that L 1  has lesser support than L 2 . However, if σ(L 1 ) and σ(L 2 ) are incomparable, then we don&#39;t have any measure of the relative strength of support for L 1  and L 2 . In this section, we shall discuss the extension of the partial order into a linear order, or, more importantly, the definition of an absolute measure of strength of support for members of  . 
     Unlike other knowledge-based systems, evidences play a front and center role in AKBs. However, a body of evidences could be an abstract concept. It is difficult, if not impossible, to completely specify all the evidences. Fortunately, in an embodiment of this invention, it is not essential to specify completely what the body of evidences consists of. One needs only to know the relations among the bodies of evidences, and the strength or validity of each body of evidences. These can in turn be used to determine the strength or validity of Lϵ . 
     We now present various methods, in the form of functions or mappings with domain 2 U , the collection of all subsets of U, for use with AKBs to measure the strength or validity of the body of evidences associated with a rule. 
       FIG.  5    provides the types of measures, used for representing the strength or validity of the body of evidences, according to an embodiment of the present invention. 
     Let ϵ⊆2 U , where 2 U  denotes the collection of all subsets of U. A measure m over ϵ is a function from ϵ into a linear ordered set, such that for all E 1 , E 2 ϵ∈, m(E 1 ) m(E 2 ) whenever E 1 ⊆E 2 . In other words, in an aspect of an embodiment of this invention, measures are monotonic. 
     Let ∈⊆2 U . A probability measure m over ∈ is function from ∈∪{Ø, U} into [0,1], the close unit interval, which satisfies the following conditions:
         1. m(Ø)=0 and m(U)=1.   2. m(E 0 )≥m(E 1 )+m(E 2 ) for all E 0 , E 1 , E 2 ϵ∈ where E 1 ∩E 2 =Ø 0  and E 1 , E 2 ⊆E 0 .   3. m(E 1 ∪E 2 )≤m(E 1 )+m(E 2 ) for all E 1 , E 2  ϵ∈ where E 1 ∪E 2 ϵ∈.       

     In the above definition, as well as the rest of this document, Ø denotes the ‘empty set’ or the set that contains no elements. 
     Clearly, every probability measure over ∈ is a measure over ∈. Moreover, if ∈=2 U , then the definition of probability measure given above is equivalent to the usual definition of probability measure. 
     Measures are also used in virtually all of the existing knowledge-based systems that deal with uncertainty. However, the measure considered in AKBs map a body of evidences into a member of a linear ordered set or into a real number. On the other hand, measures in existing knowledge-based systems map a rule directly into a real number. 
     Let κ be an AKB. m is a (probability) κ-measure if and only if m is a (probability) measure over ∈ κ , the collection of all sets (body of evidences) given in an AKB. 
     Let κ be an AKB. The extension of ∈ κ , denoted by {tilde over (∈)} κ , is the smallest collection of subsets of U that contains all the sets in ∈ and is closed under complement, union, and intersection. In other words, {tilde over (∈)} κ  includes sets which can be formed from ∈ in a natural manner. 
     Moreover, let m a (probability) κ-measure. An extension {tilde over (m)} of m is a (probability) measure over {tilde over (∈)} κ  such that {tilde over (m)}(E)=m(E) for all Eϵ∈. 
     In the case where {tilde over (m)} is probabilistic, the value {tilde over (m)}(σ κ (L)), for Lϵ , can be interpreted as the probability that L is true. 
     By viewing conditioning/composition rules as extension schemes, it is clear that the ability to extend m tom is equivalent to the ability to infer or to reason in existing knowledge-based systems. In an AKB, inference or reasoning can be done in two separate phases:
         1. Form the body of evidences that supports the target rules.   2. Determine the value of {tilde over (m)} for the body of evidences obtained in the first phase.       

     There are many schemes for extending a κ-measure m with domain ∈ κ to {tilde over (m)} with domain {tilde over (∈)} κ . Many try to capture the essence of the following, which holds for probability measure. 
     Let m be a probability measure over 2 U  and G, G 1 , G 2 ⊆U. Then m satisfies the following conditions:
         1. {tilde over (m)}(E′)=1-m(E).   2. max(0, m(G 1 )+m(G 2 )-1)≤m(G 1 ∩G 2 )≤min(m(G 1 ), m(G 2 )).   3. max(m(G 1 ), m(G 2 ))≤m(G 1 ∪G 2 )≤min(1, m(G 1 )+m(G 2 )).       

     The above observation, which can also be found in Eugene S. Santos and Eugene Santos, Jr. Reasoning with uncertainty in a knowledge-based system. In  Proceedings of the seventeenth international symposium on multi - value logic, Boston, Mass.,  pages 75-81, 1987—the result are the same but are use differently), was used there to compute the probabilities of the union and intersection, are used in this invention to determine a lower bound and an upper bound for m(E), for every Eϵ{tilde over (∈)}, provided m is a probability measure. Unfortunately, after applying the results a few times, the lower and upper bound quickly approaches 0 and 1, respectively, yielding very minimal useful information. 
     Schemes for extending a measure m over ∈ to a measure {tilde over (m)} over {tilde over (∈)} are provided.
         1. {tilde over (m)}(E′)=1-m(E),   {tilde over (m)}(E 1 ∩E 2 )=min(m(E 1 ), m(E 2 )), and   {tilde over (m)}(E 1 ∪E 2 )=max(m(E 1 ), m(E 2 )).   2. {tilde over (m)}(E′)=1-m(E),   {tilde over (m)}(E 1 ∩E 2 )=max(0, m(E 1 )+m(E 2 )-1), and   {tilde over (m)}(E 1  U E 2 ) =min(1, m(E 1 ) +m(E 2 )).   3. {tilde over (m)}(E′)=1-m(E),   {tilde over (m)}(E 1 ∩E 2 )=m(E 1 )m(E 2 ), and   {tilde over (m)}(E 1 ∪E 2 )=1-(1-m(E 1 )) (1-m(E 2 )).       

     Schemes 1, 2 and 3 above all satisfy the DeMorgan&#39;s law, and can be applied to compute {tilde over (m)}(E) for any E ϵ{tilde over (∈)} κ . However, one could run into various problems by using these schemes indiscriminately, as witness by many existing knowledge-based systems that use expressions similar to some of those given above to manipulate their numbers. Worst yet, for all three schemes above, the values of {tilde over (m)}(E), where E ϵ{tilde over (∈)} κ , may not be unique, since they may depend on how E is expressed. Moreover, Schemes 1 and 2 are not probabilistic (they are not additive). On the other hand, Scheme 3 implicitly assume that all the sets in E are stochastically independent. Due to this implicit assumption, Scheme 3 has not been strictly applied in real applications. 
     Of course, many other schemes existed in the literature. Many are ad-hoc, such as the composition rule for certainty factors used in the original MYCIN (Bruce G. Buchanan and Edward H. Shortliffe.  Rule - Based Expert Systems . Addison Wesley, 1984). There are also other schemes that are essentially modifications and/or combinations of the above schemes, such as the composition rule (orthogonal sum) used by the Dempster-Shafer approach (G. Shafer.  A Mathematical Theory of Evidence . Princeton University Press, 1976). Finally, there is a natural scheme for extending a probabilistic m into a probabilistic {tilde over (m)}, namely, the constraint stochastic independence method introduced in the latter part of this invention, which can be used to form a new reasoning scheme, the augmented reasoning. This scheme is particularly suited for AKBs. 
     It is not necessary to select just one extension scheme for m for a given AKB. It is possible, and, in fact, beneficial at times to use more than one schemes either simultaneously and/or conditionally. In the latter case, several schemes may be provided and based on L and/or how L is formed, a particular scheme is then selected to evaluate the validity of L. A version of multiple schemes that is being used conditionally is given in (L. A. Zadeh. A simple view of the Dempster-Shafer theory of evidence and its implication for the rule of combination.  Al Magazines,  7:85-90, 1986) in connection with fuzzy knowledge bases. However, in this case, as in virtually all existing cases, the extension is applied directly to the rules rather than the bodies of evidences. 
     Clearly, a complete formulation of an AKB requires the specifications of κ, m, and the scheme for extending m to {tilde over (m)}. The extension scheme is just one of the facets in an AKB, and any scheme could be used for that purpose. By selecting appropriately the E, the A, and the E→A, as well as, m and the extension scheme for m, most of the well-known approaches to knowledge bases and uncertain reasoning, including probabilistic logic (N. J. Nilsson. Probabilistic logic.  Artificial Intelligence,  28:71-87, 1986), Dempster-Shafer theory (G. Shafer.  A Mathematical Theory of Evidence. Princeton University Press,  1976), Bayesian network(Judea Pearl.  Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . Morgan Kaufmann, 1988), Bayesian knowledge base Eugene Santos, Jr. and Eugene S. Santos. A framework for building knowledge-bases under uncertainty.  Journal of Experimental and Theoretical Artificial Intelligence,  11:265-286, 1999), fuzzy logic (L. A. Zadeh. The role of fuzzy logic in the management of uncertainty in expert systems.  Fuzzy Sets and Systems,  11:199-227, 1983; L. A. Zadeh. Fuzzy sets.  Information and Control,  8:338-353, 1965. 41; R. Yager. Using approximate reasoning to represent default knowledge.  Artificial Intelligence,  31:99-112, 1987), numerical ATMS (Johan DeKleer. An assumption-based TMS.  Artificial Intelligence,  28:163-196, 1986), incidence calculus (Alan Bundy. Incidence calculus: A mechanism for probabilistic reasoning.  Journal of Automated Reasoning,  1(3):263-283, 1985; Weiru Liu and Alan Bundy. Constructing probabilistic atmss using extended incidence calculus.  International Journal of Approximate Reasoning,  15(2):145-182, 1996), etc. can be formulated as special cases of AKBs (see Section 3). 
     Section 3. Comparative Studies 
     The definition of AKB given in Section 1 encompasses virtually all of the widely used formalisms of uncertain reasoning and knowledge bases. As we shall see below, these existing systems can be formulated as AKBs according to the embodiments of the present invention by imposing certain restrictions on the relations among the E, the A, and the (E→A) in κ, as well as, on how the κ-measure m is extended. 
     For illustration purposes, we shall consider the following well-known formalisms: probabilistic logic(N. J. Nilsson. Probabilistic logic.  Artificial Intelligence,  28:71-87, 1986), Bayesian network(Judea Pearl.  Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . Morgan Kaufmann, 1988) and Bayesian knowledge base (Eugene Santos, Jr. and Eugene S. Santos. A framework for building knowledge-bases under uncertainty.  Journal of Experimental and Theoretical Artificial Intelligence,  11:265-286, 1999), and Dempster-Shafer theory(G. Shafer.  A Mathematical Theory of Evidence . Princeton University Press, 1976). 
     A probabilistic logic can be defined by an ordered pair ( , p), where   is a finite collection of elements in  , a first order logic, and p is a function from   into [0,1]. For simplicity, instead of a first order logic, assume that   is a propositional calculus. For each Pϵ , associate the set E p , and let κ be the AKB including all E p →P and E p ′→P′, where Pϵ . (There is a one-to-one correspondence between P and E p , where E p  is the set version of the logical expression P.) Moreover, define m such that m(E p )=p(P) for all Pϵ . Extend m into {tilde over (m)} that satisfies the 3 properties of probabilistic measure given in Section 2. It can be shown that the resulting AKB κ is equivalent to ( , p). 
     Both Bayesian networks and Bayesian knowledge bases can be defined by specifying a finite collection   of conditional probabilities subject to certain restrictions. Let R denote the collection of all random variables used in the Bayesian network or Bayesian knowledge base, and for each Xϵ , let I X  represents the set of all possible instantiations of X. A typical element A of   is of the form: p(X=α|X 1 =α 1 , X 2 =α 2 , . . . , X κ =α κ ), where Xϵ , αϵI X , and for all 1≤i≤k, X i ϵ , and α i ϵI X     i   . 
     Associate with each element Aϵ : the rule
         (X 1 =α 1 )∧(X 2 =α 2 )∧ . . . ∧(X κ =α κ ) =(X=α),       

     and the set E A . 
     Let κ be the AKB containing one or more (e.g., all) objects of the form E A →A where Aϵ . Moreover, define m such that:
         m(E A )=p(X=α|X 1 =α 1 , X 2 =α 2 , . . . , X κ =α κ ).       

     Let A=((X 1 =α 1 )∧A (X 2 =α 2 )∧ . . . ∧(X κ =α κ )⇒(X=α)) ϵ   κ , and =((Y 1 =b 1 )∧(Y 2 =b 2 )∧ . . . ∧(Y l =b l )⇒(Y=b)) ϵ   κ . A˜B means for all 1≤i≤k and 1≤j≤l, α i =bj whenever X i =Y j . In other words, A and B are antecedent-compatible. In order to capture the properties of conditional probabilities, the following conditions are needed: For every A, B ϵ   κ , if A˜B, X=Y but a≠b, then E A ∩E B =Ø. 
     However, for Bayesian knowledge bases, an additional property is needed: For every A, B ϵ   κ , if A˜B,X=Y and a=b, then E A =E B . (This is the exclusivity property given in Eugene Santos, Jr. and Eugene S. Santos. A framework for building knowledge-bases under uncertainty.  Journal of Experimental and Theoretical Artificial Intelligence,  11:265-286, 1999.) 
     On the surface, it might seem that Bayesian networks and Bayesian knowledge bases can deal with relationships or constraints among the sets. Actually, they cannot handle constraints unless they are inherent in probability theory or in their definition. In other words, neither can handle externally imposed constraints. 
     Bayesian networks and Bayesian knowledge bases essentially employed Scheme 2 given in Section 2 with the proviso that {tilde over (m)}(A∩B)=0 whenever A∩B=Ø. It can be shown that the resulting AKB κ, as defined above, are equivalent to the corresponding Bayesian network or Bayesian knowledge base. 
     Another well-known reasoning scheme is based on Dempster-Shafer theory (DST)(G. Shafer.  A Mathematical Theory of Evidence. Princeton University Press,  1976). Using DST terminology, consider a simple support function S with focal element A and degree of support s. S can be represented by the objects E→A and E′→A′, with m(E)=s and m(E′)=1-s. If relations exist among the focal elements, then additional objects have to be included in the AKB. For example, suppose A and B are disjoint focal elements, then we need to include the object U→A′∨B′ in the AKB. (Although focal elements in DST are sets, we view them as propositions to fit them into our formulation.) If the frame of discernment Θ is given, another way of representing the support functions, without resorting to using additional objects to specify the relations among focal elements, is to write: A={θ 1 , θ 2 , . . . , θ κ }⊆Θ as θ 1 ∨θ 2 ∨ . . . ∨θ κ . 
     In this case, we need only add, once and for all, the objects U→a′∨b′ for distinct a, bϵΘ. DST employed Scheme 2 given in Section 2 to extend the K-measure m and then normalized the result by dividing it by 1-{tilde over (m)}(σ κ (F)). It can be shown that the orthogonal sum used in DST can be derived from the above representation. Although DST emphasized evidence in its formulation, like all other existing models, it did not distinguish between the evidence and the proposition it supports. 
     Section 4. Augmented Knowledge Base Inference Engine 
     In this section, we shall show how inference or reasoning is done in an AKB. From the above discussions, it is clear that, in an embodiment of this invention, the functions of the augmented knowledge base engine (AKBE) can be divided neatly into two phases. The first phase deals only with the AKB κ (or any desired subset thereof, in the case of distributed knowledge bases), while the second phase deals with the K-measure and its extension. As noted earlier, it is possible to use more than one extension schemes in a single AKB. Moreover, depending on the extension scheme(s) used, it may not be necessary to complete the first phase before starting the second phase. In particular, the two phases, as well as the extension schemes, if two or more schemes are used simultaneously, maybe carried out in parallel to make the process more efficient. 
     The main thrust of the first phase of an AKBE is the evaluation of σ κ (L). By virtue of results given in Section 1, we need only provide a method for determining σ κ (F) for arbitrary AKB κ. Many such algorithms are given in Section 15 (Unification Algorithms). 
     The main thrust of the second phase of an AKBE is the computation of {tilde over (m)}(σ κ (F)). This clearly depends on the scheme used for extending m. As stated earlier, the result in Section 2 can be used to provide a lower bound and an upper bound for {tilde over (m)}(E) for any probabilistic extension of m as long as m itself is probabilistic. Unfortunately, after applying the theorem a few times, the lower and upper bound quickly approaches 0 and 1, respectively, yielding very minimal useful information. Nevertheless, both the lower and upper bounds can be computed easily, and thus it provides a very efficient way for bounding the value of {tilde over (m)}(E). 
     Several extension schemes are given in Section 2. Clearly, all of those schemes are intended to be used to compute {tilde over (m)}(E) directly, provided Eϵ{tilde over (∈)} κ , without any regard to the relations among the sets in {tilde over (∈)} κ  (e.g. Is E 1  a subset of E 2 , or are they disjoint?). There are many other known extension schemes and/or conditioning/composition rules. However, they are either too restrictive, or have no clear semantics and thus suffer from various anomalies. 
     A promising approach is the use of the extension scheme based on constraint stochastic independence method mentioned earlier and discussed in detail below. It provides a unique point value for {tilde over (m)}(E), and forms the basis for a new computational model of uncertain reasoning. A unique feature of this new reasoning scheme is its ability to deal with relationships among the bodies of evidences, or its capability to take into account constraints imposed on the bodies of evidences. This is a clear departure from all existing formalisms for uncertain reasoning, which are incapable of dealing with such constraints. This added feature can lead to more powerful, robust, accurate and/or refined characterizations of the knowledge base. In addition, because of its clear probabilistic semantics, virtually all of the known anomalies associated with existing knowledge-based systems disappear. 
     Although our discussion on AKBE focuses on σ κ , the same method can be used for  σ   κ  or other other appropriate functions. In addition, if κ is consistent (see Section 5), and both σ κ  and  σ   κ  are considered, then one can determine an interval value ({tilde over (m)}(σ κ (L)), {tilde over (m)}( σ   κ (L))) for any Lϵ . 
     In general, AKBs allow rules to be supported by bodies of evidences that are related to other bodies of evidences. For example, two different rules may be supported by the same body of evidences, or a rule is supported by E while another rule is supported by E′. If one needs to know which specific rules, not just which specific bodies of evidences, that are applied to obtain the desired results, such as in PROLOG-like query, Σ κ (L)={ωϵ{circumflex over (κ)}|τ(ω)⇒L} can first be determined. Clearly, all the rules involve in the inference are included inΣ κ (L). One can then use the definition, together with the given constraints, to determine σ κ (L). 
     Providing explanations on how results were obtained by any knowledge-based system will go a long way in bolstering the user&#39;s confidence on the system. For AKBs, the explanation is built-in. All the rules that are involved in deducing the final results are given in Σ κ (L). Moreover, the overall body of evidences supporting L is given in σ κ (L). Furthermore, all constraints involved, when constraint stochastic independence method is employed, can be readily extracted during the second inference phase. 
     It is worth noting that the Σ κ (L) and/or σ κ (L) obtained in the first phase of the AKBE, contains a mountain of treasures (information) waiting to be exploited. We have seen how it can be used to determine the support of L, as well as, how to explain away L. Many other concepts, such as consistency, reliability, vulnerability, etc., which are central to many different complex systems, as well as, deception, which is central to knowledge-based systems, can also be formulated and determined via Σ κ (L), σ κ (L) and/or {tilde over (m)} (see Section 5 below). 
     Section 5. Properties of AKB 
       FIG.  7    is a table of methods for testing and ensuring properties of AKB, according to an embodiment of the present invention. 
     In this section, certain basic properties of AKBs are presented together with methods for testing and ensuring that the AKB possesses the properties. 
     Let κ be an AKB. κ is consistent if and only if G=Ø, subject to    κ , whenever 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             
               F 
               . 
             
           
         
       
     
         κ is the collection of all constraints involving κ. This means that for consistent κ, if a rule is FALSE, then it is not supported by any evidences. 
     Consistency is an important issue involving an AKB. It specifies the internal consistencies of the contents of the AKB. For example, if both E 1 →A and E 2 →A′ are in κ, then E 1  and E 2  should be disjoint for κ to be consistent. We need a higher order AKB to deal with inconsistencies (see Section 7). If an AKB is not consistent, then the (E→A) in κ may not be universally accepted. Inconsistency is closely related to reliability. It could also be a precursor of something important, such as deception, when dealing with knowledge bases not known for their inconsistencies. 
     AKBs associated with Probabilistic logic(N. J. Nilsson. Probabilistic logic.  Artificial Intelligence,  28:71-87, 1986), Bayesian networks(Judea Pearl.  Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . Morgan Kaufmann, 1988) and Bayesian knowledge-bases(Eugene Santos, Jr. and Eugene S. Santos. A framework for building knowledge-bases under uncertainty.  Journal of Experimental and Theoretical Artificial Intelligence,  11:265-286, 1999) are consistent. On the other hand, consistency is not strictly observed in Dempster-Shafer theory (G. Shafer.  A Mathematical Theory of Evidence. Princeton University Press,  1976). This omission, together with its composition rule, can lead to certain anomalies (L. A. Zadeh. On the validity of Dempster&#39;s rule of combination of evidence. Technical Report 79/24, University of California, Berkeley, 1979; L. A. Zadeh. A mathematical theory of evidence (book review).  AI Magazines,  55:81-83, 1984; L. A. Zadeh. A simple view of the Dempster-Shafer theory of evidence and its implication for the rule of combination.  AI Magazines,  7:85-90, 1986). 
     In general, consistency imposed certain conditions that the E′s should satisfy. Some criteria for consistency are given below: 
     Let κ be an AKB. The following statements are equivalent:
         1. κ is consistent.   2. G=Ø, subject to    κ , whenever       

     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             
               F 
               . 
             
           
         
       
         
         
           
             3. For every ωϵ{circumflex over (κ)}, l (ω))=Ø whenever τ(ω)=F. 
             4. σ κ (F)=Ø. 
             5.  τ   κ (T)=U. 
             6. For every Lϵ , σ κ (L) ∩τ κ (L′)=Ø. 
             7. For every Lϵ ,  σ   κ (L)∪ σ   κ (L′)=U. 
             8. For every Lϵ , σ κ (L)⊆ σ   κ (L). 
           
         
       
    
     Any of the criteria above can be used to test and ensure that the AKB is consistent. As observed earlier, an inconsistent AKB is actually a higher order AKB. Although inconsistencies can be removed from an AKB κ by adding the constraint σ κ (F)=Ø, this method may not be advisable since it could alter the nature of the AKB. Besides, all inconsistencies should be handled with care. They may occur due to errors. More importantly, they may occur due to possible deceptions (see below), especially if the AKB is not known to have inconsistencies. 
     Let κ be an AKB. κ is complete if and only if for every Lϵ ,  σ   κ (L). κ is perfect if and only if for every Lϵ ,  σ   κ (L)=σ κ (L). 
     Perfect AKBs are those AKBs whose support and plausibility for any L E→  are equal. This turns out to be a very powerful property. 
     Additional methods for testing and ensuring that an AKB is perfect are given below: 
     Let κ be an AKB. The following statements are equivalent:
         1. κ is perfect.   2. For every Lϵ ,  σ   κ (L)=σ κ (L).   3. κ is both consistent and complete.   4. κ satisfies the following conditions:
           a) σ κ (L′)=[σ κ (L)]′;   b) σ κ (L 1 ∧L 2 )=σ κ (L 1 )∩σ κ (L 2 ); and   c) σ κ (L 1 ∨L 2 )=σ κ (L 1 )∪σ κ (L 2 ).   
               

     In light of 4 of the above result, if κ is perfect, then for every Lϵ  σ κ (L) is completely determined by σ κ (A), where Aϵ   a , and    a  is the collection of all atomic proposition in  . An atomic proposition is a proposition that is indivisible, i.e., it cannot be expressed in terms of other propositions. A rule A is a combination of or formed of one or more atomic propositions. 
     We shall now present some other important properties involving AKBs, and show their possible applications. 
     Let κ be an AKB, m a κ-measure, {tilde over (m)} an extension of m over {tilde over (∈)} κ , λ⊆κ, and Lϵ . 
       ψ κ (λ,  L )={tilde over ( m )}(σ κ(   L )-{tilde over ( m )}(σ κ-λ ( L )).
 
     ψ κ (λ, L) will be referred to as the contribution of λ over L. If λϵκ, then we shall also write: ψ κ (μ, L) for ψ κ ({μ}, L). 
     The concept of contribution can be used to detect and overcome vulnerabilities, as well as, detect possible deceptions (see below). 
     Let κ be an AKB, μϵκ and Lϵ→ . μ is an essential support for L if and only if ψ κ (μ, L)&gt;0. 
     Clearly, all the vulnerabilities of κ with respect to L can be determined from S κ (L)={μϵκ|μ is an essential support for L}, which can in turn be obtained from Σ κ (L). As a matter of fact, we can order the elements μ of S κ (L) in descending order of ψ κ (μ, L). In this way, one can pinpoint all the major vulnerabilities of κ with respect to L. Sometimes, vulnerabilities are not due to a single element of κ. In this case, Σ κ (L) should be examined to determine group of elements of κ that may be the root cause of major vulnerabilities. 
     Detecting possible deceptions involving L can become more complicated since it involves human and/or another corrupted machine. Nevertheless, a method to start the detection process can be carried out by first determining the major single and/or multiple vulnerabilities with respect to L, as explained above, and carefully examining which of the major single and/or multiple vulnerabilities are plugged using questionable sources. In general, deceptions might involved altering, adding and/or deleting multiple elements of K. For security purposes, no existing element of κ should be allowed to be removed without thorough investigation to assure that the element in question is useless, not appropriate and/or superseded. All changes should be introduced as new members of κ (deletion of (E→L)ϵκ can be accomplished by temporarily adding the new member ℏ→L to κ). A log should be provided for any changes, addition or physical deletion of any member of κ. 
     Section 6. Inductive Inference 
       FIG.  8    is flow diagram of inductive inference in AKB, according to an embodiment of the present invention. 
     Inductive inference comes in many different flavors and has been widely studied in the literature (Aidan Feeney and Evan Heit, editors.  Inductive Reasoning : Experimental, Developmental, and Computational Approaches . Cambridge University Press, 2007; John H. Holland, Keith J. Holyoak, Richard E. Nisbett, and Paul R. Thaggard.  Induction: Process of Inference, Learning, and Discovery . MIT Press, 1989). In this section, we provide a method for performing inductive inference in AKBs. The inductive inference presented in this document is not only more general (capable of handling uncertainties and/or incompleteness), but also more robust, than traditional inductive inference. Together with the results given above, AKB can serve as a unified framework for deductive and inductive reasoning. Furthermore, in view of the results that will be presented in this section, we can view deductive reasoning and inductive reasoning as dual of each other. 
     Let κ be an AKB, G⊆U and Lϵ . 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 i 
               
               κ 
             
             L 
           
         
       
     
     (where i dentoes inductive reasoning) if and only if there exists L 0 ϵ  where L 0  refers to a composite rule such that the target rule L⇒L 0  and G→ κ L 0 . 
     This is equivalent to there exists ωϵ{circumflex over (κ)} such that l (ω)=G and L⇒r(ω). Observe the difference between 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 i 
               
               κ 
             
             
               
                 L 
                 ⁢ 
                     
                 and 
                 ⁢ 
                     
                 G 
               
               
                 
                   
                     → 
                     &#34;\[Rule]&#34; 
                   
                   d 
                 
                 κ 
               
               
                 L 
                 . 
               
             
           
         
       
     
     In other words, 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 i 
               
               κ 
             
             L 
           
         
       
     
     means there exists a composite object ω in the AKB κ (ω is formed from objects in κ), where G is the set of evidences associated with ω, and the rule associated with ω is implied by L 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 i 
               
               κ 
             
             L 
           
         
       
     
     is one of the key concepts for dealing with inductive reasoning and other aspects of AKBs. Among other things, it provides a natural way to show how a given Lϵ  is inductively related to κ. Let κ be an AKB and Lϵ .
         1. The inductive plausibility for L with respect to κ, (also denoted by ϕ κ (L)), is the smallest G⊆U where       

     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 i 
               
               κ 
             
             
               L 
               . 
             
           
         
       
         
         
           
             2. The inductive support for L with respect to κ, (also denoted by  ϕ   κ (L)), is equal to [ϕ κ (L′)]′.
 
In other words, inductive plausibility for L with respect to κ is the smallest set of evidences G such that
 
           
         
       
    
     
       
         
           
             
               G 
               
                 
                   
                     → 
                     &#34;\[Rule]&#34; 
                   
                   i 
                 
                 κ 
               
               L 
             
             , 
           
         
       
     
     while inductive support for L with respect to κ is the largest set of evidences G such that 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 i 
               
               κ 
             
             
               
                 L 
                 ′ 
               
               . 
             
           
         
       
     
     Let κ be an AKB. Let ωϵ{circumflex over (κ)}. The complement ω′ of ω is defined recursively as follows:
         1. If ω=(E→A) where ωϵ{circumflex over (κ)}, then ω′=(E′→A′).   2. If ω 1 , ω 2 ϵ{circumflex over (κ)}, then (ω 1 ∨ω 2 )′=ω 1 ′∧ω 2 ′ and (ω 1 ∧ω 2 )′=ω 1 ′∨ω 2 ′.
 
Clearly, for any composite object of ω, ω′ is obtained from ωby taking the complement of the set of evidences portion of ω, and the negation of the rule portion of ω. The complement ω′ of ω is needed to show the relations between deductive inference and inductive inference.
       

     Let Ω⊆{circumflex over (κ)}.  Ω ={ω′|ωϵΩ}. 
     Let τ⊆κ.  τ ={ω′|ωϵτ}. When  κ  is viewed as an AKB, then      κ   , =   κ . 
     The following properties show that inductive support and inductive plausibility with respect to κ are closely related to plausibility and support with respect to  κ . They also provide a method for computing the inductive support and inductive plausibility with respect to κ using the Unification Algorithms (see Section 15) for computing the support and plausibility with respect to κ. 
     Let κ be an AKB and Lϵ . ϕ κ (L)= σ     κ   (L) and  ϕ   κ (L)=σ   κ   (L). 
     Clearly, reasoning using σ κ  corresponds to deductive inference or reasoning. On the other hand, reasoning using ϕ κ  may be viewed as inductive inference or reasoning. ϕ κ  can be used for extracting new knowledge from κ. In view of the above results,  κ  may be viewed as the AKB induced by κ using inductive inference. However, it should be observed that, even if κ is consistent, new knowledge extracted from κ, need not be consistent with one another; i.e.,  κ  need not be consistent. In the rest of this section, we shall provide necessary and sufficient conditions for the new knowledge extracted from κ to be consistent. 
     In view of the previous paragraphs, inductive inference can be accomplished using deductive inference, as follows: construct the complement κ ( 410  ) from κ ( 400 ), construct the negation L′ ( 412 ) from L ( 405 ), perform deductive inference on  κ  and L′ ( 420 ) to determine the support of L′ with respect to  κ , and other items in ( 422 ), and then use the relation ϕ κ (L)= ϕ     κ   (L) given above to compute inductive plausibility of L with respect to κ, as well as other items ( 424 ). 
     Let κ be an AKB. The following statements are equivalent:
         1. κ is i-consistent.   2. G=U, subject to    κ , whenever       

     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 i 
               
               κ 
             
             
               T 
               . 
             
           
         
       
         
         
           
             3. For every ωϵ{circumflex over (κ)}, l (ω)=U whenever τ(ω)=T 
             4. ϕ κ (T)=U. 
             5.  ϕ   κ (F)=Ø. 
             6. For every Lϵ , ϕ κ (L)∪ϕ κ (L′)=U. 
             7. For every Lϵ ,  ϕ   κ (L)∩ ϕ   κ (L′)=Ø. 
             8. For every Lϵ ,  ϕ   κ (L)⊆ϕ κ (L). 
             9.  κ  is consistent. 
           
         
       
    
     Any of the criteria above can be used to test and ensure that the AKB is i-consistent. It follows from the above results that if κ is i-consistent, then  κ  is consistent. In this case, the new knowledge extracted from κ will be consistent with each other. 
     Since κ is i-consistent if and only if  κ  is consistent, in the same manner, we shall say that κ is i-xxx if and only if  κ  is xxx. Moreover, we shall say that κ is dual-xxx if and only if both κ and  κ  are xxx. Therefore, all results given in Section 5 can be transformed into corresponding results involving i-complete and/or i-perfect using the above results. 
     Let κ be an AKB. κ is monotonic if and only if for every ω 1 , ω 2  ϵ{circumflex over (κ)}, if τ(ω 1 )⇒τ(ω 2 ), then l (ω 1 )⊆l(ω 2 ). 
     Let κ be an AKB. The following statements are equivalent:
         1. κ is monotonic.   2.  κ  is monotonic.   3. For every ω 1 , ω 2  ϵ{circumflex over (κ)}, if τ(ω 1 )Ψτ(ω 2 ), then l (ω 1 )=l (ω 2 ).   4. For every ωϵ{circumflex over (κ)}, l (ω)=σ κ (τ( 107  ))   5. For every ωϵ{circumflex over (κ)}, l (ω)=ϕ κ (τω)).   6. For every ωϵ{circumflex over (κ)}, σ κ (τ(ω))=ϕ κ (τ(ω)).   7. For every Lϵ , σ κ (L)⊆ϕ κ (L).   8. For every Lϵ , σ   κ   (L)⊆ σ   κ (L).   9. {umlaut over (κ)} is consistent, where {umlaut over (κ)}=κU κ , where    κ =   κ .       

     Any of the criteria above can be used to test and ensure that the AKB is monotonic. 
     If  κ  is consistent, then the original knowledge in κ and the newly extracted knowledge associated with  κ  are all consistent with each other. 
     Section 7. Higher Order AKB 
       FIG.  9    is a flow diagram of constructing consistent higher order AKBs, according to an embodiment of the present invention. Fig, 9 is a list of 3 higher order AKBs and how they are constructed. All 3 types are described in this section. 
     In this section, unless otherwise stated, we shall assume that n is a positive integer. We shall now present higher order AKBs using induction.
         1. A 1-st order AKB is an AKB (as defined above).   2. Let    0  be an n-th order AKB. An (n+1)-th order AKB   is a finite collection of objects of the form G→μ, where G⊆U and μϵ   0 . G will be referred to as the reliability of μ, and   an immediate extension of    0 .   3. A general AKB is a n-th order AKB.       

     Let   be a general AKB. Since the objects in   have the same form as objects in an AKB, many of the basic concepts and notations for AKB can be carried over to  , e.g., ϵ ,  , τ( ), l( )/0, etc. Moreover,   is the collection of all relations among the sets or bodies of evidences involved in   and/or in  . 
     Let   be an n-th order AKB and n&gt;1.    ↓ ={l(ω)∩l(τ( 107  ))→τ(τ(ω))|→ωϵ }. Observe the    ↓  is an (n-1)-th order AKB. This provides a way to reduce an n-th order AKB into an (n-1)-th order AKB. Moreover,   is consistent if and only if    ↓  is consistent. 
     In the rest of this section, we shall present several methods for constructing consistent second order AKBs. It includes the constructions of    κ   9 ,    κ   1 , and different varieties of    α   2 . 
     Let κ be an AKB.    κ   0 ={ σ   κ (τ(μ))→μ|μϵκ}. 
     If κ is a deterministic AKB, then   contains only the elements of κ which are consistent with all the other elements of κ. Thus, for example, if κ contains both L is TRUE and L′ is TRUE, then neither elements will be included in    κ   0 . 
     Let κ be an AKB and z, 97   is a second order AKB.
            is an ideal immediate extension of κ if and only if  ={G μ →μ|ηϵκ} and for every τϵM κ , α κ (τ)⊆∪ μϵτ G μ ′ where α κ (τ)=∩ μϵτ l (μ) and β κ (τ)=∧ μϵτ τ(μ);   τ is F-minimal if and only if (i) β κ (τ)=F and (ii) β κ (τ 0 )≠F whenever τ 0  is a proper subset of τ; and   M κ  is the collection of all F-minimal subset of κ.
 
The above definitions and notations are needed to properly define    κ   1  and    κ   2 .
       

     Let κ be an AKB.    κ   1 ={(γ(μ))′→μ|μϵκ}, where for μϵκ, Γ κ (μ)={τϵM κ |μϵτ} and γ(μ)=∪ τϵΓ     κ     μ) α κ (τ) if Γ κ (μ)≠Ø. Otherwise, γ(μ)=Ø. 
     Given an AKB κ. Construct    κ   2  of κ.
         1. Let  =Ø.   2. For each τϵM κ  and each μϵτ, let G(μ,τ) be a new symbol in ∈ .   3. For each τϵM κ , add C κ the constraint that the collection {G(μ,τ)|μϵτ} forms a partition of α κ (τ).   4. For each μϵκ, add to   the object ∩ τϵΓ     κ     (μ) (G(μ,τ))′→μ.   5. Return  .       

     Let κ be an AKB and   an ideal immediate extension of κ. If m is a κ-measure, then m can be extended to a    ↓ -measure M. In particular, if   =   κ   2 , then we can assign M(G(μ,τ)) to be any nonnegative values, for every τκM κ and μκτ; provided Σ μκτ M(G(μ,τ))=1 for every μϵκ. More information and/or human intervention will be needed in order to assign specific values for M(G(μ,τ)). However, if no such information is forthcoming, assign M(G(μ,τ))=1/|τ|. 
     The above discussions show how one could construct second order AKBs to guarantee consistency in κ,  κ  and/or {umlaut over (κ)}. It follows from the above results that new knowledge can be extracted from κ in meaningful ways. Thus, AKBs provides a computational framework for knowledge extraction and data mining. Moreover, the selection of different ideal immediate extension for an AKB gives rise to different knowledge extractions/data mining schemes (See Section 8). 
     Section 8. Free-Form Database 
       FIG.  10    is a diagram for illustrating the relations for generating a free-form database, according to an embodiment of the present invention. In this section, we provide methods for constructing free-form databases (FFDB), which are special type of AKBs, and show how relational databases can be transformed into FFDBs. Among other things, we show that by so doing, one can automatically deals with uncertainties and/or incompleteness in relational databases in a natural manner. Moreover, we shall use FFDBs to construct deductive and inductive databases. 
     Let κ be an AKB (over   and U). κ is a free-form database (FFDB) ( 500 ) if and only if every atomic proposition in   is of the form v= v , where v is a variable and  v ϵV v , the collection of all possible values for v. In addition, every variable v in an FFDB satisfies the following two conditions:
         1. ((v={umlaut over (v)} 1 ∧(v={umlaut over (v)} 2 ))ΨF whenever  v   1 ,  v   2 ϵV v  and  v   1 ≠ v   2 l ; and   2. V   v ϵV     v   (v= v )ΨT;       

     Observe that a relational database   is made up of a finite set of relations. Consider a relation   in   with header A 1 , . . . , A k . Then any member of   can be represented in the form: 
       ( A   1   =α   1 )∧ . . . ∧( A   k =α k )⇒( = T ),  (1)
 
     where ( =T) can be interpreted as the relation is in the database  , and ⇒is material implication in  . 
     Let   be a relational database.   is smallest FFDB which contains the collection of all U→p, over all relations   in  , where p is an expression of the form given in (1) above. 
     Only deterministic relational databases are defined above. However, in the new representation, uncertainties and/or incompleteness could be readily incorporated in κ  by changing the U in  to any appropriate subset E of U. Moreover, by using the above representation, not only is it possible to specify which relation is in the database, but it is also possible to specify which relation is NOT in the database by setting ( =F) instead of ( =T). 
     The dependencies/independencies among the data are of paramount importance in traditional databases, since these databases are subject to constant updating. Violations of these dependencies/independencies are the main sources of anomalies in these databases. The dependencies can be characterized by one-to-one and/or many-to-one relationships (dependencies). A many-to-one dependency (or functional dependency) can be expressed as: 
       ∧ i=1   k (v i   L = v   i   L )⇒(∧ j=1   n (v j   R = v   j   R ))∧( =T),  (2)
 
     where  v   i   L ϵV v     i     L  and  v   j   R ϵV v     j     R  for all i=1, 2, . . . , k and j=1, 2, . . . , n. A one-to-one dependency can be expressed as two many-to-one dependencies. 
     Expression (2) reduces to expression (1) when n=0. The left hand side of expression (2), for n≥0, represent independencies. In other words, the values of the variables v 1   L , v 2   L , . . . , v k   L  in (2) are arbitrary and independent of each other, and the set {v 1   L , v 2   L , . . . , v k   L } of variables forms a key. The concept of multi-valued dependency and join dependency (R. Fagin. A normal form for relational databases that is based on domain and keys. ACM Transaction on Database Systems, 6:387-415, 1981) can be viewed as some sort of independencies/dependencies, and thus can be reformulated as such. 
     Let   be a relational database.   is smallest FFDB which contains the collection of all U→p, where p is an expression of the form given in (2) above, with n≥0, over all dependencies/independencies in  . In addition,  = ∪ . In this case, we shall also say that κ is an augmented relational database (510). 
     The expression given by (2) above can be decomposed into the n expressions: ∧ i=1   k (v i   L = v   i   L )⇒(v j   R = v   j   R ),j=1, 2, . . . , n, and the expression (∧ i=1   k (v i   L = v   i   L ))⇒( T). 
     Each of these expressions, after decomposition, is a Home clause. Since expressions given by (1) are also Home clauses, therefore unification for any augmented relational database can be carried out in polynomial time. 
     The power of FFDBs is manifested not just in its capability and flexibility in representing relational databases (Amihai Motro. Imprecision and incompleteness in relational databases: Survey.  Information and Software Technology,  32(9):279-588, 1990; S. K. Lee. An extended relational database model for uncertain and imprecise information.  Proceedings of VLDB,  pages 211-220, 1992) with uncertainties and/or incompleteness, but also, as is shown below, in its ability to represent any deductive database (Raymond T. Ng. Reasoning with uncertainty in deductive databases and logic programs.  International Journal of Uncertainty, Fuzziness and Knowledge - based Systems,  5(3):261-316, 1997) under uncertainty, i.e, augmented deductive database. Moreover, the concept of FFDB lends itself to the construction of augmented inductive databases. These databases can serve as formal framework for extracting new information from relational databases. 
     Clearly, an augmented deductive database, i.e., a deductive database centered on the relational database  , can be represented by a FFDB κ, where  ⊆κ. Using such a representation, the full force of the results obtained for AKBs can be applied to deductive databases. Therefore, unlike existing deductive databases, the augmented deductive database is capable of handling full-fledge uncertainties and/or incompleteness ( 520  and  525 ). According to an aspect of an embodiment, at  520 , the deduction of  220  in  FIG.  3    is applied to FFDB to obtain augmented deductive databases. According to an aspect of an embodiment, at  530 , an inductive version of  230 , defined in Paragraph 137, is applied to FFDB to obtain augmented inductive databases. 
     Consider an FFDB κ where  ⊆κ and   is a relational database. If inductive reasoning (see Section 6) are employed instead of deductive reasoning, i.e., using ϕ κ  instead of σ κ , then we have an augmented inductive database ( 530  and  535 ). Unlike deductive databases, we are not interested in searching, deducing, and/or generating views for inductive databases. Instead, we are interested in acquiring possible new knowledge from the database, i.e., data mining. 
     Most FFDBs are consistent. Nevertheless,  κ  may not be consistent. Thus, the construction of second order AKBs associated with κ given in Section 7 is central to data mining in a relational database. 
     As discussed in Section 7, there are many different ways to guarantee consistency by selecting different associated second order AKBs. The different selections give rise to various natural schemes that can be used in data mining. 
     From the above discussions, it is clear that augmented inductive database can serve as general framework and formal model for knowledge acquisition and data mining in relational databases, with or without uncertainties and/or incompleteness. 
     Section 9. Average and Stochastic Independence 
     The main objective of the rest of this document is to show how to extend the measure m, with domain ∈, to {tilde over (m)}, with domain {tilde over (∈)}. We are particularly interested in those cases where both m and {tilde over (m)} are probability measures. This problem is central to many applications, in particular, reasoning in a knowledge-based system involving uncertainties and/or incompleteness, such as AKBs. 
     In the rest of this document, we shall denote by   the set of all non-negative integers, and denote by    +  the set of all positive integers. 
     Let us interpret the probabilities as frequencies. In other words, let ∈⊆2 U  (∈ is a subset of the universal set U), |U|=n (the universal set U has n elements), and let m denotes a function from ∈ into [0, 1] such that for every E in ∈, m(E)=k/n, where k=|E|. (IEI denotes the cardinality of E, i.e., the number of elements in E). Thus, m is a probability measure over ∈, and m(E) represents the probability of E. 
     If the sets in ∈ are explicitly specified, the problem of extending a measure m to {tilde over (m)} can be based upon determining the cardinality of any set in {tilde over (−)}. Unfortunately, this might not be the case. If E is in ∈ and |E|=κ, then E can stand for any subset of U with cardinality κ, subject to possibly some other constraints which will be discussed in subsequent sections. 
     A natural probabilistic extension for a measure m with domain ∈ to {tilde over (m)} with domain {tilde over (∈)} can be obtained by taking the average of the probabilities of all allowable sets in {tilde over (∈)}. 
     Let ∈⊆2 U , and A, Bϵ∈. Let |U|=n, |A|=a and |B|=b. Assume that A can represent any subset of U whose cardinality is a, and B can represent any subset of U whose cardinality is b. Then the average probability of A∩B is given by: 
     
       
         
           
             
               
                 m 
                 ~ 
               
               ( 
               
                 A 
                 ⋂ 
                 B 
               
               ) 
             
             = 
             
               
                 
                   
                     ∑ 
                     i 
                   
                   
                     [ 
                     
                       
                         ( 
                         
                           
                             
                               n 
                             
                           
                           
                             
                               a 
                             
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         ( 
                         
                           
                             
                               a 
                             
                           
                           
                             
                               i 
                             
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         ( 
                         
                           
                             
                               
                                 n 
                                 - 
                                 a 
                               
                             
                           
                           
                             
                               
                                 b 
                                 - 
                                 i 
                               
                             
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         i 
                         n 
                       
                     
                     ] 
                   
                 
                 
                   
                     ( 
                     
                       
                         
                           n 
                         
                       
                       
                         
                           a 
                         
                       
                     
                     ) 
                   
                   ⁢ 
                   
                     ( 
                     
                       
                         
                           n 
                         
                       
                       
                         
                           b 
                         
                       
                     
                     ) 
                   
                 
               
               = 
               
                 
                   
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               1 
                             
                           
                         
                         
                           
                             
                               a 
                               - 
                               1 
                             
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               1 
                             
                           
                         
                         
                           
                             
                               b 
                               - 
                               1 
                             
                           
                         
                       
                       ) 
                     
                   
                   
                     
                       ( 
                       
                         
                           
                             n 
                           
                         
                         
                           
                             a 
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             n 
                           
                         
                         
                           
                             b 
                           
                         
                       
                       ) 
                     
                   
                 
                 = 
                 
                   
                     
                       a 
                       n 
                     
                     × 
                     
                       b 
                       n 
                     
                   
                   = 
                   
                     
                       m 
                       ⁡ 
                       ( 
                       A 
                       ) 
                     
                     ⁢ 
                     
                       m 
                       ⁡ 
                       ( 
                       B 
                       ) 
                     
                   
                 
               
             
           
         
       
     
     The probability of any Eϵ{tilde over (∈)} above can be determined in a similar manner. In particular, it can be shown that {tilde over (m)}(A∩B′)=m(A) [1-m(B)] and {tilde over (m)}(A∪B)=m(A)+m(B)-m(A)m(B). 
     Under the assumption that no constraints are imposed, the average method used to compute {tilde over (m)} turns out to be the same as Scheme 2 given above. On the other hand Scheme 2 is based on the implicit assumption that the sets in ∈ are stochastically independent. Because of this, Scheme 2 fails completely if constraints exist among the sets in ∈. If constraints exist, the sets may no longer be stochastically independent. For example, under Scheme 2, {tilde over (m)}(A∩B)=m(A) m(B) for all A and B, regardless, even in the cases where A⊆B or A∩B=Ø. 
     Constraints among the sets in E could be inherent in most applications. The average method discussed above will still work even when such constraints exist. This will be examined in detail in the subsequent sections. Indeed, as we shall see below, using the average method, a new measure over ∈ may be created which takes into consideration one or more of (e.g., all) the constraints involved; and under the new measure, the sets in ∈ may be viewed as stochastically independent. For this reason, we shall refer to this new method as the constraint stochastic independence method. 
     The constraint stochastic independence method is the basis of a new computational model of uncertain reasoning—augmented reasoning. One of the important advantages of this method is its ability to deal with relationships among the bodies of evidences, or its capability to take into account constraints imposed on the bodies of evidences. For knowledge-based systems, this provides a unique mechanism to resolve relationships among the bodies of evidences. As stated earlier, this is a clear departure from all existing knowledge bases, which are incapable of supporting such constraints. This added feature can lead to more powerful, robust, accurate and/or refined characterizations of knowledge bases. 
     Section 10. Constraints 
     Let ∈⊆2 U , and A, B, Cϵ∈, where the cardinality of U, A, B and C are n, a, b and c, respectively. Suppose the only constraint is (A∪B)∩C =Ø. (This is equivalent to the two constraints A∩C=Ø and B∩C=Ø) In other words, A, B and C can represent any subsets of U with cardinality a, b and c, respectively, satisfying (A∪B)∩=Ø. In this case, provided m(A)+m(C)≤1 and m(B)+m(C)≤1, the average probability of A∩B can be computed as follows: 
     
       
         
           
             
               
                 m 
                 ~ 
               
               ( 
               
                 A 
                 ⋂ 
                 B 
               
               ) 
             
             = 
             
               
                 
                   
                     ∑ 
                     i 
                   
                   
                     [ 
                     
                       
                         ( 
                         
                           
                             
                               n 
                             
                           
                           
                             
                               c 
                             
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         ( 
                         
                           
                             
                               
                                 n 
                                 - 
                                 c 
                               
                             
                           
                           
                             
                               a 
                             
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         ( 
                         
                           
                             
                               a 
                             
                           
                           
                             
                               i 
                             
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         ( 
                         
                           
                             
                               
                                 n 
                                 - 
                                 c 
                                 - 
                                 a 
                               
                             
                           
                           
                             
                               
                                 b 
                                 - 
                                 i 
                               
                             
                           
                         
                         ) 
                       
                       ⁢ 
                       
                         i 
                         n 
                       
                     
                     ] 
                   
                 
                 
                   ( 
                   
                     
                       
                         
                           n 
                         
                       
                       
                         
                           c 
                         
                       
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               c 
                             
                           
                         
                         
                           
                             a 
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               c 
                             
                           
                         
                         
                           
                             b 
                           
                         
                       
                       ) 
                     
                   
                 
               
               = 
               
                 
                   
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               1 
                             
                           
                         
                         
                           
                             c 
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               c 
                               - 
                               1 
                             
                           
                         
                         
                           
                             
                               a 
                               - 
                               1 
                             
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               c 
                               - 
                               1 
                             
                           
                         
                         
                           
                             
                               b 
                               - 
                               1 
                             
                           
                         
                       
                       ) 
                     
                   
                   
                     
                       ( 
                       
                         
                           
                             n 
                           
                         
                         
                           
                             c 
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               c 
                             
                           
                         
                         
                           
                             a 
                           
                         
                       
                       ) 
                     
                     ⁢ 
                     
                       ( 
                       
                         
                           
                             
                               n 
                               - 
                               c 
                             
                           
                         
                         
                           
                             b 
                           
                         
                       
                       ) 
                     
                   
                 
                 = 
                 
                   
                     
                       m 
                       ⁡ 
                       ( 
                       A 
                       ) 
                     
                     ⁢ 
                     
                       m 
                       ⁡ 
                       ( 
                       B 
                       ) 
                     
                   
                   
                     1 
                     - 
                     
                       m 
                       ⁡ 
                       ( 
                       C 
                       ) 
                     
                   
                 
               
             
           
         
       
     
     The above example illustrates the roles constraints play in the extension of m to {tilde over (m)}, as well as, the restrictions constraints imposed on the values of the original m. 
     It is clear from the above discussions that we do not have to be interested in the specific subsets of U. Each member E in ∈ represents a potential subset of U where |E| is fixed and E satisfies the constraints specified. The notation ∈⊆2 U  does not accurately reflect this concept. Therefore, in an embodiment of this invention, we shall introduce the new notation ∈  2 U , together with certain related new concepts. 
     In the new notation ∈ 2 U , we can view each member of E as a set variable which can be assigned certain subsets of U. For each Eϵ∈, all subsets of U that can be assigned to E should have the same cardinality. This common cardinality will be denoted by |E|. 
     Given ∈  2 U , E is completely defined only if |E| is specified for every Eϵ∈. Alternatively, we can specify a function m from E into ∈ into [0, 1] and let |E|=m(E)×|U| for all Eϵ∈. Observe that m(E) is the probability of any subset of U that can be assigned to E. We shall refer to m as a measure over ∈, and denote by |⋅∈ m  the cardinality induced by m, i.e., |E| m =m(E)×|U| for all Eϵ∈. Clearly, if m(E)=0, then E can only be assigned the subset Ø; and if m(E)=1, then E can only be assigned the subset U. For simplicity, we shall also denote by Ø (U) the set variable that can be assigned only the set Ø (U). 
     The members of ∈, where ∈ 2 U , may be subject to certain constraints as illustrated above. Each constraint imposed further restrictions on the subsets of U that can be assigned to the set variables in ∈. It is clear from the above example that given a probability measure m and a collection of constraints   for ∈, some additional conditions may have to be imposed to insure that m and   are compatible. 
     More formally, we start with a collection ∈ of objects. The collection {tilde over (∈)} is defined recursively as follows: 
     1. If Eϵ∈, then E is in {tilde over (∈)}. 
     2. If Z, Z 1 , Z 2  ϵ{tilde over (∈)}, then Z′, Z 1  ∪ Z 2  and Z 1  ∩ Z 2  are in {tilde over (∈)}. 
     A constraint for ∈ is an expression of the form Z 1  rel Z 2 , where Z 1 , Z 2  ϵ{tilde over (∈)} and rel is one of the following relational operators: ⊆, ⊆, ⊆, ⊆, ⊇, ⊇, ⊇, ⊇, =, ≠. 
     A complete instantiation ζ of ∈ is a mapping from ∈ into 2 U . If ζ is a complete instantiation of ∈, and W any expression or relation involving members of ∈, then ζ(W) is the expression or relation, obtained by replacing each Eϵ∈ that occurred in W by ζ(E). In particular, if W is a constraint for ∈, then ζ(W) is the set relation, obtained by replacing each Eϵ∈ that occurred in W by ζ( ). If ζ is a complete instantiation of ∈, and   is a collection of constraints for ∈, then ( ) is the collection of all ζ(W) where Wϵ . Let   be a collection of constraints for ∈, and W a constraint for ∈. W is derivable from   if and only if for all complete instantiation of ζ of ∈, ζ(W) follows from ζ( ). Let    1  and    2  be collections of constraints for ∈.    1  and    2  are equivalent if and only if for every constraint W for ∈, W is derivable from    1  whenever W is derivable from    2 , and vice versa. 
     A complete definition of ∈ 2 I  requires the specification of a collection   of constraints for ∈(  may be empty, i.e., no constraint is imposed on ∈), and a measure m over ∈. A measure m over ∈ is a function from ∈ into [0, 1] such that for every Eϵ∈,|E| m =|U|×m(E)ϵ . 
     A complete instantiation of ζ of ∈is legitimate over m and   if and only if for each Eϵ∈, |ζ(E)|=|E| m , and for every Wϵ , ζ(W) holds. 
     Let m be a measure over ∈ and ζ a legitimate complete instantiation of ∈ over m and  . Let ζ m  be a function from ζ(∈)={ζ(E)|Eϵ∈} into [0, 1], where ζ m (ζ(E))=m(E). Clearly, ζ m  is a probability measure over ζ(∈). 
     If there is at least one complete instantiation legitimate over m and  , then m and   are compatible (or m is compatible with  ).   is consistent if and only if m and   are compatible for some measure m over ∈. The issue of compatibility is addressed in Section 13 below. 
     Let   be a collection of constraints for ∈ 2 U , and m a measure over ∈. Let W be a relation involving m and members of ∈. W is valid if and only if for all complete instantiation ζ of ∈ legitimate over m and  , ζ(W) holds. 
     In what follows, if   is a collection of constraints for ∈ 2 U , then   is assumed to be consistent. Moreover, given ∈ 2 U , if the concepts or results hold for arbitrary  , then   will not be specified. In other words, no   doesn&#39;t mean that   is empty. Similarly, if the concepts or results hold for arbitrary m, then m will not be specified. 
     Let ∈ 2 U ,   a collection of constraints for ∈, and m a measure over ∈ which is compatible with  . {tilde over (m)} is the function from {tilde over (∈)} into [0, 1], such that for every Eϵ{tilde over (∈)}, {tilde over (m)}(E) is the average of all |ζ(E)|, where ζ is taken over all complete instantiations of ∈ which are legitimate over m and  . 
     Clearly, in the above definition, the extension of m to {tilde over (m)} corresponds to using the average for finding the probability of the new set. The compatibility of m and   guarantees that {tilde over (m)} is a ‘probability measure’. 
     In both the examples given above, {tilde over (m)}(A∩B) is well-defined or unique, since their values depend solely on the probabilities of the sets which are involved. However, this is not true in general. 
     It can be shown that inclusion of the relational operators of the types ≠ ⊆ ,⊆, ⊇  or ⊇ in a collection of constraints for ∈, may cause the extension {tilde over (m)} of m to be ill-defined, i.e., not well-defined. 
     In addition, for the extension {tilde over (m)} to be well-defined, all constraints of the form B 1 ∩B 2 ∩ . . . ∩B l =Ø, where 1&gt;2, should be derivable from other constraints. In other words, one need only considers disjoint relations or constraints of the form A∩B=Ø. Unfortunately, as we shall see in the next section, this restriction, together with the restrictions given below, are not sufficient to guarantee that the extension will be well-defined (i.e., the extension will depend solely on the individual probabilities). 
     There are many possible constraints or relations among the elements in ∈  2 U , which do not contain relational operators of the types ≠⊆,⊂,⊇ and ⊂. These constraints are listed below: 
     1. (disjoint) In view of remark given above, an example intersection involving only two members of ∈ is described. Let A, B ϵ∈. Since A′∩B′=Ø is equivalent to A∪B=U, all such relationships will be replaced by equivalent relationships discussed below (Case 6) and dealt with accordingly. In addition, A∩B′=Ø is equivalent to A⊆B. These relations will be converted to subset relations (case 2) and dealt with accordingly. Thus, we shall restrict our attention only to disjoint relations of the form A∩B=Ø where both A and Bϵ∈. In addition, if A⊆B and B∩C=Ø, then A∩C=Ø. Thus, it is essential to capture these implied disjoint relations. 
     2. (subset) Let A, Bϵ∈. Clearly, 
     A⊆B′ is equivalent to A∩B=Ø (Case 1 above); 
     A′⊆B is equivalent to A∪B=U (Case 6 below); and 
     A′⊆B′ is equivalent to B⊆A. 
     Therefore, it is only necessary to consider A⊆B where A, B ϵ∈. However, ⊆ is a transitive relation. Thus, it is essential that we captured most of, or all, or a number of according to application criteria, the subset relations, whether they are explicit, implicit or derived. Moreover, subset relations could give rise to equality relations. These equality relations (case 3) should be captured and dealt with accordingly. 
     3. (equality) Let A, Bϵ∈. If A=B, then we can remove B from ∈ and replace all occurrences of B by A, and all occurrences of B′ by A′. Alternatively, A=B can be replaced by |A|=|B|, and either A⊆B or B⊆A. (If either A⊆B or B⊆A is implied by other constraints, then replace A=B with |A|=|B|.) A=B′ is equivalent to {A, B} is a partition of U, which is Case 4 below. Furthermore, A=Ø can be replaced by |A|=0, and A=U can be replaced by |A|=1. 
     4. (partition) {A 1 , A 2 , . . . , A κ } is a partition of A 0  if and only if the following conditions hold:
         a. A i ∩A j =Ø for all 1≤i, j≤k and i≠j;   b. A i ⊆A 0  for 1≤i≤k; and   c. |A 0 |=|A 1 |+|A 2 |+ . . . +|A k |.       

     Hence, all partition relations can be replaced by disjoint relations and subset relations, plus imposing certain conditions on the measure m. 
     5. (A∩B=C) If A∩B=C≠Ø, then extend ∈ to include the objects G 1  and G 2 , where |G 1 1|=|A|-|C| and |G 2 |=|B|-|C|. In essence, we are trying to decompose A and B into the sets A=G 1 ∪C and B=G 2 ∪C. Clearly, A∩B=C is completely characterized by the values assigned to |G 1 | and |G 2 |, and the facts that {C, G 1 } is a partition of A, and {C, G 2 } is a partition of B. 
     6. (A∪B=C) If A∪B=C, then extend ∈ to include the objects G 0 , G 1  and G 2 , where |G 0 |=|A|+|B|-|C|, |G 1 |=|A|-|G 0 |, and |C 2 |=|B| 0  |G 0 |. In essence, we are trying to decompose A and B into the sets G 0 =A∩B, G 1 =A-G 0  and G 2 =B-G 0 . Clearly, A∪B=C is completely characterized by the values assigned to |G 0 |, |G 1 | and |G 2 |; the three sets G 0 , G 1  and G 2  are pairwise disjoint; and the facts that {G 0 , G 1 } is a partition of A, and {G 0 , G 2 } is a partition of B. In view of Cases 1 and 2 above, the case C=U is of particular significance. 
     7. (intersection) A 0 =A 1 ∩A 2 ∩A k  is equivalent to A 1 ∩A 2 ∩ .. . ∩A k ∩A 0 ′=Ø. In view of the above result, only the case k=2 will be considered. This is equivalent to Case 5 above. 
     8. (union) A 0 =A 1 ∪A 2 ∪ . . . ∪A k  is equivalent to A 0 ′=A 0 ′∩A 2 ′ ∩ . . . . ∩A k ′. Therefore, only the case k=2 will be considered. This is equivalent to Case 6 above. 
     9. (proper subset) Let A, Bϵ∈. A⊂B if and only if A⊆B and |A|&lt;|B|. 
     Observe that:
         constraints of the form A⊆B∪C and of the form A∩B⊆C, if not derivable from other constraints, may cause {tilde over (m)} to be ill-defined;   constraints of the form B∪C⊆A can be characterized using only subset relations; and   constraints of the form C⊆A∩B can be characterized using only subset relations.       

     The above discussions show how various constraints or relations can be transformed into constraints or relations of the form A∩B=Ø and/or A⊆B, where A, B ϵ∈. 
     Section 11. Graph Representations 
       FIG.  11    is a flow diagram for generating graph representations, according to an embodiment of the present invention. Actually  FIG.  11    presents 2 graphs representations which are used in subsequent discussions—admissibility and compatibility. Both representations are described in this Section. In the previous section, we showed that constraints or relations that can be transformed into constraints or relations of the form A∩B=Ø and/or A⊆B, where A, B ϵ∈ are, for example, necessary for the extension to be well-defined. In this section, we shall show that these conditions might not be sufficient. In order to get a better understanding of the structures of collections of constraints, we shall also represent collections of constraints using graphs. 
     Let ∈  2 U . An acceptable constraint or relation for ∈ is a constraint or relation of the form A∩B=Ø or of the form A⊆B, where A, B ϵ∈. Moreover, let   be a collection of constraints for ∈  2 U .   is weakly acceptable if and only if every constraint in   is acceptable. 
     Clearly, ⊆ is transitive. Moreover, if A⊆B and B∩C=Ø, then A∩C=Ø. Therefore, there might be constraints or relations not in   but implied by the constraints or relations in  . 
     Let   be a collection of constraints for ∈  2 U .   is maximal if and only if all acceptable constraints implied by   are also in  . Moreover,    X  will denote the smallest weakly acceptable collection of constraints that contains   and is maximal. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 1. (Construction of     X ) Let    be a weakly acceptable 
               
               
                 collection of constraints for ε    2 U . 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Let     X  =     . 
               
               
                 2. 
                 Let     0  be the subset of    which contains all the subset relations of    , i.e., (A ⊆ B) ∈     0  if 
               
               
                   
                  and only if (A ⊆ B) ∈    . 
               
               
                 3. 
                 Construct the transitive closure of     0  using any standard method, for example, Alfred V. 
               
               
                   
                  Aho, John E. Hopcroft, and Jeffrey D. Ullman.  The Design and Analysis of Computer   
               
               
                   
                   Algorithms . Addison Wesley, 1974. 
               
               
                 4. 
                 Enlarge     X  to include all members in the transitive closure of     0   
               
               
                 5. 
                 For each (A ⊆ B) ∈     X , let     A⊆B  be the set of all relations of the form (B ∩ C = Ø) ∈     X . 
               
               
                   
                  For each relation (B ∩ C = Ø) ∈     A⊆B , add to     X  the relation (A ∩ C = Ø). 
               
               
                   
               
            
           
         
       
     
     Let   be a weakly acceptable collection of constraints for ∈ 2 U .
         1. The directed graph associated with (∈,  ), denoted by    ∈ ( ), is the directed graph (∈,  ), where  ={(A, B)|A, B ϵ∈, either (A∩B=Ø) or (A⊆B) ϵ }.   2. The SR-graph associated with (∈,  ) is the directed graph  =(∈,  ) where  ={(A, B)|A, B ϵ∈, (A⊆B)ϵ }.       

     Let   be a weakly acceptable collection of constraints for ∈  2 U , and let   be the SR-graph associated with (∈,  ). Clearly, every directed cycle in   is equivalent to some B 1  ⊆ B 2  ⊆ . . . ⊆B k , where B 1 =B k , and vice-versa. This implies that B 1 =B 2 = . . . =B k . Due to the above observation, the following algorithm can be used to remove one or more of (e.g., all) equality relations and one or more of (e.g., all) subset relations in C that give rise to equality: 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 2. Removal of Equality Relations) Let    be a weakly acceptable collection 
               
               
                 of constraints for ε    2 U , and    be the SR-graph associated with (ε,    ). 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Remove both A ⊆ B and B ⊆ A if both are in    . 
               
               
                 2. 
                 Determine all directed cycles in    (this can be done using standard algorithms, for 
               
               
                   
                  example, depth-first search algorithm discussed in Alfred V. Aho, John E. Hopcroft, and 
               
               
                   
                  Jeffrey D. Ullman.  The Design and Analysis of Computer Algorithms . Addison Wesley, 
               
               
                   
                  1974). 
               
               
                 3. 
                 Remove all the subset relations from    which appear in the directed cycles. 
               
               
                 4. 
                 Process the equality relations obtained in the Steps 1, and/or 2 using the methods given 
               
               
                   
                  above on how to handle equality. 
               
               
                   
               
            
           
         
       
     
     Given a weakly acceptable collection of constraints   for ∈  2 U .   is acceptable if and only if   is maximal, ∈ϵ∈, and no equality relation between any two members of ∈ can be derived from the constraints in  . 
     Let   be an undirected graph and let C be a cycle in  . C is pure if and only if C is simple, has length&gt;3, and contains no subcycles. If   is a directed graph and Can undirected cycle in  , then C is a pure cycle of   if and only if C is a pure cycle of | |. 
     Let   be an acceptable collection of constraints for   2 U . If there exists a pure cycle in |   ∈ ( )|, then the extension of m is not well-defined (it is not dependent solely on the individual probabilities). 
     Section 12. Admissibility 
       FIG.  12    is a flow diagram for checking for admissibility, according to an embodiment of the present invention. We have shown in the previous section that for m to have a well-defined extension, not only is it necessary that the collection   of constraints be acceptable, but also that the undirected graph that represents   cannot have any pure cycle. The main result of this section asserts that this is not only a necessary condition, but it is also a sufficient condition. 
     Let   be a directed or undirected graph.   is admissible if and only if   has no pure cycles. Moreover, let   be an acceptable collection of constraints for ∈ 2 U .   is admissible if and only if    £ ( ) is admissible. 
     Clearly, if   is empty, then   is admissible.   is empty means the elements in ∈ are not subject to any explicit constraints. 
     Let  =(V,  ) be an undirected graph and   a total ordering on V.   is permissible on   if and only if for every A, B, C ∈V, if {A, B}, {A, C} ∈  and {B, C} Ε  , then either A  B or A  C. Let  =(V,  ) be a tree with root T.
         Let AϵV.   (A), the depth of A over  , is the length of the path from T to A. In particular, d(T)=0.   Let AϵV.   (A) is the set of all children of A in  .      is the total ordering on V, where for all A, B ϵV, A  B if and only if either d(A)&lt;d(B), or d(A)=d(B) and A lies to the left of B.   Let AϵV.   (A) is the set of all BϵE V where B=A; d(A)=d(B) and A  B; or B is the child of some E in   where d(E)=d(A) and E  A.       

     Let  =(V, , ) be a forest, i.e., a collection of disjoint trees, and   a total ordering on V.   is compatible with   if and only if for every A, B ϵV, A  B whenever A  B for some tree   contained in  . 
     Let  =l(V,  ) and  =(V 0 ,  ) be directed or undirected graphs.   is a maximal directed or undirected subgraph of   if and only if V 0 ⊆V, and for every A, B ϵV 0 , {A, B} ϵ   0  if and only if {A, B}ϵ . 
     Let  =(V,  ) be an undirected graph and   a total ordering on V. The following algorithm provides a constructive definition for the concept of recursive breadth-first search (RBFS) forest for   based on  . An RBFS forest can be constructed recursively using recursive breadth-first search. In the following algorithm, the nodes in V are initially unmarked, and marking of nodes is a global operation. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 1. (Construction of RBFS forest) Given an undirected 
               
               
                 graph    = (V,    ) where V ≠ Ø, and    a total ordering on V. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Let Q be a queue which is initially empty. 
               
               
                 2. 
                 Let    be a forest which is initially empty. 
               
               
                 3. 
                 While there are unmarked nodes in V, do the following: 
               
            
           
           
               
               
               
            
               
                   
                  a) 
                  Let T be the unmarked node in V that precedes all other unmarked nodes in V under 
               
               
                   
                   
                     . 
               
               
                   
                  b) 
                  Mark T, and enqueue T into Q. 
               
               
                   
                  c) 
                  Add to    the tree    which includes the node T (The root of    is T). 
               
               
                   
                  d) 
                  Add to    the tree    which includes the node T (The root of    is T). 
               
            
           
           
               
               
               
            
               
                   
                  i. 
                 Dequeue from Q and let E be the node dequeued. 
               
               
                   
                  ii. 
                 Let S be the set consisting of all unmarked nodes in V which are neighbor of E in 
               
               
                   
                   
                     . 
               
               
                   
                 iii. 
                 If S is not empty, do the following: 
               
            
           
           
               
               
               
            
               
                   
                 A. 
                 Let     0  = (S,     0 ) be a maximal undirected subgraph of    . 
               
               
                   
                 B. 
                 Call Algorithm 1 with input     0  and let     0  be the output from the algorithm. 
               
               
                   
                 C. 
                 Let     S  be a total ordering on S compatible with     0  and order S according to 
               
               
                   
                   
                      S . 
               
               
                   
                 D. 
                 Make the nodes in S children of E and arranged the children in the prescribed 
               
               
                   
                   
                 order, i.e., according to     S . 
               
               
                   
                 E. 
                 Append S to Q in the prescribed order, i.e., according to     S . 
               
            
           
           
               
               
            
               
                 4. 
                 Output    . 
               
               
                   
               
            
           
         
       
     
     Let #=(V,  ) be an undirected graph and let   be a total ordering on V. Let    0  be a total ordering on V.   is an RBFS-ordering on   based on    0  if and only if   is compatible with the RBFS forest for   based on    0 . Moreover,   is an RBFS-ordering on   if and only if there exists a total ordering    0  on V such that   is an RBFS-ordering on   based on    0 . 
     Let   be an acceptable collection of constraints for ∈ 2 u . The following statements are equivalent:
         1.   is admissible.   2.    ∈ ( )| is admissible.   3. |   ∈ ( )| contains no pure cycle.   4. There exists a total ordering on ∈ which is permissible on |   ∈ ( )|.   5. Any RBFS-ordering on |  ( )| is permissible on |   ∈ ( )|.       

     Any of the criteria above can be used to test and ensure that   is admissible. 
     We shall now provide a polynomial algorithm to determine whether or not a given acceptable collection of constraints for ∈ 2 U  is admissible, based on 5 above. It is clear that RBFS forest and RBFS-ordering can play a central role in the following algorithm. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 2. (Checking for Admissibility) Let    be an acceptable 
               
               
                 collection of constraints for ε    2 U . 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Construct    = |     ε (    )|. 
               
               
                 2. 
                 Let    be any total ordering on ε. Construct the RBFS-ordering    over 
               
               
                   
                     based on    using Algorithm 1. 
               
               
                 3. 
                 For i = 1 to i = |ε|, do the following: 
               
            
           
           
               
               
               
            
               
                   
                  a) 
                 Determine    . 
               
               
                   
                  b) 
                 For every A, B ∈    , determine whether or not {A, B} is 
               
               
                   
                   
                 in    . If {A, B} is not in    , stop.    is not admissible. 
               
               
                   
                   
                 Otherwise, continue. 
               
            
           
           
               
               
            
               
                 4. 
                 Stop.    is admissible. 
               
               
                   
               
            
           
         
       
     
     Section 13. Compatibility 
       FIG.  13    is a flow diagram of checking for compatibility, according to an embodiment of the present invention. Sufficient conditions for m and   to be compatible are given in this section. An optimal method for adjusting the values of a given measure to make it compatible with the constraints is also provided. 
     Let C be an acceptable collection of constraints for ∈ 2 U  and V⊆∈. B is well-nested under C if and only if for every A, BϵB, r c (A, B) is defined, i.e., any pair of sets in B are either disjoint or one of the set is a subset of the other. In addition, if B be well-nested under C and T=(V, R) is a tree, then T is a well-nested tree of B if and only if V=B∪{U}, and for every A,BϵV, A is the parent of B in T if and only if A⊇B. 
     Let   be an admissible collection of constraints for ∈ 2 U , =|   ∈ ( )|,   a RBFS-ordering over   based on some total ordering on ∈, and 1≤|∈|. The following algorithm provides constructive definitions for   and  . 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 1. (Construction of    and    ) Let    be an admissible collection 
               
               
                 of constraints for ε    2 U  and    a total ordering on ε. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Construct    = |     ε (    )|. 
               
               
                 2. 
                 Construct the RBFS-ordering    over    based on    using Algorithm 1. 
               
               
                 3. 
                 Order the nodes in    according to    . Say E 1 , E 2 , ... E m . 
               
               
                 4. 
                 For k = 1 to k = m, do the following: 
               
            
           
           
               
               
               
            
               
                   
                  (a) 
                  Determine    (E k ). 
               
               
                   
                  (b) 
                  Construct a well-nested tree    for    (E k ). 
               
               
                   
                  (c) 
                 Let    be the parent of E k  in    . 
               
               
                   
                  (d) 
                 Let    be the collection consisting of all siblings of E k  in    . 
               
               
                   
                  (e) 
                 Let    be the collection consisting of all children of E k  in    . 
               
            
           
           
               
               
            
               
                 5. 
                 Return the following sequences: 
               
            
           
           
               
               
               
            
               
                   
                  (a) 
                     , ... ,    . 
               
               
                   
                  (b) 
                     , ... ,    . 
               
               
                   
                  (c) 
                     , ... ,    . 
               
               
                   
                   
               
            
           
         
       
     
     Let   be an admissible collection of constraints for ∈  2 U , where ∈ is ordered by a RBFS-ordering   over   based on some total ordering on ∈, m a measure over ∈, and 1k≤|∈|. 
     
       
         
           
             
               • 
               ⁢ 
               
                 m 
                 
                   p 
                   , 
                   𝒢 
                   , 
                   ≺ 
                 
                 k 
               
             
             = 
             
               m 
               ⁡ 
               ( 
               
                 ω 
                 
                   p 
                   , 
                   𝒢 
                   , 
                   ≺ 
                 
                 k 
               
               ) 
             
           
         
       
       
         
           
             
               • 
               ⁢ 
               
                 m 
                 
                   s 
                   , 
                   𝒢 
                   , 
                   ≺ 
                 
                 k 
               
             
             = 
             
               
                 ∑ 
                 
                   E 
                   ∈ 
                   
                     Ω 
                     
                       s 
                       , 
                       𝒢 
                       , 
                       ≺ 
                     
                     k 
                   
                 
               
               
                 m 
                 ⁡ 
                 ( 
                 E 
                 ) 
               
             
           
         
       
       
         
           
             
               • 
               ⁢ 
               
                 m 
                 
                   c 
                   , 
                   𝒢 
                   , 
                   ≺ 
                 
                 k 
               
             
             = 
             
               
                 ∑ 
                 
                   E 
                   ∈ 
                   
                     Ω 
                     
                       c 
                       , 
                       𝒢 
                       , 
                       ≺ 
                     
                     k 
                   
                 
               
               
                 m 
                 ⁡ 
                 ( 
                 E 
                 ) 
               
             
           
         
       
     
     Let   be an admissible collection of constraints for ∈ 2 U , and m a measure over ∈. m is super additive over   if and only if m(E)≥Σ E     0     ϵ∈     0    m (E 0 ) for every E ϵ∈ and E 0 ⊆∈, where all members of ∈ 0  are pairwise disjoint and E 0 ⊆ E for every E 0  ϵ∈ 0 . 
     As shown in the following theorem, there are more than one method to test for admissibility—super additivity, permissible total ordering, etc. 
     Let   be an admissible collection of constraints for ∈  2 U  and let m be a measure over ∈. The following statements are equivalent:
         1. m and   are compatible.   2. m is super additive over  .   3. There exists a total ordering   on ∈ which is permissible on  =|   ∈ ( )|, such that for all 1≤i≤m,   ≤m(E i )≤m p,lG,   -  where ∈={E 1 , E 2 , . . . , E m } is ordered according to  .   4. For all total ordering   on ∈ which is permissible on   =   ∈ ( )|, and for all 1≤i≤m,  ≤m(E i )≤ -  where ∈={E 1 , E 2 , . . . , E m } is ordered according to  .       

     Criteria 2, 3 or 4 above together with Algorithm 1 can be used to test and ensure that m and   are compatible. 
     Let   be a collection of constraints for ∈ 2 U , and let ∈ 0 ⊆∈,E 0  ϵ∈∪{U}. ∈ 0  is a disjoint group of E 0  under   if and only if E⊆E 0  for every Eϵ∈ 0 , and all the members of ∈ 0  are pairwise disjoint under  . Moreover, ∈ 0  is a maximal disjoint group of E 0  under   if and only if ∈ 0  is a disjoint group of E 0  under  , and for every ∈ 1 ⊆∈ where ∈ 1 ⊂∈ 0 , ∈ 1  is a NOT a disjoint group of E under  . 
       FIG.  14    is a flow diagram of guaranteeing compatibility, according to an embodiment of the present invention. 
     Problem 1. (Minimization Problem for Compatibility) Let   be a collection of constraints for ∈  2 U , and m a measure over ∈.
         1. For each Eϵ∈∪{U}, let x E  be a real variable where 0≤m(E).   2. For each ∈ 0 ⊆∈ and E 0  ϵ∈ where ∈ 0  is a maximal disjoint group of E 0  under  , introduce the linear constraint Σ Eϵ∈     0   x E ≤x E     0   .   3. Minimize the objective function Σ Eϵ∈ (m(E)- 2 ,       

     Problem 1 is a quadratic programming problem (Alexander Schrijver.  Theory of Linear and Integer Programming . John Wiley, 1998) and therefore can be solved using standard techniques. 
     Let   be a collection of constraints for ∈  2 U , and m a measure over ∈. Let x E  be a solution of Problem 1, and let m 0 (E)=x E  for every Eϵ∈. Then m 0  is the measure over ∈ induced by m. 
     The above definition can be extended to partial measures. A partial measure m over ∈ is a measure over some subset of ∈. In this case, we extend m such that m(E)=1 for all Eϵ∈ which are not in the domain of m. 
     There are many other ways to guarantee that   and m are compatible, besides solving Problem 1. Nevertheless, the measure m 0  above is the measure closest to m, in the least square sense, without exceeding it. It should be noted that adjustment of the values of any measure might need to be done only sparingly to ensure the integrity of   and m. 
     Section 14. Preprocessing and Extension 
       FIG.  15    is a flow diagram of preprocessing, according to an embodiment of the present invention. In order to make the computation of {tilde over (m)}(E), where Eϵ{tilde over (∈)}, more efficient, an algorithm for preprocessing ∈,   and m is given. The preprocessing algorithm also determines whether or not   is admissible, and whether or not m and   are compatible. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 1. (Preprocess ε,    and m) Let    be an acceptable 
               
               
                 collection of constraints for ε    2 U ,    a total ordering on ε, and m a measure over ε. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Construct    = |     ε (    )|. 
               
               
                 2. 
                 Construct the RBFS-ordering    over    based on    using Algorithm 1. 
               
               
                 3. 
                 Order the nodes in    according to    . Say E 1 , E 2 , ... E m . 
               
               
                 4. 
                 For k = 1 to k = m, do the following: 
               
            
           
           
               
               
               
            
               
                   
                  a) 
                 Determine    (E k ). 
               
               
                   
                  b) 
                 For every A, B ∈    (E k ), determine whether or not {A, B} is in    . If {A, B} 
               
               
                   
                   
                 is not in    , stop.    is not admissible. Otherwise, continue. 
               
               
                   
                  c) 
                 Construct a well-nested tree    for    (E k ). 
               
               
                   
                  d) 
                 Determine    , and    . (see Algorithm 1) 
               
               
                   
                  e) 
                 Test whether or not the conditions for compatibility are satisfied. If any of the 
               
               
                   
                   
                 conditions are violated, stop.    is not compatible with m. Otherwise, continue. 
               
               
                   
                  f) 
                 Let    (E k ) = [m(E k ) −    ] ÷ [    −    −    ]. 
               
            
           
           
               
               
            
               
                 5. 
                 Return    . 
               
               
                   
               
            
           
         
       
     
     The preprocessing of ∈,   and m, combines all the constraints in   and produces a new function  . Clearly,   is a measure over ┐. 
     Let   be an admissible collection of constraints for ∈={E 1 , E 2 , . . . , E m }   2 U , where ∈ is ordered by some total ordering   on ∈ which is permissible on |lG ∈ ( )|. If Eϵ∈, then define   (E′)=1-  (E). 
     Let     2 U .   =B∪{B′|BϵB}. Moreover, let ∈  2 U . B is coset of ∈ if and only if B⊆∈ and for every Eϵ∈, not both E and E′ are in B. 
     Let   be an admissible collection of constraints for ∈={E 1 , E 2 , .. . , E m }  2 U , where ∈ is ordered by some total ordering   on ∈ which is permissible on |G ∈ ( )|, and B a coset of ∈. The   -cover   (B) of B under   is the smallest coset of ∈ satisfying the following conditions:
         1. B⊆  (B);   2. If B=E k  and there exists B 0  ϵ  (B) where B is the parent of B 0  with respect to the well-nested tree   for   (E k ), then B ϵ→  (B); and   3. If B=E k  and there exists B 0  ϵ (B) where B is a sibling of B 0  with respect to the well-nested tree   for   (E k ), then B′ ϵ  (B).       

     Let   be an admissible collection of constraints for ∈=l{E 1 , E 2 , . . . , E m }  , where ∈ is ordered by some total ordering   on ∈ which is permissible on |lG ∈ ( )|, m a measure over ∈ which is compatible with  , and   B a coset of ∈. Let |( ) be the intersection of all the sets in  . If |( )≠Ø, then for every permissible total ordering   on ∈: 
     
       
         
           
             
               
                 m 
                 ~ 
               
               ( 
               
                 I 
                 ⁡ 
                 ( 
                 ℬ 
                 ) 
               
               ) 
             
             = 
             
               
                 
                   m 
                   ~ 
                 
                 ( 
                 
                   
                     ⋂ 
                     
                       B 
                       ∈ 
                       
                         
                           Λ 
                           
                             𝒢 
                             , 
                             ≺ 
                           
                         
                         ( 
                         ℬ 
                         ) 
                       
                     
                   
                   
                     ( 
                     B 
                     ) 
                   
                 
                 ) 
               
               = 
               
                 
                   ∏ 
                   
                     B 
                     ∈ 
                     
                       
                         Λ 
                         
                           𝒢 
                           , 
                           ≺ 
                         
                       
                       ( 
                       ℬ 
                       ) 
                     
                   
                 
                 
                   
                     
                       m 
                       
                         𝒢 
                         , 
                         ≺ 
                       
                     
                     ( 
                     B 
                     ) 
                   
                   . 
                 
               
             
           
         
       
     
     In particular, if  =Ø, then 
     
       
         
           
             
               
                 m 
                 ~ 
               
               ( 
               
                 I 
                 ⁡ 
                 ( 
                 ℬ 
                 ) 
               
               ) 
             
             = 
             
               
                 
                   m 
                   ~ 
                 
                 ( 
                 
                   
                     ⋂ 
                     
                       B 
                       ∈ 
                       ℬ 
                     
                   
                   
                     ( 
                     B 
                     ) 
                   
                 
                 ) 
               
               = 
               
                 
                   ∏ 
                   
                     B 
                     ∈ 
                     ℬ 
                   
                 
                 
                   
                     
                       m 
                       
                         𝒢 
                         , 
                         ≺ 
                       
                     
                     ( 
                     B 
                     ) 
                   
                   . 
                 
               
             
           
         
       
     
     The above result provides a method for determining {tilde over (m)}(l( )). Clearly, under  , the relevant sets in ∈ are basically stochastically independent. This is the reason why we named our method constraint stochastic independence method. Furthermore, {tilde over (m)}(I( )) can be determined in 0(| | 2 )-time after preprocessing. 
     In general, if Gϵ{tilde over (∈)}, can express G as union of intersections of sets, such as disjunctive normal form. If all the terms in the expression are pair-wise disjoint, {tilde over (m)}(G) can be determined by applying the above result to each term and then summing them. 
     Section 15. Unification Algorithms 
     In this section, we provide several algorithms for determining ν k (F). 
     Let   be a collection of propositions. 
        ={P′|Pϵ  } and  = ∪ . 
        is the collection of all   P where Q⊆ . For completeness,   P=F if  =Ø. 
        is the smallest collection of propositions containing   and close under negation, conjunction and disjunction. 
     Let   be a collection of atomic propositions.   is a coset of   if and only if   ⊆  and for every Pϵ , not both P and P′ are in  . Let Lϵ . L is d-simple if and only if L=  P for some coset   of  . 
     Without loss of generality, we shall assume that L is d-simple whenever Lϵ . 
     An AKB κ is disjunctive if and only if there exists a finite collection   of atomic propositions such that Aϵ  for every (E→A) E K. 
     We shall assume that   is the smallest collection of atomic propositions that satisfies the above definition. 
     The following show how to transform an arbitrary AKB into a disjunctive AKB. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 1. (Disjunctive AKB) Given an AKB κ. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 For each ω ∈ κ, do the following: 
               
            
           
           
               
               
               
            
               
                   
                  (a) 
                 Express r(ω) as L 1  ∧ L 2  ∧ ··· ∧ L k , where L i  ∈    and L i   
               
               
                   
                   
                 is simple for each i = 1, 2, ..., k. 
               
               
                   
                  (b) 
                 For each i = 1, 2, ..., k, add to κ the object l(ω) → L i . 
               
               
                   
                  (c) 
                 Remove ω from κ. 
               
            
           
           
               
               
            
               
                 2. 
                 Return κ. 
               
               
                   
               
            
           
         
       
     
     Let κ be an AKB. κ is irreducible if and only if κ satisfies the following conditions: 
     1. For every ωϵκ, l(ω)≠Øand τ(ω)≠T.  6 p 2. κ is disjunctive. 
     3. For every ω 1 , ω 2 ϵκ, if τ(ω 1 )=τ(ω 2 ), then l(ω 1 )=l(ω 2 ). 
     4. For every ω 1 , ω 2 ϵκ, if τ(ω 1 )⇒τ(ω 2 ), then l(ω 1 )⊆l(ω 2 ). 
     The following show how to transform an arbitrary AKB into an irreducible AKB. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 2. (Irreducible AKB) Given an AKB κ. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Remove all ω from κ where l(ω) = Ø or r(ω) = T. 
               
               
                 2. 
                 Transform κ into a equivalent disjunctive AKB using Algorithm 1. 
               
               
                 3. 
                 Let κ = {ω κ   r |ω ∈ κ}, where ω κ   r  = V μεκ, r(μ)=r(ω)  μ. 
               
               
                 4. 
                 For every ω ∈ κ, let κ ω  = {μ ∈ κ|ρ(r(μ)) ⊆ ρ(r(ω))}. 
               
               
                 5. 
                 For every ω ∈ κ such that |κ ω | &gt; 1, replace ω with V μεκ     ω   μ. 
               
               
                 6. 
                 Return κ. 
               
               
                   
               
            
           
         
       
     
     Let κ be an irreducible AKB. 
       Ω   k ={E→A|E⊆U, Aϵ }, Ω̆={E→A|E⊆U,A,ϵ } and {tilde over (Ω)}× k ={E→A|E⊆U,Aϵ }. 
     Let Ø=Ω⊆{tilde over (Ω)} k . Then ∧ wϵΩ ω=(U→T) and ∨ wϵΩ ω=(Ø→F). 
     Let ωϵ{tilde over (Ω)} k . p 107  ) is the collection of all P ϵ  that occur in τ(ω), and |ω|=|o(ω)|. Let  ⊆  ω/  is obtained from ω by removing from τ(ω) all Pϵ . If p(ω) ⊆ , then ω/ =(l(ω)→F). Moreover, if  ={P}, then ω/P= 6107  / . 
     Let λ⊆κ and  ⊆ .
         λ ={μκλ| ⊆p(μ)},  λ   ={μϵλ| ∩p(μ)=Ø}, and λ/ ={μ/ |μϵα}.   If  ={P}, then λ p =λ p ,  λ   p = λ    and λ/P=λ/ .       

     Let κ be an irreducible AKB and Pϵ  P is a useless symbol if and only if κ p =Ø or κ p′ =Ø. Moreover, κ is useful if and only if P is not a useless symbol for all Pϵ   κ . 
     The following show how to transform an irreducible AKB into a useful AKB. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 3. (Useful AKB) Given a irreducible AKB κ. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
               
            
               
                   
                 1. 
                 While there exists a useless symbol P ∈    let κ =  κ   {P, P′} . 
               
               
                   
                 2. 
                 Return κ. 
               
               
                   
                   
               
            
           
         
       
     
     Let κ be an irreducible AKB, ω 1 , ω 2  ϵΩ̆ k  and Pϵ   k . P is complemented with respect to ω 1  and ω 2  if and only if either Pϵp(ω 1 ) and P′ϵp(ω 2 ), or P′ ϵp(ω 1 ) and P ϵp(ω 2 ). 
     Let κ be an irreducible AKB and ω l , ω 2  ϵΩ̆ k . c(ω 1 , ω 2 ) is the collection of all Pϵ   κ where P is complemented with respect to ω 1  and ω 2 . 
     Let P ϵ .
         ω 1 ˜ P ω if and only if P ϵp(ω 1 ), P′ϵp(ω 2 ) and c(ω 1 /P,ω 2 /P′)=Ø.   ω 1 ˜ω 2  if and only if ω 1 ˜ P ω 2  for some P ϵ . In other words, ω 1 ˜ω 2  if and only if |c(ω 1 , ω 2 )|=1.   If ω 1 ˜ P ω 2  where P ϵ  then ω 1 ⋄ω 2 =(l( 107   1 )∩l(ω 2 )→τ(ω 1 /P) vτ(ω 2 /P′)).       

     Otherwise, ω 1 ⋄ω 2  is not defined. In other words, ω 1 ⋄ω 2  merges ω 1  and ω 2  and removes both P and P′. In this case, we say that ω 1  and ω 2  are mergeable ( 300 )
         Γ(κω)=(κ-{μϵκ|τ(μ)=τ(ω)})∪{V μϵκ,τ(μ)=τ(ω) μ}.       

       FIG.  4    is a flow diagram of an example unification algorithm, according to an aspect of an embodiment of the invention.  FIG.  4    also emphasizes a new unification operator for reasoning under uncertainties and/or incompleteness capable of managing the rules and the sets of evidences together. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 4. (Unification Algorithm) Given a irreducible AKB κ. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Do while there exists an unmarked pair (ω 1,  ω 2 ), where ω 1,  ω 2  ∈ κ 
               
               
                   
                 and ω 1  ~ ω 2:   
               
            
           
           
               
               
               
            
               
                   
                  (a) 
                 Let κ = Γ(κ, ┌ 1  ⋄ ω 2 ). 
               
               
                   
                  (b) 
                 Mark (ω 1,  ω 2 ). 
               
            
           
           
               
               
            
               
                 2. 
                 Let    = {G ⊆ U|(G → F) ∈ κ}. If    ≠ Ø, then return ∪ G∈     G. 
               
               
                   
                 Otherwise, return Ø. 
               
               
                   
               
            
           
         
       
     
     Let κ be an irreducible AKB and P ϵ  Since σ κ (F)=σ κ (P) ∩σ κ (P′), therefore σ κ (F) can be determined recursively on   Although this requires the computations of both σ κ (τ(ω)) and σ κ ((τ(ω)′)), the two can be carried out in an integrated manner. Moreover, it can be used to reduce the size of κ. 
     The following show how to construct κ|P given an irreducible AKB κ, and P ϵ . 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 5. (Construction of κ|P) Given a irreducible AKB 
               
               
                 κ, and P ∈    . Return κ|P 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Do while there exists an unmarked pair (ω 1,  ω 2 ), where ω 1  ∈ κ P , 
               
               
                   
                 ω 2  ∈ κ P′ , and ω 1  ~ P  ω 2   
               
            
           
           
               
               
               
            
               
                   
                  (a) 
                 Let κ = ┌(κ, ω 1  ⋄ ω 2 ). 
               
               
                   
                  (b) 
                 Mark (ω 1,  ω 2 ). 
               
            
           
           
               
               
            
               
                 2. 
                 Return κ   {P, P′}   . 
               
               
                   
               
            
           
         
       
     
     Algorithm 5 can be used as a basis for a unification algorithm as shown below: 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 6. (Unification Algorithm based on κ|P) Given 
               
               
                 a irreducible AKB κ. Return G ⊆ U. 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 While there exists P ∈    , apply Algorithm 5 with input κ and P, and 
               
               
                   
                 let κ = κ|P. 
               
               
                 2. 
                 Let    = {G ⊆ U|(G → F) ∈ κ}. If    ≠ Ø then return    G. Otherwise 
               
               
                   
                 return Ø. 
               
               
                   
               
            
           
         
       
     
     By virtue of the above results, ω 1 ⋄ω 2 , where ω 1 ˜ω 2 , can be used as the basic operation in any unification algorithm for determining σ κ (F). (See  FIG.  4   ) The operator ⋄ is capable of performing deduction under uncertainties and/or incompleteness and is therefore a significant and natural generalization of the classical deduction process. Step 5 of Algorithms 4 and 6 can be intentionally left vague so that any ordering of (ω 1 , ω 2 ), where ω 1 , ω 2 ϵκ and ω 1 ˜ω 2 , and any ordering of  , can be used. As a matter of fact, many heuristics can be applied to various unification algorithms, e.g., Algorithms 4 and 6, to make them more efficient. 
     If necessary, the algorithms below can be used to reduce the size of κ, and therefore can be used to devise approximate algorithms to determine σ κ (L). 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 7. (Processing Rules with length ≤ q) Given a irreducible 
               
               
                 AKB κ and a non-negative integer q. Return κ (q) . 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                  Apply Algorithm 3 to transform κ into an equivalent useful AKB. 
               
               
                 2. 
                  While there exists an unmarked pair (ω 0 , ω 1 ) where ω 0 , ω 1  ∈ κ 
               
               
                   
                  such that |ω 0 | ≤ q and ω 0  ~ ω 1 , do the following: 
               
            
           
           
               
               
               
            
               
                   
                  (a) 
                 Let κ = ┌(κ, ω 0  ⋄ ω 1 ). 
               
               
                   
                  (b) 
                 Mark the pair (ω 0 , ω 1 ). 
               
            
           
           
               
               
            
               
                 3 
                 Return κ. 
               
               
                   
               
            
           
         
       
     
     Let κ be an irreducible AKB, ω 1 , ω 2  ϵκ, and ω 1 ˜ω 2 . d(ω 1 , ω 2 )=|ω 1 ⋄ω 2 |-max(|ω 1 |, |ω 2 )|. 
     
       
         
           
               
             
               
                   
               
               
                 Algorithm 8. (Processing Rules with d(ω 1 , ω 
               
               
                   2 ) ≤ q) Given a irreducible AKB κ and integer 
               
               
                 q ≥ −1. Return κ [q] . 
               
               
                   
               
             
            
               
                   
               
            
           
           
               
               
            
               
                 1. 
                 Apply Algorithm 3 to transform κ into an equivalent useful AKB. 
               
               
                 2. 
                 While there exists an unmarked pair (ω 1 , ω 2 ) where ω 1 , ω 2  ∈ κ such 
               
               
                   
                 that d(ω 1 , ω 2 ) ≤ q, 
               
               
                   
                  do the following: 
               
            
           
           
               
               
               
            
               
                   
                  (a) 
                 If ω 1  ~ ω 2 , replace κ by Γ(κ, ω 1  ⋄ ω 2 ). 
               
               
                   
                  (b) 
                  Mark the pair (ω 1 , ω 2 ). 
               
            
           
           
               
               
            
               
                 3. 
                 Return κ. 
               
               
                   
               
            
           
         
       
     
     The embodiments of the present invention can provide one or more of the following: 
     A computer-based method for constructing, reasoning, analyzing and applying knowledge bases with uncertainties and/or incompleteness. The system/model will be referred to as augmented knowledge base (AKB): (See Section 1)
         (a) The objects in an AKB are of the form E→A, where A is a logical sentence in a first-order logic, a proposition or a rule in the traditional sense, and E is a set corresponding to the body of evidences that supports A.   (b) No restrictions are imposed on E→A. For example, it is possible to have both E 1 →A and E 2 →A in the AKB κ. This means two or more sets of evidences can be used to support the same rule, thereby allowing, among other things, multiple experts/sources to be involved in designing a single AKB.   (c) Relationships among the bodies of evidences can be specified explicitly. In other words, constraints may be imposed on the bodies of evidences.   (d) A mapping associates each set (body of evidences), not each rule, with a value.   (e) In an AKB, evidences (the E&#39;s) and rules (the A&#39;s) represent completely different objects and each play an essential but separate role in the operations of an AKB.       

       FIG.  3    provides the basic mechanism for deductive reasoning on an AKB, according to an embodiment of the present invention. The basic mechanism associated with deductive reasoning on an AKB κ is 
     
       
         
           
             
               G 
               
                 
                   
                     → 
                     &#34;\[Rule]&#34; 
                   
                   d 
                 
                 κ 
               
               L 
             
             , 
           
         
       
     
     where G is a body or evidences and L is a target rule. The support σ κ (L) of L with respect to κ, and the plausibility  σ   κ (L) of L with respect to κ can all be determined using 
     
       
         
           
             G 
             
               
                 
                   → 
                   &#34;\[Rule]&#34; 
                 
                 d 
               
               κ 
             
             
               L 
               . 
             
           
         
       
     
     . (See Section 1) 
     Computation of σ κ (L) and  σ   κ (L), the support and plausibility of L, where L is a target rule, using σ κ (L)=σ κ     0    (F) where κ 0 =κ∪{U→L′}; and  σ   κ (L)=σ κ     1    (F) where κ 1 =κ∪{U→L}. (See Section 1) . This provides a universal method for computing the support and plausibility of L, for any L. 
     A new unification operator ω 1 ⋄ω 2  which is applicable to knowledge bases with uncertainties and/or incompleteness. (See Unification Algorithms Section). This new unification operator extends and generalizes the classical unification operators. The classical unification operators are not capable of dealing with uncertainties and/or incompleteness. (See also  FIG.  4   ) 
     Several unification methods/algorithms for determining σ κ (F). (See Unification Algorithms Section).  FIG.  4    is a flow diagram of an example unification algorithm, according to an aspect of an embodiment of the invention. 
     Functions or mappings representing the strength or validity of the body of evidences associated with a given rule, as well as, associated with all relevant rules. They are referred to as measure. (See Section 2) 
     AKBs can use the extension scheme constraint stochastic independence method given above and/or any other extension schemes, like those given in Section 2. Moreover, AKB can select more than one scheme at a time, and applied them either simultaneously and/or conditionally. 
       FIG.  6    is a flow diagram of deductive inference in AKB, according to an embodiment of the present invention. Method for performing deductive inference in an AKB—done in two separate steps: Given AKB κ ( 350 ) and target rule L ( 355 ). (See Sections 2 and 4).
         (1) Form the body of evidences that supports L. This can be accomplished by applying any of the Unification Algorithms given ( 360 ).   (2) Determine the value associated with the body of evidences obtained in the first step.       

     This depends on the extension scheme(s) selected for κ ( 362  and  364 ). 
     AKB encompasses most of the well-known formalisms of knowledge bases together with their associated reasoning schemes, including probabilistic logic(N. J. Nilsson. Probabilistic logic.  Artificial Intelligence,  28:71-87, 1986), Dempster-Shafer theory (G. Shafer.  A Mathematical Theory of Evidence. Princeton University Press,  1976), Bayesian network( Judea Pearl.  Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . Morgan Kaufmann, 1988), Bayesian knowledge base (Eugene Santos, Jr. and Eugene S. Santos. A framework for building knowledge-bases under uncertainty.  Journal of Experimental and Theoretical Artificial Intelligence,  11:265-286, 1999), fuzzy logic (L. A. Zadeh. The role of fuzzy logic in the management of uncertainty in expert systems.  Fuzzy Sets and Systems,  11:199-227, 1983; L. A. Zadeh. Fuzzy sets.  Information and Control,  8:338-353, 1965. 41; R. Yager. Using approximate reasoning to represent default knowledge.  Artificial Intelligence,  31:99-112, 1987), numerical ATMS (Johan DeKleer. An assumption-based TMS.  Artificial Intelligence,  28:163-196, 1986), incidence calculus (Alan Bundy. Incidence calculus: A mechanism for probabilistic reasoning.  Journal of Automated Reasoning,  1(3):263-283, 1985; Weiru Liu and Alan Bundy. Constructing probabilistic atmss using extended incidence calculus.  International Journal of Approximate Reasoning,  15(2):145-182, 1996), etc. We illustrated how to recast the first four as AKBs (see Section 3), so that they can be expanded, and results obtained for AKBs can be applied directly to them. 
     Present several important properties of AKBs and provide methods for checking, applying and/or managing them. The properties include: consistency, completeness, perfectness, contribution, i-consistency, i-completeness, i-perfectness, monotonicity, contribution, vulnerability, possible deception, etc. (see Section 5 and 6). (Many of these properties, such as contribution, vulnerability, etc. are applicable to any complex systems.) 
     Methods to enable AKBs to perform inductive inferences and extract meaningful new knowledge from AKBs as long as certain consistency conditions are satisfied (see Section 6). One such method of performing inductive inference in an AKB is as follows: Given AKB κ and Lϵ .
         (a) Construct  κ  and L′.   (b) Perform deductive inference on  κ  and L′.       

     Methods to construct consistent higher order AKBs, including    κ   0 ,    κ   1 , and different varieties of    κ   2 , to serve as extensions of any inconsistent AKB (see Section 7). 
     Present a new system/model named free-form database (FFDB) and provide methods for transforming relational databases and deductive databases into FFDBs, i.e., augmented relational database and augmented deductive database, which are special cases of AKBs (see Section 8). This provides a new way of dealing with relational databases and deductive databases, as well as expanding their capabilities. 
     Using FFDB, new system/model named augmented inductive database is presented which can be used to extract new information from relational databases (see Section 8). This provides a general, as well as integrated method for performing data mining. 
     A method for extending any probabilistic measure via the new notion of ∈  2 U  and by taking the average of all allowable sets. This method is referred to as constraint stochastic independence (CSI) method (see Sections 9). This method has a clear probabilistic semantics, and therefore not subject to the anomalies that are usually associated with other extension schemes. 
     Provide a new computational scheme for reasoning under uncertainties and/or incompleteness based on constraint stochastic independence method (see Section 10). 
     Present allowable constraints and provide methods to transform standard relations among sets into allowable constraints (see Section 10). 
     Provide a graph representation of weakly acceptable collection of constraints (see Sections 11). 
     Methods for checking and ensuring that the collection of constraints is admissible (see 12). 
     Methods for checking and ensuring that the constraints are compatible with the measure in the extension scheme based on CSI (see Section 13). 
     Optimal method to adjust the values of the measure to guarantee compatibility (see Section 13). 
     Provide a preprocessing method/algorithm so that the extension based on CSI can be computed more efficiently (see Section 14). 
     A method of representing/processing/extracting knowledge into/over/from a knowledge-based system, is provided as follows:
         (i) A knowledge base containing objects where each object is a rule or logical sentence (knowledge) associated with a set of evidences that supports the knowledge; Existing knowledge base, that involves uncertainties and/or incompleteness, contains mostly rules/knowledge, and a number representing the strength of the rule. Although evidences may be used in determining the number, these evidences are not explicitly represented in the knowledge base nor are they used in any way in the inference scheme.   (ii) A set of relationships among the bodies of evidences; Since existing knowledge bases used numbers directly, rather than bodies of evidences, they are incapable of dealing with the relationships among the bodies of evidences. This is a very significant factor in making the knowledge base, presented in embodiments of this invention, more powerful, robust, accurate and/or capable of more refined characterizations.   (iii) A mapping which associates each body of evidences with a value. In addition, each piece of knowledge may be associated with multiple bodies of evidences. Moreover, same bodies of evidences and/or some combinations of these bodies of evidences may be associated with any knowledge. This allows the knowledge base to be created by multiple experts and/or from multiple sources.   (iv) Methods for performing deductive and inductive inferences. Existing knowledge bases can only perform deductive inferences. However, since inductive inferences, in a knowledge base according to embodiments of this invention, can be viewed as dual (for example, inductive inference can be represented as the dual of inductive inference, i.e., instead of the original knowledge base, the negation of the knowledge and the complement of the associated bodies of evidences are used. Inductive inference can be used to extract new knowledge from the given knowledge base), inductive inferences can also be performed using our knowledge base. Inductive inference can be used to extract new knowledge from the original knowledge base, in other words, it is capable of doing data mining, etc.       

     According to an embodiment of the present invention, the described functions are implemented as a computer online service providing a database of knowledge according to embodiments of the present invention for representation of knowledge, knowledge acquisition mechanisms and inference mechanisms to output results or reports. According to an embodiment, a target knowledge is expressly associated with a set evidences that supports the target knowledge. The set of evidences can be dynamically maintained, for example, updated. The relationship of evidences with the target knowledge can be based upon input upon acquisition of the target knowledge. According to an embodiment, relationships among evidences (constraints) in a set of evidences are maintained. Target knowledge can be retrieved from data sources and/or created/generated. In addition, the evidences, including its relationships, in support of the target knowledge can be retrieved from data sources and/or created/generated. A computer implemented user interface can be provided to support input of target knowledge, its associated evidences, relationships among the evidences. Semantic data source based upon a domain ontology including value of evidences in support of the knowledge can be utilized. 
     For example, an expert (person and/or machine) can create knowledge and/or evidences, including its relationships, in support of the knowledge. According to an embodiment, a blog, social media chat or information may be a source of knowledge and/or evidences, including its relationships. 
     According to an embodiment, inference mechanism (reasoning) is based upon a value indicative of strength of the evidence. Deductive inference involves determining a set of evidences and its validity. Inductive inference involves determining the set of evidences that can induce new knowledge or extract (data mining) new knowledge, by utilizing the constraints of the evidences in the set of evidences supporting the target knowledge. According to the embodiments described methods are provided for checking and ensuring that the constraints are admissible and/or compatible, as described for example in paragraphs 233, 244 and  FIGS.  12 - 13   , an optimal method is provided to adjust the values of the measure to guarantee compatibility in case it is not compatible, and a preprocessing method/algorithm is provided so that the extension can be computed more efficiently. 
     Evidence strength indications may be derived and/or input, for example, based upon evaluations, rating. According to an embodiment, the evidence values are derived based upon probabilities. 
       FIG.  16    is a functional block diagram of a processing device, such as a computer (hardware computing/processing machine) for the embodiments of the invention, namely a computer  120  configured to execute functions of the augmented knowledge base computer system  100 . In  FIG.  16   , the computer can be any computing device that can execute instructions to provide the described functions. Typically, the computer includes an input device  1514  (for example, a mouse, keyboard, multi-touch display screen, etc.), output device  1502  (for example, a display to display a user interface or output information, printer, etc). One or more computer controller(s) or processing cores  1504  (e.g., a hardware central processing unit) executes instructions (e.g., a computer program or software) that control the apparatus to perform operations. According to an aspect of an embodiment, one or more networked computer servers, each with a number of processing cores, execute the described operations. 
     Typically, a memory component  1506  stores the instructions for execution by the controller  1504 . According to an aspect of an embodiment, the apparatus reads/writes/processes data of any computer readable recording or storage media  1510  and/or communication transmission media interface  1512 . The communication transmission media interface is to data network with one or other machines (e.g., computers, a distributed network) to execute the described functions. The embodiments can be implemented via grid computing. The display  1502 , the CPU  1504  (e.g., hardware logic circuitry based computer processor that processes instructions, namely software), the memory  1506 , the computer readable media  1510 , and the communication transmission media interface  1512  are in communication by one or more the data bus(es)  1508 . 
     According to an aspect of the embodiments of the invention, any combinations of one or more of the described features, functions, operations, and/or benefits can be provided. A combination can be one or a plurality. The embodiments can be implemented as an apparatus (a machine) that includes hardware for performing the described features, functions, operations, and/or benefits, for example, hardware to execute instructions or software, for example, computing hardware (i.e., computing apparatus), such as (in a non-limiting example) any computer or computer processor that can store, receive, retrieve, process and/or output data and/or communicate (network) with other computers. According to an aspect of an embodiment, the described features, functions, operations, and/or benefits can be implemented by and/or use computing hardware and/or software. For example, the computer  120  and expert/and other sources devices  110 , . . . , etc. can comprise a computing controller (CPU) (e.g., a hardware logic circuitry based computer processor that processes or executes instructions, namely software/program), computer readable media, transmission communication interface (network interface), input device, and/or an output device, for example, a display device, and which can be in communication among each other through one or more data communication buses. In addition, an apparatus can include one or more apparatuses in computer network communication with each other or other devices. In addition, a computer processor can refer to one or more computer processors in one or more apparatuses or any combinations of one or more computer processors and/or apparatuses. An aspect of an embodiment relates to causing and/or configuring one or more apparatuses and/or computer processors to execute the described operations. The results produced can be output to an output device, for example, displayed on the display. An apparatus or device refers to a physical machine that performs operations, for example, a computer (physical computing hardware or machinery) that implement or execute instructions, for example, by way of software, which is code executed by computing hardware, and/or by way of computing hardware (e.g., in circuitry, etc.), to achieve the functions or operations being described. The functions of embodiments described can be implemented in any type of apparatus that can execute instructions or code. More particularly, programming or configuring or causing an apparatus or device, for example, a computer, to execute the described functions of embodiments of the invention creates a new machine where in case of a computer a general purpose computer in effect becomes a special purpose computer once it is programmed or configured or caused to perform particular functions of the embodiments of the invention pursuant to instructions from program software. According to an aspect of an embodiment, configuring an apparatus, device, computer processor, refers to such apparatus, device or computer processor programmed or controlled by software to execute the described functions. 
     A program/software implementing the embodiments may be recorded on a computer-readable media, e.g., a non-transitory or persistent computer-readable medium. Examples of the non-transitory computer-readable media include a magnetic recording apparatus, an optical disk, a magneto-optical disk, and/or volatile and/or non-volatile semiconductor memory (for example, RAM, ROM, etc.). Examples of the magnetic recording apparatus include a hard disk device (HDD), a flexible disk (FD), and a magnetic tape (MT). Examples of the optical disk include a DVD (Digital Versatile Disc), DVD-ROM, DVD-RAM (DVD-Random Access Memory), BD (Blue-ray Disk), a CD-ROM (Compact Disc-Read Only Memory), and a CD-R (Recordable)/RW. The program/software implementing the embodiments may be transmitted over a transmission communication path, e.g., a wire and/or a wireless network implemented via hardware. An example of communication media via which the program/software may be sent includes, for example, a carrier-wave signal. 
     The many features and advantages of the embodiments are apparent from the detailed specification and, thus, it is intended by the appended claims to cover all such features and advantages of the embodiments that fall within the true spirit and scope thereof. Further, since numerous modifications and changes will readily occur to those skilled in the art, it is not desired to limit the inventive embodiments to the exact construction and operation illustrated and described, and accordingly all suitable modifications and equivalents may be resorted to, falling within the scope thereof.