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

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.

• Type: Conference
• Year: 2001
• Where: CADE
• Authors: Harald Ganzinger, David A. McAllester
• Keywords: Automated Reasoning, Bottom-up Logic Programs, CADE 2001, Nontrivial Meta-complexity Theorems