B. Carpenter. Typed feature structures: A generalization of first-order terms. In V. Saraswat and K. Ueda, editors, Logic Programming, Proceedings of the 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....possibly cyclic graphs labelled with sorts and features similar to feature trees. In contrast to feature trees, nodes of feature graphs may or may not be labelled with sorts. Feature graphs correspond to the so called feature structures commonly found in linguistically motivated investigations [19, 8]. 1.3 Organization of the Paper Section 2 recalls the necessary notions and notations from Predicate Logic. Section 3 defines the theory FT by means of three axiom schemes. Section 4 establishes the overall structure of the completeness proof by means of a lemma. Section 5 studies ....

B. Carpenter. Typed feature structures: A generalization of first-order terms. In V. Saraswat and K. Ueda, editors, Logic Programming, Proceedings of the 1991.

....For instance, our algorithm is complete for quantified negative constraints such as :9y9z(z = f(y; z) Feature descriptions have a long and winded history. One root are the unification grammar formalisms FUG [14] and LFG [13] developed for applications in computational linguistics (see [8] for a more recent paper in this area) Another, independent root is Ait Kaci s term calculus [1, 2] which is the basis of several constraint programming languages [3, 4, 5] Smolka [20] gives a unified logical view of most earlier feature formalisms and studies an expressive feature constraint ....

....programming languages [3, 4, 5] Smolka [20] gives a unified logical view of most earlier feature formalisms and studies an expressive feature constraint logic. Feature trees appeared only recently with the work on FT [7, 6] To our knowledge the notion of an arity constraint is new. Carpenter s [8] extensional types are somewhat related in that they fix an arity for all elements of a type. 1.5 Organization of the Paper Section 2 gives a formal definition of the feature tree structure, thus fixing syntax and semantics of CFT. Section 3 defines a first order theory by means of five axiom ....

B. Carpenter. Typed feature structures: A generalization of first-order terms. In V. Saraswat and K. Ueda, editors, Logic Programming, Proceedings of the 1991 International Symposium, pages 187--201, San Diego, USA, 1991. The MIT Press.

....3. 1 Basic notions We assume familiarity with theories of feature structure based unification grammars, as formulated by, e.g. Carpenter (1992) or Shieber (1992) Grammars are defined over typed feature structures (TFSs) which can be viewed as generalizations of first order terms (Carpenter, 1991). TFSs are partially ordered by subsumption, with the least (or most general) TFS. A multi rooted structure (MRS, see Sikkel (1997) or Wintner and Francez (1999) is a sequence of TFSs, with possible reentrancies among different elements in the sequence. Meta variables A; B range over TFSs and ....

Carpenter, Bob. 1991. Typed feature structures: A generalization of first-order terms. In Vijai Saraswat and Ueda Kazunori, editors, Logic Programming -- Proceedings of the 1991 International Symposium, pages 187--201, Cambridge, MA. MIT Press.

....(WAM like) machine for the formalism ( 14] we consider parsing as a computational process and use it as an operational semantics to guide the design of the control structures for the abstract machine. In this paper the machine is not discussed further. Section 2 outlines the theory of TFSs of [1, 3]. We emphasize abstract typed feature structures (AFSs) that encode the essential information of TFSs and extend unification to AFSs. Section 3 introduces an explicit construct of multi rooted feature structures (MRSs) that naturally extend TFSs, used to represent phrasal signs as well as grammar ....

....that is, the number of equivalence classes of paths can decrease. Consequently, the result of a unification is always more specific than any of its arguments. Theorem 2.14 If C 0 = A t B then A C 0 . TFSs (and therefore AFSs) can be seen as a generalization of first order terms (FOTs) see [1]) Accordingly, AFS unification resembles FOT unification; however, the notion of substitution that is central to the definition of FOT unification is missing here, and as far as we know, no analog to substitutions in the domain of feature structures was ever presented. 3 Multi rooted Structures ....

Bob Carpenter. Typed feature structures: A generalization of first-order terms. In Vijai Saraswat and Ueda Kazunori, editors, Logic Programming -- Proceedings of the 1991 International Symposium, pages 187--201, Cambridge, MA, 1991. MIT Press.

....explicitly the existence of a model satisfying the sort definitions in contrast with [10] cf. also, Footnote 6) As for unfolding sort definitions, we know of two other works, both relevant to computational linguistics: that of Bob Carpenter and that of Martin Emele and Remi Zajac. Bob Carpenter [6] proposed a simple type checking of a system of sort definitions for feature terms that are essentially a variation of terms. However, besides being purely operational, this system is limited to the simple case where sort definitions specify sort constraints on features alone, without feature ....

....works with total features. As it turns out, our system can be made to handle partial features with the addition of one simple decidable rule whose effect is to narrow the sort of a variable to intersect a feature s domain when that feature is applied to it. Therefore, the system described in [6] is a special case of what we present here. In the recent book [7] Chapter 15 deals with recursive type constraint systems extending that of [1] to be of the kind we study here. He gives a complete resolution method similar to Horn clause resolution. That method differs from ours in that it is ....

Bob Carpenter. Typed feature structures: A generalization of first-order terms. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 International Symposium on Logic Programming, pages 187--201, Cambridge, MA, 1991. MIT Press.

....existence of a model satisfying the sort definitions while this is overlooked in [20] cf. also, Footnote 6) As for unfolding sort definitions, we know of two other works, both relevant to computational linguistics: that of Bob Carpenter and that of Martin Emele and R emi Zajac. Bob Carpenter [12] proposed a simple type checking of a system of sort definitions for feature terms that are essentially a variation of terms. However, besides being purely operational, this system is limited to the simple case where sort definitions specify sort constraints on features alone, without feature ....

....works with total features. As it turns out, our system can be made to handle partial features with the addition of one simple decidable rule whose effect is to narrow the sort of a variable to intersect a feature s domain when that feature is applied to it. Therefore, the system described in [12] is a special case of what we present here. In the recent book [13] Chapter 15 deals with recursive type constraint systems extending that of [3] to be of the kind we study here. He gives a complete resolution method similar to Horn clause resolution. That method differs from ours in that it is ....

[Article contains additional citation context not shown here]

Bob Carpenter. Typed feature structures: A generalization of first-order terms. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 International Symposium on Logic Programming, pages 187--201, Cambridge, MA, 1991. MIT Press.

....as a first class data structure that can be manipulated in TSO. All these approaches are out of the scope of this paper and are therefore not discussed further. 7 Related and future work A concept similar to type specialization was proposed as typed feature structures for linguistic computations [6, 14], and terms supporting an object oriented programming style in LIFE, an extension of Prolog [2] This concept extends logic terms with a multiple inheritance type system over which unification is well defined. During computation, feature structures are unified so that the variables types become ....

Bob Carpenter. Typed feature structures: a generalization of first-order terms. In Logic Programming: Proceedings of the 1991 Int. Symp., 187--201, The MIT Press (1991).

....For instance, our algorithm is complete for negative quantified constraints such as :9y9z(x = f(y; z) Feature descriptions have a long and winded history. One root are the unification grammar formalisms FUG [21] and LFG [20] developed for applications in computational linguistics (see [11] for a more recent paper in this area) Another, independent root is Ait Kaci s term calculus [1, 2] which is the basis of several constraint programming languages [4, 5, 6] Smolka [29] gives a unified logical view of most earlier feature formalisms and studies an expressive feature constraint ....

....programming languages [4, 5, 6] Smolka [29] gives a unified logical view of most earlier feature formalisms and studies an expressive feature constraint logic. Feature trees appeared only recently with the work on FT [9, 7] To our knowledge the notion of an arity constraint is new. Carpenter s [11] extensional types are somewhat related in that they fix an arity for all elements of a type. Feature constraints with first class features have been considered in [31] A short version of this paper not containing the proofs and the description of the abstract machine has appeared before [30] ....

[Article contains additional citation context not shown here]

B. Carpenter. Typed feature structures: A generalization of first-order terms. In Saraswat and Ueda [28], pages 187--201.

No context found.

Bob Carpenter. Typed feature structures: A generalization of first-order terms. In Vijai Saraswat and Ueda Kazunori, editors, Logic Programming -- Proceedings of the 1991 International Symposium, pages 187--201, Cambridge, MA, 1991. MIT Press.

No context found.

Bob Carpenter. Typed feature structures: A generalization of first-order terms. In Vijai Saraswat and Ueda Kazunori, editors, Logic Programming -- Proceedings of the 1991 International Symposium, pages 187--201, Cambridge, MA, 1991. MIT Press.

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