Results 1  10
of
230,655
Computability of . . . Distributive Lattices
, 2010
"... Distributive lattices are studied from the viewpoint of effective algebra. ..."
Abstract
 Add to MetaCart
Distributive lattices are studied from the viewpoint of effective algebra.
Entailment Relations and Distributive Lattices
, 1998
"... . 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 ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
. 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
DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS
"... ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph – called corientations. Given a distributive lattice we construct a set of graphs, realizing the distributive lattice as the lattice of their corientations. One distributive lattice may ari ..."
Abstract
 Add to MetaCart
ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph – called corientations. Given a distributive lattice we construct a set of graphs, realizing the distributive lattice as the lattice of their corientations. One distributive lattice may
Distributive Lattices from Graphs
"... Several instances of distributive lattices on graph structures are known. This includes corientations (Propp), αorientations of planar graphs (Felsner/de Mendez) planar flows (Khuller, Naor and Klein) as well as some more special instances, e.g., spanning trees of a planar graph, matchings of plan ..."
Abstract
 Add to MetaCart
Several instances of distributive lattices on graph structures are known. This includes corientations (Propp), αorientations of planar graphs (Felsner/de Mendez) planar flows (Khuller, Naor and Klein) as well as some more special instances, e.g., spanning trees of a planar graph, matchings
Graphs orientable as distributive lattices
 Proc. Amer. Math. Soc
, 1983
"... Abstract. There are two types of graphs commonly associated with finite (partially) ordered sets: the comparability graph and the covering graph. While the first type has been characterized, only partial descriptions of the second are known. We prove that the covering graphs of distributive lattices ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
of an ordered set if and only if each odd cycle of G has a triangular chord [4,5]. In contrast little is known about this question (cf. [9]): when is a graph the covering graph of an ordered setl The purpose of this note is to answer the question for a special class of ordered sets: finite distributive lattices
Evolution on distributive lattices
 J THEOR BIOL
, 2006
"... We consider the directed evolution of a population after an intervention that has significantly altered the underlying fitness landscape. We model the space of genotypes as a distributive lattice; the fitness landscape is a realvalued function on that lattice. The risk of escape from intervention ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
We consider the directed evolution of a population after an intervention that has significantly altered the underlying fitness landscape. We model the space of genotypes as a distributive lattice; the fitness landscape is a realvalued function on that lattice. The risk of escape from
The structure of pseudocomplemented distributive lattices
 I. Subdirect decomposition, Trans. Amer. Math. Soc
, 1971
"... ABSTRACT. Absolute subretracts are characterized in the classes S„, zi < co. This is applied to describe the injectives in S [ (due to R. Balbes and G. Gra'tzer) and 82. 1. Introduction. In Parts I and II ([41 and [61) we have acquired a rather thorough knowledge of the structure of pseudoco ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
of pseudocomplemented distributive lattices. In this paper we use this knowledge to extend the results of R. Balbes and G. Grätzer [il on injective Stone algebras to any ÍB. (Recall that fB. is the class of Stone algebras; for the notation, see §2.) It turns out, however, that there are rather
COMPLETING DISTRIBUTIVE LATTICE EXPANSIONS
"... An algebra A = 〈A;F 〉 is a distributive lattice expansion if there are terms ∧, ∨ ∈ TerA, the term clone of A, such that 〈A;∧,∨ 〉 is a distributive lattice. How do you embed A into an algebra B such that 〈B;∧,∨ 〉 is a complete distributive lattice? This turns out to be a very difficult problem whic ..."
Abstract
 Add to MetaCart
An algebra A = 〈A;F 〉 is a distributive lattice expansion if there are terms ∧, ∨ ∈ TerA, the term clone of A, such that 〈A;∧,∨ 〉 is a distributive lattice. How do you embed A into an algebra B such that 〈B;∧,∨ 〉 is a complete distributive lattice? This turns out to be a very difficult problem
On Unification for Bounded Distributive Lattices
 Proc. CADE17, LNAI 1831
, 2000
"... We give a resolutionbased procedure for deciding unifiability in the variety of bounded distributive lattices. The main idea is to use a structurepreserving translation to clause form to reduce the problem of testing the satisfiability of a unification problem S to the problem of checking the sati ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We give a resolutionbased procedure for deciding unifiability in the variety of bounded distributive lattices. The main idea is to use a structurepreserving translation to clause form to reduce the problem of testing the satisfiability of a unification problem S to the problem of checking
8. Distributive Lattices
"... Every dog must have his day. In this chapter and the next we will look at the two most important lattice varieties: distributive and modular lattices. Let us set the context for our study of distributive lattices by considering varieties generated by a single finite lattice. A variety V is said to b ..."
Abstract
 Add to MetaCart
Every dog must have his day. In this chapter and the next we will look at the two most important lattice varieties: distributive and modular lattices. Let us set the context for our study of distributive lattices by considering varieties generated by a single finite lattice. A variety V is said
Results 1  10
of
230,655