We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at ...
Abstract. These notes deal with an interconnecting web of mathematical techniques all of which deserve a place in the armoury of the welleducated computer scientist. The objective ...
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
Some recent results provide su cient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives resu...
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...