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]
@inproceedings{GanzingerM01,
title = {A New Meta-complexity Theorem for Bottom-Up Logic Programs},
author = {Harald Ganzinger and David A. McAllester},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2083/20830514.htm},
tags = {meta programming, meta-model, logic programming, logic, Meta-Environment, meta-objects},
researchr = {https://researchr.org/publication/GanzingerM01},
cites = {0},
citedby = {0},
pages = {514-528},
booktitle = {Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings},
editor = {Rajeev Goré and Alexander Leitsch and Tobias Nipkow},
volume = {2083},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42254-4},
}