The query itself is considered as a
Boolean expression whose components are 2-tuples < ti, ci >belonging to the set, TxS; ti [member of] T., where ci is a value of the linguistic variable "Relevance", associated to a limit semantics [18].
Caption: Figure 3: (a) A PSL sequence and the equivalent PSL
Boolean expression. (b) A matching diagram for the expression.
The boolean adjacent vertex search over a graph is a more general operation, which searches for all adjacent vertices by a
boolean expression. There are disjunction, conjunction and negation three basic operations in
boolean expression [12].
A logical query is the action of evaluating a
Boolean expression concerning tuples and relations.
(i) Constrained simple sequence expression (CSSE) is formed by
Boolean expression, repeat operator, and cycle delay operator.
Table 2 is the
Boolean expression of the transaction database
The growth in number of terms in the resultant
Boolean expression and the number of different degree terms in the output equation are both high.