A New Meta-complexity Theorem for Bottom-Up Logic Programs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Harald Ganzinger, David A. McAllester. A New Meta-complexity Theorem for Bottom-Up Logic Programs. In Rajeev Goré, Alexander Leitsch, Tobias Nipkow, editors, Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings. Volume 2083 of Lecture Notes in Computer Science, pages 514-528, Springer, 2001. [doi]

This author has not been identified. Look up 'Harald Ganzinger' in GoogleThis author has not been identified. Look up 'David A. McAllester' in Google

runs on WebDSL