| DATR theory | Modelling conventions |
| local inheritance | paradigmatic ISA inheritance |
| global inheritance | syntagmatic PARTOF (ID) inheritance |
| non-hidden nodes | lexical entry nodes |
| hidden nodes | abstract class nodes |
| equation right-hand side sequence | linear (LP) order |
| evaluation of right-hand side sequence | property |
| attribute paths | orthogonal inheritance |
Timetable: <> == Compound_Noun
<modifier> == "Time:<>"
<head> == "Table:<>" .
Time: <surf> == taIm
<sem> == tempus .
Table: <surf> == teIbl
<sem> == matrix .
Compound_Noun: <> == "<modifier>" "<head>" .
Theorems: Queries are pairs of nodes and atomic paths, and evaluate to theorems derived by standard DATR inference:
Table:< surf > = teIbl .
Table:< sem > = matrix .
Time:< surf > = taIm .
Time:< sem > = tempus .
Timetable:< surf > = taIm teIbl .
Timetable:< sem > = tempus matrix .