Logic Programming problems and 'benchmarks'

Article View: comp.lang.prolog

Article #2011

#2011

From: Raghu Toppur
Date: Mon, 08 Apr 1991 14:37

18 lines
1111 bytes


	I am working on an FCP-like implementation and I am looking for
	a set of programs (and classic problems) which can provide a basis for
	performance evaluation.

	Do there exist 'benchmarks' for Prolog, FCP, PARLOG or GHC ?

	Any input regarding standard problems for implementation will be 
	greatly appreciated . Dining Philosophers, Readers and Writers, Quicksort...
	any others ? I am interested in both uniprocessor as well as multiprocessor
	implementations.

	thanks,
	Raghu Toppur					e-mail : raghtp@hubcap.clemson.edu
											 Dept of Comp Sc,
											 Clemson University, Clemson,
											 SC 29631.

Technical Details

Message-ID: <1991Apr8.143706.24402@hubcap.clemson.edu>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!samsung!sdd.hp.com!spool.mu.edu!uwm.edu!psuvax1!rutgers!gatech!hubcap!raghutp

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!samsung!sdd.hp.com!spool.mu.edu!uwm.edu!psuvax1!rutgers!gatech!hubcap!raghutp
From: raghutp@hubcap.clemson.edu (Raghu Toppur)
Newsgroups: comp.lang.prolog
Subject: Logic Programming problems and 'benchmarks'
Keywords: classic problems, Prolog and FCP programs
Message-ID: <1991Apr8.143706.24402@hubcap.clemson.edu>
Date: 8 Apr 91 14:37:06 GMT
Organization: Clemson University
Lines: 18