Retrieval System and Dynamic Algorithm Looking for Axioms of Notions Defined by Programs

Article type: Research Article

Authors: Biela, Andrzej

Affiliations: Department of Mathematics, University of Silesia, PL-40-007, Katowice Poland

Abstract: In this paper we shall introduce a formal system of algorithmic logic which enables us to formulate some problems connected with a retrieval system which provides a comprehensive tool in automated theorem proving of theorems consisting of programs, procedures and functions. The procedures and functions may occur in considered theorems while the program of the above mentioned system is being executed. We can get an answer whether some relations defined by programs hold and we can prove functional equations in a dynamic way by looking for a special set of axioms /assumptions/ during the execution of system. We formulate RS-algorithm which enables us to construct the set of axioms for proving some properties of functions and relations defined by programs. By RS-algorithm we get the dynamic process of proving functional equations and we can answer the question whether some relations defined by programs hold. It enables us to solve some problems concerning the correctness of programs. This system can be used for giving an expert appraisement. We shall provide the major structures and a sketch of an implementation of the above formal system.

Keywords: algorithmic logic, diagram, procedures, RS-algorithm, implementation, experimental results

DOI: 10.3233/FI-1993-193-404

Journal: Fundamenta Informaticae, vol. 19, no. 3-4, pp. 275-301, 1993