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

Authors:
Harald Ganzinger;David A. McAllester
Affiliations:
-;-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 7
Cited 16

Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
Breaking through the n3barrier: faster object type

Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
Variations on the Common Subexpression Problem

Journal of the ACM (JACM)
A Theory of Objects

A Theory of Objects
On the Complexity Analysis of Static Analyses

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Abstract Congruence Closure and Specializations

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Relating Semantic and Proof-Theoretic Concepts for Polynomial Time Decidability of Uniform Word Problems

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science

Program optimization using indexed and recursive data structures

PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Automatic Complexity Analysis

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Logical Algorithms

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Monadic concurrent linear logic programming

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
CHR grammars

Theory and Practice of Logic Programming
Optimal union-find in Constraint Handling Rules

Theory and Practice of Logic Programming
Specifying distributed trust management in LolliMon

Proceedings of the 2006 workshop on Programming languages and analysis for security
Linear Logical Algorithms

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Logical algorithms meets chr: A meta-complexity result for constraint handling rules with rule priorities

Theory and Practice of Logic Programming
From datalog rules to efficient programs with time and space guarantees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithmic specifications in linear logic with subexponentials

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
A logical algorithm for ML type inference

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The correspondence between the logical algorithms language and CHR

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Precise complexity analysis for efficient datalog queries

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Identifying polynomial-time recursive functions

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.06

Visualization

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.