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. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Ganzinger, H., & McAllester, D. (2001). A new meta-complexity theorem for bottom-up logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2083 LNAI, pp. 514–528). Springer Verlag. https://doi.org/10.1007/3-540-45744-5_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
