We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constrai...
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Near-regular texture (NRT), denoting deviations from otherwise symmetric wallpaper patterns, is commonly observable in the real world. Existing lattice detection algorithms captur...
Brian A. Canada, Georgia K. Thomas, Keith C. Cheng...