Journal of Symbolic Computation
Production matching for large learning systems
Production matching for large learning systems
Hi-index | 0.00 |
An algebraic system containing production-logic binary relations on a complete lattice is introduced. Some properties of such relations are studied without the use of recursions. The existence of a logical closure of a noetherian binary relation is proved. This allows for defining the notion of an equivalent relation.