TDL--- A Type Description Language for Constraint-Based Grammars

TL;DR

This paper introduces dl, a typed language for constraint-based grammars that supports complex reasoning over types and features with efficient inference mechanisms.

Contribution

It presents a novel typed feature-based language with advanced reasoning capabilities for constraint-based grammars.

Findings

Supports open- and closed-world reasoning

Handles partially and fully expanded types

Provides efficient inference modules

Abstract

This paper presents \tdl, a typed feature-based representation language and inference system. Type definitions in \tdl\ consist of type and feature constraints over the boolean connectives. \tdl\ 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 \tdl\ is accomplished through specialized modules.