This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternative to lattice. The authors analyze some of the shortcomings of conventional lattice structure and propose a novel algebraic structure in the form of Hyper-lattice to overcome problems with lattice. They establish how Hyper-lattice supports dynamic insertion of elements in a partial order set with a partial hierarchy between the set members. The authors present the characteristics and the different properties, showing how propositions and lemmas formalize Hyper-lattice as a new algebraic structure
We survey applications of the theory of partial orders to distributed computing. A distributed compu...
We study languages for manipulating partially ordered structures with duplicates (e.g. trees, lists)...
International audienceGalois sub-hierarchies have been introduced as an interesting polynomial-size ...
This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternati...
The purpose of this thesis is twofold: (1) to define a formal lattice-theoretic calculus of partiall...
The maturing of the field of data mining has brought about an increased level of mathematical sophis...
This indispensable reference source contains a wealth of information on lattice theory. The book pre...
AbstractThe theory of ordered sets lies at the confluence of several branches of mathematics includi...
Lattice Theory presents an elementary account of a significant branch of contemporary mathematics co...
In this paper, we consider the representation and management of an element set on which a lattice ...
This paper is about partially ordered multisets (pomsets for short). We investigate a particular cla...
Abstract. The study of sup lattices teaches us the important distinction between the algebraic part ...
Multi-dimensional algebraic modelling languages make extensive use of simple and compound index sets...
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...
AbstractA prime algebraic lattice can be characterised as isomorphic to the downwards-closed subsets...
We survey applications of the theory of partial orders to distributed computing. A distributed compu...
We study languages for manipulating partially ordered structures with duplicates (e.g. trees, lists)...
International audienceGalois sub-hierarchies have been introduced as an interesting polynomial-size ...
This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternati...
The purpose of this thesis is twofold: (1) to define a formal lattice-theoretic calculus of partiall...
The maturing of the field of data mining has brought about an increased level of mathematical sophis...
This indispensable reference source contains a wealth of information on lattice theory. The book pre...
AbstractThe theory of ordered sets lies at the confluence of several branches of mathematics includi...
Lattice Theory presents an elementary account of a significant branch of contemporary mathematics co...
In this paper, we consider the representation and management of an element set on which a lattice ...
This paper is about partially ordered multisets (pomsets for short). We investigate a particular cla...
Abstract. The study of sup lattices teaches us the important distinction between the algebraic part ...
Multi-dimensional algebraic modelling languages make extensive use of simple and compound index sets...
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...
AbstractA prime algebraic lattice can be characterised as isomorphic to the downwards-closed subsets...
We survey applications of the theory of partial orders to distributed computing. A distributed compu...
We study languages for manipulating partially ordered structures with duplicates (e.g. trees, lists)...
International audienceGalois sub-hierarchies have been introduced as an interesting polynomial-size ...