The University of Sussex

DATR Paths as arguments

Lionel Moser

DATR is a lexical knowledge representation language which is designed to support the lexicon in an NLP system. Its syntax and semantics are designed to support the types of inference required in computational lexicography. It was not a design intention of the language to support general logic programming, yet in this paper we show that the types of inference permitted in the language do support a general type of logical inference. Drawing and analogy with Prolog, both are declarative languages, and each has its own inference engine or theorem prover, which are quite different. DATR allows at least a subset of Prolog-definable logic programs to be encoded.

Download zip file