"... In PAGE 39: ... To begin a geometry problem is usually expressed by descriptions such as, Two transversals intersect two parallel lines and intersect with each other at a point x between the two parallel lines. In the geometry theorem proving program, such statements, as well as the geometry definitions and theorems, would be encoded in some descriptive notation ( Table1 ) such as a language composed of terms and relations. Problem Statement (line l1) (line l2) (line t1) (line t2) (parallel l1 l2) (transversal t1 l1 l2) (transversal t2 l1 l2) (intersect t1 t2 x) (between x l1 l2) Geometry Definitions (production rules of the program) (production-rule (alternate-interior lt;a1 gt; lt;a2 gt;) (angle lt;a1 gt; lt;a2 gt;) - gt; (congruent lt;a1 gt; lt;a2 gt;)) Table 1.... In PAGE 39: ... In the geometry theorem proving program, such statements, as well as the geometry definitions and theorems, would be encoded in some descriptive notation (Table 1) such as a language composed of terms and relations. Problem Statement (line l1) (line l2) (line t1) (line t2) (parallel l1 l2) (transversal t1 l1 l2) (transversal t2 l1 l2) (intersect t1 t2 x) (between x l1 l2) Geometry Definitions (production rules of the program) (production-rule (alternate-interior lt;a1 gt; lt;a2 gt;) (angle lt;a1 gt; lt;a2 gt;) - gt; (congruent lt;a1 gt; lt;a2 gt;)) Table1 . Given data structure and program in a semi-formal notation (extracted from Larkin and Simon, Table 4, p.... In PAGE 47: ...47 Stockholm: Cognition, Education, and Communication Technology Symposium A comparison of the points of view ( Table1 ) shows that the alternative Newell and Simon reject also includes a linguistic deep structure, again the symbol structures of their IPS models. Although they raise the possibility of nonlinguistic deep structure, they cannot conceive of this standing on its own because they fundamentally view understanding and thinking as mapping to and manipulating linguistic (symbol) strings.... ..."

"... In PAGE 3: ... 2. Adding Hybrid-Redundant Numbers The first step in our addition scheme for WBS encoding of hybrid-redundant numbers is to construct a 4-deep WBS number by simply merging the posibits and ne- gabits in like positions of the two operands, as shown by the vertical alignments of operands in the examples of Table3 . The equal-weight grouping offered in [6] may be considered as a special case.... ..."

"... In PAGE 2: ... However, such systems rarely provide ad-hoc query capabilities, and it is unusual for built-in fa- cilities to be provided that support complex analyses. The classification used in Table 1 is applied for typical deep databases in Table2 . As for broad databases, the focus is principally on browsing and visualising rather than query- ing and analysing.... ..."

"... In PAGE 7: ... Line estimation improvement by using Image/text areas removal. All possible line intersections (see Table1 ) are detected progressively according to the following algorithm. First, we detect all intersections with IDs 1-4.... ..."

"... In PAGE 3: .... Specialisation Operators: this group consists of two operators: Intersect and Intersect1. They integrate a set of overlapping local classes by generating a common subclass. Table3 shows the effects of each of this group of operators. 4.... ..."

"... In PAGE 8: ... Therefore we select a high-precision strategy and use the intersection of two results with different seed vector numbers to further improve the precision. The results in Table2 show that the precision is improved greatly and able to achieve at 97% with combination strategy. When the searching ... ..."