Some Uses of Higher - Order Logicin Computational
نویسنده
چکیده
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 rst-order logic or that use mechanisms whose formal justiications are to be provided after the fact. In this paper we shall consider the use of a higher-order logic for this task. We rst present a version of deenite 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 deenite clauses and interprets them using a depth-rst 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 diier-ent 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 justiica-tions for the computations speciied much more direct.
منابع مشابه
Exact Implementation of Multiple Initial Conditions in the DQ Solution of Higher-Order ODEs
The differential quadrature method (DQM) is one of the most elegant and useful approximate methods for solving initial and/or boundary value problems. It is easy to use and also straightforward to implement. However, the conventional DQM is well-known to have some difficulty in implementing multiple initial and/or boundary conditions at a given discrete point. To overcome this difficulty, this ...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملIntegrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy
In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...
متن کاملOn Green and Naghdi Thermoelasticity Model without Energy Dissipation with Higher Order Time Differential and Phase-Lags
In the present work, a modified model of heat conduction including higher order of time derivative is derived by extending Green and Naghdi theory without energy dissipation. We introduce two phase lag times to include the thermal displacement gradient and the heat flux in the heat conduction and depict microscopic responses more precisely. The constructed model is applied to s...
متن کامل