FAQ: Prolog Resource Guide 1/2 [Monthly posting] 
Author Message
 FAQ: Prolog Resource Guide 1/2 [Monthly posting]

Archive-name: prolog/resource-guide/part2
Last-Modified: Thu Mar 13 12:13:00 1997 by Mark Kantrowitz
Version: 1.35

URL: http://www.*-*-*.com/
Size: 91137 bytes, 1682 lines

;;; ****************************************************************
;;; Prolog Resource Guide ******************************************
;;; ****************************************************************
;;; prg_2.faq

This is part two of the Prolog Resource Guide. This part lists
available Prolog, logic programming, and constraint system
implementations, both free and commercial.

Prolog Implementations (Part 2):
  [2-0]  General information about Prolog Implementations

  [2-1]  Free Prolog Implementations
  [2-2]  Commercial Prolog Implementations

  [2-3]  Free Parallel Prolog Implementations
  [2-4]  Commercial Parallel Prolog Implementations

  [2-5]  Free Constraint Systems
  [2-6]  Commercial Constraint Systems

  [2-7]  Free Logic Programming Systems
  [2-8]  Commercial Logic Programming Systems

  [2-9]  Other Commercial Prolog Products

  [2-10] Prolog extensions, meta-interpreters, and pre-processors

Search for [#] to get to topic number # quickly. In newsreaders which
support digests (such as rn), [CTRL]-G will page through the answers.

Subject: [2-0] General information about Prolog Implementations

When comparing free and commercial Prolog implementations, a rule of
thumb is that commercial prolog implementations are often more robust
and better supported than the public domain and free prolog
implementations. Commercial Prolog implementations tend to have better
debugging facilities. Many of the commercial Prolog vendors offer
educational discounts to universities, and some of the commercial
Prolog implementations are rather inexpensive.

When considering a commercial Prolog implementation, be sure to ask
for current pricing information. Although we try to keep this
information up to date, there is no guarantee that it hasn't changed
in the interim. If you find that the information has changed, please
ask the vendor to send us current information.

Some research institutions make their Prolog implementations available
for a fee. We have included those implementations in the lists of
commercial Prolog implementations.

The Prolog Management Group may be contacted by email via the Secretary,

Remember when ftping compressed or compacted files (.Z, .arc, .fit,
.zip, .z, etc.) to use binary mode for retrieving the files.

Files that end with a .z suffix were compressed with the patent-free
gzip (no relation to zip). Source for gzip is available from:
as the files gzip-1.2.3.shar, gzip-1.2.3.tar,or gzip-1.2.3.msdos.exe.

Subject: [2-1] Free Prolog Implementations

The following list of free Prolog and logic programming implementations
excludes those listed in the comp.lang.lisp and comp.lang.scheme FAQs
(i.e., Prolog interpreters written in Lisp and Scheme).

Most of these Prolog implementations are available from the CMU AI
Repository, in the directory

A.D.A. Public Domain Prolog:

   A rather slow implementation of Prolog for MS-DOS systems, originally
   a product of Automata Design Associates (now defunct), 1570
   Arran Way, Dresker, PA 19025, 215-335-5400.

Aquarius Prolog:
   Aquarius Prolog is a high-performance, portable Prolog implementation
   developed since 1989 by the Aquarius Project at UC/Berkeley, the Advanced
   Computer Architecture Laboratory (ACAL) at the University of Southern
   California (USC), and at Digital Equipment Corporation's Paris Research
   Laboratory. The developers are Tom Getzinger, Ralph Clarke Haygood, and
   Peter Van Roy. Aquarius Prolog includes:

      - A compiler with global analysis.  The compiler is built around the
        Berkeley Abstract Machine (BAM) execution model for Prolog. BAM
        retains desirable features of the Warren Abstract Machine (WAM),
        but allows for significant further optimizations and is easier to
        map onto actual general-purpose machines.

      - A back-end that maps the BAM onto various actual general-purpose
        machines, including MIPS R3000 (DEC Ultrix and MIPS RISC/os),
        SPARC (SunOS), HP 9000 300/400 with MC68020, MC68030 or MC68040
        processors (HP-UX), and Sun3 (SunOS).

      - A run-time system offering substantially the same built-in
        predicates and memory management as Quintus Prolog, with additions
        such as two kinds of destructive assignment.  Most of the built-in
        predicates are written in Prolog, with little or no performance

   Aquarius Prolog also includes an interpreter and documentation.
   Aquarius Prolog comes in two distributions, Enduser and Full. The
   latter includes full source code and implementation notes.

   Aquarius Prolog may be obtained free of charge from USC, after signing
   and returning a license agreement. To get the license agreement, send a

      get aquarius-info license
   in the message body. To get more information about the Full and
   Enduser distributions, send the listserver a message containing
   one or both of the two lines:
           get aquarius-info readme-full
           get aquarius-info readme-enduser
   To subscribe to the aquarius-prolog mailing list, send the listserver a
   message with body:
           subscribe aquarius-prolog <Your real name here>
   To get more information about the abilities of the listserver, send it a
   message with 'help' in the body.

   For further information, write to University of Southern California,
   Advanced Computer Architecture Laboratory (ACAL), Attn: Aquarius Prolog
   Licensing, 3740 S. McClintock, Suite 131, Los Angeles, CA 90089-2561, or

Beta-Prolog (version 1.2):

   Beta-Prolog is a fast and portable Prolog implementation. It consists
   of an emulator of the NTOAM (matching Tree Oriented Abstract Machine)
   written in C, a compiler written in Prolog that translates Prolog
   programs into NTOAM instructions, and a library of built-in

   Beta-Prolog has the following features:

      1. It is one of the fastest emulator-based Prolog implementations.
         The NTOAM inherits many good features of the WAM, but differs from
         WAM-based systems in that predicate arguments are passed directly
         in stack frames and only one frame is used for each predicate. For
         many programs written for WAM-based systems, Beta-Prolog is faster
         than emulator-based SICStus Prolog 2.1. Further speed-ups can be
         achieved if these programs are rewritten into a style suitable for
         Beta-Prolog by taking the NTOAM's argument passing scheme into

      2. Besides Edinburgh style clauses, Beta-Prolog also accepts
         matching clauses in which input and output unifications are
         separated, and determinism is denoted explicitly. The compiler is
         able to translate predicates in this form into matching trees and
         index them using all input arguments. The compiler can compile
         quite large programs in a short time because it consists of only
         matching clauses.

      3. It provides an interactive interface through which the
         programmers can consult, compile, load, debug and run programs.

      4. It provides an interface through which C functions can be
         called from Prolog.

      5. It provides a special data structure called state tables that
         can be used to represent graphs, simple and complex domains in
         constraint satisfaction problems, and situations in various
         combinatorial search problems.

      6. It includes a finite-domain constraint solver with which
         constraint satisfaction problems can be specified declaratively.

   Beta-Prolog is available by anonymous ftp from
      ftp.kyutech.ac.jp:/pub/Language/prolog/ []
   or from the CMU AI Repository in
   The system can be installed without difficulty on any machine that
   runs Unix and the cc (or gcc) C compiler. Beta-Prolog was developed by

   and Systems Engineering, Kyushu Institute of Technology, 680-4 Kawazu,
   Iizuka, Fukuoka 820, Japan, phone 81-948-29-7774, fax 81-948-29-7760.

   clement.info.umoncton.ca:/BinProlog3.0.tar.gz []
   ftp.elis.rug.ac.be:/pub/BinProlog/        []

   BinProlog replaces the WAM by a more compact continuation passing logic
   engine based on a mapping of full Prolog to binary logic programs.  It
   includes an interface Tcl/Tk. Version 2.20 runs on Sparc, DEC Alpha,
   MIPS (SGI, DEC) 68k (NeXT, Sun3), R6000 (IBM), PA-RISC (HP) and IBM PC
   (386/486). The compiler makes 528 KLIPS on a Sparc 10-40 (101 KLIPS on a
   NeXT) and still uses a very small (49K under Solaris 2.1) emulator,
   making it among the fastest freely available C-emulated Prologs (3-5
   times faster than C-Prolog, 2-3 times faster than SWI-Prolog, 1.5-2
   times faster than (X)SB-prolog and close to C-emulated Sicstus 2.1.).
   Comments and bug reports should be sent to Paul Tarau

   BinProlog is free for reasearch and other non-profit purposes.  Use in
   industrial applications, licensing of C-sources, porting to other
   platforms, BinProlog related support and consulting are available but
   need a separate agreement. BinProlog's very small code-size

read more »

Thu, 30 Dec 1999 03:00:00 GMT  
 [ 3 post ] 

 Relevant Pages 

1. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

2. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

3. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

4. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

5. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

6. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

7. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

8. FAQ: Prolog Resource Guide 1/2 [Monthly posting]

9. FAQ: Prolog Resource Guide 1/2 [Monthly posting]


Powered by phpBB® Forum Software