### Table 1: Elementary data types

"... In PAGE 4: ... If a variable is not global only the program organisation unit it was declared in can use it. Information about the different variable types can be found in Table1 . Each row shows the keyword that is used in a program, the name of the data type and the size in bits for one type of variable.... ..."

### Table 1. Elementary predicates.

"... In PAGE 4: ... By contrast, in traditional logic programming based on definite clauses no set of such elementary relations is identified since clauses offer rather unconstrained means of building formulas utilizing terms. Since we adhere to the data type of lists in the present context, in COMBILOG we introduce the following set of elementary predicates with accompanying relational ex- tensions as shown in Table1 . It is assumed that the Herbrand universe H is denumer- ably infinite by presence among the constants of the empty list together with free list formation.... In PAGE 5: ...171 Table1 shows the elementary predicates used presently. The last column shows the corresponding defining clauses in ordinary definite logic program form.... ..."

### Table 1: Six types of problems in Elementary Algebra

2006

"... In PAGE 4: ... A simple example of a precedence relation between problems is illustrated by Fig. 1, which displays a plausible precedence diagram pertaining to the six types of algebra prob- lems illustrated in Table1 . Note in passing that we distinguish between a type of problem and an instance of that type.... In PAGE 5: ...recedence relation proposed by the diagram of Fig. 1 is a credible one. For example, if a student responds correctly to an instance of Problem (f), it is highly plausible that the same student has also mastered the other five problems. Note that this particular precedence relation is part of a much bigger one, representing a comprehensive coverage of all of Beginning Algebra, starting with the solution of simple linear equations and ending with problem types such as (f) in Table1 . An example of such a larger precedence relation is represented by the diagram of Fig.... In PAGE 8: ... 2 or 3 obtained?) This question and other critical ones are considered later on in this article. For the time being, we focus on the miniature example of Table1 which we use to introduce and illustrate the basic ideas. The knowledge states.... ..."

Cited by 1

### TABLE 2. Elementary interventions and types of antagonists

1999

Cited by 1

### TABLE 3. Elementary omissions and types of substitute

1999

Cited by 1

### Table 2-1 Elementary Operations.

"... In PAGE 2: ... Other required sequences need other types of operations. These elementary operations are summarized in Table2 -1. The first two elementary operations are used with sequences for which there is no pulse on the clock.... ..."

### Table 2. The elementary state transitions of PDDL

"... In PAGE 22: ... Like KARL, PDDL uses a minimal Herbrand model of a set of clauses to define elementary updates and the operational fragment of KARL (see [Angele, 1993], [Fensel, Angele amp; Studer]) is restricted to finite Herbrand models (aside from some built-in types) and therefore has similar expressive power. Table2 provides the transition types of PDDL and their counterpart in MCL. Table 2.... ..."

### Table 2. The elementary state transitions of PDDL

"... In PAGE 22: ... Like KARL, PDDL uses a minimal Herbrand model of a set of clauses to define elementary updates and the operational fragment of KARL (see [Angele, 1993], [Fensel, Angele amp; Studer]) is restricted to finite Herbrand models (aside from some built-in types) and therefore has similar expressive power. Table2 provides the transition types of PDDL and their counterpart in MCL. Table 2.... ..."

### Table 2. The elementary state transitions of PDDL

"... In PAGE 22: ... Like KARL, PDDL uses a minimal Herbrand model of a set of clauses to define elementary updates and the operational fragment of KARL (see [Angele, 1993], [Fensel, Angele amp; Studer]) is restricted to finite Herbrand models (aside from some built-in types) and therefore has similar expressive power. Table2 provides the transition types of PDDL and their counterpart in MCL. Table 2.... ..."