Stan Raatz

According to our database1, Stan Raatz authored at least 12 papers between 1985 and 1993.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1993
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.
J. ACM, 1993

1992
Theorem Proving Using Equational Matings and Rigid E-Unification.
J. ACM, 1992

1989
Extending SLD Resolution to Equational Horn Clauses using E-Unification.
J. Log. Program., 1989

Induction in an Abstraction Space: A Form of Constructive Induction.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Error Correction in Constructive Induction.
Proceedings of the Sixth International Workshop on Machine Learning (ML 1989), 1989

1988
A Relational Semantics for Logic Programming.
Proceedings of the Logic Programming, 1988

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
Hornlog: A Graph-Based Interpreter for General Horn Clauses.
J. Log. Program., 1987

Patterns of interaction in rule-based expert system programming.
Comput. Intell., 1987

Theorem Proving Using Rigid E-Unification Equational Matings
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986
SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification.
Proceedings of the 1986 Symposium on Logic Programming, 1986

1985
Logic Programming and Graph Rewriting.
Proceedings of the 1985 Symposium on Logic Programming, 1985


  Loading...