Sparse logical terms Original Research Article

We propose a sparse representation for logical terms analogous to formalisms used for sparse matrices. For applications which manage terms containing many anonymous variables, this can provide a savings both in terms of storage space and unification time. Variations of this scheme provide a set of easily implemented tools suitable for diverse applications such as taxonomic encoding, natural language processing, and automatic configuration.