## Search

Now showing items 11-20 of 30

#### A File Definition Facility for File Structures

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74001-R

This paper describes a file definition facility (FDF) for defining files as graph structures. The structure of the file is explicitly declared in the file definition. Primitive functions(from graph theory), operators, and ...

#### No Abelian Semigroup Operation Is Complete

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74021-R

This paper shows that there does not exist a finite abelian semigroup <S, *> with order > 3 such that the semigroup operation is complete over S. Neither is {*} complete with constants over S. J. C. Muzio has shown that ...

#### Learning as a Problem Solving Tool

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74018-R

This paper explores the use of learning as a practical tool in problem solving. The idea that learning should and eventually will be a vital component of most Artificial Intelligence programs is pursued. Current techniques ...

#### Definability of Boolean Function Over Many-value Boolean Algebra

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74007-R

In this paper, the definability of functions over B_s is first briefly discussed. We then give necessary and sufficient conditions on the definable functions over B_2, boolean algebra of four values. An efficient algorithm ...

#### A Note on Ledgard's Minilanguage 2 And a Proposal for an Alternative

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74017-R

This note reviews and discusses the concepts of assignment statements which occur within programming languages and as exemplified by Minilanguage 2 by Ledgard [3]. Observing that the description of assignment by Ledgard ...

#### On the Minimal Total Path Length of a Spanning Tree

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74032-R

The notions of a balance node and the total path length with respect to a node u of a spanning tree are defined. We show that the total path length of a spanning tree with respect to u is minimal if and only if u is a ...

#### The Automatic Digitizer in Computer Graphics

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74029-R

An operational hardware-software system is described which rapidly and economically converts hard-copy drawings into graphic data structures faithfully representing both their geometry and their topology. These facilities ...

#### First Report on Epos: Aspects of Generality And Efficiency in Programming Language Implementation

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74016-R

No abstract available.

#### The Logical Foundations of Microlanguages

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74020-R

After the consideration of two recent examples of instruction sets for microprogrammable computers, the article sketches known and new results about complete sets of functions which appear to be applicable to microlanguage ...

#### A Computer Implementation of the Transformations of Formulas into Prenex Normal Form

(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74010-R

The purpose of this paper is to explain a computerized process whereby any well-formed formula (wff) of first order predicate calculus can be moved to its prenex normal form (PNF). The main features of the program demonstrate ...