Binary relation is a mathematical concept useful to describe a relationship between two sets or an internal structure on one set. Several authors have used binary relations for formulation of geological relations and for algorithms of computer processing (Burns, 1975; Dienes, 1978; Dienes and Mann, 1977; Shiono and Wadatsumi, 1988, 1991) . Sakamoto and Shiono (1990) showed that stratigraphic sequence can be formulated in terms of partial ordering which is defined by a reflexive, antisymmetric and transitive relation on a set, and presented a Prolog program to infer the sequence by symbolic operations. However, from a view point of integration of the inference algorithm with other numerical processing, it is convenient to infer the sequence by numerical operations using relation matrices whose entry is 0 or 1.
In the present paper we review basic arithmetical operations of relation matrices (1) to find the properties of relations, (2) to operate the union, the intersection, and the composite of two relations, (3) to constitute a partition of a set under an equivalence relation, and (4) to arrange elements of a set into linear sequence according to a given partial ordering. Further, we present an algorithm and a Basic program to infer the stratigraphic sequence from the observations at field outcrops. The program includes many subroutines for elementary operations of relation matrices which can be applied to a wide variety of problems formulated in terms of binary relations.
View full abstract