Stepwise construction of the dedekind-MacNeille completion (Sesearch Note)

摘要

Lattices are mathematical structures which are frequently used for the representation of data. Several authors have considered the problem of incremental construction of lattices. We show that with a rather general approach, this problem becomes well-strcutured. We give simple algorithms with satisfactory complexity bounds.