Readings in Knowledge Representation
Readings in Knowledge Representation
Using λ-calculus to represent meanings in logic grammars
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
Higher-order unification revisited: Complete sets of transformations
Journal of Symbolic Computation
Journal of the ACM (JACM)
Combining Syntax and Pragmatic Knowledge for the Understanding of Spontaneous Spoken Sentences
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Information Extraction: Towards Scalable, Adaptable Systems
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
Higher-order unification and matching
Handbook of automated reasoning
Bidirectional contextual resolution
Computational Linguistics
Using higher-order logic programming for semantic interpretation of coordinate constructs
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A definite clause version of Categorial Grammar
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Anaphoric reference to events and actions: a representation and its advantages
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Consideration of the question of meaning in the framework of linguistics often requires an allusion to sets and other higher-order notions. The traditional approach to representing and reasoning about meaning in a computational setting has been to use knowledge representation systems that are either based on first-order logic or that use mechanisms whose formal justifications are to be provided after the fact. In this paper we shall consider the use of a higher-order logic for this task. We first present a version of definite clauses (positive Horn clauses) that is based on this logic. Predicate and function variables may occur in such clauses and the terms in the language are the typed λ-terms. Such term structures have a richness that may be exploited in representing meanings. We also describe a higher-order logic programming language, called λProlog, which represents programs as higher-order definite clauses and interprets them using a depth-first interpreter. A virtue of this language is that it is possible to write programs in it that integrate syntactic and semantic analyses into one computational paradigm. This is to be contrasted with the more common practice of using two entirely different computation paradigms, such as DCGs or ATNs for parsing and frames or semantic nets for semantic processing. We illustrate such an integration in this language by considering a simple example, and we claim that its use makes the task of providing formal justifications for the computations specified much more direct.