Hassan At-Kaci, Andreas Podelski, and Seth Copen Goldstein. Order-sorted feature theory unification. (1992). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Implementation of Unification-Based Grammars - Wintner, al. (1999) (3 citations) (Correct)
....i.e. grammars. 3. 2 Representation of Feature Structures The most convenient graphical representation of TFSs is through attribute value matrices (AVMs) However, to represent a (totally well typed) feature structure linearly we use a first order term like notation, based upon At Kaci s # terms [4, 5], where the type plays a similar role to that of a function symbol and the features are listed in a fixed order. Reentrancy is implied by attaching identical tags (of the form i , i # 0) to reentrant TFSs. A term is normal if all its types are tagged, and if the same tag appears more than once, ....
Hassan At-Kaci, Andreas Podelski, and Seth Copen Goldstein. Order-sorted feature theory unification. In Dale Miller, editor, Logic Programming -- Proceedings of the 1993 International Symposium, pages 506--524, Cambridge, Mass., 1993. MIT Press.
An Abstract Machine to Implement Functions in LIFE - Goldstein (1992) Self-citation (Goldstein) (Correct)
....constraint tree. In LIFE the function call is represented by a term, where the sort of the term is the name of the function being invoked, and the arguments to the function are terms connected to the root by features that label them as arguments. For instance, the function call append([1,2,3], 4,5] is really shorthand for append(1 ) 1,2,3] 2 December 1992 Digital PRL An Abstract Machine to Implement Functions in LIFE 3 X:person X.name = F F: fred S:person X.spouse = S S.name = M M: mary S.spouse = X Figure 2: The Constraint Tree representation of the dissolved term. ....
....is represented by a term, where the sort of the term is the name of the function being invoked, and the arguments to the function are terms connected to the root by features that label them as arguments. For instance, the function call append( 1,2,3] 4,5] is really shorthand for append(1 ) [1,2,3], 2 December 1992 Digital PRL An Abstract Machine to Implement Functions in LIFE 3 X:person X.name = F F: fred S:person X.spouse = S S.name = M M: mary S.spouse = X Figure 2: The Constraint Tree representation of the dissolved term. 4,5] As will be seen later, representing the function ....
[Article contains additional citation context not shown here]
Hassan At-Kaci, Andreas Podelski, and Seth Copen Goldstein. Order-sorted feature theory unification. (1992).
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