Logic Programming and Graph Rewriting. - Jean H. Gallier; Stan Raatz (SLP, 1985)

SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. - Jean H. Gallier; Stan Raatz (SLP, 1986)

Theorem Proving Using Rigid E-Unification Equational Matings - Jean H. Gallier; Stan Raatz; Wayne Snyder (LICS, 1987)

Patterns of interaction in rule-based expert system programming. - Stan Raatz; George Drastal (Comput. Intell., 1987)

Hornlog: A Graph-Based Interpreter for General Horn Clauses. - Jean H. Gallier; Stan Raatz (J. Log. Program., 1987)

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. - Jean H. Gallier; Paliath Narendran; David A. Plaisted; Stan Raatz; Wayne Snyder (CADE, 1988)

A Relational Semantics for Logic Programming. - Stan Raatz; Jean H. Gallier (ICLP/SLP, 1988)

Error Correction in Constructive Induction. - George Drastal; Regine Meunier; Stan Raatz (ML, 1989)

Induction in an Abstraction Space: A Form of Constructive Induction. - George Drastal; Gabor Czako; Stan Raatz (IJCAI, 1989)

Extending SLD Resolution to Equational Horn Clauses using E-Unification. - Jean H. Gallier; Stan Raatz (J. Log. Program., 1989)

Theorem Proving Using Equational Matings and Rigid E-Unification. - Jean H. Gallier; Paliath Narendran; Stan Raatz; Wayne Snyder (J. ACM, 1992)

An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. - Jean H. Gallier; Paliath Narendran; David A. Plaisted; Stan Raatz; Wayne Snyder (J. ACM, 1993)