This document reviews the features of the Zdatr 2.0 compiler and inference engine. It is not an introduction to DATR; For the standard introduction to DATR language representation and inference, consult Roger Evans & Gerald Gazdar (1995), `DATR: A Language for Lexical Knowledge Representation' in Computational Linguistics, 22.2, 167-216.[Image]
Currently the most comprehensive formalisation -- in fact three formalisations -- of DATR, with a theorem prover application and a formalisation of causal networks (WB-Graphs) in DATR, is to be found in Thorsten Gerdsmeier (1998), Formale Beschreibung von DATR [Formal description of DATR]. Diploma thesis, U Bielefeld.
The current standard requirements specification for DATR libraries is The DATR standard Library RFC, Version 2.00, 18 August 1998 by Evans & Gazdar, which incorporates suggestions by Petra Barg, John Carroll, Dafydd Gibbon, Bill Keller, Jim Kilbury, Christof Rumpf and Sebastian Varges.
The development of Zdatr 2.0 has been made possible by much voluntary work and by local funds of the Computational Linguistics and Spoken Language group of the Faculty of Linguistics and Literary Studies, University of Bielefeld, Germany.