|  | 
|  | Antecedent () | 
|  | 
| virtual | ~Antecedent () | 
|  | 
| virtual void | setText (const std::string &text) | 
|  | Sets the antecedent in text.  More... 
 | 
|  | 
| virtual std::string | getText () const | 
|  | Gets the antecedent in text.  More... 
 | 
|  | 
| virtual Expression * | getExpression () const | 
|  | Gets the expression tree of the antecedent.  More... 
 | 
|  | 
| virtual void | setExpression (Expression *expression) | 
|  | Sets the expression tree of the antecedent.  More... 
 | 
|  | 
| virtual bool | isLoaded () const | 
|  | Indicates whether the antecedent is loaded.  More... 
 | 
|  | 
| virtual void | unload () | 
|  | Unloads the antecedent.  More... 
 | 
|  | 
| virtual void | load (const Engine *engine) | 
|  | Loads the antecedent with the text obtained from Antecedent::getText() and uses the engine to identify and retrieve references to the input variables and output variables as required.  More... 
 | 
|  | 
| virtual void | load (const std::string &antecedent, const Engine *engine) | 
|  | Loads the antecedent with the given text and uses the engine to identify and retrieve references to the input variables and output variables as required.  More... 
 | 
|  | 
| virtual Complexity | complexity (const TNorm *conjunction, const SNorm *disjunction) const | 
|  | Computes the estimated complexity of calculating the activation degree.  More... 
 | 
|  | 
| virtual Complexity | complexity (const TNorm *conjunction, const SNorm *disjunction, const Expression *node) const | 
|  | Computes the estimated complexity of recursively calculating the activation degree from the given node.  More... 
 | 
|  | 
| virtual scalar | activationDegree (const TNorm *conjunction, const SNorm *disjunction, const Expression *node) const | 
|  | Computes the activation degree of the antecedent on the expression tree from the given node.  More... 
 | 
|  | 
| virtual scalar | activationDegree (const TNorm *conjunction, const SNorm *disjunction) const | 
|  | Computes the activation degree of the antecedent on the expression tree from the root node.  More... 
 | 
|  | 
| virtual std::string | toString () const | 
|  | Returns a string representation of the expression tree in infix notation.  More... 
 | 
|  | 
| virtual std::string | toPrefix (const Expression *node=fl::null) const | 
|  | Returns a string represention of the given expression tree utilizing prefix notation.  More... 
 | 
|  | 
| virtual std::string | toInfix (const Expression *node=fl::null) const | 
|  | Returns a string represention of the given expression tree utilizing infix notation.  More... 
 | 
|  | 
| virtual std::string | toPostfix (const Expression *node=fl::null) const | 
|  | Returns a string represention of the given expression tree utilizing postfix notation.  More... 
 | 
|  | 
The Antecedent class is an expression tree that represents and evaluates the antecedent of a Rule. 
The structure of a rule is: if (antecedent) then (consequent). The structure of the antecedent of a rule is:
if variable is [hedge]* term [(and|or) variable is [hedge]* term]*
where *-marked elements may appear zero or more times, elements in brackets are optional, and elements in parentheses are compulsory.
- Author
- Juan Rada-Vilela, Ph.D. 
- See also
- Consequent 
- 
Rule 
- Since
- 4.0 
Definition at line 48 of file Antecedent.h.