scientific article; zbMATH DE number 1765697

MaRDI QIDQ4539638zbMATH OpenFDO

Authors Harald Ganzinger, David Allen McAllester

Publication date 10 July 2002

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2080295
• 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

(3)

• On the complexity analysis of static analyses
• scientific article; zbMATH DE number 2080295 (Why is no real title available?)
• A Survey of the Proof-Theoretic Foundations of Logic Programming

This page was built for publication:

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