Hiord: A type-free higher-order logic programming language with predicate abstraction

A new formalism, called Hiord, for defining type-free higherorder logic programming languages with predicate abstraction is introduced. A model theory, based on partial combinatory algebras, is presented, with respect to which the formalism is shown sound. A programming language built on a subset of Hiord, and its implementation are discussed. A new proposal for defining modules in this framework is considered, along with several examples.

Inductive inference in the variable valued predicate logic system VL 21 : methodology and computer implementation /

Vita.

Load regulation and dispatching in a network of computers /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Complete problems in the first-order predicate calculus /

"UILU-ENG 79 1726."

Dispatching fire trucks with the aid of a computer /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

Homelie del R. padre F. Franceschino Visdomini da Ferrara ... : nelle quali vi sono molti vtili, e necessari essempi, e documenti, tratti dalle principali auttorità [sic!] della sacra Biblia, & de sacri Euangeli : predicate in Roma, in Vinegia, in Genoua, In Bologna, in Brescia [et] nel sacro santo Concilio di Trento /

Mode of access: Internet.

Prediche del reuerendo don Gabriello Inchino, canonico regolare lateranense, sopra i quattro Nouissimi : da lui predicate in alcune citta d'Italia : Vtilissime ad ogni stato, grado, e conditione di persone; ma principalmente a' parochi, a' curato, [et] a' predicatori; che ne potrannno cauare molti sermoni, e prediche sopra diuersi passi del sacro Euangelio : Con vna tauola di tutte le cose notabili, che in esse prediche si contengono ...

Mode of access: Internet.

Sei prediche del R.D. Gabriel Fiamma, canonigo regolare lateranense : in lode della beata Vergine sopra lÉvangelio de S. Luca ... : predicate in Napoli, nella Chiesa dell'Annunciata, i Sabbati di Quaresma, l'anno 1573.

Mode of access: Internet.

Prediche del reu. mons. Francesco Riccardotto ... : sopra il sacramento dell'altare da lui predicate ..., con vna predica del medesimo sopra le imagini delle chiese in difesa della fede cattolica /

Edit16,

Inspection and investigation of train-dispatching offices : hearings before a subcommittee of the Committee on Interstate Commerce, United States Senate, Seventy-fourth Congress, first session, on S. 2511, a bill to promote the safety of employees and travelers on railroads by providing for the inspection and investigation of conditions prevailing in train-dispatching offices and for the promulgation of necessary rules and regulations governing the working conditions of train dispatchers (see also: Hearings on S. 1562 incorporated herein by reference). July 5, 8, and 9, 1935.

Augustine Lonergan, chairman of subcommittee.

Genetic algorithm-based spinning reserve dispatching in a competitive electricity market

Power systems rely greatly on ancillary services in maintaining operation security. As one of the most important ancillary services, spinning reserve must be provided effectively in the deregulated market environment. This paper focuses on the design of an integrated market for both electricity and spinning reserve service with particular emphasis on coordinated dispatch of bulk power and spinning reserve services. A new market dispatching mechanism has been developed to minimize the ISO's total payment while ensuring system security. Genetic algorithms are used in the finding of the global optimal solutions for this dispatching problem. Case studies and corresponding analyses haw been carried out to demonstrate and discuss the efficiency and usefulness of the proposed market.

A First Order Predicate Logic Formulation of the 3D Reconstruction Problem and its Solution Space

This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added.

New Knowledge Obtaining in Structural-predicate Models of Knowledge

An effective mathematical method of new knowledge obtaining on the structure of complex objects with required properties is developed. The method comprehensively takes into account information on the properties and relations of primary objects, composing the complex objects. It is based on measurement of distances between the predicate groups with some interpretation of them. The optimal measure for measurement of these distances with the maximal discernibleness of different groups of predicates is constructed. The method is tested on solution of the problem of obtaining of new compound with electro-optical properties.