Skip to main content
SpringerLink
Log in

Relating logic programs via program maps

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Sterling and R. Beer, Meta-interpreters for expert systems, J. Logic Progr. 6(1989)163–178.

    Google Scholar 

  2. A. Lakhotia and L. Sterling, A method for incremental programming,Proc. Skokie Conf. on Software Engineering, Skokie, IL, (June 1990).

  3. A.J. Power and L. Sterling, A notion of map between logic programs,Proc. 7th Int. Conf. on Logic Programming, ed. D.H.D. Warren and P. Szeredi (MIT Press, 1990) pp. 390–404.

  4. J.W. Lloyd,Foundations of Logic Programming (Springer, 1984).

  5. M. Kirschenbaum and L. Sterling, Refinement strategies for inductive learning of simple Prolog programs,Proc. 12th IJCAI, Australia (1991).

  6. L. Sterling and A. Lakhotia, Composing Prolog meta-interpreters,Proc. 5th Int. Conf. on Logic Programming, ed. K. Bowen and R. Kowalski (MIT Press, 1988) pp. 386–403.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Science, and Center for Automation and Intelligent Systems Research, Case Western Reserve University, 44106, Cleveland, OH, USA

    Marc Kirschenbaum, Leon Sterling & Ashish Jain

  2. Mathematics and Computer Science Department, John Carroll University, 44118, Cleveland, OH, USA

    Marc Kirschenbaum

Authors
  1. Marc Kirschenbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leon Sterling
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ashish Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kirschenbaum, M., Sterling, L. & Jain, A. Relating logic programs via program maps. Ann Math Artif Intell 8, 229–245 (1993). https://doi.org/10.1007/BF01530791

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01530791

Keywords

Search

Navigation