An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Discrete Mathematical Structures with Applications to Computer Science
Discrete Mathematical Structures with Applications to Computer Science
Minimal data upgrading to prevent inference and association attacks
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental encoding of multiple inheritance hierarchies
Proceedings of the eighth international conference on Information and knowledge management
Efficient transitive closure reasoning in a combined class/part/containment hierarchy
Knowledge and Information Systems
Encoding multiple inheritance hierarchies for lattice operations
Data & Knowledge Engineering
Hierarchy Encoding with Multiple Genes
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Experiences with PDG-Based IFC
ESSoS'10 Proceedings of the Second international conference on Engineering Secure Software and Systems
| Hi-index | 0.00 |
We present an encoding algorithm for lattices that significantly reduces space requirements while allowing fast computations of least upper bounds and greatest lower bounds of pairs of elements. We analyze the algorithms for encoding, LUB and GLB computations, and prove their correctness. Empirical experiments reveal that our method is significantly more space efficient than the transitive closure method, and the saving becomes increasingly more important as the size of the lattice increases.