Hassan Ait-Kaci, Robert S. Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. Programming Languages and Systems, 11(1):115--146, 1989. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Object-Oriented Data Model Formalised Through Hypergraphs - Levene And Poulovassilis (1991) (Correct)
....by a hypergraph. We define class schemas and discuss structural inheritance in Section 5. We show that GROOVY can support multiple inheritance [8, 23] and we present an algorithm to 3 compute the greatest lower bound and least upper bound of any two class schemas in the inheritance lattice (c.f. [2]) In Section 6 we extend value schemes to include attributes which are themselves value schemes. As a consequence, GROOVY supports the multi level abstraction of object schemas and the definition of recursive value schemes. For example, we can model the case where a PERSON has a set of CHILDREN ....
....proof consider inter after line 6. If the class schema C chosen at line 5 is such that C C, then inter 1, since C TC(rel, C) and thus both C and C inter. On the other hand, if the class schema C chosen at line 5 is such that C = C, then inter = 1, since inter = C . # Ait Kaci et al. [2] have developed algorithms which perform the same task as GLB LUB. They present a naive algorithm and then develop further algorithms in order to gain better performance. Our function GLB LUB resembles the naive algorithm of [2] We note that GLB LUB can easily be generalised to compute the GLB ....
[Article contains additional citation context not shown here]
AIT-KACI H., BOYER R., LINCOLN P., AND NASR R. 1989. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems 11, pp. 115-146.
The INCINERATE Data Model - Jagadish (1995) (Correct)
....by re assertions or exceptions over more specific sets. In particular, the meta relation is empty if the base relation is a flat relation (with no quantifiers) One can further reduce the size of the meta relation by using one of the transitive closure compression techniques suggested in [1, 3, 17]. It is straightforward to see how the operators discussed in the preceding sections can be implemented in this context. For example, a selection on an INCINERATE relation becomes a selection on the corresponding meta relation, to retrieve the IDs of tuples that are relevant, further selections on ....
H. Ait-Kaci, R. Boyer, P. Lincoln, and R. Nasr, "Efficient Implementation of Lattice Operations," ACM Transactions on Programming Languages and Systems, 11(1), Jan. 1989, pp. 115-146.
Computational and Structural Aspects of Openly Specified Type.. - Hegner (1998) (Correct)
....In [21, Sec. 3.1] the term open specification is used in a different way, in a discussion contrasting ALE to Troll [12] We see this terminological overloading as a non issue, provided authors are careful to indicate which definitions are in force in their writings. 3 In his work A it Kaci [1] [2] has used a crown construction to complete hierarchies which may not have all glb s. However, this technique always associates a unique completion with a specification. Thus, we regard it as a means of extracting a total specification from an incomplete specification, rather than one of open ....
H. Ait-Kaci, R. Boyer, P. Lincoln, and R. Nasr. Efficient implementation of lattice operations. ACM Trans. Programming Languages and Systems, 11:115--146, 1989.
Concept Hierarchy in Data Mining: Specification, Generation and.. - Lu (1997) Self-citation (Ait-kaci) (Correct)
....amenable to performing operations efficiently. Encoding hierarchies in a manner that permits quick execution of such operations has been a goal in logic programming and other areas of computer science[14] Many encoding schemes have been proposed such as in Dahl[9, 10] Brew[5] and Ait Kaci, et al. [4]. Although those encoding schemes are successful in their particular fields, research is ongoing in the quest for general purpose, compact, flexible and efficient encoding techniques. Interesting studies on the automatic generation of concept hierarchies for nominal data can also be seen in other ....
H. Ait-Kaci, R. Boyer, P. Lincoln and R. Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Languages, 11(1):115-146, 1989.
MediaBroker: An Architecture for Pervasive Computing - Modahl, Bagrak, Wolenetz.. (2003) (1 citation) (Correct)
No context found.
Hassan Ait-Kaci, Robert S. Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. Programming Languages and Systems, 11(1):115--146, 1989.
Qualitative and Topological Relationships - Cui, Cohn, Randell (1993) (Correct)
No context found.
H. Ait-Kaci, et al: "Efficient Implementation of Lattice Operations," ACM Trans. on Programming Languages and Systems, 11(1), 1989
Application-Driven Automatic Subgrammar Extraction - Henschel, Bateman (1997) (Correct)
No context found.
Hassan Ait-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. 1989. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115 -- 146.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC