TDL--- A Type Description Language for Constraint-Based Grammars
Abstract
This paper presents , a typed feature-based representation language and inference system. Type definitions in \ consist of type and feature constraints over the boolean connectives. \ supports open- and closed-world reasoning over types and allows for partitions and incompatible types. Working with partially as well as with fully expanded types is possible. Efficient reasoning in \ is accomplished through specialized modules.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.