Relating logic programs via program maps |
| |
Authors: | Marc Kirschenbaum Leon Sterling Ashish Jain |
| |
Affiliation: | (1) Department of Computer Engineering and Science, and Center for Automation and Intelligent Systems Research, Case Western Reserve University, 44106 Cleveland, OH, USA;(2) Mathematics and Computer Science Department, John Carroll University, 44118 Cleveland, OH, USA |
| |
Abstract: | This paper presents a mathematical theory underlying a systematic method for constructingProlog programs calledstepwise enhancement. Stepwise enhancement dictates building a program starting with askeleton program which constitutes the basic control flow for the problem to be solved, and adding extra computations to the skeleton program by using well-understood programming techniques. Each extra computation can be developed independently, and the separate enhancements combined to produce the final program. While intuition and motivation have focused onProlog, the methods are applicable to logic programming languages more generally. The central concept in our mathematical theory for stepwise enhancement is that of a program map between two logic programs. Our definition of a program map from an enhancement to its skeleton guarantees the lifting of computations, the essence of the enhancement methodology. In this paper, we give definitions of program map and extensions, show that the definitions preserve the property of computations lifting, give examples of extensions and programming techniques which generate them, and point to directions for future work. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|