Skip to main content
SpringerLink
Log in

Towards Synthesis of Nearly Pure Prolog Programs

  • Conference paper
Logic Program Synthesis and Transformation

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

In [4] the Interactive Debugging System (IDS), a system for debugging pure Prolog programs, is decsribed. In IDS, a program being debugged, an example (either positive or negative), and metaknowledge about procedures are used as input. A refinement operator then uses breadth first search beginning with the most general clause. IDS can also build new clauses by inductive inference. The following operators for generalization/specialization are used: adding/removing subgoals, instantiating variables and unifying two terms.

The author would like to thank ALP and the organising commitee of LOPSTR 91, namely Kung-Kiu Lau and Tim Clement, for the opportunity to take part in this wonderful workshop, and all the participants for their help and patience.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Huntbach M. An improved version of Shapiro’s model inference system. Proc. 3rd Int.Conf. on Logic Programming London 1986, LNCS 225, pp. 180-187.

    Google Scholar 

  2. Nadjm-Tehrani S. Contributions to the Declarative Approach to Debugging Prolog Programs. Linkoeping Studies in Science and Technology, Thesis No. 187, Dept. of Computer and Information Science, Linkoeping University, 1989.

    Google Scholar 

  3. Popelinsky L. Inductive Inference of Nearly Pure Prolog Programs. Technical report, Dept. of Comp. Sci., Masaryk University of Brno, 1991.

    Google Scholar 

  4. Shapiro, E.: Algorithmic Program Debugging. The MIT Press, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Masaryk University of Brno and Brno Machine Learning Group, Burešova 20, 601 77, Brno, Czechoslovakia

    Luboš Popelinský

Authors
  1. Luboš Popelinský
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9PL, UK

    Timothy Paul Clement MA, DPhil  & Kung-Kiu Lau BSc, PhD  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag London

About this paper

Cite this paper

Popelinský, L. (1992). Towards Synthesis of Nearly Pure Prolog Programs. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3494-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3494-7_7

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19742-3

  • Online ISBN: 978-1-4471-3494-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation