Stan Raatz

Publication Activity (10 Years)

Years Active: 1985-1993
Publications (10 Years): 0

Publications

Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. J. ACM 40 (1) (1993)
Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39 (2) (1992)
George Drastal, Gabor Czako, Stan Raatz
Induction in an Abstraction Space: A Form of Constructive Induction. IJCAI (1989)
Jean H. Gallier, Stan Raatz
Extending SLD Resolution to Equational Horn Clauses using E-Unification. J. Log. Program. 6 (1&2) (1989)
George Drastal, Regine Meunier, Stan Raatz
Error Correction in Constructive Induction. ML (1989)
Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. CADE (1988)
Stan Raatz, Jean H. Gallier
A Relational Semantics for Logic Programming. ICLP/SLP (1988)
Stan Raatz, George Drastal
Patterns of interaction in rule-based expert system programming. Comput. Intell. 3 (1987)
Jean H. Gallier, Stan Raatz
Hornlog: A Graph-Based Interpreter for General Horn Clauses. J. Log. Program. 4 (2) (1987)
Jean H. Gallier, Stan Raatz, Wayne Snyder
Theorem Proving Using Rigid E-Unification Equational Matings LICS (1987)
Jean H. Gallier, Stan Raatz
SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. SLP (1986)
Jean H. Gallier, Stan Raatz
Logic Programming and Graph Rewriting. SLP (1985)