Relating sentences and semantic networks with procedural logic
Communications of the ACM
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Logic Programming
Natural Language Communication with Computers
Hierarchical semantics, reasoning, and translation
Hierarchical semantics, reasoning, and translation
Translating Spanish into logic through logic
Computational Linguistics
From English to logic: context-free computation of "conventional" logical translation
Computational Linguistics
Translating English into logical form
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
Sentential semantics for propositional attitudes
Computational Linguistics
Montagovian Definite Clause Grammar
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Some uses of higher-order logic in computational linguistics
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
This paper describes how meanings are represented in a semantic grammar for a fragment of English in the logic programming language Prolog. The conventions of Definite Clause Grammars are used. Previous work on DCGs with a semantic component has used essentially first-order formulas for representing meanings. The system described here uses formulas of the typed λ-calculus. The first section discusses general issues concerning the use of first-order logic or the λ-calculus to represent meanings. The second section describes how λ-calculus meaning representations can be constructed and manipulated directly in Prolog. This 'programmed' representation motivates a suggestion, discussed in the third section, for an extension to Prolog so that the language itself would include a mechanism for handling the λ-formulas directly.