Stan Raatz - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

1993

An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial TimeJean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder. JACM, 40(1):1-16, 1993. [doi]

1992

Theorem Proving Using Equational Matings and Rigid E-UnificationJean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder. JACM, 39(2):377-429, 1992. [doi]

1989

Error Correction in Constructive InductionGeorge Drastal, Regine Meunier, Stan Raatz. icml 1989: 81-83

Induction in an Abstraction Space: A Form of Constructive InductionGeorge Drastal, Gabor Czako, Stan Raatz. IJCAI 1989: 708-712

Extending SLD Resolution to Equational Horn Clauses using E-UnificationJean H. Gallier, Stan Raatz. jlp, 6(1&2):3-43, 1989.

1988

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial TimeJean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder. cade 1988: 182-196

A Relational Semantics for Logic ProgrammingStan Raatz, Jean H. Gallier. ICLP 1988: 1024-1035

1987

Theorem Proving Using Rigid E-Unification Equational MatingsJean H. Gallier, Stan Raatz, Wayne Snyder. lics 1987: 338-346

Hornlog: A Graph-Based Interpreter for General Horn ClausesJean H. Gallier, Stan Raatz. jlp, 4(2):119-155, 1987.

Patterns of interaction in rule-based expert system programmingStan Raatz, George Drastal. ci, 3:107-116, 1987.

1986

SLD-Resolution Methods for Horn Clauses with Equality Based on E-UnificationJean H. Gallier, Stan Raatz. SLP 1986: 168-179

1985

Logic Programming and Graph RewritingJean H. Gallier, Stan Raatz. SLP 1985: 208-219

Sign in or sign up to see more results.

runs on WebDSL