The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stan Raatz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean H. Gallier, Stan Raatz
    Logic Programming and Graph Rewriting. [Citation Graph (1, 0)][DBLP]
    SLP, 1985, pp:208-219 [Conf]
  2. Jean H. Gallier, Stan Raatz
    Hornlog: A Graph-Based Interpreter for General Horn Clauses. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1987, v:4, n:2, pp:119-155 [Journal]
  3. Jean H. Gallier, Stan Raatz
    Extending SLD Resolution to Equational Horn Clauses using E-Unification. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1989, v:6, n:1&2, pp:3-43 [Journal]
  4. 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. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:182-196 [Conf]
  5. Stan Raatz, Jean H. Gallier
    A Relational Semantics for Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP/SLP, 1988, pp:1024-1035 [Conf]
  6. George Drastal, Regine Meunier, Stan Raatz
    Error Correction in Constructive Induction. [Citation Graph (0, 0)][DBLP]
    ML, 1989, pp:81-83 [Conf]
  7. George Drastal, Gabor Czako, Stan Raatz
    Induction in an Abstraction Space: A Form of Constructive Induction. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:708-712 [Conf]
  8. Jean H. Gallier, Stan Raatz, Wayne Snyder
    Theorem Proving Using Rigid E-Unification Equational Matings [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:338-346 [Conf]
  9. Jean H. Gallier, Stan Raatz
    SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. [Citation Graph (0, 0)][DBLP]
    SLP, 1986, pp:168-179 [Conf]
  10. Stan Raatz, George Drastal
    Patterns of interaction in rule-based expert system programming. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1987, v:3, n:, pp:107-116 [Journal]
  11. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:1, pp:1-16 [Journal]
  12. Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder
    Theorem Proving Using Equational Matings and Rigid E-Unification. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:2, pp:377-429 [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002