Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Logic

CL 2000: Computational Logic — CL 2000 pp 116–130Cite as

Binary Speed Up for Logic Programs

  • Conference paper
  • First Online:

  • 589 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1861))

Abstract

Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained by this way are less efficient than the original programs. Demoen [2] showed an interesting example of a logic program whose computational behavior was improved if it was transformed to a binary program and then specialized by partial deduction.

The class of so called B-stratifiable logic programs is defined. It is shown that for every B-stratifiable logic program, binarization and subsequent partial deduction produce a binary program which usually has a better computational behavior than the original one. Both binarization and partial deduction can be automated.

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. R. Apt, From Logic Programming to Prolog, Prentice Hall International, NJ 1996

    Google Scholar 

  2. B. Demoen, On the Transformation of a Prolog Program to a More Efficient Binary Program, in: Logic Program Synthesis and Transformation 1992, Kung-Kiu Lau and Tim Clement (editors), Lecture Notes in Computer Science Vol. Springer-Verlag 1993 pp. 242–252

    Google Scholar 

  3. D. De Schreye, R. Gluck, J. Jorgensen, M. Leuschel, B. Martens, M. H. Sorensen, Conjunctive partial deduction: foundations, control, algorithms and experiments, The Journal of Logic Programming 41 (1999), 231–277

    Article  MATH  Google Scholar 

  4. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative Modeling of the Operational Behavior of Logic Languages, Theoretical Sci. 69(3):289–318 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Leuschel, Dozen Problems for Partial Deduction (A Set of Benchmarks) http://www.ecs.soton.ac.uk/~mal/systems/dppd/

  6. M. Leuschel, M. H. Sorensen, Redundant Arguments Filtering of Logic Programs, in John Gallagher (ed.), Logic Programm Synthesis and Transformation, Proceedings of the 6th International Workshop, LOPSTR’96, LCNS 1207, 83–103, Stockholm, 1996.

    Google Scholar 

  7. J. W. Lloyd and J. C. Shepherdson, Partial Evaluation in Logic Programming, J. Logic Programming 11 (1991), 217–242

    Article  MathSciNet  MATH  Google Scholar 

  8. M. J. Maher, Equivalences of Logic Programs, in: Proc. Third Int. Conference on Logic Programming, London 1986, E. Shapiro (editor), Lecture Notes in Sci. Vol 225, Springer-Verlag, Berlin 1986, pp. 410–424

    Google Scholar 

  9. U. W. Neumerkel, Specialization of Prolog Programs with Partially Static Goals and Binarization, PhD Thesis, Technical University, Wien, 1993

    Google Scholar 

  10. M. Proietti, A. Pettorossi, Tranformation of logic programs: Foundations and Techniques, Journal of Logic Programming, 19, 20:261–320, 1994

    Article  MathSciNet  Google Scholar 

  11. M. Proietti, A. Pettorossi, Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs, Theoretical Computer Science 142 (1995), 98–124

    Article  MathSciNet  Google Scholar 

  12. A. Pettorossi, M. Proietti, Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs, Tech. Rep. 457, Dipartimento di Informatica, Sistemi e Produzione, Universita di Roma, Tor Vergata, Giugno 1997

    Google Scholar 

  13. D. Sahlin, An Automatic Partial Evaluator for Full Prolog, PhD Dissertation, The Royal Institute of Technology, Dept. of Telecommunication and Computer Science, Stockholm, March 1991

    Google Scholar 

  14. T. Sato, H. Tamaki, Unfold/Fold Transformation of Logic Programs in: Proc. of the 2nd Int. Logic Programming Conference, Uppsala 1984, S. Å. Tärnlund (editor), pp. 127–138

    Google Scholar 

  15. T. Sato, H. Tamaki, Existential Continuation, New Generation Computing 6 (1989), 421–438

    MATH  Google Scholar 

  16. J. Šebelík and P. Štěpánek, Horn Clause Programs for Recursive Functions, in: Logic Programming, K. J. Clark and S. Å. Tärnlund (editors), ACADEMIC PRESS, London 1982, pp. 325–240

    Google Scholar 

  17. O. Štěpánková and P. Štěpánek, Stratification of Definite Clause Programs and of General Logic Programs, in: Proc. CSL’ 89, Third Workshop on Computer Science Logic, Kaiserslautern, Germany, 1989, Lect. Notes in Sci. Vol 440, Springer-Verlag, Berlin 1989, pp. 396–408

    Google Scholar 

  18. P. Tarau, A Continuation Passing Style Prolog Engine, Lecture Notes in Computer Science, Vol. 631, pp. 479–480, Springer-Verlag, Berlin 1992

    Google Scholar 

  19. P. Tarau and M. Boyer, Elementary Logic Programs, in: Proc. PLILP’90, P. Deransart and J. Maluzsyński (editors), Lecture Notes in Sci. Vol. Springer-Verlag, Berlin 1990, pp. 159–173

    Google Scholar 

  20. S. Å. Tärnlund, Horn Clause Computability, BIT 17 (1977), 215–226

    Article  MATH  Google Scholar 

  21. K. Ueda, Making Exhaustive Search Programs Deterministic, New Generation Computing 5 (1987), 317–326

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Computer Science, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    Jan Hrůza & Petr Štěánek

Authors
  1. Jan Hrůza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Štěánek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Australian National University, Australia

    John Lloyd

  2. Simon Fraser University, Canada

    Veronica Dahl

  3. Universität Koblenz, Germany

    Ulrich Furbach

  4. The University of Birmingham, UK

    Manfred Kerber

  5. University of Manchester, UK

    Kung-Kiu Lau

  6. The Pennsylvania State University, USA

    Catuscia Palamidessi

  7. Universidade Nova de Lisboa, Portugal

    Luís Moniz Pereira

  8. The Hebrew University of Jerusalem, Israel

    Yehoshua Sagiv

  9. The University of Melbourne, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hrůza, J., Štěánek, P. (2000). Binary Speed Up for Logic Programs. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_8

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

  • Online ISBN: 978-3-540-44957-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation