Příklady literal

• Within this framework, positive relevance literals denote addition of complexity and detail whilst negative relevance literals denote removal of complexity and detail.

• We assume we have a set of items of structured text, and that we will represent these by a set of positive literals.

• We represent each news report as a conjunction of classical logic literals.

• Our extended definition and the classical one coincide either for definite programs or for general programs whose negative literals have only input positions.

• The two definitions coincide either for definite programs or for general programs whose negative literals have only input positions.

• Sets of default negated literals are considered as extensions of the program, and a notion of "attack" between these sets is defined.

• Intuitively the truth of literals in these sequences must be determined in order to prove or fail the abductive subgoal.

• Elementary formulas are literals and the symbols ("false") and ("true").

• Defining tightness relative to a set of literals extends the applicability of this method to some programs that are not absolutely tight.

• Their bodies usually contain special fluent literals of the form ab(c).

• Elementary formulas are literals and the 0-place connectives ("false") and ("true").

• The body of rules is composed of negative literals only.

• Nevertheless, for the cases in which there are no conflicting literals in the first of the programs, the operators in question would be equivalent.

• The first four rules define literals and contrary literals.

• One of the main reasons is that, for each predicate mode declaration, the compiler is required to appropriately re-order literals in the predicate's definition.