  In the recently proposed Lace framework for collective entity resolution,
logical rules and constraints are used to identify pairs of entity references
(e.g. author or paper ids) that denote the same entity. This identification is
global: all occurrences of those entity references (possibly across multiple
database tuples) are deemed equal and can be merged. By contrast, a local form
of merge is often more natural when identifying pairs of data values, e.g. some
occurrences of 'J. Smith' may be equated with 'Joe Smith', while others should
merge with 'Jane Smith'. This motivates us to extend Lace with local merges of
values and explore the computational properties of the resulting formalism.
