Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!rutgers!mcnc!unc!bts
From: bts@unc.cs.unc.edu (Bruce Smith)
Newsgroups: comp.ai,comp.lang.prolog,sci.math.symbolic
Subject: Unification benchmarks?
Message-ID: <1362@unc.cs.unc.edu>
Date: Tue, 22-Sep-87 10:12:12 EDT
Article-I.D.: unc.1362
Posted: Tue Sep 22 10:12:12 1987
Date-Received: Thu, 24-Sep-87 04:43:15 EDT
Organization: CS Dept., U. of N. Carolina, Chapel Hill
Lines: 19
Keywords: unification, benchmarks, theorem proving, neat stuff
Xref: mnetor comp.ai:801 comp.lang.prolog:349 sci.math.symbolic:157

Does anyone have a good set of unification problems?  I want to run
simulations of unifications on an architecture being developed here
at UNC, and I'd like a set of "typical" problems. (And, I guess I'd
also like to be able to say I'm not the only one who claims they're
typical.)

A paper by Trum and Winterstein, referenced by Martelli & Montanari,
might have what I'm looking for.  Can anyone supply a copy of

    Trum P. and Winterstein,G. "Description, implementation and
    practical comparison of unification algorithms," Internal Rep.
    6/78, Fachbereich Informatik, Univ. of Kaiserlautern, Germany.

Other references on this topic are welcome, also.  Thanks!
__________________________________
Bruce T. Smith, bts@unc.cs.unc.edu
Dept. of Computer Science
Sitterson Hall/ UNC-CH
Chapel Hill, NC 27514