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, this reduces to the idempotent semiring-based CSP approach, and the lattice operations can be used to define a sound and complete proof theory. For the general case, it is shown how sound and complete deduction can be p...

A (distributive) p-algebra is an algebra 〈L;∨,∧, ∗, 0, 1〉 whose reduct 〈L;∨,∧, 0, 1〉 is a bounded (distributive) lattice and whose unary operation ∗ is characterized by x ≤ a if and only if a ∧ x = 0. If L is a p-algebra, B(L) = { x ∈ L : x = x } and D(L) = { x ∈ L : x = 1 } then 〈B(L);∪,∧, 0, 1〉 is a Boolean algebra when a ∪ b is defined to be (a∗ ∧ b∗)∗, for any a, b ∈ B(L), D∗(L) = { x ∨ x∗ ...

The power set of a domain D can be seen as the function space D ! 2 of all functions in the pointwise order. One computational version thereof is the lifted lower powerdomain, which we can think of as the lattice of Scott-closed subsets or, alternatively, as the order dual of the function space D ! 2]. Therefore, logic and the ordinary power set, as well as its information-theoretic version, re...

The concept of a GADL as a generalization of an ADL is introduced. Necessary and sufficient conditions for a GADL to become a distributive lattice and a GADL to become an ADL are obtained. We also study the maximal sets in a GADL and give equivalent conditions for a GADL to become a distributive lattice in terms of maximal

It is well known that the only simple distributive lattice is the twoelement chain. In an earlier paper, we introduced the concept of a completesimple lattice, and proved the existence of infinite complete-simple distributive lattices. In this paper we provide a new proof which is easier to visualize.

To any entailment relation Sco74] we associate a distributive lattice. We use this to give a construction of the product of lattices over an arbitrary index set, of the Vietoris construction, of the embedding of a distributive lattice in a boolean algebra, and to give a logical description of some spaces associated to mathematical structures.

In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attribution operations that preserve ∨, ∧ and ⊥. The preservation of ∧ allows the attributes to model the natural join operation in databases. We start by introducing ontological frameworks and knowledge bases and define the notion ...

Let L be a distributive lattice and R(L) the associated Hibi ring. We compute regR(L) when L is a planar lattice and give bounds for regR(L) when L is nonplanar, in terms of the combinatorial data of L. As a consequence, we characterize the distributive lattices L for which the associated Hibi ring has a linear resolution.