Skip to main content
SpringerLink
Log in

Estimating the computational cost of logic programs

  • Invited Talk
  • Conference paper
  • First Online:
Static Analysis (SAS 1994)

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

Included in the following conference series:

Abstract

Information about the computational cost of programs is potentially useful for a variety of purposes, including selecting among different algorithms, guiding program transformations, in granularity control and mapping decisions in parallelizing compilers, and query optimization in deductive databases. Cost analysis of logic programs is complicated by nondeterminism: on the one hand, procedures can return multiple solutions, making it necessary to estimate the number of solutions in order to give nontrivial upper bound cost estimates; on the other hand, the possibility of failure has to be taken into account while estimating lower bounds. Here we discuss techniques to address these problems to some extent.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. A. Bondy, “Bounds for the Chromatic Number of a Graph,” Journal of Combinatorial Theory 7, (1969), pp. 96–98.

    Google Scholar 

  2. S. K. Debray, and D. S. Warren, “Functional Computations in Logic Programs,” ACM Transactions on Programming Languages and Systems 11, 3 (July 1989), pp. 451–481.

    Article  Google Scholar 

  3. S. K. Debray, and N.-W. Lin, “Cost Analysis of Logic Programs”, ACM Transactions on Programming Languages and Systems, vol. 15 no. 5, Nov. 1993, pp. 826–875.

    Article  Google Scholar 

  4. S. K. Debray and N. Lin, “Static Estimation of Query Sizes in Horn Programs,” Proc. Third International Conference on Database Theory, Paris, France, December 1990, pp. 514–528.

    Google Scholar 

  5. S. K. Debray, N.-W. Lin, and M. Hermenegildo, “Task Granularity Analysis in Logic Programs”, Proc. of the 1990 ACM Conf. on Programming Language Design and Implementation, pp. 174–188. ACM Press, June 1990.

    Google Scholar 

  6. S. K. Debray, P. López García, M. Hermenegildo, and N.-W. Lin, “Lower Bound Cost Estimation for Logic Programs”, manuscript, April 1994.

    Google Scholar 

  7. Decorte, D. De Schreye, and M. Fabris, “Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis”, Proc. 1993 International Symposium on Logic Programming, 1993, pp. 420–436. MIT Press.

    Google Scholar 

  8. N.-W. Lin, Automatic Complexity Analysis of Logic Programs, Ph.D. Dissertation, The University of Arizona, 1993.

    Google Scholar 

  9. Ju. V. Matijasevič, “Enumerable Sets are Diophantine”, Doklady Akademii Nauk SSSR, 191 (1970), 279–282 (in Russian; English translation in Soviet Mathematics—Doklady, 11 (1970), 354–357).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Arizona, 85721, Tucson, AZ, USA

    S. K. Debray

  2. Department of Artificial Intelligence, Universidad Politecnica de Madrid, E-28600, Madrid, Spain

    P. López García & M. Hermenegildo

  3. Department of Computer Science and Information Engineering, National Chung Cheng University, 62107, Chiayi, Taiwan, ROC

    N. -W. Lin

Authors
  1. S. K. Debray
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. López García
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Hermenegildo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. N. -W. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Baudouin Le Charlier

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Debray, S.K., García, P.L., Hermenegildo, M., Lin, N.W. (1994). Estimating the computational cost of logic programs. In: Le Charlier, B. (eds) Static Analysis. SAS 1994. Lecture Notes in Computer Science, vol 864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58485-4_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-58485-4_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58485-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation