bts@unc.cs.unc.edu (Bruce Smith) (12/12/87)
Here is the latest LIST-OF-PROLOGs. The LIST is intended to help
people who want to learn/teach/use Prolog and people who have Prolog
systems find each other. Public domain, free or almost free systems,
along with those that come with substantial discounts to academic
users are particularly welcome.
Please mail me additions, corrections and updates. Many of entries
are 2 or more years old. I intend to make the LIST FTP-able from UNC
by mid-January, but I'm willing to mail copies (electronically or
hardcopy) to folks who can't get it that way.
____________________________________________________
Bruce T. Smith (bts@cs.unc.edu -or- bts@cs.duke.edu)
Dept. of Computer Science
Sitterson Hall / UNC-Chapel Hill
Chapel Hill, NC 27514
---------------------------------------------------------------------
---------------------------------------------------------------------
NAME: A.D.A. Prolog
VERSION: First release, dated 1985
SRC/MACHINE/OS: C / MSDOS and PCDOS systems
AVAILABILITY: Full version from May 1985; five versions of
increasing complexity available separately;
educational and commercial licenses.
COST: ??
FEATURES:
Incremental compiler, VML virtual memory system and extensions
invisible to user, database access routines, debugging, stream
input, list-based structure sharing, UNIX style modules, incre-
mental garbage collection, Edinburgh-compatible syntax.
CONTACT: Automata Design Associates
1570 Arran Way
Dresker, PA 19025
(215) 335-5400
DATED: June 1985
---------------------------------------------------------------------
NAME: Arity/Prolog
SRC/MACHINE/OS: IBM-PC and compatibles, the compiler is written in
Arity/Prolog
COST: ??
FEATURES:
Interpreter and compiler, with debugger; "string support",
interface to other programming languages, UNIX-style file I/O
and systems functions, text screen management; DCG support;
"more comprehensive" set of primitives
CONTACT: Arity Corporation
358 Baker Avenue
Concord, MA 01742
(617) 371-1243
NOTES:
Arity/Prolog compiler compiles itself in less than one and 1/4
minutes on an AT.
DATED: August 1985
---------------------------------------------------------------------
NAME: Basser Prolog
VERSION: 3
SRC/MACHINE/OS: C/Unix (V7, 4.?BSD & others) also VMS
AVAILABILITY: Educational license, source or binary
COST: A$300 or US$300 or negotiable, VMS version extra
STATUS: running, some development & support
FEATURES:
Fast interpreter, full interface to Unix, Dec-10 debugging
facilities, real arithmetic, backtrackable I/O, good docu-
mentation (user manual & tutorial).
CONTACT: Andrew Taylor (USENET: mulga!basser!andrewt)
Department of Computer Science
Sydney University
Sydney, N.S.W. 2006
Australia
NOTES:
Yet another prolog syntax. Most of the code is clean and readable.
Generally similar to DEC-10 prolog. Basser Prolog has sufficient
"features" to make it a reasonable programming environment and a
useful tool.
DATED: May 1984
-------------------------------------------------------------------------
NAME: BIM-Prolog
VERSION: ?
SRC/MACHINE/OS: VAX and SUN/4.2bsd UNIX
AVAILABILITY: Academic and commercial
COST: Varies; discounts for academic users.
FEATURES:
Compiler/interpreter, algorithmic debugging, external language
interface, graphics and windowing, module concept, partial
evaluation, relational database interface (Unify & Ingres).
CONTACT:
Raf Venken The SHURE Group
Belgian Institute of Management 1514 Pacific Ranch Dr.
Kwikstraat 4 Encinitas, CA 92024
B-3047, Belgium (sun!suntan!bshure)
(02) 759-5925 (619) 944-0320
DATED: June 1985
-------------------------------------------------------------------------
NAME: Blog - a "prolog system" with readable code
SRC/MACHINE/OS: Franz Lisp. Porting should be trivial.
AVAILABILITY:
One page prettyprinted. Also available a 1K (1024 byte) source code
version, including comments, title, user manual and installation
guide (I'll admit, short ones). Two-page user manual also available.
COST:
Free, mail me and I'll try to mail it to you. Distribute freely,
but keep saying it's mine, and (more important) tell me about ports,
enhancements, etc.
FEATURES:
Pure Prolog, so no cut, assert or retract. Lisp syntax. No
special handling of clause names, so variables may appear anywhere
(except one var as body of a clause). Therefore second order logic
possible. No operators but dot. Slow - not written to run but to
let people read the code. Numbers are used to denote internal
variables. Advantage: different vars have different names;
Disadvantage: numbers can neither be used as variables, nor as
constants. No packages, so what would one want to use numbers
for?
CONTACT: J. A. Biep Durieux
(mcvax!cs.vu.nl!biep@seismo.css.gov)
NOTES:
It's really not much more than the famous "tiniest little prolog in
the world".
Support: Try to mail me, I may be in a good mood.
Future: Module compiler and much faster interpreter almost
ready. Perhaps version with cut, or with adequate negation.
DATED: Sept 1987
-------------------------------------------------------------------------
NAME: C-Prolog
VERSION: 1.5
SRC/MACHINE/OS: C/UNIX 4.1/2 BSD, C/VMS
AVAILABILITY: Academic and commercial licenses
COST: 100 pounds, academic
updates (if you have earlier version) 50 pounds
FEATURES:
Interpreter, Prolog-10 compatibility, four port debugger.
CONTACT:
Department of Architecture SRI International
Edinburgh Univeristy 333 Ravenswood Ave.
Forest Hill Rd. Menlo Park, CA 94025
Edinburgh EH1 1GZ
U.K.
(decvax!mcvax!ukc!edcaad!margaret)
DATED: July 1984
-------------------------------------------------------------------------
NAME: Caltech Prolog (tentative)
VERSION: 0.2
SRC/MACHINE/OS: IBM, written in Prolog and 370 assembly
AVAILABILITY: Not being distributed.
FEATURES:
Compiler completely compiles itself, but some normal glue routines
still missing. Speed of about 1 Megalip on an IBM 3090 for naive
reverse.
CONTACT: Mike Newton (newton@vlsi.caltech.edu)
DATED: Oct 1987
-------------------------------------------------------------------------
NAME: GProlog
VERSION: Versions corresponding to C-Prolog versions 1.4 and 1.5
SRC/MACHINE/OS: C with some assembler/Sun 2 and Sun 3/SunOS (4.2 BSD)
AVAILABILITY: Anyone
COST:
Send a magtape and $10 to cover postage and handling. Will store
files in tar format. Specify which version of C-Prolog you are using.
STATUS:
Has been in use for several years, including use in a couple of large
projects.
FEATURES: Adds SunCore graphics predicates to C-Prolog
CONTACT: Barry Brachman {ihnp4!alberta,uw-beaver,seismo}!
Dept. of Computer Science ubc-vision!ubc-cs!brachman
Univ. of British Columbia brachman@cs.ubc.cdn
Vancouver, B.C. V6T 1W5
(604) 228-4327
DATED: August 1987
NOTES:
A few of the SunCore routines are not available to GProlog. The
distribution consists of patches to be applied to the original
C-Prolog 1.4 or 1.5 sources; C-Prolog is *not* included in the
distribution. Will email the 6 page manual in LaTeX form upon
request.
-------------------------------------------------------------------------
NAME: Horne
VERSION: 28
SRC/MACHINE/OS: Common Lisp / Explorer (v2.1) & Symbolics 36xx (v7.1)
AVAILABILITY: anyone, upon signing a license/disclaimer
COST: $150 (academic), TR for $15. Non-academic institutions
are requested to send whatever they can afford over $150
to help defray expenses.
FEATURES:
LISP interface; tracing and debugging; typed theorem proving;
automated reasoning facilities include forward chaining, constraint
posting.
CONTACT:
Admin: (to get tape, TR) Gail Cassell (gail@cs.rochester.edu)
Technical: Brad Miller (miller@cs.rochester.edu)
Author: James Allen (james@cs.rochester.edu)
Computer Science Dept.
River Campus
University of Rochester
Rochester, NY 14627
NOTES:
Some zetalisp code mixed in with Common Lisp, but others have
ported to SUN, IBM, etc. Also included: REP, Knowledge
Representation extensions that allow reasoning about structured
types, classification of objects, etc. Similar in spirit to
KL-1, but internal representation is consistent with Horn clause
notation, allowing for more flexible systems.
DATED: Aug. 1987
---------------------------------------------------------------------
NAME: IC Prolog
VERSION: 0.7 (1979)
SRC/MACHINE/OS: Pascal
AVAILABILITY: no longer supported
FEATURES:
Uses program annotations, data flow coroutining, collectors;
special features for control and data handling for database
applications; extended handling of negation; pseudo-parallelism
annotations enable time-sharing processes on a sequential
machine.
CONTACT: F.G. McCabe
Department of Computing
Imperial College
London SW7 2BU
DATED: June 1985
---------------------------------------------------------------------
NAME: ICL Prolog
VERSION: First release dated 1984
SRC/MACHINE/OS: Pascal / VME on ICL 2900 to intermediate code
AVAILABILITY: Commercial license.
COST: Complete package priced at 400 pounds per quarter,
including functional LISP.
FEATURES:
Compiler; lexical modules for construction of large applications;
incremental garbage collection, tail recursion optimization,
early detection of determinacy, clause indexing, trace and
debugging facilities; large address space, interface to other
languages.
CONTACT: J. W. Doores
International Computers Ltd.
Wenlock Way, West Gorton
Manchester M12 5DR
Tel: 061-223 1301
DATED: June 1985
NOTES:
Improved version to be released soon written in 'C' and Prolog,
for UNIX on Orion and PERQ PNX systems.
---------------------------------------------------------------------
NAME: IF/Prolog
VERSION: ?
SRC/MACHINE/OS: Apple Macintosh; Apollo/UNIX; Data General AOS/VS;
DEC VMS/ULTRIX; IBM-PC/MS-DOS/UNIX; SUN UNIX; etc.
COST: 30% discount to non-commercial research institutions.
FEATURES:
Interpreter, compiler; interfaces to operating system, GKS
(Graphics Kernel System) database (Oracle/Informix/...) and C
functions; emacs editor; full screen box debugger.
CONTACT: InterFace Computer Gmbh.
Garmischer Strasse 4 Phone: (089) 510 86 55
D-8000 Munich 2 karin@ifcom.uucp
Germany
NOTES:
Also offer tutorials/courses and consulting in either English
or German.
DATED: Sept 1987
---------------------------------------------------------------------
NAME: Lambda Prolog
VERSION: 2.6
SRC/MACHINE/OS: C-Prolog 1.5, straightforward conversion to Quintus
AVAILABILITY:
Available by FTP from linc.cis.upenn.edu; log in as anonymous, use
your login id as password; cd pub/lp2.6; retrieve the code in the
subdirectory.
Can mail tar format tapes for those who cannot FTP.
CONTACT:
Dale Miller (dale@linc.cis.upenn.edu)
University of Pennsylvania
or
Gopalan Nadathur (gopalan@cs.duke.edu)
Duke University
FEATURES:
Lambda Prolog extends Prolog by
(1) using typed lambda-terms instead of first-order terms,
(2) permitting quantification over function and predicate variables
(3) performing higher-order unification and lambda-conversion
(4) permitting and interpreting universally quantified goals, and
(5) containing a notion of modules.
This logic programming language provides many of the higher-order
features which are common in functional programming languages. The
availability of higher-order unification, however, gives this
language a certain kind of richness not present in other programming
languages. We illustrate this richness by demonstrating how this
language can be used to provide novel specifications of
(1) theorem provers and proof systems,
(2) program transformation algorithms, and
(3) knowledge representation systems.
DATED: Sept 1987
---------------------------------------------------------------------
NAME: LISPLOG
VERSION: 2
SRC/MACHINE/OS: SYMBOLICS COMMON LISP and FRANZ LISP or COMMON LISP
in UNIX on VAX, APOLLO, SUN, and IBM-RT
AVAILABILITY: Unrestricted.
COST: Still free
FEATURES:
Iterative interpreter and CProlog translator; several LISP/PROLOG
interfaces; varying-length structures; predicate variables;
specialized cut operator and initial-cut tools; zoom-box model;
modules; streams; forward-chaining extensions; micro-UNIXPERT
system.
CONTACT: LISPLOG-Buero, AG Richter
FB Informatik, Univ. Kaiserslautern
Postfach 3049
6750 Kaiserslautern
W. Germany
E-mail: lisplog@uklirb.UUCP
DATED: September 1987
NOTES: Recursive interpreter (version II) also supported.
---------------------------------------------------------------------
NAME: LM-Prolog
SRC/MACHINE/OS: ZetaLisp/LMI Lambda
AVAILABILITY: commercial and non-commercial licenses.
STATUS: Stable.
FEATURES:
Compiles to Zetalisp, interpreter, "4 port" debugger, microcode
support, worlds, indexing, lazy and eager collections,
constraints; Concurrent Prolog interpreter; backtracking Turtle
graphics; interface to Lisp; optional occur check, optional
cyclic structures, mutable arrays, full Lisp machine environment;
DEC-10 Prolog compatibility package.
CONTACT: Mats Carlsson
SICS
PO Box 1263
S-16313 SPANGA, Sweden
mats-c@sics.se
DATED: December 1986
---------------------------------------------------------------------
NAME: The Logic WorkBench
SRC/MACHINE/OS: various 68000 UNIX systems
COST: $6,900
FEATURES:
Edinburgh syntax; compiler, interpreter, interactive debugger,
interface to C; Prolog interface to external database; ability to
store large Prolog databases on disk and use then without
downloading into main memory.
CONTACT: Silogic, Inc.
6420 Wilshire Blvd.
Los Angeles, CA 90048
(213) 653-6470
DATED: June 1985
---------------------------------------------------------------------
NAME: LOGLISP
VERSION: Version 3 (dated 1984)
SRC/MACHINE/OS: UCI Rutgers LISP/DEC 10; Zetalisp/LMI Lambda;
Symbolics 3600.
AVAILABILITY: Commercial, academic and US Government licenses.
COST: $30 to $400, depending on license.
FEATURES:
Interpreter incorporating breadth-first and heuristic search mode
and notion of reducibility; LISP host environment with embedded
logic programming system; uses structure sharing techniques with
reduction; functions in modules; set of new LISP primitives
callable from within LISP programs.
CONTACT: K. J. Greene
313 Link Hall
School of Computer and Information Science
Syracuse University
Syracuse, NY 13210
DATED: June 1985
---------------------------------------------------------------------
NAME: Micro-Prolog
VERSION: 3.1 (dated March 1984)
SRC/MACHINE/OS: Assembler/ CP/M-80 and MSDOS microcomputers.
AVAILABILITY: Academic and commercial licenses available.
COST: For CPM80 machines: 125 pounds or $195;
for CPM86/MSDOS/PCDOS machine: 175 pounds or $295;
special rates for educational institutions.
FEATURES:
Extensibility of supervisor made possible by modules; interactive
program text editor; editor and trace utility modules; real
numbers; memory trace facility; SIMPLE extension to supervisor;
DEC-10 front end for machines with >64KB memories; APES -- Expert
System Shell available.
CONTACT:
Programming Logic Systems Logic Programming Associates
31 Crescent Drive Studio 4,
The Royal Victoria Patriotic Building
Milford, CT 06460 Trinity Road
London SW18 6SX
DATED: June 1985
---------------------------------------------------------------------
NAME: Modula-Prolog
SRC/MACHINE/OS: Modula-2, MS-DOS, VAX VMS and UNIX
AVAILABILITY: ?
COST: ?
FEATURES:
Modula-Prolog is a software package written in Modula-2, offering
tools for constructing Prolog interpreters which can interact in
many ways with other Modula-2 programs. Fully compatible with
Clocksin & Mellish.
CONTACT: Carlo Muller
Brown Boveri Research
CH-5405 Baden
Switzerland
DATED: Sept 1985
---------------------------------------------------------------------
NAME: MProlog
VERSION: 1.5 (dated 1984)
SRC/MACHINE/OS: CDL2 & Prolog; DEC VAX: VMS and UNIX (4.2 BSD);
IBM: VM/CMS, MVS/TSO; IBM-PC: PC DOS; 68000 based
UNIX variations; Tektronix 4404 workstation.
AVAILABILITY: wide range-- commercial, educational, per CPU, OEM
distribution and run-time licenses
COST: Educational and OEM discounts available.
FEATURES:
Interpreter, compiler; program development environment -
interactive editor, concurrent proof editing, trace facilities;
user-defined error handling; garbage collection; over 250
built-in predicates; external routine interfaces; modularity;
portability
CONTACT: Logicware Inc.
5000 Birch Street
West Tower, Suite 3000
Newport Beach, CA 92660
(714) 476-3634
or
Logicware Inc.
1000 Finch W., Suite 600
Toronto, Canada M3J 2V5
(416) 665-0022
or
Systems, Computers and Informatics Laboratory, SZKI
1368 Budapest, POB 224
Hungary
DATED: March 1985
---------------------------------------------------------------------
NAME: MU-Prolog
VERSION: 3.2
SRC/MACHINE/OS: C/UNIX on VAX, SUN, Perkin Elmer, Pyramid, Gould,
Elxsi... (portable to most UNIX systems)
AVAILABILITY: Now, non-military education and research only.
COST: $200 (Australian)
STATUS: Stable
FEATURES: DEC-10 compatibility, database system, coroutines
CONTACT: Lee Naish
(lee@mulga.oz.au, munnari!lee@seismo.css.gov.us)
Department of Computer Science
University of Melbourne
Parkville, Victoria 3052
Australia
NOTES:
Extra control facilities enable coroutining. Negation and other
predicates are delayed when insufficiently instantiated. The
database system allows terms containing functors and variables
to be stored on disk.
DATED: August 1987
---------------------------------------------------------------------
NAME: NU-Prolog
VERSION: 1.1
SRC/MACHINE/OS: C/UNIX on VAX, SUN, Perkin Elmer, Pyramid, Elxsi...
(portable to most UNIX systems)
AVAILABILITY: Now, non-commercial.
COST: $400 (Australian)
STATUS: Development
FEATURES: Quintus compatibility, database system, coroutines,
compiler
CONTACT: John Shepherd
(jas@mulga.oz.au, munnari!jas@seismo.css.gov.us)
NU-Prolog Distribution
Department of Computer Science
University of Melbourne
Parkville, Victoria 3052
Australia
NOTES:
Extra control facilities enable coroutining. Predicates are
delayed when insufficiently instantiated. Good facilities for
negation, quantifiers, implication, etc. The database system
allows terms containing functors and variables to be stored on
disk. Implementation is based on an extended version of WAM.
DATED: August 1987
---------------------------------------------------------------------
NAME: Pascal Prolog
SRC/MACHINE/OS: Pascal
AVAILABILITY: for research purposes only
COST: $70 handling charge
STATUS: probably frozen, very portable.
FEATURES:
Marseilles syntax, very limited set of evaluable predicates
(arithmetic, output, bagof); tail recursion and some intelligent
backtracking.
CONTACT: Maurice Bruynooghe.
Katolicke Universite de Leuven,
Adfelung Toegepaste Wiskunde en Programmatic,
B-3030 Heverlee,
Belgium.
Tel: (32) 16 200656
DATED: February 1983
-------------------------------------------------------------------
NAME: POPLOG
SRC/MACHINE/OS: VAX (VMS/Ultrix and UNIX BSD), Sun-2, SUN-3,
HP9000/200, HP9000/300, Apollo version with reduced
features.
AVAILABILITY: academic and commercial licenses
COST: substantial educational discounts available.
STATUS:
Development continuing. "Delivery" mechanism planned. Being
ported to other machines. Developed as part of software infra-
structure for UK "Alvey Programme" in advanced IT. Now
marketed and supported internationally.
FEATURES:
Mixed language development system, providing incremental
compilers for DEC-10 Prolog, Common Lisp and POP-11 (like Lisp,
but readable syntax, co-routines, etc.); routines written in C,
Fortran and Ada may be linked dynamically into POPLOG
environment and unlinked if necessary. Integrated editor
included. Window manager. Large number of online HELP, TEACH
and Program library files. Incremental compiler for Standard
ML available optionally. The languages all compile
incrementally via a common virtual machine. So mixed language
programming is supported, with shared data-structures.
Tools provided for adding incremental compilers for new
languages. The Prolog is fast, but re-coding critical
deterministic bits in POP-11 can achieve further speed-up.
Object Oriented programming library included. Autoloading and
search lists provide extreme tailorability, e.g. for teaching,
or project libraries.
CONTACT:
Academic users in USA and Canada:
Prof Robin Popplestone (Also at University of Amherst)
Computable Functions Inc.,
35 South Orchard Drive,
Amherst, MA 01002, USA
tel (413) 253-7637
Others
AI Business Centre
Systems Designers Plc,
Pembroke House,
Pembroke Broadway
Camberley, Surrey, GU15 3XD, England
Phone +44 (0)276 686200
UK academic users:
Poplog Manager,
School of Cognitive Sciences
Sussex University
Falmer, Brighton BN1 9QN, England
NOTES:
Poplog Version.13 with full Common Lisp, new Window Manager, and
many enhancements will be released Oct/Nov 1987. POPLOG is
marketed under license from the University of Sussex.
DATED: Sept 1987
---------------------------------------------------------------------
NAME: Prolog-1
SRC/MACHINE/OS: MS-DOS, CP/M, PDP-11 VAX, Macintosh
AVAILABILITY: ?
COST: ?
FEATURES:
Standard syntax, ES/P expert system shell, 1KLIPS on VAX/VMS.
CONTACT:
Expert Systems, International
34 Alexandra Road 1150 First Avenue
Oxford OX2 0DB King of Prussia, PA 19406
U.K.
NOTES:
Plans to interface to RAPPORT relational database. Teknowledge
used this Prolog for their M.1 product. See March 1985 issue
of Dr. Dobb's Journal.
DATED: March 1985
---------------------------------------------------------------------
NAME: Prolog-2
SRC/MACHINE/OS: largely Prolog, CP/M-86, MS-DOS, RSX/RT/11; IBM-C
AVAILABILITY: Academic and commercial.
COST: Varies with license.
FEATURES:
Fast interpreter; compiler for IBM-PC version only; DEC-10
compatible syntax; source file editor, clause indexing, tail
recursion optimization, virtual memory facility, debugger
(OR-gree), error handler, garbage collector, ability to overlay
modules, windowing scheme, help facility.
CONTACT: Expert Systems International, Ltd.
same address as Prolog-1
NOTES: Compiler/interpreter for VAX/VMS to be released
early 1986.
DATED: June 1985
---------------------------------------------------------------------
NAME: Prolog-10 and Prolog-20
VERSION: 3.52 (Prolog-10), 1.5 (Prolog-20)
SRC/MACHINE/OS: Prolog+Macro-10; TOPS-10 and TOPS-20
AVAILABILITY: Academic and commercial licenses
STATUS: stable, maintenance only
FEATURES: Compiler and interpreter
CONTACT: Quintus Computer Systems
2345 Yale Street, Palo Alto, CA 94304
(415)494-3612
NOTES:
This version is vastly improved in comparison with the original
Edinburgh system: an incremental compiler integrated with the
interpreter producing tail-recursion optimized code, an
interactive debugger and execution stepper for interpreted code,
many other goodies; the TOPS-20 version runs in native mode and
has a number of improvements over the TOPS-10 one
DATED: July 1984
---------------------------------------------------------------------
NAME: Prolog-86
SRC/MACHINE/OS: MS-DOS, PC-DOS, CPM-86
COST: $125
CONTACT: Solution Systems
335-D Washington Street
Norwell, MA 02061
(617) 659-1571
DATED: March 1985
NOTES: See March 1985 issue of Dr. Dobb's Journal.
---------------------------------------------------------------------
NAME: Prolog-II
SRC/MACHINE/OS: Prolog, Pascal, Candide, Fortran; many operating systems.
AVAILABILITY: Academic and commercial.
COST: 2500F to 15000F.
FEATURES:
Portability on account of virtual machine, and interpreter and
compiler; interactive clause development editor; unification to
infinite trees; postponement of evaluation; new data structures;
modularity as system of "worlds", tree structured rule space.
CONTACT: M van Canegham
PrologIA
278 Rue St. Pierre
13005 Marseille
France
DATED: June 1985
---------------------------------------------------------------------
NAME: Prolog-V
SRC/MACHINE/OS: IBM PC & compatibles
COST: $69.95
CONTACT: Chalcedony Software
5580 La Jolla Blvd.
Suite 126A
La Jolla, CA 92037
(619) 483-8513
NOTES: See March 1985 issue of Dr. Dobb's Journal.
DATED: March 1985
---------------------------------------------------------------------
NAME: Prolog-CRISS (formerly FOLL-Prolog)
VERSION: 3.1 dated 1985
SRC/MACHINE/OS: Pascal, HB68/MULTICS; ICL2900/VME/B; UNIX machine;
VAX/VMS; PC/MS-DOS
AVAILABILITY: Academic and commercial.
COST: 10000F, or 1000F for academic use.
FEATURES:
Interpreter; cross-referencing between program identifiers,
partial delay of program execution, intelligent backtracking,
loop detection, definite clause grammar translation, database
features, modularity on worlds.
CONTACT: CRISS - BP 47X
38040 Grenoble Cedex
France
DATED: June 1985
---------------------------------------------------------------------
NAME: PROLOG/P
VERSION: 2.00
SRC/MACHINE/OS: Wide range of systems, including VAX/VMS and 68000
machines.
AVAILABILITY: Academic and commercial.
COST: ?
FEATURES:
Interpreter written in Pascal, programming environment written
in Prolog/P; possesses powerful yet portable features of Prolog
language; interactive programming environment, flexible and
extensible; modularity: can incorporate modules written in
other languages; large number of evaluable predicates;
optimized memory management, tail recursion, garbage collection.
Speed: 1300 LIPS on VAX 750/VMS.
CONTACT: Mr. Hentinger
CRIL (Conception et Realisation Industriel de Logiciel)
12 Bis, Rue Jean-Jaures
92807 Puteaux
France
Tel: 776.34 37
DATED: June 1985
---------------------------------------------------------------------
NAME: Quintus Prolog
VERSION: 1.0
SRC/MACHINE/OS: 4.2 Unix on VAX and SUN, System V on CT Megaframe and
VAX/VMS.
AVAILABILITY: supported commercial license, academic and multiple CPU
discounts.
COST: ?
FEATURES:
Incremental optimizing compiler with TRO and indexing; interpreter
with full Prolog-10/20-type debugger; fancy Emacs interface with
reconsulting/recompilation from editor buffers (Unipress Emacs
license included); C interface; 23KLIPS on a VAX-780, 20KLIPS on
a SUN-2.
STATUS: continuing development, fully supported
CONTACT: Jonathan Newmann
Quintus Computer Systems, Inc.
2345 Yale Street
Palo Alto, CA 94304
(415)494-3612
DATED: June 1985
---------------------------------------------------------------------
NAME: Rhet
VERSION: pre-release
SRC/MACHINE/OS: Common Lisp with extensions / Explorer 3.0 and
Symbolics 7.1
AVAILABILITY:
We are just starting to use the initial version in-house, and the
complete version is unlikely to be available until June88. An
interim version may be made available to the very interested
(willing to put up with b-test level software) around January 88.
COST:
Undecided, probably about $150.-$250. for non-commercial source
license. Updates for the cost of distribution (FTP may be available
for updates). Free to members of our Industrial Affiliates program.
FEATURES:
This is a Knowledge Representation system based on concepts
proved with HORNE. It includes 2 major modes for representing
knowledge (as Horn Clauses or as frames), which are interchangable;
a type subsystem for typed and type restricted objects (including
variables); E-unification; negation; forward and backward chaining;
complete proofs (prove, disprove, find the KB inconsistent, or
claim a goal is neither provable nor disprovable); incremental
compilation; contextual reasoning; default reasoning; truth
maintenance; intelligent backtracking; full LISP compatibility (can
call or be called by lisp); upward compatible with HORNE; user-
declarable reasoning subsystems; Allen & Koomen's TEMPOS time
interval reasoning subsystem; frames have KL-1 type features, plus
arbitrary predicate restrictions on slots within a frame as well
as default values for slots; separate subsystem providing windowing
facilities, graphics, and ZMACS interface on the lispms.
CONTACT:
Admin: (distribution and TRs) Peg Meeker, TR Secretary
Technical: Brad Miller (miller@cs.rochester.edu)
James Allen (james@cs.rochester.edu)
Computer Science Department
University of Rochester
Rochester, NY 14627
NOTES:
TRs (2 will be available by mid-September 87, a users manual and
hackers guide)
DATED: September 1987
---------------------------------------------------------------------
NAME: Salford University Prolog
SRC/MACHINE/OS: Fortran 77, runs on Prime computers
COST: $3500 for universities, $750 annual maint.
FEATURES:
Edinburgh syntax; packaged with Salford Lisp; programs in one
language can call programs in the other.
CONTACT: Salford University Industrial Centre Limited
Salford M5 4WT
England
Or
Mitchell Associates
P.O. Box 6189
San Rafael, CA
(415) 435-2024
DATED: June 1985
---------------------------------------------------------------------
NAME: SB-Prolog (Stony Brook Prolog)
VERSION: 2.2.1
SRC/MACHINE/OS:
C and UNIX. Assumes longwords need only be word-aligned, may not
port easily to machines with stronger alignment requirements.
AVAILABILITY:
FTP-able from Arizona, restrictions similar to GNU. Login to
arizona as anonymous, copy contents of the directory 'sbprolog'.
Several files are in tar format, so ftp should be done in
binary mode.
COST: FREE!!
FEATURES:
Based on the Warren Abstract Machine. Allows arbitrary mixing of
compiled (byte code) and interpreted code. Provides user-directed
goal caching; argument indexing in both compiled and interpreted
code; CProlog-like trace/debug package; compilation to byte-code
object files, with dynamic loading of undefined predicates.
CONTACT: Saumya K. Debray (debray@arizona.edu)
Department of Computer Science
University of Arizona
Tucson, Arizona 85721
(602) 621-4527
DATED: November 1987
---------------------------------------------------------------------
NAME: Sicstus Prolog
SRC/MACHINE/OS: C/Berkeley Unix
AVAILABILITY: Commercial and non-commercial licenses.
STATUS: Active development.
FEATURES:
WAM based emulator, in-core & file-to-file compilers, interpreter,
"4 port" debugger, dynamic interface to C functions, global stack
garbage collector, ^C handler, cyclic term unifier, coroutines
(dif and freeze), WAM level debugger. Tries to be Quintus
compatible.
CONTACT: Mats Carlsson
SICS
PO Box 1263
S-16313 SPANGA, Sweden
mats-c@sics.se
NOTES:
Current version (0.5) lacks manual (being written). Save/restore
and native code compiler are being added. 20Klips on a SUN-3.
DATED: August 1987
---------------------------------------------------------------------
NAME: Trilogy
VERSION: Commercial version V1.0 released September 1987.
SRC/MACHINE/OS: IBM-PC/XT/ATs or compatibles under DOS-2.1 or higher.
COST: 99.95 (US) + shipping/handling.
FEATURES:
Constraint based logic prog. lang. It contains six different
decision procedures. These include the full dec. proc. for the
Presburger Arithmetic (arbitrarily quantified systems of linear
equations and inequalities in integers). Trilogy also decides
constraints involving finite mappings such as "a(x)=y" where all
three variables can be solved for. Because of the constraints
Trilogy executes combinatorial problems involving arithmetic
thousand times faster than Prologs. Trilogy is fully based on
the first order theory of S-exprs and it does not contain a single
extralogical feature. Trilogy is an integrated language in that it
contains 3G constructs (Pascal-like predicates and types) as well
as 4G constructs (extensive dbase file operations). Dbase files
can be also queried in the 5G setting of predicate calls. Trilogy
comes with its own environment including online editor, native
code compiler, linker, loader, and module librarian.
CONTACT: Complete Logic Systems Inc.,
741 Blueridge Ave, V7R 2J5,
North Vancouver B.C.
tel: (604) 986-3234.
DATED: Sept 1987
---------------------------------------------------------------------
NAME: UNH Prolog
VERSION: 1.3 (1985)
SRC/MACHINE/OS: C, VAX/VMS and UNIX
AVAILABILITY: Per machine license for all users
COST: $300 handling charge for all users
STATUS: Active
FEATURES: Compatible with DEC-10/20 Prolog
CONTACT: James L. Weiner/Wendy Fogg
Department of Computer Science
University of New Hampshire
Durham, New Hampshire 03824
NOTES:
Fully-compatible to EDINBURGH Prolog, with exception that some of
the more obscure features are not implemented. Debugging features
of EDINBURGH Prolog also implemented. Hooks into UNIX supported.
DATED: Sept 1985
---------------------------------------------------------------------
NAME: UNIX Prolog
VERSION: NU7
SRC/MACHINE/OS: PDP-11 Assembly/V6 or V7 Unix
AVAILABILITY: Restricted License per machine
COST: 20 pounds sterling (24 AUG 1981)
STATUS: development stopped
FEATURES: Interpreter, similar to DEC-10 version
CONTACT: Robert Rae
Department of Artificial Intelligence
University of Edinburgh
Forrest Hill
Edinburgh EH1 2QL Scotland,
U.K.
NOTES:
Uses copy-on-use data representation. Has been run in
compatibility mode on VAX's under 4.1 BSD, but is restricted by
PDP-11 address space.
DATED: December 1982
---------------------------------------------------------------------
NAME: UNSW Prolog
VERSION: 4.2
SRC/MACHINE/OS: C/Unix V7,32V,5.0,4.1BSD
AVAILABILITY: Educational and research purposes only
COST: A$100 in Australia,
US$150 elsewhere
FEATURES:
Interpreter, enhanced UNIX interface Based on DEC-10 Prolog (not
completely compatible)
CONTACT: Claude Sammut
(claude@cheops.eecs.unsw.oz
cheops.eecs.unsw.oz!claude@ukc)
School of Electrical Engineering and Computer Science,
University of New South Wales
P.O. Box 1
Kensington, N.S.W. 2033
Australia
Phone: +61 2 697 4052
NOTES:
Changes in version 4.2 include:
about 25% faster
real arithmetic
streams
Most i/o predicates take a stream as an optional first
argument. These are Quintus like.
inter process communication facilities
* asynchronous processes may be started with streams to and
from the process optionally created
* A stream may be polled to see if it is ready to be read.
* In a BSD universe it is possible to do a select on a list
of streams. Select blocks for a given interval until one of
the supplied streams are ready. This stream is unified with
the last argument.
many bug fixes
a profiling facility that gives the user the ability to find out,
for each clause total calls, fails, exits, cputime, the number
of times each subgoal of the clause exits
DATED: Sept 1987
---------------------------------------------------------------------
NAME: Uranus System
SRC/MACHINE/OS: LISP/Dec 20, VAX/UNIX, Symbolics
AVAILABILITY: Academic only
FEATURES:
A superset of Prolog/KR (Prolog for Knowledge Representation).
DEC 10 compatibility features; multiple worlds mechanism, lazy
and pseudo parallel evaluation.
CONTACT: Hideyuki Nakashima
Information Processing Group
Electrotechnical Laboratory
Sakura-mura, Ibaraki 305, Japan
DATED: Sept 1985
---------------------------------------------------------------------
NAME: VPI Prolog
SRC/MACHINE/OS: Pascal, VAX with VMS.
AVAILABILITY: Unrestricted.
COST: $1000
FEATURES:
Uses list allocation (9 byte cons) and syntax, double precision
reals; facilities for interactive program development; interfaces
to Lisp, Pascal and Fortran available, also general purpose expert
system shell.
CONTACT: Prof. John Roach,
Dept. of Computer Science,
Virginia Polytechnic Institute,
Blacksburg, Va.
(703) 961 5368
DATED: February 1983
---------------------------------------------------------------------
NAME: WProlog
SRC/MACHINE/OS: IBM VM/370 CMS
FEATURES: Very fast interpreter!
AVAILABILITY: educational, commercial, third party
COST: Yearly license, 50% academic discount
CONTACT: WATCOM Products, Inc.
415 Phillip Street
Waterloo, Ontario
Canada, N2L 3X2
(519) 886-3700
DATED: Sept 1987
---------------------------------------------------------------------
NAME: York Portable Prolog
VERSION: 2
SRC/MACHINE/OS: Pascal interpreter (ISO Standard Pascal)/ wide range
of systems that support Pascal.
AVAILABILITY: Educational, research etc.
COST: 200 pounds sterling.
STATUS: Available now
FEATURES:
Modeled after Edinburgh PDP-11 version; large number of
built-in predicates; interactive debugging package written in
Prolog; supports full Prolog syntax, with definite clause
grammars, garbage collection of the Prolog database.
CONTACT: Mrs Jennifer Turner
Software Technology Research Centre
Department of Computer Science
University of York
York, YO1 5DD, U.K.
(0904) 59861
DATED: December 1984
---------------------------------------------------------------------
---------------------------------------------------------------------bts@unc.cs.unc.edu (Bruce Smith) (12/13/87)
I promised that CLP(R) was in the LIST-OF-PROLOGs, and somehow it was
left out. Here's the entry-- additions or corrections welcome. Maybe
I didn't have something sufficiently instantiated the first time?
Bruce
______________________________________________________________________
NAME: CLP(R)
VERSION: 2.0
SRC/MACHINE/OS: C / VAXen,Pyramid,Sun,etc. / UNIX
AVAILABILITY: educational or research
COST: $150 (Australian?)
FEATURES:
Interpreter, targetted at educational or research usage.
The CLP(R) language is an instance of the Constraint Logic
Programming scheme described in [Jaffar & Lassez 87]. Its
operational mode is similar to that of Prolog. A major
difference is that unification is replaced by a more general
mechanism: solving constraints in a domain of uninterpreted
functors over real arithmetic. (from the programmer's manual)
CONTACT: clp@moncsbruce.oz.au
munnari!moncsbruce.oz!clp@seismo
CLP(R) Distribution
Department of Computer Science
Monash University
Clayton, Victoria 3168
Australia
NOTES:
Jaffar,J. & Lassez,J-L., "Constraint logic programming",
POPL, Munich, Jan 87.
DATED: June 1987
______________________________________________________________________