![]() | ![]() |
2000 | ||
---|---|---|
11 | Elmar Eder: The Cut Role in Theorem Proving. Intellectics and Computational Logic 2000: 101-123 | |
1997 | ||
10 | EE | Wolfgang Bibel, Elmar Eder: Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. J. ACM 44(2): 320-344 (1997) |
1996 | ||
9 | Elmar Eder: Backward Reasoning in Systems with Cut. AISMC 1996: 339-353 | |
1991 | ||
8 | Elmar Eder: Consolution and its Relation with Resolution. IJCAI 1991: 132-136 | |
1990 | ||
7 | Elmar Eder, Yan Liu: Rule-Based Mechanism for Constraint Checking in Logic Programs. AIMSA 1990: 149-158 | |
1988 | ||
6 | Elmar Eder: A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods. CSL 1988: 80-98 | |
1986 | ||
5 | Stefan Bayerl, Elmar Eder, Franz J. Kurfess, Reinhold Letz, Johann Schumann: An Implementation of a PROLOG-like Theorem Prover based on the Connection Method. AIMSA 1986: 29-36 | |
1985 | ||
4 | Elmar Eder: Properties of Substitutions and Unifications. J. Symb. Comput. 1(1): 31-46 (1985) | |
1984 | ||
3 | Elmar Eder: An Implementation of a Theorem Prover Based on the Connection Method. AIMSA 1984: 121-128 | |
1983 | ||
2 | Elmar Eder: Properties of Substitutions and Unifications. GWAI 1983: 197-206 | |
1 | Wolfgang Bibel, Elmar Eder, Bertram Fronhöfer: Towards an Advanced Implementation of the Connection Method. IJCAI 1983: 920-922 |
1 | Stefan Bayerl | [5] |
2 | Wolfgang Bibel | [1] [10] |
3 | Bertram Fronhöfer | [1] |
4 | Franz J. Kurfess | [5] |
5 | Reinhold Letz | [5] |
6 | Yan Liu (Yan (Jenny) Liu) | [7] |
7 | Johann Schumann | [5] |