Krieger, H.-U. 1995. Classification and Representation of Types in TDL. In Proceedings of the International KRUSE Symposium, Knowledge Retrieval, Use, and Storage for Efficiency, 74--85. Also available as DFKI Research Report RR-95-17. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reasoning With Taxonomies - Fall (1996) (8 citations) (Correct)
.... Walt Kelly The cohesive theme of this thesis is the partial order, a simple yet elegant and powerful mathematical concept to which a lot of attention has been devoted (e.g. 15, 38, 144] Partial orders underlie central aspects of many domains, such as mathematical logic [128] sorted logic [27, 28, 93] and logic programming [3, 4, 93] type systems [106] natural language processing (e.g. typed feature structures [23, 71, 118] systemic networks [80, 101] object orientation (e.g. databases [1] languages [24] knowledge representation (e.g. conceptual structures [42, 136] knowledge bases ....
.... of this thesis is the partial order, a simple yet elegant and powerful mathematical concept to which a lot of attention has been devoted (e.g. 15, 38, 144] Partial orders underlie central aspects of many domains, such as mathematical logic [128] sorted logic [27, 28, 93] and logic programming [3, 4, 93], type systems [106] natural language processing (e.g. typed feature structures [23, 71, 118] systemic networks [80, 101] object orientation (e.g. databases [1] languages [24] knowledge representation (e.g. conceptual structures [42, 136] knowledge bases [45] description logics [17, 18, ....
[Article contains additional citation context not shown here]
H. Krieger. Classification and representation of types in TDL. In Proc. First International Symposium on Knowledge Representation, Use and Storage for Efficiency (KRUSE'95), Santa Cruz, CA, 1995. BIBLIOGRAPHY 129
From Word Hypotheses to Logical Form: An Efficient.. - Kasper, Krieger.. (1996) (1 citation) Self-citation (Krieger) (Correct)
....undertaken by the sophisticated typed feature formalisms TDL. Since the HPSG grammar for dialog turns (cf. Section 3) is strictly typed, a good deal of feature structure unifications simply reduce to type unifications which are implemented very efficiently through bit vectors and hash tables (cf. Krieger 1995). It is worth noting that all rules of the grammar obey a certain locality requirement, meaning that they do not constrain daughters of daughters (neither through coreference requirements, nor through values) This is not only linguistically interesting (and nicely complements the locality ....
Krieger, H.-U. 1995. Classification and Representation of Types in TDL. In Proceedings of the International KRUSE Symposium, Knowledge Retrieval, Use, and Storage for Efficiency, 74--85. Also available as DFKI Research Report RR-95-17.
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