Thesis--Wisconsin. / Vita. Includes glossary.

Thesis (M.S. in computer science)--Washington State University, May 2010. / Title from PDF title page (viewed on July 28, 2010). "School of Engineering and Computer Science." Includes bibliographical references (p. 65-67).

Thesis (M.S.)--University of Delaware, 2007. / Principal faculty advisor: Chien-Chung Shen, Dept. of Computer & Information Sciences. Includes bibliographical references.

Steeb, W.H., Prof.

No description available.

No description available.

A summary of the work done in the field of analytic differentiation by computer is presented. It is shown that there exists a need for an analytic differentiation routine whose output can be processed by a regular algebraic compiler. An algorithm is presented which will transform a FORTRAN FUNCTION subprogram into a FORTRAN SUBROUTINE subprogram that evaluates both the original function and its first derivative with respect to one independent variable. Implementation of this algorithm and possible extensions to it are discussed. / Science, Faculty of / Computer Science, Department of / Graduate

A covariance analysis procedure which compares multiple linear regression equations is developed by extending the general linear hypothesis model of full rank to encompass heterogeneous data. A FORTRAN IV computer program tests parallelism and coincidence amongst sets of regression equations. By a practical example both the theory and the computer program are demonstrated. / Graduate and Postdoctoral Studies / Graduate

Many expert systems have been developed over the past decades. ProGrammar is a modest expert system shell that has been developed recently. It is built on top of the CProlog/UNIX* system running on a VAX† 11/750. ProGrammar is designed for processing and developing grammars. It can also be used as a knowledge base constructor for other fields besides grammars, a learning tool, a Prolog interpreter, and as a consulting system. ProGrammar is an interactive system meaning not only can the user query ProGrammar but ProGrammar also can question the user. The user is allowed to request an explanation from the ProGrammar on how the solution to the query was derived. / Science, Faculty of / Computer Science, Department of / Graduate

DLOG is a logic-based data model developed to show how logic-programming can combine contributions of Data Base Management (DBM) and Artificial Intelligence (AI). The DLOG specification includes a language syntax, a proof (or query evaluation) procedure, a description of the language's semantics, and a specification of the relationships between assertions, queries, and application databases. DLOG's data description language is the Horn clause subset of first order logic [Kowalski79, Kowalski81], augmented with descriptive terms and non-Horn integrity constraints. The descriptive terms are motivated by AI representation language ideas, specifically, the descriptive terms of the KRL language [Bobrow77]. A similar facility based on logical descriptions is provided in DLOG. DLOG permits the use of definite and indefinite descriptions of individuals and sets in queries and assertions. The meaning of DLOG's extended language is specified as Horn clauses that describe the relation between the basic language and the extensions. The experimental implementation is a Prolog program derived from that specification. The DLOG implementation relies on an extension to the standard Prolog proof procedure. This includes a "unification" procedure that matches embedded terms by recursively invoking the DLOG proof procedure (cf. LOGLISP [Robinson82]). The experimental system includes Prolog implementations of traditional database facilities (e.g., transactions, integrity constraints, data dictionaries, data manipulation language facilities), and an idea for using logic as the basis for heuristic interpretation of queries. This heuristic uses a notion of partial, match or sub-proof to produce assumptions under which plausible query answers can be derived. The experimental DLOG knowledge base management system is exercised by describing an undergraduate degree program. The example application is a description of the Bachelor of Computer Science degree requirements at The University of British Columbia. This application demonstrates how DLOG's descriptive terms provide a concise description of degree program knowledge, and how that knowledge is used to specify student programs and select program options. / Science, Faculty of / Computer Science, Department of / Graduate