Skip to main content
SpringerLink
Log in

An incremental approach to automatic algorithm design

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

This paper presents an incremental approach to automatic algorithm design, which can be described by algebraic specifications precisely and conveniently. The definitions of selection operator and extension operator which can be defined by strategy relations and transformations are given in order to model the process of finding the solution of a problem. Also discussed is its object-oriented implementation. The functional specification and the design specification for an algorithm are given in one framework so that the correctness of the algorithm can be easily proved.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Smith D R. Automating the Design of Algorithms. LNCS 755, Springer-Verlag, 1993, pp.324–354.

  2. Smith D R. Toward a Classification Approach to Design. LNCS 1101, Springer-Verlag, 1996, pp.62–84.

  3. Helman P. An Algebra for Search Problems and Their Solution. InSearch in Artificial Intelligence, Kanal L, Kumar V'eds, (eds.), Springer-Verlag, 1988, pp.28–90.

  4. Lowry, M. R., Algorithm synthesis through problem reformulation. InProceedings of the 1987 National Conference on Artificial Intelligence, 1987, pp.432–436.

  5. Robert D. McCartney. Synthesizing Algorithms with Performance Constraints. InProceedings of the 1987 National Conference on Artificial Intelligence, 1987, pp.149–154.

  6. Ehrig H, Kreowski H J, Mahr B, Padawitz P. Algebraic implementation of abstract data types.Theoretical Computer Science, 1982, 20(3): 209–263.

    Article  MATH  Google Scholar 

  7. Tello E R. Object-oriented programming for artificial intelligence. Berlin: Springer-Verlag, 1989.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Beijing University of Aeronautics and Astronautics, 100083, Beijing, P.R. China

    Luan Shangmin & Li Wei

Authors
  1. Luan Shangmin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is supported by the National Natural Science Foundation of China.

LUAN Shangmin received his B.S. degree in mathematics from Shangdong Institute of Mining Technology in 1990, and his M.S. and Ph.D. degrees in computer science from Shangdong University in 1993 and from Beijing University of Aeronautics and Astronautics in 1999, respectively. His research interests include automatic algorithm design, belief revision, formal specification.

LI Wei received his B.S. degree in mathematics from Peking University in 1966 and obtained his Ph.D. degree in computer science from The University of Edinburgh in 1983. Since 1986, he has been a Professor in computer science at Beijing University of Aeronautics and Astronautics. He has published more than 90 papers concerning the areas of concurrent programming languages, operational semantics, type theories, and logical foundation of artificial intelligence.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luan, S., Li, W. An incremental approach to automatic algorithm design. J. Comput. Sci. & Technol. 14, 314–319 (1999). https://doi.org/10.1007/BF02948733

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation