A new meta-complexity theorem for bottom-up logic programs

DOI10.1007/3-540-45744-5_44MaRDI QIDQ4539638zbMATH OpenFDO

Authors Harald Ganzinger, David Allen McAllester

Publication date 10 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2083/20830514

Mathematics Subject Classification ID

Logic programming (68N17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Meta-complexity theorems: Talk abstract
• On the complexity analysis of static analyses
• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities
• On meta complexity of propositional formulas and propositional proofs
• scientific article; zbMATH DE number 4110071

Cited in

(4)

• On the complexity analysis of static analyses
• Meta-complexity theorems: Talk abstract
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• As time goes by. II: More automatic complexity analysis of concurrent rule programs

This page was built for publication: A new meta-complexity theorem for bottom-up logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539638)