Skip to main content
SpringerLink
Log in

A New Meta-Complexity Theorem for Bottom-Up Logic Programs

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2001)

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

Included in the following conference series:

Abstract

Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper gives a new meta-complexity theorem for bottom-up logic programs that is both more general and more accurate than previous such theorems. The new theorem applies to algorithms not handled by previous meta-complexity theorems, greatly facilitating their analysis.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Cardelli. A Theory of Objects. Springer, New York, Berlin, Heidelberg, 1996.

    Book  MATH  Google Scholar 

  2. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. Logic and Computation, 4(3):217–247, 1994. Revised version of Research Report MPI-I-91-208, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  3. Leo Bachmair and Ashish Tiwari. Abstract congruence closure and specializations. In David McAllester, editor, Automated Deduction-CADE-17, 17th International Conference on Automated Deduction, LNAI 1831, pages 64–78, Pittsburgh, PA, USA, June 17-20, 2000. Springer-Verlag.

    Google Scholar 

  4. William F. Dowling and Jean H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming, 3:267–284, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  5. P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpressions problem. J. Association for Computing Machinery, 27(4):771–785, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  6. H. Ganzinger. Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems. In Proc. 16th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 2001. To appear.

    Google Scholar 

  7. R. Givan and D. McAllester. New results on local inference relations. In Principles of Knowledge Representation and reasoning: Proceedings of the Third International Conference (KR’92), pages 403–412. Morgan Kaufmann Press, 1992.

    Google Scholar 

  8. F. Henglein. Breaking through the n3 barrier: Faster object type inference. Theory and Practice of Object Systems, 5(1):57–72, 1999. A preliminary version appeared in FOOL4.

    Article  Google Scholar 

  9. D. McAllester. Automatic recognition of tractability in inference relations. J. Association for Computing Machinery, 40(2):284–303, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  10. David McAllester. On the complexity analysis of static analyses. In A. Cortesi and R. Filé, editors, Static Analysis — 6th International Symposium, SAS’99, LNCS 1694, pages 312–329, Venice, Italy, September 1999. Springer-Verlag.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MPI Informatik, D-66123, Saarbrücken, Germany

    Harald Ganzinger

  2. AT&T Labs-Research, Florham Park, NJ, 07932, USA

    David Mc Allester

Authors
  1. Harald Ganzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Mc Allester
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Favoritenstr. 9, E185-2, 1040, Wien, Austria

    Alexander Leitsch

  3. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganzinger, H., Mc Allester, D. (2001). A New Meta-Complexity Theorem for Bottom-Up Logic Programs. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-45744-5_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45744-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation