Sciweavers

654 search results - page 1 / 131
» Ordered Sets and Complete Lattices
Sort
View
ORDER
2010
96views more  ORDER 2010»
13 years 2 months ago
More Sublattices of the Lattice of Local Clones
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 ...
Michael Pinsker
ACMMPC
2000
Springer
238views Mathematics» more  ACMMPC 2000»
13 years 8 months ago
Ordered Sets and Complete Lattices
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 ...
Hilary A. Priestley
ECAI
2004
Springer
13 years 9 months ago
Soft Constraints with Partially Ordered Preferences
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...
Nic Wilson
DM
2002
101views more  DM 2002»
13 years 3 months ago
Pseudocomplements of closure operators on posets
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...
Francesco Ranzato
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 3 months ago
A logic of soft constraints based on partially ordered preferences
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...
Nic Wilson