Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2000: Principles and Practice of Constraint Programming – CP 2000 pp 13–17Cite as

Meta-complexity Theorems: Talk Abstract

  • Conference paper
  • First Online:

  • 586 Accesses

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

Abstract

A variety of authors have argued that bottom-up logic programs provide a clear presentation of a wide variety of algorithms, e.g.,[6,4,5,2,3]. Recently meta-complexity theorems have been given that allow, in many cases, the running time of a bottom-up logic program to be determined by inspection [1]. This talk abstract presents the fundamental meta-complexity theorem. New meta-compleixty theorems useful for optimization algorithms were presented in the talk.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. David McAllester. The complexity analysis of static analyses. In Symposium on Static Analysis. Springer Verlag, 1999.

    Google Scholar 

  2. Jeff Naughton and Raghu Ramakrishnan. Bottom-up evaluation of logic programs. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. MIT Press, 1991.

    Google Scholar 

  3. Thomas Reps. Demand interprocedural program analysis using logic databases, pages 163–196, 1994.

    Google Scholar 

  4. J. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, 1988.

    Google Scholar 

  5. J. Ullman. Bottom-up beats top-down for datalog. In Proceedings of the Eigth ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems, pages 140–149, March 1989.

    Google Scholar 

  6. M. Vardi. Complexity of relational query languages. In 14th Symposium on Theory of Computation, pages 137–146, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs-Research, 180 Park Ave, Florham Park, NJ, 07932

    David McAllester

Authors
  1. David McAllester
    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 California at Irvine, Irvine, CA, 92697, USA

    Rina Dechter

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

McAllester, D. (2000). Meta-complexity Theorems: Talk Abstract. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45349-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41053-9

  • Online ISBN: 978-3-540-45349-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation