Accession Number : ADP003036

Title :   Experimental Logic and the Automatic Analysis of Algorithms,

Corporate Author : TEXAS UNIV AT AUSTIN DEPT OF COMPUTER SCIENCES

Personal Author(s) : Brown,F. M.

Report Date : 31 JAN 1984

Pagination or Media Count : 65

Abstract : Experimental Logic can be viewed as a branch of logic dealing with the actual construction of useful deductive systems and their application to various scientific disciplines. In a sense it is a reversion of the study of logic back to its original purpose, before the study of logic became merely the metamathematical study of artificial language systems. This paper describes an experimental logic called Quantified Computational Logic (i.e., QCL) and a automatic theorem prover called the SYMbolic EVALuator (i.e., SYMEVAL) which automatically makes deductions in the QCL language. This logic is being applied to solving problems in several areas of computer science such as automatic complexity analysis of computer programs, automatic verification of the correctness of computer programs, automatic natural language analysis, and as a model for advanced language design. (Author)

Descriptors :   *Computer logic, *Programming languages, Problem solving, Algorithms, Systems analysis, Automatic, Theorems

Distribution Statement : APPROVED FOR PUBLIC RELEASE