Extended person-machine interface
Artificial Intelligence
Communications of the ACM
Logic for Problem Solving
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A flexible graph-unification formalism and its application to natural-language processing
IBM Journal of Research and Development
A computational treatment of sentence-final 'then'
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
VP Ellipsis in a DRT-implementation
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Machine translation using isomorphic UCGs
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Unification Categorial Grammar: a concise, extendable grammar for natural language processing
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Embedding DRT in a situation theoretic framework
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Semantic abstraction and anaphora
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
Incremental syntactic and semantic processing
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
JSAI'03/JSAI04 Proceedings of the 2003 and 2004 international conference on New frontiers in artificial intelligence
Interpreting plurals in the naproche CNL
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
A Principled Approach to Grammars for Controlled Natural Languages and Predictive Editors
Journal of Logic, Language and Information
| Hi-index | 0.00 |
Discourse Representation Theory, as formulated by Hans Kamp and others, provides a model of inter- and intra-sentential anaphoric dependencies in natural language. In this paper, we present a reformulation of the model which, unlike Kamp's, is specified declaratively. Moreover, it uses the same rule formalism for building both syntactic and semantic structures. The model has been implemented in an extension of PROLOG, and runs on a VAX 11/750 computer.