Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CADE
2001
Springer

favoriteEmaildiscussreport

106views Logical Reasoning» more CADE 2001»

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

14 years 5 months ago

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

Download domino.mpi-inf.mpg.de

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.

Harald Ganzinger, David A. McAllester

Real-time Traffic

Automated Reasoning | Bottom-up Logic Programs | CADE 2001 | Nontrivial Meta-complexity Theorems |

claim paper

Related Content

» Blocking and Other Enhancements for BottomUp Model Generation Methods

» BottomUp Shape Analysis

» Logical Interpretation Static Program Analysis Using Theorem Proving

» Mathematical Programming Embeddings of Logic

» Operational Semantics for DyLPs

» Free theorems in the presence of seq

» An Algebraic Account of Modularity in IDLogic

» A Hidden Herbrand Theorem

» From Proofs to Focused Proofs A Modular Proof of Focalization in Linear Logic

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2001
Where	CADE
Authors	Harald Ganzinger, David A. McAllester

Comments (0)