Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
# | Year | Author(s) [non member] | Editor(s) [non member] | Title | Type | |||||
---|---|---|---|---|---|---|---|---|---|---|
1 |
| |||||||||
1 |
| |||||||||
2 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
2 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
3 |
| |||||||||
1 |
| |||||||||
2 |
| |||||||||
1 |
| |||||||||
2 |
| |||||||||
1 |
| |||||||||
6 |
| |||||||||
2001 | de Nivelle, Hans [Pratt-Hartmann, Ian] | [Goré, Rajeev] [Leitsch, Alexander] [Nipkow, Tobias] | A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality In: Automated reasoning : First International Joint Conference, IJCAR 2001, 211-225 | Proceedings Article | ||||||
2001 | Ganzinger, Harald [McAllester, David] | [Goré, Rajeev] [Leitsch, Alexander] [Nipkow, Tobias] | 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] | [Goré, Rajeev] [Leitsch, Alexander] [Nipkow, Tobias] | Context trees In: Automated reasoning : First International Joint Conference, IJCAR 2001, 242-256 | Proceedings Article | ||||||
2001 | [Nieuwenhuis, Robert] Hillenbrand, Thomas [Riazanov, Alexandre] [Voronkov, Andrei] | [Goré, Rajeev] [Leitsch, Alexander] [Nipkow, Tobias] | On the Evaluation of Indexing Techniques for Theorem Proving In: Automated reasoning : First International Joint Conference, IJCAR 2001, 257-271 | Proceedings Article | ||||||
2001 | Waldmann, Uwe | [Goré, Rajeev] [Leitsch, Alexander] [Nipkow, Tobias] | Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract) In: Automated reasoning : First International Joint Conference, IJCAR 2001, 226-241 | Proceedings Article | ||||||
1993 | [Bachmair, Leo] Ganzinger, Harald Waldmann, Uwe | [Gottlob, Georg] [Leitsch, Alexander] [Mundici, Daniele] | 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 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
1 |
| |||||||||
2 |
|