Elmar Eder

According to our database1, Elmar Eder authored at least 12 papers between 1983 and 2000.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2000
The Cut Role in Theorem Proving.
Proceedings of the Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday), 2000

1997
Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution.
J. ACM, 1997

1996
Backward Reasoning in Systems with Cut.
Proceedings of the Artificial Intelligence and Symbolic Mathematical Computation, 1996

1992
Die Rolle der mathematischen Logik in der Künstlichen Intelligenz.
Proceedings of the Künstliche Intelligenz, 1992

Relative complexities of first order calculi.
Artificial intelligence = Künstliche Intelligenz, Vieweg, ISBN: 978-3-528-05122-8, 1992

1991
Consolution and its Relation with Resolution.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1990
Rule-Based Mechanism for Constraint Checking in Logic Programs.
Proceedings of the Artificial Intelligence IV: Methodology, Systems, Applications, 1990

1988
A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods.
Proceedings of the CSL '88, 1988

1986
An Implementation of a PROLOG-like Theorem Prover based on the Connection Method.
Proceedings of the Artificial Intelligence II: Methodology, Systems, Applications, 1986

1985
Properties of Substitutions and Unifications.
J. Symb. Comput., 1985

1984
An Implementation of a Theorem Prover Based on the Connection Method.
Proceedings of the Artificial Intelligence: Methodology, Systems, Applications, 1984

1983
Towards an Advanced Implementation of the Connection Method.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983


  Loading...