A New Meta-Complexity Theorem for Bottom-up Logic Programs (2001)

by Harald Ganzinger , David Mcallester
Venue:In Proceedings of the International Joint Conference on Automated Reasoning, Lecture Notes in Computer Science
Citations:30 - 2 self