article

Open access

Efficient implementation of lattice operations

Authors:

Hassan Aït-Kaci,

Patrick Lincoln,

Roger NasrAuthors Info & Claims

ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 11, Issue 1

Pages 115 - 146

https://doi.org/10.1145/59287.59293

Published: 01 January 1989 Publication History

Abstract

Lattice operations such as greatest lower bound (GLB), least upper bound (LUB), and relative complementation (BUTNOT) are becoming more and more important in programming languages supporting object inheritance. We present a general technique for the efficient implementation of such operations based on an encoding method. The effect of the encoding is to plunge the given ordering into a boolean lattice of binary words, leading to an almost constant time complexity of the lattice operations. A first method is described based on a transitive closure approach. Then a more space-efficient method minimizing code-word length is described. Finally a powerful grouping technique called modulation is presented, which drastically reduces code space while keeping all three lattice operations highly efficient. This technique takes into account idiosyncrasies of the topology of the poset being encoded that are quite likely to occur in practice. All methods are formally justified. We see this work as an original contribution towards using semantic (vz., in this case, taxonomic) information in the engineering pragmatics of storage and retrieval of (vz., partially or quasi-ordered) information.

References

[1]

AHO, V. A., HOPCROFT, J. E., AND ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.

[2]

AiT-KACI, H. A lattice-theoretic approach to computation based on a calculus of partiallyordered type structures. Ph.D. dissertation, Computer and Information Science, University of Pennsylvania, Philadelphia, Penn., 1984.

[3]

AiT-KACl, H. An algebraic-semantic approach to the effective resolution of type equations. Theor. Comput. Sci. 45 (1986), 185-215.

[4]

AiT-KACI, H., BOYER, R., L1NCOLN, P., ANO NASR, R. Efficient implementation of object inheritance. Tech. Rep. AI-102-87, Microelectronics and Computer Technology Corporation, Austin, Tex., 1987.

[5]

A~T-KACl, H., AND NASR, R. LOGIN: a logic programming language with built-in inheritance.{ J. Logic Program. 3 (1986), 185-215.

[6]

AiT-KACI, H., AND LINCOLN, P. LIFE: A natural language for natural language. Teeh. Rep. ACA-ST-074-88, Microelectronics and Computer Technology Corporation, Austin, Tex., Feb. 1988.

[7]

ALBANO, A., GIANNOTTI, F., ORSINI, R., AND PEORESCHI, D. The type system of Galileo. In M. Atkinson, P. Buneman, and R. Morrison, Ed. Data Types and Persistence. Springer-Verlag, Berlin, W. Germany, 1988, pp. 101-120.

[8]

BIRKHOFF, G. Lattice Theory. Volume 25 of Colloquium Publications, American Mathematical{ Society, Providence, R.I., (third edition) (1979).

[9]

BOBROW, D. et al. Commonloops, merging Lisp in object-oriented programming. In Proceedings{ of Object-Oriented Programming Systems, Languages, and Applications Conference, 1986 (Portland, Ore., 1986), pp. 17-19. Also SIGPLAN Not. 21, 11 (Nov. 1986).

[10]

CARDELLI, L. Amber. Tech. Memo. 11271-840924-10TM, AT&T Bell Labs, Murray Hill, N.J., 1984.

[11]

GOGUEN, J., AND MESEGUER, J. Extensions and foundations of object-oriented programming. ACM SIGPLAN Not. 21, 10 (Oct. 1986), 153-162.

[12]

GOLDBERG, A., AND ROBSON, D. SmallTalh-80: The Language and its Implementation. Addison- Wesley, Reading, Mass., (1980).

[13]

JArFAR, J., AND LASSEZ, J.-L. Constraint logic programming. In Proceedings of the 14th ACM} POPL Symposium (Munich, Jan. 1987), ACM, New York, 1987, pp. 111-119.

[14]

MCALLESTER, D. Boolean class expressions. ACM SIGPLAN Not. 21, 11 (Nov. 1986), 417-423.

[15]

MUKAI, K. Anadic tuples in Prolog. Paper presented at the workshop organized by J. Minker on Foundations of Deductive Databases and Logic Programming (Washington, D.C., Aug. 1986).

[16]

PARKER, D.S. Partial Order Programming. Tech. Rep. CSD-870067, Computer Science Department, UCLA, Los Angeles, Cal., Dec. 1987.

[17]

SMOLKA, G., NUTT, W., GOGUEN, Z., AND MESEGUER, J. Order-sorted equational computation. In H. Ait-Kaci, and M. Nivat, Eds. Resolution of Equations in Algebraic Structures. Academic Press, Cambridge, Mass. (Forthcoming).

[18]

STICKEL, M. Automatic deduction by theory resolution. In Proceedings of International Joint Conference on Artificial Intelligence (Los Angeles, Cal. 1985). Morgan Kauffman, 1985, pp. 1181-1186.

[19]

WALTHER, C. A mechanical solution of Schubert's steamroller by many-sorted resolution. Artif. Intell. 26 (1985), 217-224.

[20]

WEINREB, D., AND MOON, D. Lisp Machine Manual. Massachusetts Institute of Technology, Cambridge, Mass., 1981.

Cited By

Milanese GPasi G(2024)Similarity-Based Reasoning With Order-Sorted Feature LogicIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2024.336289732:5(2797-2810)Online publication date: May-2024
https://doi.org/10.1109/TFUZZ.2024.3362897
Milanese GPasi G(2024)Fuzzy order-sorted feature logicFuzzy Sets and Systems10.1016/j.fss.2023.108800477:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.fss.2023.108800
Rousselot F(2022)Mes recherches en IA et Langue Naturelle : de l’équipe Pitrat à une méthode de conception inventiveRevue Ouverte d'Intelligence Artificielle10.5802/roia.203:1-2(81-93)Online publication date: 23-Mar-2022
https://doi.org/10.5802/roia.20
Show More Cited By

Index Terms

Efficient implementation of lattice operations

Recommendations

Lattice implication ordered semigroups

From the viewpoint of semantics, lattice implication algebras provide a basis to establish lattice-valued logic with truth value in a relatively general lattice. In this paper, we first introduce two notions of lattice implication n-ordered semigroup ...
Lattice pseudoeffect algebras as double residuated structures
Special Issue on Evolutionary Fuzzy Systems

Pseudoeffect algebras are partial algebraic structures which are non-commutative generalizations of effect algebras. The main result of the paper is a characterization of lattice pseudoeffect algebras in terms of so-called pseudo Sasaki algebras. In ...
Lattice-valued bornological systems

Motivated by the concept of lattice-valued topological system of J.T. Denniston, A. Melton, and S.E. Rodabaugh, which extends lattice-valued topological spaces, this paper introduces the notion of lattice-valued bornological system as a generalization ...

Reviews

Reviewer: David B. Benson

This paper is about the efficient implementation of multiple object inheritance. When the objects are permanent or nearly so, a program may use considerable computational effort to determine an encoding of the object inheritance data, which it uses at run-time to inexpensively compute lattice operators on the inheritance lattice. The paper describes, with exceptional clarity, a modulation method that provides for both time and space efficiency. This modulation technique is tuned to the object inheritance lattices likely to be met in practice. As the authors say in the abstract, “We see this work as an original contribution towards using semantic . . . information in the engineering pragmatics of storage and retrieval of . . . information.”

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Programming Languages and Systems

ACM Transactions on Programming Languages and Systems Volume 11, Issue 1

Jan. 1989

167 pages

ISSN:0164-0925

EISSN:1558-4593

DOI:10.1145/59287

Issue’s Table of Contents

Copyright © 1989 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1989

Published in TOPLAS Volume 11, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

167
Total Citations
View Citations
1,235
Total Downloads

Downloads (Last 12 months)136
Downloads (Last 6 weeks)11

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Milanese GPasi G(2024)Similarity-Based Reasoning With Order-Sorted Feature LogicIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2024.336289732:5(2797-2810)Online publication date: May-2024
https://doi.org/10.1109/TFUZZ.2024.3362897
Milanese GPasi G(2024)Fuzzy order-sorted feature logicFuzzy Sets and Systems10.1016/j.fss.2023.108800477:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.fss.2023.108800
Rousselot F(2022)Mes recherches en IA et Langue Naturelle : de l’équipe Pitrat à une méthode de conception inventiveRevue Ouverte d'Intelligence Artificielle10.5802/roia.203:1-2(81-93)Online publication date: 23-Mar-2022
https://doi.org/10.5802/roia.20
Milanese GPasi G(2021)Conjunctive Reasoning on Fuzzy Taxonomies with Order-Sorted Feature Logic2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)10.1109/FUZZ45933.2021.9494474(1-7)Online publication date: 11-Jul-2021
https://dl.acm.org/doi/10.1109/FUZZ45933.2021.9494474
Khelil AMesmoudi AGalicia JBellatreche LHacid MCoquery E(2021)Combining Graph Exploration and Fragmentation for Scalable RDF Query ProcessingInformation Systems Frontiers10.1007/s10796-020-09998-z23:1(165-183)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1007/s10796-020-09998-z
Khelil AMesmoudi AGalicia JSenouci M(2019)Should We Be Afraid of Querying Billions of Triples in a Graph-Based Centralized System?Model and Data Engineering10.1007/978-3-030-32065-2_18(251-266)Online publication date: 28-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-32065-2_18
Kambona KRenaux TDe Meuter W(2018)Harnessing Community Knowledge in Heterogeneous Rule EnginesWeb Information Systems and Technologies10.1007/978-3-319-93527-0_7(132-160)Online publication date: 19-Jun-2018
https://doi.org/10.1007/978-3-319-93527-0_7
Neal TSundararajan KFatima AYan YXiang YWoodard D(2017)Surveying Stylometry Techniques and ApplicationsACM Computing Surveys10.1145/313203950:6(1-36)Online publication date: 22-Nov-2017
https://dl.acm.org/doi/10.1145/3132039
Voronkov AIwaya LMartucci LLindskog S(2017)Systematic Literature Review on Usability of Firewall ConfigurationACM Computing Surveys10.1145/313087650:6(1-35)Online publication date: 6-Dec-2017
https://dl.acm.org/doi/10.1145/3130876
Lara JGuerra E(2017)A Posteriori Typing for Model-Driven EngineeringACM Transactions on Software Engineering and Methodology10.1145/306338425:4(1-60)Online publication date: 5-May-2017
https://dl.acm.org/doi/10.1145/3063384
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents