Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic Programming Synthesis and Transformation

LOPSTR 1998: Logic-Based Program Synthesis and Transformation pp 143–158Cite as

Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1559))

Abstract

Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic programs from examples. The combinators comprise fold combinators for recursion on lists. The combinator form is distinguished by enabling piecewise composition of semantically meaningful program elements according to the compositional semantics principle. The principle of combining programs from combinators admits induction of programs without appealing to most-specific-generalization and predicate invention in contrast to prevailing ILP approaches. Moreover, the combinator form avoids confusing object and metavariables in the applied metalogic program environment. In addition useful algebraic rewriting rules can be formulated conveniently with the combinators.

Supported by a grant from Volvo Research Foundation, Volvo Educational Foundation and Dr Pehr G. Gyllenhammar’s Research Foundation.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Apt & E. Marchiori: Reasoning About Prolog Programs: From Modes Through Types to Assertions. J. Formal Aspects of Computing, (1994) 6A pp. 743–764.

    Article  Google Scholar 

  2. J. Backus: Can Programming be Liberated from the von Neumann Style ? A Functional Style and Its Algebra of Programs. Comm. of the ACM, 21, 8, 1978. pp. 613–641.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Bird & O. de Moor: Algebra of Programming, Prentice Hall, 1997.

    Google Scholar 

  4. P. Flener: Inductive Logic Program Synthesis with Dialogs. In [12] pp. 175–198.

    Google Scholar 

  5. Gegg-Harrison, T.S.: Representing Logic Program Schemata in λ-Prolog. In L. Sterling(ed.) Procs. Twelfth International Conference on Logic Programming 1995, MIT Press, London, 1995. pp. 467–481.

    Google Scholar 

  6. A. Hamfelt & J. Fischer Nilsson: Inductive Metalogic Programming. In S. Wrobel (ed.) Procs. Fourth International Workshop on Inductive Logic programming (ILP-94), Bad Honnef/Bonn, GMD-Studien Nr. 237, 1994. pp. 85–96.

    Google Scholar 

  7. A. Hamfelt & J. Fischer Nilsson: Declarative Logic Programming with Primitive Recursive Relations on Lists. In M. Maher (ed.) Procs. Joint International Conference and Symposium on Logic Programming 1996, MIT Press, London, 1996, pp. 230–242.

    Google Scholar 

  8. A. Hamfelt & J. Fischer Nilsson: Towards a Logic Programming Methodology Based on Higher-order Predicates. J. New Generation Computing, vol 15, no 4, 1997. pp. 421–448.

    Article  Google Scholar 

  9. A. Hamfelt, J. Fischer Nilsson & A. Vitoria: A Combinatory Form of Pure Logic Programs and its Compositional Semantics. Submitted for publication 1998.

    Google Scholar 

  10. N. Lavrac & S. Dzeroski: Inductive Logic Programming. Ellis Horwood, New York, 1994.

    MATH  Google Scholar 

  11. S. Muggleton(ed.): Inductive Logic Programming. Academic Press, London, 1992.

    MATH  Google Scholar 

  12. S. Muggleton (ed.): Inductive Logic Programming, Proceedings of the 6th International Workshop on Inductive Logic Programming, 1996, Lecture Notes in Artificial Intelligence 1314, Springer, 1996.

    Google Scholar 

  13. S.-H. Nienhuys-Cheng & R. de Wolf: Foundations of Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1228, Springer, 1997.

    Google Scholar 

  14. J. Fischer Nilsson & A. Hamfelt: Constructing Logic Programs with Higher Order Predicates. In M. Alpuente & M. I. Sessa (eds.) Procs. Joint Conference on Declarative Programming 1995 (GULP-PRODE’95), Universita’ Degli Studi di Salerno, Salerno, 1995. pp. 307–312.

    Google Scholar 

  15. A. Petorossi & M. Proietti: Transformation of Logic Programs. In D. M. Gabbay, C. J. Hogger & J. A. Robinson (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press.

    Google Scholar 

  16. W. V. Quine: Predicate-functor Logic. In J. E. Fenstad (ed.) Procs. Second Scandinavian Logic Symposium, North-Holland, 1971. pp. 309–315.

    Google Scholar 

  17. C. Reade: Elements of Functional Programming, Addison-Wesley, 1989.

    Google Scholar 

  18. D. H. D. Warren: Higher-order extensions to PROLOG: are they needed? In D. Michie (ed.) Machine Intelligence 10, Ellis Horwood and Edinburgh University Press, 1982. pp. 441–454.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Science Department, Uppsala University, sweden

    Andreas Hamfelt

  2. Department of Computer Science, Technical University of Denmark, Denmark

    Jørgen Fischer Nilsson

Authors
  1. Andreas Hamfelt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jørgen Fischer Nilsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Science, Uppsala University, Box 311, S-751 05, Uppsala, Sweden

    Pierre Flener

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamfelt, A., Nilsson, J.F. (1999). Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes. In: Flener, P. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 1998. Lecture Notes in Computer Science, vol 1559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48958-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48958-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65765-1

  • Online ISBN: 978-3-540-48958-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation