COMBINATORICA
2011
13 years 7 days ago
2011
Let L be a finite distributive lattice and µ : L → R+ a logsupermodular function. For functions k : L → R+ let Eµ(k; q) def = x∈L k(x)µ(x)qrank(x) ∈ R+ [q]. We prove fo...
IGPL
2011
13 years 3 months ago
2011
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic oper...
EJC
2011
13 years 7 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
DLOG
2009
13 years 10 months ago
2009
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...
HEURISTICS
2006
14 years 13 days ago
2006
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...
EJC
2008
14 years 15 days ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
ECAI
2004
Springer
14 years 5 months ago
2004
Springer
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...