DFKI Research Report-94-37
by Hans-Ulrich Krieger, Ulrich Schäfer
TDL - A Type Description Language for HPSG, Part 1: Overview.
This paper presents , a typed feature-based language and inference system, which is specifically designed to support highly lexicalized grammar theories like HPSG. allows the user to define (possibly recursive) hierarchically-ordered types, consisting of type constraints and feature constraints over the standard boolean connectives. distinguishes between avm types (open-world reasoning), sort types (closed-world reasoning), built-in types and atoms, and allows the declaration of partitions and incompatible types. Working with partially as well as with fully expanded types is possible, both at definition time and at run time. is incremental, i.e., it allows the redefinition of types and the use of undefined types. Efficient reasoning is accomplished through four specialized reasoners:
This document is available as Postscript.
The next abstract is here, and the previous abstract is here.
Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.