Stan Raatz

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