Stan Raatz (Selection)

Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

12		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): 1-16 (1993)
11		Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder: Theorem Proving Using Equational Matings and Rigid E-Unification. J. ACM 39(2): 377-429 (1992)
8		Jean H. Gallier, Stan Raatz: Extending SLD Resolution to Equational Horn Clauses using E-Unification. J. Log. Program. 6(1&2): 3-43 (1989)
7		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: 182-196
6		Stan Raatz, Jean H. Gallier: A Relational Semantics for Logic Programming. ICLP/SLP 1988: 1024-1035
5		Jean H. Gallier, Stan Raatz, Wayne Snyder: Theorem Proving Using Rigid E-Unification Equational Matings LICS 1987: 338-346
3		Jean H. Gallier, Stan Raatz: Hornlog: A Graph-Based Interpreter for General Horn Clauses. J. Log. Program. 4(2): 119-155 (1987)
2		Jean H. Gallier, Stan Raatz: SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. SLP 1986: 168-179
1		Jean H. Gallier, Stan Raatz: Logic Programming and Graph Rewriting. SLP 1985: 208-219

Selection of 9 from 12 records - Stan Raatz has 7 coauthors