"logic expression" is a correct and usable term in written English.
You can use it whenever you want to refer to a mathematical expression that describes a logical relationship between two or more variables. For example, "The logic expression x > y describes how x is greater than y."
Often these searchers were trained reference librarians who engaged in a reference interview with the researcher who needed the information so that the searcher could express the researcher's information need correctly, usually as a Boolean logic expression with search terms connected with logical operators such as AND, OR, or NOT [ 35].
The logic expression is evaluated before the loop, which means that if the expression returns false right from the beginning, the code inside the loop might never be executed.
Missing data were coded explicitly as described and handled by using logic expression.
(mathcal {P}) is a logic expression representing the pre-condition of (mathcal {W}) that must hold before (mathcal {W}) is invoked.
The logic expression (widetilde{Hotel} wedge widetilde{Dates}) is the pre-condition that must hold before the Web service is invoked.
Consequently, the Tiam1 fluorescence signal at the PM was turned off exclusively in the presence of both inputs, indicating successful implementation of the NAND logic expression (Supporting Information Figure 3d).
The modelling has been performed through ASM notation, and CTL temporal logic expressions are used to express the system requirements.
The semantics of the logic expressions such as "equivalent to", "or", and "and" as expressed by (sum _{i in I}(prod _{m in A_{i}}m)), (A_{i} subseteq M), (i in I) can be formulated in terms of the AFS algebra ((mathrm{EM}^)), defined as: begin{aligned}&displaystyle mathrm{EM}^ =left{ sum _{i in I}left( prod _{m in A_{i}}mright) right.
The central of this phase is an algorithm for computing verbal relationships in the process of generating the Vietnamese paragraph from the logical expression of discourse representation structure (DRS), which is the first-order logic expressions without explicit quantifiers, and represents the meaning as well as reflects the potential contexts of a given discourse or a sequence of sentences.
The trained NNMs are used for complexity estimation for the Boolean logic expressions with a given number of variables and sum of products (SOP) terms.
These are in the optimization of the Register Transfer Level (RTL) VHDL which leads to an optimal description of the VHDL in terms of logic expressions.
