Bottom-Up Deduction with Deletion and Priorities

  • Harald Ganzinger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2053)


McAllester [1] has recently shown that the running time of a bottom-up logic program can be bounded by the number of “prefixfir ings” of its inference rules. This theorem allows one to view a logic program as an algorithm whose running time is given by the number of prefixfir ings of the rules. Although pure logic programs under prefixfir ing running time are adequate for many algorithms, many other algorithms seem to lie outside of this framework.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Harald Ganzinger
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations