WorldCat Identities

Green, Cordell

Overview
Works: 14 works in 31 publications in 1 language and 115 library holdings
Roles: Author, Editor
Classifications: TK7895.S65, 001.535
Publication Timeline
.
Most widely held works by Cordell Green
Automated design of displays for technical data by Stephen Westfold( Book )

2 editions published in 1990 in English and held by 79 WorldCat member libraries worldwide

This paper reports on a theory of a graphical display that automatically designs tables and diagrams that represent relations occurring in technical data. The theory is based upon a small number of principles such as using visual adjacency and visual connectedness to reflect semantic relations among the data. The theory uses techniques adapted from automated programming for display reformulation and display optimization. A prototype display synthesis system that implements the theory as a set of transformation rules has been written. The system takes a relational specification as input and produces a display as output. The theory is illustrated in this paper by showing an annotated trace of the prototype generating a large number of tables and diagrams from relational technical data. The examples show the generation of displays from aircraft maintenance technical data that is free of all formatting and display instructions. (KR)
A hypothetical dialogue exhibiting a knowledge base for a program-understanding system by C Green( Book )

3 editions published in 1975 in English and held by 7 WorldCat member libraries worldwide

A hypothetical dialogue with a fictitious program-understanding system is presented. In the interactive dialogue the computer carries out a detailed synthesis of a simple insertion sort program for linked lists. The content, length and complexity of the dialogue reflect the underlying programming knowledge which would be required for a system to accomplish this task. The nature of the knowledge is discussed and the codification of such programming knowledge is suggested as a major research area in the development of program-understanding systems
On program synthesis knowledge by C Green( Book )

5 editions published in 1977 in English and Undetermined and held by 6 WorldCat member libraries worldwide

This paper presents a body of program synthesis knowledge dealing with array operations, space reutilization, the divide and conquer paradigm, conversion from recursive paradigms to iterative paradigms, and ordered set enumerations. Such knowledge can be used for the synthesis of efficient and in-place sorts including quicksort, mergesort, sinking sort, and bubble sort, as well as other ordered set operations such as set union, element removal, and element addition. The knowledge is explicated to a level of detail such that it is possible to codify this knowledge as a set of program synthesis rules for use by a computer-based synthesis system. The use and content of this set of programming rules is illustrated herein by the methodical synthesis of bubble sort, sinking sort, quicksort, and mergesort. (Author)
Application of theorem proving to problem solving by Cordell Green( Book )

4 editions published in 1969 in English and held by 5 WorldCat member libraries worldwide

This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended proof procedure can solve problems involving state transformations. The paper explores several alternate problem representations and provides a discussion of solutions to sample problems including the "Monkey and Bananas" puzzle and the "Tower of Hanoi " puzzle. The paper exhibits solutions to these problems obtained by QA3, a computer program based on these theorem-proving methods. In addition, the paper shows how QA3 can write simple computer programs and can solve practical problems for a simple robot
Speech understanding systems. Final report of a study group by Allen Newell( Book )

3 editions published between 1971 and 1994 in English and held by 3 WorldCat member libraries worldwide

The report provides an evaluation of the state of the art and a program for research towards the development of speech understanding systems. To assess the possibility of such systems four specific tasks were considered and evaluated. Problem areas are identified and discussed leading to the conclusions on the technical aspects of the study. A possible program for research and development is presented. (Author)
Recent research in computer science by John McCarthy( Book )

3 editions published in 1977 in English and Undetermined and held by 3 WorldCat member libraries worldwide

This report summarizes recent accomplishments in six related areas: basic AI research and formal reasoning, image understanding, mathematical theory of computation, program verification, natural language understanding, and knowledge based programming
Real-time software visualization( Book )

3 editions published in 1998 in English and held by 2 WorldCat member libraries worldwide

This report describes a formal approach to visualizing software specifications. The approach taken was to begin with a formal description of the entity to be visualized and repeatedly apply automated inference steps to transform the description into a form which could be rendered using standard techniques. The Specware specification construction environment was used to build specifications defining these visualizations. Several examples are included. In addition to visual representation, the role of sound in understanding and visualizing complex structures was also investigated
Research on Synthesis of Concurrent Computing Systems by Richard M King( Book )

1 edition published in 1982 in English and held by 1 WorldCat member library worldwide

The object of our research is the codification of programming knowledge for the synthesis of concurrent programs. This final report presents the derivation of two concurrent algorithms: dynamic programming (for the class of problems that run in polynomial time on sequential machines) and array multiplication. Both derived concurrent versions run in linear time. The concurrent versions are significant and complex algorithms, though they are not new and already have been reported in the literature. The synthesis knowledge for these derivations is embodied in seven synthesis rules, preliminary versions of which are presented in this report. The rules will probably generalize to other classes of algorithms but we have not explored that issue yet. We have also discovered a pair of techniques called virtualization and aggregation. This pair of techniques (plus the other seven rules) is shown to be powerful enough to synthesize Kung's systolic array architecture (Kung-76) from a specification of matrix multiplication
Theorem proving by resolution as a basis for question-answering systems : revised draft by Cordell Green( Book )

2 editions published in 1968 in English and held by 1 WorldCat member library worldwide

Knowledge-based synthesis of efficient structures for concurrent computation using fat-trees and pipelining by Kestrel Institute( Book )

1 edition published in 1986 in English and held by 1 WorldCat member library worldwide

In a previous work the authors developed techniques to synthesize lattice and tree parallel structures from first order logic specifications. They have now developed new techniques that synthesize new structures. First the new techiques enable the synthesis of trees in which the width of the width of the interconnections and the power of the nodes increases as the distance from the leaves increases. This type of tree has been given the name fat-tree. Fat-trees are univeral in that the performance of any network at all can be equal by a fat-trees, to a constant and some factors logarithmic in the size of the structure to be simulated. The constant is immense, making fat-trees, at present not a general method for simulating other structures. The idea of such a varying-width tree can, however, be used in specific cases as a synthesis target. The authors describe techniques for using extensions of previous work to build specialized fat-trees to satisfy certain first order logic specifications. These fat-tree are efficient, because they are specialized. The second extension is a proof that an appropriately defined parallel structure can be modified to produce a structure capable of pipelining, or processing different parts of several problem instances simultaneously in a manner similar to an assembly line. The roof is a constructive one; a synthesis method based on the proof is feasible
Application of theorem proving to problem solving by Cordell Green( )

1 edition published in 1990 in English and held by 1 WorldCat member library worldwide

Report of the workshops automated generation of electronic technical manuals( )

1 edition published in 1993 in English and held by 0 WorldCat member libraries worldwide

Paper-based technical manuals are expensive to produce and maintain, difficult to update and modify, and bulky and inflexible in the field. They are fast approaching their practical limit in coping with the complexity of modern Air Force weapons systems. The next 10 to 15 years hold the promise of a revolution, triggered by emerging technologies, in the production and presentation of aircraft maintenance information. This report describes a vision of integrated and electronically based maintenance information support in the future, and suggests the specific research and development goals necessary to achieve that vision. The report identifies a number of emerging technologies which will enable maintenance instructions to be created and managed more efficiently, and used more effectively, than they are now. Outlined herein are the essential advancements in applicable field needed to migrate from a costly and cumbersome world of paper production to the lean world of digital production and delivery. Success in these pursuits will bring enormous benefits both within the economy of human-centered design technology for concurrent engineering and in the performance of maintenance personnel
e-Merge-ANT: A Toolkit to Create Run-Time Autonomous Negotiating Teams (ANT) Generators, Aggregators, and Synthesizers( )

1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide

This project addressed the problem of the real-time management of distributed resources. It developed an abstract formulation in terms of distributed constraint optimization and developed a simple anytime algorithm that was shown to be effective efficient robust and scalable to large problems. It extended the formulation and algorithm to the management of distributed sensors in a target detection and tracking application. It also developed high-level models for resource management in time-critical targeting in air campaigns and extended an existing scheduler generator tool to automatically generate executable schedulers that quickly assign aircraft and munitions to prosecute targets of opportunity while minimizing disruption to pre-planned target prosecutions
Toward a formal model of the design and evolution of software by Kestrel Institute( )

1 edition published in 1988 in English and held by 0 WorldCat member libraries worldwide

This report summarizes recent activities on the development of a formal model of the design and evolution of software. The model is intended to be both descriptive and prescriptive. It is descriptive in that we are attempting to capture known design processes in the model. The model is also intended to be prescriptive in the sense that it provides the conceptual basis for the sophisticated knowledge-based software design environments of the future. It should have the flexibility to support a variety of design methodologies, be comprehensive enough to encompass the gamut of software lifecycle activities, and be precise enough to provide the conceptual foundations for an open yet rigorous development environment. We also present recent work on the structure and design of a class of algorithms called global search. The design tactic for global search algorithms provides a rich example of the kind of design process that the abstract model is intended to capture. We present a tactic for designing global search algorithms and illustrate it with the derivation of an algorithm for enumerating cyclic difference sets - a rare kind of set that bear some similarities to the prime numbers. The design tactic has been implemented and used to derivation dozens of global search algorithms including one for enumerating cyclic difference sets
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.66 (from 0.59 for Report of ... to 0.99 for Applicatio ...)

Alternative Names
Green, Claude Cordell

Languages
English (28)