Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
A mechanical solution of Schubert's steamroller by many-sorted resolution
Artificial Intelligence
Login: A logic programming language with built-in inheritance
Journal of Logic Programming
An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
CommonLoops: merging Lisp and object-oriented programming
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data types and persistence
Extensions and foundations of object-oriented programming
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)
Lisp machine manual
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient implementation of bit-vector operation in Common Lisp
ACM SIGPLAN Lisp Pointers
Abstract semantics for a higher-order functional language with logic variables
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extending N-grid group authorization using compact encoding
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Efficient handling of multiple inheritance hierarchies
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
ACM Transactions on Database Systems (TODS)
Vortex: an optimizing compiler for object-oriented languages
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Unification encodings of grammatical notations
Computational Linguistics
Efficient type inclusion tests
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Fast interprocedural class analysis
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Type elaboration and subtype completion for Java bytecode
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finding least common ancestors in directed acyclic graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Type elaboration and subtype completion for Java bytecode
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient subtyping tests with PQ-encoding
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
IEEE Transactions on Knowledge and Data Engineering
A Space-and-Time-Efficient Coding Algorithm for Lattice Computations
IEEE Transactions on Knowledge and Data Engineering
Efficient transitive closure reasoning in a combined class/part/containment hierarchy
Knowledge and Information Systems
Computational and Structural Aspects of Openly Specified Type Hierarchies
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Representing Large Concept Hierarchies Using Lattice Data Structure
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
A compact architecture for dialogue management based on scripts and meta-outputs
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Computational aspects of the 2-dimension of partially ordered sets
Theoretical Computer Science
TDL: a type description language for constraint-based grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Contribution of a category hierarchy to the robustness of syntactic parsing.
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Encoding multiple inheritance hierarchies for lattice operations
Data & Knowledge Engineering
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Tractability and structural closures in attribute logic type signatures
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient subtyping tests with PQ-encoding
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compact reachability labeling for graph-structured data
Proceedings of the 14th ACM international conference on Information and knowledge management
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Efficient type inference for secure information flow
Proceedings of the 2006 workshop on Programming languages and analysis for security
A context-free superset approximation of unification-based grammars
New developments in parsing technology
Efficient transitive closure of sparse matrices over closed semirings
Theoretical Computer Science - Algebraic methods in language processing
Building an "impossible" verifier on a java card
WIESS'02 Proceedings of the 2nd conference on Industrial Experiences with Systems Software - Volume 2
Towards including prosody in a text-to-speech system for modern standard Arabic
Computer Speech and Language
Journal of Systems and Software
Fast liveness checking for ssa-form programs
Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization
EVEY: enhancing privacy of service discovery in pervasive computing
Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion
Perfect hashing as an almost perfect subtype test
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Hierarchy Encoding with Multiple Genes
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
A Hybrid Method of Indexing Multiple-Inheritance Hierarchies
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Automatic acquisition of feature-based phonotactic resources
SIGMorPhon '04 Proceedings of the 7th Meeting of the ACL Special Interest Group in Computational Phonology: Current Themes in Computational Phonology and Morphology
Query Evaluation on Probabilistic RDF Databases
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Lowest common ancestors in trees and directed acyclic graphs
Journal of Algorithms
Pervasive and Mobile Computing
Incremental speech translation
Incremental speech translation
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A generalized-zero-preserving method for compact encoding of concept lattices
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Semi-partitioned horn clauses: a tractable logic of types
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Approximate bit vectors for fast unification
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Experiences with PDG-Based IFC
ESSoS'10 Proceedings of the Second international conference on Engineering Secure Software and Systems
A formal approach to subgrammar extraction for NLP
Mathematical and Computer Modelling: An International Journal
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Generalized Hybrid Encoding of Polyhierarchical Structures
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
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.