1 |
| Le Charlier, Baudouin (ed.) |
| |
| | 2001 | Ganzinger, Harald
[McAllester, David] | | A new meta-complexity theorem for bottom-up logic programs
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 514-528 | Proceedings Article | |
| | 2001 | Ganzinger, Harald
[Nieuwenhuis, Robert]
[Nivela, Pilar] | | Context trees
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 242-256 | Proceedings Article | |
| | 2001 | [Nieuwenhuis, Robert]
Hillenbrand, Thomas
[Riazanov, Alexandre]
[Voronkov, Andrei] | | On the Evaluation of Indexing Techniques for Theorem Proving
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 257-271 | Proceedings Article | |
| | 1993 | [Bachmair, Leo]
Ganzinger, Harald
Waldmann, Uwe | | Superposition with simplification as a decision procedure for the monadic class with equality
In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, 83-96 | Proceedings Article | |
1 |
| Lenzerini, Maurizio (ed.) |
| |