Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.

Dismiss

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

2 views

Skip to first unread message

Mark Kantrowitz

unread,

Jul 13, 1997, 3:00:00 AM7/13/97

Archive-name: prolog/resource-guide/part1
Last-Modified: Thu Feb 20 12:54:26 1997 by Mark Kantrowitz
Version: 1.36
Maintainer: Mark Kantrowitz <mkan...@cs.cmu.edu>
URL: http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/lang/prolog/prg/top.html
Size: 85332 bytes, 1808 lines

;;; ****************************************************************
;;; Prolog Resource Guide ******************************************
;;; ****************************************************************
;;; prg_1.faq

This post contains the Prolog Resource Guide.

Contributions, corrections, suggestions, and comments should be sent
to Mark Kantrowitz <mkan...@cs.cmu.edu>.

This guide lists a variety of resources for the Prolog community,
including books, magazines, ftp archives, and products. It is posted
on the 13th of every month to the newsgroups comp.lang.prolog and
comp.object.logic. The PRG is also posted to the newsgroups
news.answers and comp.answers where they should be available at any
time (ask your local news manager).

*** Copyright:

This FAQ may be freely redistributed in its entirety without
modification provided that this copyright notice is not removed. It
may not be sold for profit or incorporated in commercial documents
(e.g., published for sale on CD-ROM, floppy disks, books, magazines,
or other print form) without the prior written permission of the
copyright holder. Permission is expressly granted for this document
to be made available for file transfer from installations offering
unrestricted anonymous file transfer on the Internet.

If this FAQ is reproduced in offline media (e.g., CD-ROM, print form,
etc.), a complimentary copy should be sent to Mark Kantrowitz, School
of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue,
Pittsburgh, PA 15213-3891 USA.

This article is provided AS IS without any express or implied warranty.

*** Recent Changes:

;;; 1.30:
;;; 7-AUG-95 mk Updated Amzi! entry in part 2.
;;;
;;; 1.31:
;;; 29-AUG-95 mk Added ORISA Prolog entry to part 2.
;;; 29-AUG-95 mk Added [1-19] about ISO Prolog Standard
;;; 30-AUG-95 mk Updated entry for LPA Prolog in part 2.
;;; 12-SEP-95 mk Several changes to [1-1], [1-3], [1-13], [1-15] and part 2
;;; (ALS Prolog and CLP(RI)) by Ken Bowen.
;;;
;;; 1.32:
;;; 18-SEP-95 mk Updated Prolog by BIM and IBM Prolog entries.
;;;
;;; 1.33:
;;; 18-OCT-95 mk Added entry on Mercury to [2-7].
;;; 9-NOV-95 mk Updated ALP info - Logic Programming Newsletter and [1-4].
;;; 19-MAR-96 mk Added note about Henderson paper to [1-10].
;;; 14-MAY-96 mk Added entry for Visual Prolog to part 2.
;;; 14-MAY-96 mk Updated LPA Prolog entry.
;;; 14-MAY-96 mk Prolog Vendors' Group renamed Prolog Management Group, and
;;; email address changed due to Al Roth's death earlier this
;;; year.

*** Topics Covered:

There are currently two parts to the PRG:

1. Introductory Matter and General Questions
2. Prolog Implementations

Table of Contents (Part 1):

[1-0] Introduction
[1-1] Sources of information about Prolog
[1-2] Prolog and Logic Programming Related Mailing Lists
[1-3] Books and Magazine Articles
[1-4] Prolog and Logic Programming Associations and Journals
[1-5] FTP Archives and Other Resources
[1-6] Free Object-Oriented Systems for Prolog
[1-7] Commercial Object-Oriented Systems for Prolog
[1-8] The Prolog 1000 Database
[1-9] X-Windows Interfaces
[1-10] Is there a straight-forward way of compiling Prolog to C?
[1-11] WAM emulators and tracers
[1-12] What is the Basic Andorra Model and AKL?
[1-13] What is Constraint Logic Programming?
[1-14] How do you write portable programs in Prolog?
[1-15] World-Wide Web (WWW) Resources
[1-16] Prolog Job Postings
[1-17] Is Prolog really used in Windows NT?
[1-18] History of Prolog
[1-19] The ISO Standard for Prolog and other Prolog standards
[1-A] Acknowledgements

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: [1-0] Introduction

Certain questions and topics come up frequently in the various network
discussion groups devoted to and related to Prolog and logic programming.
This file/article is an attempt to gather these questions and their
answers into a convenient reference for Prolog programmers. It (or a
reference to it) is posted periodically. The hope is that this will
cut down on the user time and network bandwidth used to post, read and
respond to the same questions over and over, as well as providing
education by answering questions some readers may not even have
thought to ask.

This guide lists Prolog and logic programming resources: archives,
newsgroups, books, magazines, compilers, interpreters and anything
else you can think of which has to do with the proliferation of Prolog
and logic programming. Also included is a list of suppliers of
products and a list of publishers. Topics can also include
unification, backtracking search, and other aspects of logic
programming. As Prolog has a strong historical tradition in Europe,
we've tried to ensure that the information is relevant to all readers,
including European and North American.

This is not a Prolog tutorial, nor is it an exhaustive list of all Prolog
intricacies. Prolog is a very powerful and expressive language, but with
that power comes many complexities. This list attempts to address the
ones that average Prolog programmers are likely to encounter. If you are
new to Prolog, read one of the introductions listed in the answer to
question [1-3].

Please do not post homework questions to the comp.lang.prolog
newsgroup. You won't learn anything if somebody else does the problem
for you, and won't get any credit for your answer if your instructor
reads the newsgroup.

Please also avoid starting the debate on which language is better;
Prolog or Lisp, Prolog or C, and so on. Such discussions are rarely
productive, and nobody will change their opinion as a result of the
debate. The usual conclusion of such debates is that the languages are
Turing equivalent, but some languages are better suited for particular
tasks. For Prolog, the consensus is that it is a good choice for
problems involving logic and problems whose solution can be
represented or characterized succinctly in logical form. Some folks
feel Prolog is the best language for natural language processing;
others disagree.

The comp.lang.prolog newsgroup is archived in
ftp.cs.cmu.edu:/user/ai/pubs/news/comp.lang.prolog/
on a weekly basis.

This guide is posted regularly to comp.lang.prolog and comp.object.logic.
It may also be obtained by anonymous ftp from
ftp.cs.cmu.edu:/user/ai/pubs/faqs/prolog/ [128.2.206.173]
using username "anonymous" and password "name@host" (substitute your
email address) or via AFS in the Andrew File System directory
/afs/cs.cmu.edu/project/ai-repository/ai/pubs/faqs/prolog/
as the files prg_1.faq and prg_2.faq.

You can also obtain a copy of the FAQ by sending a message to
ai+q...@cs.cmu.edu with
Send PRG
in the message body.

The FAQ postings are also archived in the periodic posting archive on
rtfm.mit.edu:/pub/usenet/news.answers/prolog/ [18.181.0.24]
If you do not have anonymous ftp access, you can access the archive by
mail server as well. Send an E-mail message to
mail-...@rtfm.mit.edu with "help" and "index" in the body on
separate lines for more information.

An automatically generated HTML version of the PRG is accessible by
WWW as part of the AI-related FAQs Mosaic page. The URL for this
resource is
http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/top.html
The direct URL for the PRG is
http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/lang/prolog/prg/top.html

If you need to cite the FAQ for some reason, use the following format:
Mark Kantrowitz, "Prolog Resource Guide", comp.lang.prolog, <month>, <year>,
ftp.cs.cmu.edu:/user/ai/pubs/faqs/prolog/prg_?.faq, mkan...@cs.cmu.edu.

Disclaimer:

We have taken great care in making the information in this document as
accurate as possible. However we are not responsible for any problems
which might occur from using information supplied in this guide.

----------------------------------------------------------------
Subject: [1-1] Sources of Information about Prolog

The newsgroups comp.lang.prolog, comp.object.logic, and (to a lesser
extent) comp.ai are a source of information and discussion about Prolog.
See also sci.logic. The newsgroup comp.constraints is for information
about constraint processing languages and related topics.

A "Frequently Asked Questions" posting is posted to comp.lang.prolog
twice a month by Jamie Andrews <ja...@cs.sfu.ca>. The Prolog FAQ and this
Prolog Resource Guide are intended to complement one another.

Several WWW resources are available (see also [1-5] and [1-15]):

CMU Prolog Repository. Extensive archives of code, bibliographies,
FAQs, newsgroup postings, tech reports, and more. The URL is:
http://www.cs.cmu.edu:8001/afs/cs.cmu.edu/project/ai-repository/ai/lang/prolog/0.html

NALP: North American Logic Programming. World-wide coverage
with some emphasis on developing LP in North America. The URL is:
http://www.als.com/nalp.html

Logic Programming Archive at Oxford Comlab. World-wide coverage
with emphasis on Europe. The URL is:
http://www.comlab.ox.ac.uk/archive/logic-prog.html

----------------------------------------------------------------
Subject: [1-2] Prolog and Logic Programming Related Mailing Lists

Prolog and Logic Programming:
pro...@sushi.stanford.edu (general)
prolog-...@sushi.stanford.edu (nitty gritty)

All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to prolog-...@sushi.stanford.edu

[The host sushi.stanford.edu no longer exists, as of 11/24/92.
Does anybody know the new location of the mailing lists?]

Lambda Prolog:
lpr...@cis.upenn.edu

To subscribe, send mail to lprolog...@cis.upenn.edu.

Mercury:
mercury-...@cs.mu.oz.au (announcements)
mercur...@cs.mu.oz.au (general discussion)
To subscribe, send mail to mercury-anno...@cs.mu.oz.au
and/or mercury-us...@cs.mu.oz.au (respectively) with
"subscribe" in the message body.

Electronic Journal of Functional and Logic Programming (EJFLP)

EJFLP is a refereed journal that will be distributed for free via e-mail.
The aim of EJFLP is to create a new medium for research investigating the
integration of the functional, logic and constraint programming paradigms.

For instructions on submitting a paper, send an empty mail message with
Subject: Help
to:
submi...@ls5.informatik.uni-dortmund.de.
You will receive an acknowledgment of your submission within a few hours.

To subscribe to the journal, send an empty mail message to the following
address:
subscr...@ls5.informatik.uni-dortmund.de
You will receive an acknowledgment of your subscription within a few days.

If there are any problems with the mail-server, send mail to
ejfl...@ls5.informatik.uni-dortmund.de.

The editorial board is: Rita Loogen (RWTH Aachen), Herbert Kuchen (RWTH
Aachen), Michael Hanus (MPI-Saarbruecken), Manuel MT Chakravarty (TU
Berlin), Martin Koehler (Imperial College London), Yike Guo (Imperial
College London), Mario Rodriguez-Artalejo (Univ. Madrid), Andy Krall
(TU Wien), Andy Mueck (LMU Muenchen), Tetsuo Ida (Univ. Tsukuba,
Japan), Hendrik C.R. Lock (IBM Heidelberg), Andreas Hallmann (Univ.
Dortmund), Peter Padawitz (Univ. Dortmund), Christoph Brzoska (Univ.
Karlsruhe).

[The JFLP is now being published by MIT Press. Please see the JFLP web
page at the URL
http://www.cs.tu-berlin.de/~chak/jflp/
or the MIT Press web page at
http://mitpress.mit.edu/jrnls-catalog/journals-toc.html
or send email to
journa...@mit.edu
for further information.]

PDC-L:
PD...@nic.surfnet.nl is a discussion list for PDC Prolog users.

To subscribe, send mail to LIST...@nic.surfnet.nl with
SUBSCRIBE PDC-L <your full name>
in the message body.

Theorem Provers:
theorem...@ai.mit.edu

This (unmoderated) list is intended for announcements of interest to
people interested in automated theorem proving.

To subscribe, send your email address to theorem-pro...@ai.mit.edu.

Type Theory:
ty...@dcs.gla.ac.uk

Moderated mailing list about type theory. Archived on
theory.lcs.mit.edu:/pub/meyer/

To subscribe, send mail to types-...@dcs.gla.ac.uk.

Logic:
lo...@cs.cornell.edu

Moderated mailing list about logic. Archived on
theory.lcs.mit.edu:/pub/meyer/

To subscribe, send mail to logic-...@cs.cornell.edu

ALP (French Chapter):
prog-l...@irisa.fr

La liste de diffusion "prog-logique" est le support electronique de
communication de la section francaise de l'ALP (Association for Logic
Programming), groupe de travail AFCET. Elle complete la lettre du
groupe publiee trimestriellement.

Pour vous abonner ou vous desabonner, il faut envoyer un "mail" au
serveur de listes, a l'adresse
list...@irisa.fr
sans sujet ni signature, et dont le corps du message contient
SUB prog-logique Prenom Nom
Un acquittement est renvoye par messagerie. Pour desabonnement, ecrit
SIGNOFF prog-logique
Les requetes envoyees directement a la liste ne seront pas prises en
compte.

----------------------------------------------------------------
Subject: [1-3] Books and Magazine Articles

A BiBTeX bibliography of Logic Programming Conferences is available by
anonymous ftp from duck.dfki.uni-sb.de. See [1-5] below.

A partially annotated bibliography of work on integrating
object-oriented and logic programming is available by anonymous ftp
from menaik.cs.ualberta.ca:/pub/oolog/ in PostScript and BibTeX
formats. Written by Vladimir Alexiev <vlad...@cs.ualberta.ca>.

The following books are regarded as popular and widely used. Also
included are some books about WAM. This is not intended to be a complete
Prolog bibliography.

Prolog Programming:

Covington, Michael A.; Nute, D.; and Vellino, A. "Prolog
Programming in Depth", Scott, Foresman & Co., 1987. ISBN 0-521-40984-5
(Out of print, but new edition coming soon. Copies of the 1987
edition are still available from the University of Georgia
Bookstore, at 706-542-7131.)
Book source code available at:
http://www.als.com/ftp/pub/texts/texts.html

Bowen, Kenneth A. "Prolog and Expert Systems", Mcgraw-Hill, Inc.,
1991, ISBN 0-07-006731-7 ($29.95). Book source code available at:
http://www.als.com/ftp/pub/texts/texts.html

Clocksin, W.F. and Mellish, C.S: "Programming in Prolog", 3rd Ed.
Springer Verlag, 1987. 281 pages, ISBN 0-387-17539-3 ($29).
[Basic introduction to Prolog.]

Coelho, H., and Cotta, J.C., "Prolog by Example", Springer Verlag,
1988. 381 pages, ISBN 0-387-18313-2 ($39.50).

Cooke, Daniel E., "Logic: The Basis for Understanding Prolog",
Ablex, Norwood, NJ, 1994. 224 pages, ISBN 1-56750-028-5 ($27.50).
[Intro to Prolog with a review of the basic ideas underlying the language.]

Conlon, Tom: "Programming in Parlog". Addison-Wesley, 1989,
ISBN 0-201-17450-2.

Dawe, C.M. and M.S. Dawe, "Prolog for Computer Science", Springer
Verlag, 1994. 190 pages, ISBN 0-387-19811-3 paper ($35). [Intro to
computer science using Prolog.]

Dodd, Anthony, "Prolog: A logical approach", Oxford University
Press, New York, 1990, 556 pages. ISBN 0-198-53822-7 (cloth), $52.50;
ISBN 0-198-53821-9 (paperback), $26.00.

Kluzniak and Szpakowicz: "Prolog for Programmers", Academic Press 1985

G. L. Lazarev, "Why Prolog? Justifying Logic Programming for Practical
Applications", Prentice Hall, 1989. [Software engineering bent.
Emphasizes advantages of declarative programming.]

Le, Tu Van, "Techniques of Prolog programming, with implementation
of logical negation and quantified goals", John Wiley, New York, 1993.
ISBN: 0-471-57175-X (American edition), 0-471-59970-O (International
edition). LnProlog, a Prolog interpreter that supports negative
finding queries and quantified queries is available together with
the book.

Saint-Dizier, P., "An Introduction to Programming in Prolog",
Springer Verlag, 1990. 184 pages, ISBN 0-387-97144-0 paper ($25).
[Tutorial introduction, with simple examples of AI programs and games.]

Leon Sterling, editor, "The Practice of Prolog", MIT Press, 1990.
342 pages, ISBN 0-262-19301-9, $39.95.

Advanced Prolog Programming:

O'Keefe, Richard A., "The Craft of PROLOG", MIT Press, 1990, 410 pages.
ISBN 0-262-15039-5, $42.50.

Peter Ross, "Advanced Prolog: Techniques and Examples",
Addison-Wesley, 1989, ISBN 0-201-17527-4.

Leon Sterling and Ehud Shapiro, "The Art of Prolog: Advanced
Programming Techniques", 2nd Edition, MIT Press, 1994. 688 pages,
ISBN 0-262-19338-8 ($49.95).
[Source code for the book is available in ftp.cwru.edu:/ArtOfProlog/.
There is a subdirectory for each chapter of the book containing the
text of the programs in that chapter.]

AI and Prolog:

Yoav Shoham, "Artificial Intelligence Techniques in Prolog", Morgan
Kaufmann Publishers, 1993, 400 pages. ISBN 1-55860-167-8 (paper) $39.95.
ISBN 1-55860-319-0 (cloth) $49.95. [Topics include search, backward
chaining, data-driven methods, truth maintenance, constraint
satisfaction, reasoning with uncertainty, planning, temporal
reasoning, machine learning, and natural language processing. Prolog
source for all the programs in the book is available by anonymous ftp
from unix.sri.com:/pub/shoham/]

Bratko, Ivan, "Programming in Prolog for Artificial Intelligence",
2nd Edition, Addison-Wesley, 1990. [Good introduction to Prolog and AI.
A bit large, though, for an Intro to Prolog course. Includes
discussion of the 8-queens problem.]

Dennis Merritt, "Building Expert Systems in Prolog", Springer-Verlag, 1989.
358 pages, ISBN 0-387-97016-9 hardcover ($52).
Explains how to build various expert system shells in Prolog, including
forward/backward chaining, FOOPS, rete-network, frames, solving
Rubik's cube and more. Includes complete source code listings.
(Source code from the book is also sold on disk by Amzi! Inc. and
is available by anonymous FTP from
ftp.std.com:/ftp/vendors/amzi/programs/
ftp.cs.cmu.edu:/user/ai/areas/expert/systems/amzi/programs/
as the files xsip.*)

Dennis Merritt: "Adventure in Prolog", Springer-Verlag, 1990.
186 papers, ISBN 0-387-97315-X hardcover ($38).
Teaches Prolog by leading the reader through the construction of an
adventure game. The exercises lead the reader through three other
programs: an intelligent database, an expert system and an order-entry
program. While most texts teach Prolog with fragments of interesting code,
this book takes a more pragmatic (as opposed to theoretical approach) and
shows the reader how to assemble complete Prolog programs.

Gazdar, G. and Mellish, C., "Natural Language Processing in Prolog:
An Introduction to Computational Linguistics", Addison-Wesley,
Reading, Massachusetts, 1989. (There are three different editions
of the book, one for Lisp, one for Prolog, and one for Pop-11.)

Fernando C.N. Pereira and Stuart M. Shieber, "Prolog and
Natural-Language Analysis", CSLI Lecture Notes Number 10, Stanford,
CA, 1987. 286 pages, ISBN 0-937073-18-0.

Michael A. Covington, "Natural Language Processing for Prolog
Programmers", Prentice-Hall, Englewood Cliffs, NJ, 1994. ISBN
0-13-629213-5.

Harvey Abramson and Veronica Dahl, "Logic Grammars", Springer-Verlag,
New York, 1989, 234 pages, ISBN 0-387-96961-6.

Peter Flach, "Simply Logical: Intelligent Reasoning by Example",
John Wiley & Sons, 1994, 256 pages. ISBN 0-471-94152-2 paper ($31.95).
[Covers theoretical and practical aspects of Prolog programming as well
as AI topics like knowledge representation, search, heuristics,
abduction, default reasoning, and induction. Every technique is
accompanied by a Prolog program that implements it. More information
about the book is available from
http://machtig.kub.nl:2080/Infolab/Peter/SimplyLogical.html
or by email from Peter...@kub.nl.]

Prolog and Object-Oriented Programming:

Chris Moss, "Prolog++ The Power of Object-Oriented and Logic
Programming", Addison-Wesley, 1994. 312 pages, ISBN 0-201-56507-2. UK
price is 21.95 pounds. [This paperback includes a special offer to
obtain a Prolog++ compiler from LPA for Windows 3.1 or Macintosh. UK
price is 29.95 pounds (plus 17.5 percent VAT) plus 5.00 pounds postage
and handling. Elsewhere the cost is $49.95 plus $8 p&h.]

Logic Programming:

Hogger, Christopher J., "Introduction to Logic Programming",
Academic Press, 1984. 278 pages. ISBN 0-12-352090-8 (alk. paper)
ISBN 0-12-352092-4 (pbk.).

Hogger, Christopher J., "Essentials of Logic Programming",
Clarendon Press, Oxford, 1990. ISBN 0-19-853820-0. [Covers both
foundations and more practical material, relating it all to Prolog.
Takes a different approach than his first intro, dividing the book
into many short "themes" instead of chapters, and including many
excercises (with some answers).]

Kowalski, R.A.: "Logic for Problem Solving", New York 1979, Elsevier Publ.

LLoyd, John: "Foundations of Logic Programming", 2nd Edition,
Springer-Verlag, 1988. (Intro to logic programming theory.)

David Maier and David S. Warren: "Computing with Logic: Logic
Programming with Prolog", Benjamin Cummings, Menlo Park, CA, 1989.

Nilsson, Ulf and Maluszynski, Jan, "Logic, Programming and Prolog",
John Wiley & Sons, 1990, ISBN 0-471-92625-6.

Subrata Kumar DAS, "Deductive Databases and Logic Programming",
Addison-Wesley Publishing Company, July 1992, 448 pages.
ISBN 0-201-56897-7.

Constraint Logic Programming and Constraint Satisfaction:

Bennaceur, Hachemi and Gerard Plateau, "An exact algorithm for the
constraint satisfaction problem: Application to logical inference",
Information Processing Letters 48(3):151-158, November 19, 1993.

Cohen, J., "Constraint Logic Programming Languages", Communciations
of the ACM 33(7):52-68, 1992. [Good introduction to CLP and
includes a historical overview.]

Freeman-Benson, B.N., Maloney, J., and Borning, A., "An Incremental
Constraint Solver", Communications of the ACM 33(1):54-63, 1990.
[Includes a good reading list on the history and applications of
constraints.]

Freuder, Eugene C., and Richard J. Wallace, "Partial constraint
satisfaction", Artificial Intelligence 58(1-3):21-70, December 1992.

Van Hentenryck, Pascal, "Constraint Satisfaction in Logic Programming",
MIT Press, Cambridge, MA, 1989, ISBN 0-262-08181-4.

Jaffar, Joxan and Jean-Louis Lassez, "Constraint Logic Programming", in
Proceedings of the 14th ACM Symposium on Principles of Programming
Languages (POPL), Munich, Germany, pages 111-119, 1987.
[A longer version appears in Joxan Jaffar and Jean-Louis Lassez,
"Constraint Logic Programming", Technical Report 86-74, Monash
University, Victoria, Australia, June 1986.]

Kumar, Vipin, "Algorithms for Constraint-Satisfaction Problems: A
Survey", AI Magazine 13(1):32-44, 1992.

Mackworth, Alan K., "The logic of constraint satisfaction", Artificial
Intelligence 58:3-20, 1992.

Meseguer, P., "Constraint Satisfaction Problems: An Overview", AICOM
2(1):3-17, 1989.

Steele, Guy L., "The Definition and Implementation of A Computer
Programming Language Based on Constraints", PhD thesis, MIT, 1980.

Tsang, Edward, "Foundations of Constraint Satisfaction", Academic
Press, 1993. 421 pages, ISBN 0-12-701610-4 ($75). [Good overview.]

Zhang, Ying and Alan K. Mackworth, "Constraint Programming in
Constraint Nets", in Position Papers for the First Workshop on
Principles and Practice of Constraint Programming, pages 303-312,
Newport, RI, April 28-30, 1993.

[See also the articles on Constraint Networks (pages 276-285) and
Constraint Satisfaction (pages 285-293) in Shapiro's Encyclopedia
of Artificial Intelligence.]

Prolog Implementations and WAMs:

Ait-Kaci, Hassan, "Warren's Abstract Machine: A Tutorial Reconstruction",
MIT Press, Cambridge, MA. 1991.
125 pages, ISBN 0-262-51058-8 paper ($17.50), 0-262-01123-9 cloth.

Patrice Boizumault, "The Implementation of Prolog", Princeton
University Press, Princeton, NJ, 1993. Translated by Ara M.
Djamboulian and Jamal Fattouh. ISBN 0-691-08757-1, 357 pages ($49.50).
[The interpreters developed in the book are available by anonymous
ftp from cnam.cnam.fr:/pub/Boizumault/. See [2-1].]

Campbell, J.A. (ed): "Implementations of Prolog", John Wiley, 1984

Peter M. Kogge, "The Architecture of Symbolic Computers",
McGraw-Hill, 1991. ISBN 0-07-035596-7.
Includes sections on memory management, the SECD and
Warren Abstract Machines, and overviews of the various
Lisp Machine architectures.

David Maier and David S. Warren, "Computing with Logic: Logic
Programming with Prolog", Benjamin/Commings Publishing Co., 1988.
ISBN 0-8053-6681-4.

David H. D. Warren: "An Abstract Prolog Instruction Set", Technical Note
No 309, SRI International, Menlo Park, CA, 1983.

David H. D. Warren, "Logic Programming and Compiler Writing," in
Software-Practice and Experience 10(2):97-125, 1980.

J. Cohen and T. Hickey, "Parsing and Compiling using Prolog",
ACM Transactions on Programming Languages and Systems (TOPLAS),
9(2):125-163, 1987.

J. Paakki, "Prolog in practical compiler writing", The Computer
Journal 34(1):64-72, 1991. (But see Letters to the Editor, The
Computer Journal 35(3):313, 1992.)

Jonathan P. Bowen, "From Programs to Object Code using Logic and Logic
Programming", in R. Giegerich and S. L. Graham, editors, Code
Generation -- Concepts, Tools, Techniques, pages 173-192,
Springer-Verlag, 1992.

Jonathan P. Bowen, "From Programs to Object Code and back again using
Logic Programming: Compilation and Decompilation", Journal of
Software Maintenance: Research and Practice 5(4):205-234, December 1993.

Parallel Prologs:

Gregory, Steve: "Parallel Logic Programming in Parlog: The Language
and Its Implementation", Addison-Wesley, 1987, ISBN 0-201-19241-1.

Tick, E.: "Parallel Logic Programming". MIT Press, 1991

Miscellaneous:

Deville, Yves: "Logic Programming, Systematic Program Development",
International Series in Logic Programming, Addison-Wesley, 1990, 338 pages.
ISBN 0-201-17576-2.

Wolfram, D.A., "The Clausal Theory of Types", Cambridge Tracts in
Theoretical Computer Science {\bf 21}, Cambridge University Press,
1993.

Magazine Articles:

PCAI Magzine, September/October 1993. Article on exploring Prolog,
showing the first steps to four applications -- an adventure game, an
object-oriented shell, a tax program, and an animal guessing game.
An excerpt of this article is available from
ftp.cs.cmu.edu:/user/ai/lang/prolog/doc/intro/explore.doc

BYTE Magazine, August 1987. 5 introductory articles on Prolog.
Applications include logic grammars and simulating a microprocessor.

Uwe Schreiweis: Beredte Logik, Konzepte der 'KI-Sprache" Prolog,
(Eloquent Logic, Concepts of the AI language Prolog), iX Magazine,
October 1992, pages 84-90.

Uwe Schreiweis: Basis der Fuenf, Die Sprache Prolog in der Public
Domain, (Base of the Five, Prolog in the Public Domain), iX Magazine,
October 1992, pages 92-94.

Uwe Schreiweis: Fuenfte Generation, Kommerzielle Prolog-Systeme,
(Fifth Generation, Commercial Prolog Systems), iX Magazine, October
1992, pages 96-102.

Klaus Bothe: Weniger Raum, Speicherplatzbezogener Prolog-Benchmark,
(Less Space, A Space Oriented Prolog Benchmark), iX Magazine, October
1992, pages 106-7.

Magazines Related to Prolog:

Logic Programming Newsletter (4 issues/yr)
Included with membership in the Association for Logic Programming
($30 regular, $15 students). For membership information, write to
Valerie Anderson (ALP), DoC-ICSTM, 180 Queens Gate, London SW7 2BZ,
UK, phone +44-171-594-8226, fax +44-171-589-1552, or send email
to a...@doc.ic.ac.uk. Contributions are welcome and should be sent
to Andrew Davidson <a...@cs.mu.oz.au>. Selected articles from the
newsletter are available from the WWW archive
http://www.cs.mu.oz.au/~ad/alp/archive.html

AI Communications (4 issues/yr)
"The European Journal on Artificial Intelligence" ISSN 0921-7126,
European Coordinating Committee for Artificial Intelligence.

AI Expert (issued monthly) ISSN 0888-3785, Miller Freeman Publishers
See a copy of the magazine for list of BBS's in NA. On CompuServe: GO
AIEXPERT. Regularly reviews Prolog interpreters and compilers.
-- Ceased publication in June, 1995.

PC AI (issued bi-monthly) ISSN 0894-0711, Knowledge Technology Inc.
Regularly reviews Prolog systems and applications.
See http://www.pcai.com/pcai

Expert Systems (issued Feb, May, Aug and Nov) ISSN 0266-4720,
Learned Information (Europe) Ltd. Subscription: GBP 85 or USD 110

IEEE Expert (issued bimonthly) ISSN 0885-9000, IEEE Computer Society

The Journal of Logic Programming (issued bimonthly), (North-Holland),
Elsevier Publishing Company, ISSN 0743-1066

New Generation Computing, Springer-Verlag. (LOTS of Prolog in it.)

----------------------------------------------------------------
Subject: [1-4] Prolog and Logic Programming Associations and Journals

ASSOCIATION FOR LOGIC PROGRAMMING (ALP)
Members receive the ALP Newsletter.

For information on membership ($30 regular, $15 students), contact

Valerie Anderson
ALP Administrative Secretary
Department of Computing
Imperial College
180 Queen's Gate
London, SW7 2BZ, UK

Email: v...@doc.ic.ac.uk
Fax: +44 171 589 1552
Phone: +44 171 594 8226

Newsletter submissions should be sent to

Andrew Davison
Department of Computer Science
University of Melbourne
Parkville
Melbourne, Victoria 3052
AUSTRALIA

Email: a...@cs.mu.oz.au
Fax: +61 3 348 1184
Phone: +61 3 344 7207 / 5230
Telex: AA 35185

----------------------------------------------------------------
Subject: [1-5] FTP Archives and Other Resources

The following are achives that contain Prolog-related material, such as
code, interpreters, articles, etc. Most of the archives are ftp sites.
They are listed by domain.name and [IP Address]. To access them and
download programs type at the prompt:

ftp <site name> (or IP address)
login: "anonymous",
password: your own return email address,
cd <directory>, ls to see files,
set binary,
get <filename> to transfer file to your system
stop with quit or exit

Deviations from this general scheme may occur but the above should
work in most cases.

CMU AI Repository, Prolog Section:

The Prolog Section of the CMU Artificial Intelligence Repository
(aka "The Prolog Repository") is accessible by anonymous ftp to
ftp.cs.cmu.edu:/user/ai/lang/prolog/ [128.2.206.173]
through the AFS directory
/afs/cs.cmu.edu/project/ai-repository/ai/lang/prolog/
or by WWW from the URL
http://www.cs.cmu.edu/Web/Groups/AI/html/repository.html
and includes more than 110 megabytes of sources and other materials
of interest to Prolog programmers, including all freely
distributable implementations and many programs. The contents of the
CMU AI Repository has been keyword indexed to provide convenient
browsing of the contents.

The repository has standardized on using 'tar' for producing
archives of files and 'gzip' for compression.

To search the keyword index by mail, send a message to:
ai+q...@cs.cmu.edu
with one or more lines containing calls to the keys command, such as:
keys prolog gui
in the message body. Keywords may be regular expressions and are
compared with the index in a case-insensitive conjunctive fashion.
You'll get a response by return mail. Do not include anything else in
the Subject line of the message or in the message body. For help on
the query mail server, include:
help
instead.

A Mosaic interface to the keyword searching program is in the
works. We also plan to make the source code (including indexes) to
this program available, as soon as it is stable.

Most of the Prolog Section of the AI Repository appears on Prime Time
Freeware for AI, Issue 1-1, a mixed-media book/CD-ROM publication. It
includes two ISO-9660 CD-ROMs bound into a 224 page book and sells
(list) for US$60 plus applicable sales tax and shipping and handling
charges. Payable through Visa, Mastercard, postal money orders in US
funds, and checks in US funds drawn on a US bank. For more
information write to Prime Time Freeware, 370 Altair Way, Suite 150,
Sunnyvale, CA 94086 USA, call 408-433-9662, 408-433-0727 (fax),
or send email to p...@cfcl.com.

Contributions of software and other materials are always welcome but
must be accompanied by an unambiguous copyright statement that grants
permission for free use, copying, and distribution -- either a
declaration by the author that the materials are in the public domain,
that the materials are subject to the GNU General Public License (cite
version), or that the materials are subject to copyright, but the
copyright holder grants permission for free use, copying, and
distribution. (We will tell you if the copying permissions are too
restrictive for us to include the materials in the repository.)
Inclusion of materials in the repository does not modify their
copyright status in any way. Materials may be placed in:
ftp.cs.cmu.edu:/user/ai/new/
When you put anything in this directory, please send mail to
ai+co...@cs.cmu.edu
giving us permission to distribute the files, and state whether
this permission is just for the AI Repository, or also includes
publication on the CD-ROM version (Prime Time Freeware for AI).
We would also appreciate if you would include a 0.doc file for your
package; see /user/ai/new/package.doc for a template. (If you don't
have the time to write your own, we can write it for you based on
the information in your package.)

The Prolog Section of the AI Repository is maintained by Mark Kantrowitz
<AI.Rep...@cs.cmu.edu>.

Artificial Intelligence Programs:
ai.uga.edu:/pub/ [128.192.12.9]

The University of Georgia AI FTP Library contains public domain
Prologs, such as Open Prolog and ESL PD Prolog, PrEd (a small text
editor for Prolog), and some miscellaneous prolog programs in
ai.uga.edu:/pub/prolog/
A copy of the programs from the book by Covington, Nute, and Vellino, (see
the section on Books below), is in
ai.uga.edu:/pub/prolog.book/
and the draft ISO standard for prolog is in
ai.uga.edu:/pub/prolog.standard/
Some technical reports with accompanying code are in
ai.uga.edu:/pub/ai.reports/
Other materials of interest are in
ai.uga.edu:/pub/natural.language/
ai.uga.edu:/pub/natural.language.book/
Maintained by Michael Covington <mcov...@ai.uga.edu>.

ALE:
ALE (Attribute Logic Engine), a freeware system written in
Prolog, integrates phrase structure parsing and constraint logic
programming with typed feature structures as terms. Types are
arranged in an inheritance hierarchy and specified for the features
and value types for which they are appropriate. Grammars may also
interleave unification steps with logic program goal calls (as can be
done in DCGs), thus allowing parsing to be interleaved with other
system components. While ALE was developed to handle HPSG grammars,
it can also execute PATR-II grammars, DCG grammars, Prolog, Prolog-II,
and LOGIN programs, etc. Grammars and programs are specified with a
version of Rounds-Kasper Attribute Value Logic with macros and
variables. ALE supports lexical rules and empty categories for
grammars, using a bottom-up, all-paths dynamic chart parser. ALE
supports last call optimization, negation by failure and cuts in
definite clauses, which may be used independently or integrated into
grammars. The system is distributed with several sample grammars,
including a fairly comprehensive implementation of a head-driven
phrase structure grammar for English. Version 2.0 of ALE is
available free for research purposes by anonymous ftp from
j.gp.cs.cmu.edu:/usr1/carp/ftp/
as the files ale.*, or from the CMU AI Repository in
ftp.cs.cmu.edu:/user/ai/lang/prolog/code/parsing/ale/
For more information write to Bob Carpenter <ca...@lcl.cmu.edu> or
Gerald Penn <pe...@lcl.cmu.edu>.

ALP-UK Library:
The best Prolog library currently is the one collected by the ALP-UK
group. It is available to members at 30 pounds sterling for a Sun
cartridge or 2 pounds/IBM DOS disk. (non-members maybe, how much?) It
contains MBs of Prolog systems (including SB Prolog), libraries
(including the Edinburgh library), benchmarks, grammars, theorem provers,
object and graphics systems etc. For more information, write to ALP-UK
Library, Sanjay Raina, Librarian, Dept. of Computer Science, University
of Bristol, University Walk, Bristol BS8 1TR, UK, call +44 0272 303030
x3304, or send email to ra...@compsci.bristol.ac.uk.

CASLOG
CASLOG (Complexity Analysis System for LOGic) is an experimental
semi-automatic complexity analysis system for logic programs. It can
perform the worst-case analysis for complexity measures: argument size
complexity, number of solutions complexity, and time complexity.

CASLOG extends the techniques developed for analyzing imperative and
functional languages to deal with nondeterminism and generation of
multiple solutions via backtracking in logic languages. The analyses
for different complexity measures are implemented in a unified
framework and share several common features. First, the predicates in
a program are processed in an order generated by a bottom-up
topological sorting over the call graph of the program. Second, the
complexity function for a predicate is derived from the complexity
function of its clauses by using the information about the mutual
exclusion relationships between its clauses. Third, the complexity
function for a clause is inferred based on the data dependency
relationships between its literals. Fourth, the complexity functions
for recursive clauses are in the form of difference equations and are
transformed into closed form functions using difference equation
solving techniques. This unified framework can simplify proofs of
correctness and the implementation of the algorithms.

CASLOG is available by anonymous ftp from cs.arizona.edu:/caslog/. This
is an alpha distribution, and includes CASLOG version 1.0, a
preliminary user manual, a paper on CASLOG, and a set of examples.
For more information, contact Nai-Wei Lin <nai...@cs.arizona.edu>.

Constraint Programming Paper Archive:
Aarhus University, Denmark, has established an anonymous ftp archive
for papers on "Constraint Programming" at ftp.daimi.aau.dk:/pub/CLP/.
For further information, contact Brian H. Mayoh <br...@daimi.aau.dk>.

CSP:

Some constraint-related papers by a research group at the
University of Washington are available by anonymous ftp from
june.cs.washington.edu:/pub/constraints/papers/
The papers from the 1994 Principles and Practice of Constraint
Programming Workshop are available in
june.cs.washington.edu:/pub/constraints/papers/ppcp94/
There are also implementations of several constraint satisfaction
algorithms and constraint-based systems, including the DeltaBlue and
SkyBlue algorithms, the Multi-Garnet user interface toolkit, ThingLab
II, and CoolDraw (a constraint-based drawing system), in
subdirectories of
june.cs.washington.edu:/pub/constraints/code/
The ftp archive is also accessible via WWW:
http://web.cs.city.ac.uk/archive/constraints/constraints.html
All the source code is in the public domain. For more information,
write to Alan Borning <bor...@geoduck.cs.washington.edu>.

C implementations of a number of constraint satisfaction algorithms
are available by anonymous ftp from
ftp.cs.ualberta.ca:/pub/ai/csp/
Get the files README and csplib.tar.Z. The algorithms include
variations on backtracking (backjumping, backmarking, chronological
backtracking, etc.), local consistency preprocessing algorithms (e.g.,
arc consistency), and random problem generators. For more information,
write to Peter van Beek <van...@cs.ualberta.ca>.

Eden:
Eden is a Poplog-based AI microworld developed by Simon Perkins,
Jocelyn Paine and Edmund Chattoe of the Oxford University Artificial
Intelligence Society. It is intended to serve as a testbed for
learning and planning programs. Programs written in Pop-11, Prolog,
Lisp, and ML control a "bug" that lives in a 2-dimensional world. Any
kind of algorithm may be used to control the bug, including genetic
algorithms, neural nets, and rule-based systems. Eden consists of a
grid of cells, each of which can contain objects such as keys, doors,
boulders and quicksand. Bug's objective is to find and eat a piece of
food which the simulator has placed somewhere within this grid. To do
this, Bug must negotiate its way towards the food while dealing
intelligently with obstacles. Eden's laws of physics allow Bug to take
one of several different actions when it encounters an object. The
simulator then works out the consequences of the chosen action on Bug
and on Eden, and displays these graphically in a Ved window. Bug's
perceptions are updated to reflect the new state of the world, and the
cycle repeats. Eden is available by anonymous ftp from the Imperial
College archive in
src.doc.ic.ac.uk:/packages/prolog-pd-software/ [146.169.2.10]
as the file eden.tar.Z. (Note: This is really a link to the
directory computing/programming/languages/prolog/pd-software/.)
Eden includes PopBeast, a simple Prolog bug which can read and
parse simple commands, extract their meaning, plan how to satisfy
these commands, and then carry out the plans.

Parts of the current Eden are coded in Pop-11, so porting it to
Prologs other than Poplog will require some effort. Most of the
recoding needed is in the grid-world simulator and the definition of
objects. Send mail to Jocelyn Paine <po...@vax.oxford.ac.uk> if
you're willing to try this.

FW_Rules:

FW_RULES is a Sicstus Prolog library providing a compiler for forward
chaining rules. The implementation is based on a non-state saving
technique coupled with an indexing mechanism on the working memory
based on C bitwise operations to achieve efficiency. The library
supports interoperability between the forward chaining language and
the underlying Prolog engine. Terms in the working memory are
represented as Prolog facts and can be accessed from Prolog to perform
deduction. It is available by anonymous FTP from
ftp.cs.unibo.it:/pub/gaspari/fw_rules/
as the files README and fw_rules.tar.Z. For more information,
please write to Mauro Gaspari <gas...@cs.unibo.it>.

HDRUG:

Hdrug is an environment to develop logic grammars, parsers, and
generators for natural languages. The package comes with a number of
example grammars, including a Categorial Grammar, a Tree Adjoining
Grammar, a Unification Grammar in the spirit of Head-driven Phrase
Structure Grammar, an Extraposition Grammar, a Definite Clause
Grammar, and a port of the HPSG grammar from Bob Carpenter's ALE
system. Each of the grammars comes with a set of parsers, such as
Earley-like chart parsers, left-corner parsers and head-driven
parsers. Some grammars come with variants of the head-driven
generator. The package allows easy comparison of different
parsers/generators, extensive possibilities of compiling feature
equations into Prolog terms, graphical (Tk), LaTeX and ordinary Prolog
output of trees, feature structures and Prolog terms, and plotted
graphs and tables of statistical information. Hdrug runs in Sicstus
Prolog and requires ProTcl and Tcl/Tk. It is available by anonymous
FTP from
tyr.let.rug.nl:/pub/prolog-app/Hdrug/
or by WWW from
http://tyr.let.rug.nl/~vannoord/prolog-app/Hdrug/
For more information, write to Gertjan van Noord <vann...@let.rug.nl>.

Logic Programming Bibliographies:
duck.dfki.uni-sb.de:/pub/lp-proceedings/ [134.96.188.92]

The ftp server supports tar'ing on the fly, so if you type "get
bibtex.tar" you will get a tar'ed version of the "bibtex" directory.

BibTeX entries for the proceedings of the following conferences
are included: SLP84-87,91, NACLP89-90, ILPS91, ICLP82,84,86-91,93,
JICLP92, LP88, RTA89,93, PLILP90-92, ALPUK91, ICOT92, ALP90,92,
CADE90,92, CTRS90,92, LICS86-91, UNIF89, EPIA89,91,93, TACS91,
TAPSOFT93, EAIA90, FGCS92, FAC, ILPS93, PEPM91,93
and the following journals: JLP85-93, JAR91-93, JSC91-93, IANDC82-92.

The bibliography is mirrored by the Universidade Nova de Lisboa.
In addition, the bibliography can be searched using either WAIS or
GOPHER. To search the lp-proceedings using WAIS, use the
lp-proceedings.src
wais source, available from the directory of servers. To search the
lp-proceedings using GOPHER, point the client to gopher.fct.unl.pt,
and follow the directories
"Research/Bibliography/Logic Programming Proceedings".
Searching should be easier than retrieving the entire package every
time you want to locate a particular article.

Send comments and bug reports to rschei...@dfki.uni-sb.de.

Machine Learning Algorithms Implemented in Prolog:

In 1988 the Special Interest Group on Machine Learning of the German
Society for Computer Science (GI e.V.) decided to establish a library
of PROLOG implementations of Machine Learning algorithms. The library
includes - amongst others - PROLOG implementations of Winston's arch,
Becker's AQ-PROLOG, Fisher's COBWEB, Brazdil's generation of
discriminations from derivation trees, Quinlan's ID3, FOIL, IDT,
substitution matching, explanation based generalization, inverse
resolution, and Mitchell's version spaces algorithm.
All algorithms are written in Edinburgh Prolog syntax. Most of the
algorithms are copyleft under the GNU General Public License.
The programs are currently available via anonymous ftp-server from
the GMD:

ftp.gmd.de:/gmd/mlt/ML-Program-Library/ [129.26.8.84]

They are also available by surface mail from Thomas Hoppe,
Projektgruppe KIT, Technische Universitaet Berlin, Franklinstr. 28/29,
10629 Berlin, Germany. Files will be distributed via MS-DOS formated
3.5 inch floppy (double, high and extra-high density), which should
be included with your request. You can also get them by sending an email
message to Thomas Hoppe (see below).

Send additional PROLOG implementations of Machine Learning
Algorithms, complaints about them and detected bugs or problems
to Thomas Hoppe, <hop...@cs.tu-berlin.de>. Send suggestions and
complaints about the ftp library to Werner Emde, Gesellschaft
fuer Mathematik und Datenverarbeitung, Bonn, <em...@gmd.de>.

Natural Language Processing in Prolog:

The Prolog and DCG programs from Pereira and Shieber's book, "Prolog
and Natural Language Analysis", are available by anonymous ftp from
ftp.das.harvard.edu:/pub/shieber/pnla/. See the file README for the
conditions under which the material is distributed. If you retrieve
the files, please send an email message to the authors letting them
know how you plan to use them. For further information, write to
Fernando Pereira <per...@research.att.com> or Stuart Shieber
<shi...@das.harvard.edu>.

Parser:
A parser for standard Prolog text written in C is available by
anonymous ftp from
trappist.elis.rug.ac.be:/pub/prolog/
It consists of only three modules (tokenizer, parser, and display
routine) and an interface module to integrate it with an existing
Prolog system. It is completely deterministic and about 10 times
faster than O'Keefe's public domain parser written in Prolog.
For more information, write to Koen De Bosschere <k...@elis.rug.ac.be>.

Partial Evaluation:

Prolog code for the partial evaluator for the flowchart language
described in Ch. 4 of "Partial Evaluation and Automatic Program
Generation" by Jones, Gomard and Sestoft is available for anonymous
ftp from
ftp.diku.dk:/pub/diku/dists/jones-book/ch4_pl.tar.Z
All three Futamura projections are implemented. The code has been
tested under SWI Prolog 1.5 and 1.7 and should hopefully port to other
prologs without too many problems. For more information, please
contact Zerksis Umrigar <umr...@cs.binghamton.edu>.

Pleuk Grammar Development System:

Pleuk is intended to be a shell for grammar development, in that many
different grammatical formalisms can be embedded within it.
Grammatical formalisms that currently work with Pleuk include CFG (a
simple context-free grammar system), HPSG-PL (a system for developing
HPSG-style grammars, produced at Simon Fraser University, Canada, by
Fred Popowich, Sandi Kodric and Carl Vogel), Mike (a simple
graph-based unification system, enhanced with additional operations
for the treatment of free word order proposed by Mike Reape in various
publications), SLE (a graph-based formalism enhanced with arbitrary
relations in the manner of Johnson & Rosner and Doerre & Eisele.
Delayed evaluation is used to compute infinite relations. This system
has been used for the development of several HPSG-style grammars) and
Term (a term-based unification grammar system, originally developed
for the support of Unification Categorial Grammar of Zeevat, Klein and
Calder). Sample grammars are provided for all of these formalisms.
Work continues apace on other formalisms, including Bob Carpenter's
Ale system for typed feature structures, and Veronica Dahl's Static
Discontinuity Grammars.

Pleuk requires SICStus prolog version 2.1#6 or later, plus a variety
of ancillary programs available free of charge from many FTP servers.
Pleuk is available via anonymous FTP from the University of Georgia
Artificial Intelligence FTP library
ai.uga.edu:/pub/natural.language/
as the files pleuk.1.0.tar.Z, pleuk.PSmanuals.tar.Z, and pleuk.README.
Pleuk will also be available shortly from the Natural Language
Software Registry, German Research Institute for Artificial
Intelligence (DKFI), Saarbruecken. For more information, send email
to pl...@cogsci.ed.ac.uk.

Prolog Repository:
Established by Jocelyn Paine of Experimental Psychology, Oxford
University in 1987. The current catalogue (January 1991) contains
30 entries. For catalogue, queries and contributions contact POPX at:
popx%vax.ox...@oxmail.ox.ac.uk (internet) or
po...@uk.ac.ox.vax (janet)

FTP access is available through the Imperial College archive at
src.doc.ic.ac.uk:/packages/prolog-pd-software/ [146.169.2.10]
This is actually a link to the directory
/computing/programming/languages/prolog/pd-software/

To access it, cd to either of the above directories via
anonymous ftp. The file README gives a brief summary of the
contents of the directory and CATALOGUE gives a (long!)
description of each entry. Entries include the Logic Programming
Tutor from Paine's book, the DEC-10 public-domain library, the
Linger natural-language corrector, a simple object-oriented
add-on for Prolog, graph utilities, among other things.

Files in the archive are also available on MS-DOS floppies for a
nominal fee to cover the cost of floppies, postage, and packing.

Prolog to SQL Compiler:
The Prolog to SQL Compiler translates database access requests,
which consist of a projection term and a database goal, to the
appropriate SQL query. The compiler is written in standard Edinburgh
Prolog and has been ported to a number of Prologs. The code posted to
comp.lang.prolog works in ECRC's SEPIA Prolog, but should be easily
ported to other Prologs. A detailed tech report on the implementation
is available by email from dra...@cis.uni-muenchen.de (include
your full postal address). The compiler is copyright, but may be used
free of charge for non-commercial purposes and redistributed provided
the copyright notice is retained intact.

PSI:
PSI is a handy system for the management and retrieval of your
personal data, be it addresses, CD collections, or bibliographic
references. It is intended for the non-commercial user. It may not be
as full-fledged as some data-base systems, but has some features that
you won't find in most commercial systems. Also, you may find it
easier to set up and faster to use. PSI is useful for a broad range of
data. Indexing with descriptors makes searching for the data you need
fast, and the interface to other data-base formats (import and export)
is quite powerful. PSI was written in LPA MacProlog and is a "genuine
'double clickable' Mac application". PSI runs on all Macs with System
6 or 7 in 1MB of main memory. As LPA MacProlog isn't yet 32-bit clean,
PSI isn't either. Extensive documentation and some examples are
included. PSI is available by anonymous ftp from
sumex-aim.stanford.edu:/info-mac/app/ as the file psi-23.hqx. It
was also available on a recent Nautilus CD-ROM and will be on the
first Info-Mac CD-ROM.

Queens and Knights:
Queens and Knights are favorite problems for Prolog programmers.
A collection of several implementations is available by anonymous
ftp from sics.se:/pub/muse/queensANDknights.tar.Z.uue
Write to Roland Karlsson <rol...@sics.se> for more information.

Rubik's Cube:
Amzi! Inc., the creators of Cogent Prolog, have made sources to Cube Solver
II available from their ftp site, ftp.std.com:/vendors/amzi/. It is
also available from the Prolog Repository at CMU, in
ftp.cs.cmu.edu:/user/ai/lang/prolog/code/fun/rubik/. This Prolog
program solves Rubik's Cube. The sources include a simple scrolling
interface that should work in any Edinburgh standard Prolog. Also
included is a ready-made executable for 386 and 486 PCs; it was
implemented using Cogent Prolog. For more information, write to Amzi!
Inc. (formerly Amziod) <am...@world.std.com>, 40 Samuel Prescott Dr.,
Stow, MA 01775, Tel: 508-897-7332. Fax: 508-897-2784. Their Web page is
http://world.std.com/~amzi/

SEL:
SEL is a declarative set processing language. Its main features are
subset and equational program clauses, pattern matching over sets,
support for efficient iteration and point-wise/incremental computation
over sets, the ability to define transitive closures through circular
constraints, meta-programming and simple higher-order programming, and
a modest user-interface including tracing. The language seems
well-suited to a number of problems in graph theory, program analysis,
and discrete mathematics. The SEL compiler is written in Quintus
Prolog and the run-time system is written in C. It generates WAM-like
code, extended to deal with set-matching, memoization, and the novel
control structure of the language. SEL is available by anonymous FTP
from ftp.cs.buffalo.edu:/users/bharat/SEL2/. The FTP release comes with a
user manual, bibliography of papers (including .dvi files), several
sample programs, and source code. For further information, write to
Bharat Jayaraman <bha...@cs.buffalo.edu>.

A public-domain WAM emulator, written in C++ by Herve Touati, is
available by anonymous FTP from gatekeeper.dec.com:/pub/plan/prolog/ucb/.

----------------------------------------------------------------
Subject: [1-6] Free Object-Oriented Systems for Prolog

OL(P), Object Layer for Prolog, is an object-oriented extension to
Prolog. It provides an object-oriented structuring and reuse
mechanism for Prolog in a manner that preserves performance and
semantics. The object-oriented layer is compiled into Prolog without
introducing any side-effects. OL(P) takes the view of objects as
collections of predicates (called methods). To Prolog, OL(P) 1.1 adds
objects with methods, data encapsulation, instances, and multiple
inheritance. Object methods can access Prolog predicates and vice
versa. The OL(P) incremental compiler translates OL(P) programs to
Prolog programs that don't need runtime interpretation (e.g., no
search is needed for inheritance). OL(P) 1.1 comes with prepared
installation for SICStus Prolog and QUINTUS Prolog (both on UNIX),
documentation, simple built-in project management, some libraries,
and example programs. The source is included, so you can port OL(P)
to different platforms, different Prolog systems, and different
logic programming languages. OL(P) is available by anonymous ftp
from parcftp.xerox.com:/ftp/pub/ol/ [13.1.64.94]. Written by Markus
P.J. Fromherz <from...@parc.xerox.com>.

LogTalk is a free object oriented extension to the Prolog programming
language. It is based on a reflexive architecture intended to provide
an open system, easily tailored to user needs. It implements simple
inheritance and a delegation mechanism. Logtalk enables users to
define new types of slots, each one with its own semantics, that can
be reused by any object. It includes features for event-based
programming. This enables the creation of elegant solutions to
represent and maintain relations that restrict the internal state of
participating objects. Logtalk (and more information about it) is
available using the URL
http://cygnus.ci.uc.pt/logtalk/logtalk.html
For more information, write to the author Paulo Moura <pmo...@cygnus.uc.pt>.

See Common ESP (CESP) in [2-1] and BeBOP in [2-3].

----------------------------------------------------------------
Subject: [1-7] Commercial Object-Oriented Systems for Prolog

LAP is an object-oriented system by Elsa. For more information, write
to Elsa Software, La Grange Dame Rose, 6 ave du Marechal Juin, 92366
Meudon-La-Foret Cedex, France, call +33 (1) 46 30 24 55, fax +33 (1)
46 30 55 26, or send email to elsa!l...@uunet.uu.net.

SPIRAL is an object oriented system by CRIL for Sun3 and Sun4 under
Unix. For more information, write to CRIL, Conception et Realisation,
Industriel de Logiciel, 146 bd de Valmy 92707, Colombes Cedex, France,
call +33 1 47 69 53 67, or fax +33 1 47 69 53 99.

Quintus Prolog (see [2-2]) has an object system documented in
http://www.quintus.com/prolog/obj.html
and in Peter Schachte's home page,
http://muse.cs.mu.oz.au/%7Epets/
Quintus objects are updateable data structures whose slots can contain
Prolog terms. (For increased efficiency, a slot can be constrained to
hold a specific C-style type.) Because the objects are updateable,
they offer and efficient alternative to storing modifiable data in the
Prolog database.

Mark Kantrowitz

unread,

Jul 13, 1997, 3:00:00 AM7/13/97

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

Maintainer: Mark Kantrowitz <mkan...@cs.cmu.edu>
URL: http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/lang/prolog/prg/top.html

Size: 91137 bytes, 1682 lines

;;; 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.

Send suggestions and comments to: mkant+pro...@cs.cmu.edu

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,
at <in...@pap.com>.

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:
prep.ai.mit.edu:/pub/gnu/
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
ftp.cs.cmu.edu:/user/ai/lang/prolog/impl/

A.D.A. Public Domain Prolog:
aisun1.ai.uga.edu:ai.prolog/adapdpro.zip

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
penalty.

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
message to list...@acal-server.usc.edu with
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
send email to aqua...@acal-server.usc.edu.

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
predicates.

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
account.

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/ [131.206.1.101]

or from the CMU AI Repository in

ftp.cs.cmu.edu:/user/ai/lang/prolog/impl/prolog/beta_pl/
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
Neng-Fa Zhou, <zh...@mse.kyutech.ac.jp>, Faculty of Computer Science
and Systems Engineering, Kyushu Institute of Technology, 680-4 Kawazu,
Iizuka, Fukuoka 820, Japan, phone 81-948-29-7774, fax 81-948-29-7760.
For more information, send mail to betap...@cad.mse.kyutech.ac.jp.

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

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
<binp...@info.umoncton.ca>.

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 and high
performances make it suitable to be integrated in industrial
C-applications that need the services of an embedded logic
programming engine.

Boizumault Prolog:
The various Prolog interpreters described in Patrice Boizumault's
book, "The Implementation of Prolog", are available by anonymous
ftp from
cnam.cnam.fr:/pub/Boizumault/

or from the CMU AI Repository in

ftp.cs.cmu.edu:/user/ai/lang/prolog/impl/prolog/boiz_pl/
The three interpreters, corresponding to appendices A through D of
the book, are written in Common Lisp. Examples which run in all the
interpreters include cryptarithms, Eliza, Sieve of Eratosthenes,
Factorial, N-Queens, and Quicksort. For more information, write to
Patrice Boizumault <bo...@math-appli-uco.fr>.

Common ESP:
CESP (Common Extended Self-contained Prolog) is an object-oriented
system by the AI Language Research Institute, Kamakura, Japan. The
binary is free for R & D use only -- send 1/4in CMT Sun3 and Sun4
(Sparc) with Sun OS R4.0.3, R4.1 or R4.1.1. For more information,
write to AI Language Research Institute Ltd, Yoshitoku Bldg, Shiba
3-15-14, Minato-Ku, Tokyo 105, Japan, fax +81 3 3456 4418, or send
email to k-h...@air.co.jp or mats...@air.co.jp.

cu-Prolog: See [2-5].

ECLiPSe (ECRC Logic Programming System) combines the functionalities
of several ECRC systems, including SEPIA (an Edinburgh-style
extensible Prolog system based on a WAM compiler), MegaLog (a database
system) and CHIP (a constraint logic programming system). ECLiPSe
includes a Prolog compiler with extended functionality that is Quintus
and SICStus compatible, a tightly connected database system based on
the BANG file system, a CLP system, and an interface to the Tcl/Tk X11
toolkit. The BANG database can store not only relations, but also any
Prolog structures and programs. The CLP system contains several
libraries with various types of constraint handling schemes, including
atomic finite domains, linear rational constraints, CHR (constraint
handling rules) and Propia (generalised propagation). It also
supports writing further extensions like new user-defined constraints
or complete new constraint solvers. ECLiPSe also includes a profiler,
user-definable syntax, metaterms as first-class citizens, coroutining,
a high-level debugger (OPIUM), a partial evaluation system (PADDY),
and unlimited precision integer and rational numbers. ECLiPSe is
available for a nominal fee of DM 300 (~$200) to all academic and
government-sponsored organizations. It is distributed in binary form
for Sun-3 and Sparc machines. Send orders or requests for further
information to eclipse...@ecrc.de or write to ECRC,
Arabellastrasse 17, 81925 Munich, Germany. The ECLiPSe documentation
(ASCII and dvi) and some shareware packages ported to ECliPSe are now

available by anonymous ftp from

ecrc.de:/pub/eclipse
To subscribe to the eclips...@ecrc.de mailing list, send mail to
eclipse...@ecrc.de. The tech support email address is
eclips...@ecrc.de.

eLP (Ergo Lambda Prolog) is an interpreter written by Conal Elliott,
Frank Pfenning and Dale Miller in Common Lisp and implements the core
of lambda Prolog (higher-order hereditary Harrop formulas). It is
embedded in a larger development environment called ESS (the Ergo
Support System). eLP implements all core language feature and offers
a module system, I/O, some facilities for tracing, error handling,
arithmetic, recursive top-levels, on-line documentation and a number
of extended examples, including many programs from Amy Felty's and
John Hannan's thesis. It should run in Allegro Common Lisp, Lucid
Common Lisp, Kyoto Common Lisp, CMU Common Lisp and Ibuki Common Lisp.
The eLP implementation of lambda Prolog is no longer developed or
maintained, but it is still available via anonymous ftp from
ftp.cs.cmu.edu:/afs/cs.cmu.edu/project/ergo/export/ess/. The file
ergolisp.tar.Z contains the Ergo project's extensions to Common Lisp,
including some facilities for attributes and dealing with abstract
syntax trees. The file sb.tar.Z contains the Ergo
Parser/Unparser/Formatter generator and ab.tar.Z contains the Ergo
Attribute Grammar facility. The file elp.tar.Z contains the Ergo
implementation of lambda Prolog. To customize grammars you need the
sb.tar.Z file. When you retrieve the system, please print, fill out,
and send in a copy of the non-restrictive license you will find in the
file LICENSE. To subscribe to the e...@cs.cmu.edu mailing list, send
mail to elp-r...@cs.cmu.edu. Bugs should be sent to
elp-...@cs.cmu.edu.

ESL Prolog-2 (PD Version):
ai.uga.edu:ai.prolog/eslpdpro.zip [128.192.12.9]

A prolog for MS-DOS systems with good performance. It deviates
slightly from Edinburgh standard (strings "like this" are not lists
of ASCII codes), but you can add a declaration that makes it fully
Edinburgh-compatible. (Add the line
:- state(token_class,_,dec10).
at the beginning of the program.) It is a more limited version
of the interpreter from the Commercial Version (see [2-2] below).
[Please note that ESL Prolog is NOT a UGA product, they just run
the machine on which a copy is made available. Anyone with
questions should contact ESL in Oxford, England (see [2-2] below).
The commercial version of ESL Prolog-2 has been sold to ESI.]

Documentation is available as a 2-volume set published by Ablex
(type "prolog2" for info). ESL Prolog is also discussed
extensively in Tony Dodd's book "Prolog: A Logical Approach,"
Oxford University Press.

GOEDEL is intended to be a declarative successor to Prolog. The main
design aim of Goedel is to have functionality and expressiveness
similar to Prolog, but to have greatly improved declarative semantics
compared with Prolog. This improved declarative semantics has
substantial benefits for program construction, verification,
debugging, transformation, and so on. Considerable emphasis is placed
on Goedel's meta-logical facilities, since this is where Prolog is
most deficient. In particular, Goedel has declarative replacements
for Prolog's var, nonvar, assert, and retract. Goedel is a strongly
typed language, its type system being based on many-sorted logic with
parametric polymorphism. It has a module system, and supports floating
point numbers and infinite precision integers and rationals. It can
solve constraints over finite domains of integers and also linear
rational constraints. It supports processing of finite sets. It also
has a flexible computation rule and a pruning operator which
generalises the commit of the concurrent logic programming languages.
The release includes the Goedel system, the SAGE partial evaluator for
Goedel, a user manual, and 50 example programs. Goedel must be
compiled in SICStus Prolog 2.1 #6 or later; Sparc and Linux
executables are included in the distribution. Goedel is available by
anonymous ftp from
ftp.cs.kuleuven.ac.be:/pub/logic-prgm/goedel/ [134.58.41.2]
ftp.cs.bris.ac.uk:/goedel [137.222.102.102]
For more information, write to goe...@compsci.bristol.ac.uk. Please
send an email message to this address (with your name, institution and
address) to this address when you obtain the system. To subscribe to
the goedel...@compsci.bristol.ac.uk mailing list, send mail to
goedel-use...@compsci.bristol.ac.uk
indicating that you wish to join the Goedel discussion group.
A book describing the language is now available from MIT Press:
Patricia Hill and John Lloyd, "The Godel Programming Language",
MIT Press, Cambridge, MA, 1994. ISBN 0-262-08229-2 ($45.00).

IC-Prolog II:
src.doc.ic.ac.uk:/computing/programming/languages/prolog/icprolog/.
The emulator is available at present only in Sun-4 binary form.
Source code may be released later in the year when project
finishes.

Produced by Imperial College, IC-Prolog II is a multi-threaded
Prolog system. It includes a Parlog sub-system, an interface to
TCP primitives and "mailboxes", a high level communication
system. These enable distributed applications (such as
client/server systems) to be written using logic programming.
The distribution also includes a simple expert system shell and
the preprocessor for the Prolog language extension L&O from the
book "Logic & Objects" by Frank McCabe. (The sources for the
L&O extension is also available to LPA MacProlog users in the
subdirectory 'lo'.)

See "I.C. Prolog II : a Multi-threaded Prolog System" by Damian
Chu and Keith Clark and also "IC Prolog II: a Language for
Implementing Multi-Agent Systems" by Damian Chu. Postscript
copies of these two papers may be found in the subdirectory
'papers'.

Standalone versions of the Parlog system for Sun-3 and Sun-4
can also be found in this directory.

Contact Damian Chu <d...@doc.ic.ac.uk> for questions about IC
Prolog II, and contact Zacharias Bobolakis <z...@doc.ic.ac.uk> for
information about L&O.

JB-Prolog 2.1.2 is a slim and powerfull prolog for the MacIntosh. Its key
features are: Arbitrary long integers, fast interpreter only, source
line debugger, user interface toolkit, persistent objects. It is
available from the CMU AI repository as
ftp.cs.cmu.edu:/user/ai/lang/prolog/impl/prolog/jbprolog/JBprolog2.1.2.sit.hqx
For more information contact Jan Burse, jbu...@clients.switch.ch,
XLOG, Scheuchzerstr. 67, 8006 Zrich, Switzerland.

PIE2 is a Prolog interpreter for DOS. It is available on CompuServe in
the AIEXPERT forum. PIE2.zip contains the interpreter and examples, and
PIEDOC.ZIP contains the documentation. Written by Brent Ruggles
<rug...@shell.com>.

Prolog-68 is a free WAM-based Prolog system running on Atari ST and TT
computers. Not yet finished (no floating point, some missing
built-ins). Contact Jens Kilian <je...@hpbbn.bbn.hp.com> for
information. Available by anonymous ftp from
ftp.cs.cmu.edu:/user/ai/lang/prolog/impl/prolog/prolog68/
as a ZOO archive.

Prolog/Mali is a compiler for the higher-order language Lambda-Prolog.
Lambda-Prolog is an extension of Prolog defined by Miller (Miller,
D.A., and Nadathur, G., "Higher-order logic programming", 3rd
International Conference on Logic Programming, pages 448-462, London
1986). It is an extension of Prolog where terms are simply typed
lambda terms and clauses are higher order hereditary Harrop formulas.
The main novelties are universal quantification on goals and
implication. Prolog/Mali is a complete system which includes a C
translator, a linker, libraries, runtime, and documentation, and runs
on UNIX. It requires the MALI-V06 abstract memory package.
Prolog/Mali is available by anonymous ftp from ftp.irisa.fr:/local/pm/.
Written by Pascal Brisset <pbri...@eis.enac.dgac.fr> (or <bri...@ecrc.de>)
and Olivier Ridoux (rid...@irisa.fr). To be added to the mailing list,
send mail to prolog-ma...@irisa.fr. For more information, send
mail to p...@irisa.fr.

LIFE (Logic, Inheritance, Functions, and Equations) is an experimental
programming language with a powerful facility for structured type
inheritance. It reconciles styles from functional programming, logic
programming, and object-oriented programming. It subsumes the
functionality of its precursor languages LOGIN and Le_Fun, and may be
seen as an extension of Prolog. The syntax of Wild_LIFE has been kept
as close as possible to that of the Edinburgh standard for Prolog.
LIFE offers natively high-level abstraction facilities and convenient
data and control structures particularly well-suited for AI
programming. LIFE implements a constraint logic programming language
with equality (unification) and entailment (matching) constraints over
order-sorted feature terms. The interplay of unification and matching
provides an implicit coroutining facility thanks to an automatic
suspension mechanism. This allows interleaving interpretation of
relational and functional expressions which specify structural
dependencies on objects. The Wild_LIFE interpreter is the first
implementation of the LIFE language available to the general public.
It is a product of Digital Equipment Corporation's Paris Research
Laboratory (DEC PRL). Wild_LIFE runs on MIPS/Ultrix (DECstations),
Alpha/OSF-1, SPARC/SunOS, RS/6000, and SGI machines, and should
be portable to other Unix workstations. It is implemented in C,
and includes an interface to X Windows. Wild_LIFE is available
by anonymous ftp from gatekeeper.dec.com:/pub/plan as the file
Life1.0.tar.Z. To be added to the mailing list (life-...@cs.sfu.ca),
send mail to life-user...@cs.sfu.ca. Send bug reports to
life...@cs.sfu.ca.

Open Prolog:
Open Prolog (OP) is a Prolog interpreter for the Apple Macintosh.

It follows the so-called 'Edinburgh' syntax and supports most standard
Prolog features, including Definite Clause Grammars.
Extra predicates can be added via drop-in external predicates, similar to
Hypercard's XCMDs.

OP will work in any Macintosh from a Macintosh Plus, and runs in
emulated mode on Power Macs.

The most recent version of Open Prolog is available by anonymous ftp
from its home site:
ftp.cs.tcd.ie:/languages/open-prolog/ [134.226.32.15]
It is also available from other sites, such as:
sumex-aim.stanford.edu:/info-mac/
mac.archive.umich.edu [141.211.165.41].

For more information, write to Michael Brady, Computer Science
Department, Trinity College, Dublin 2, IRELAND, send email to
br...@cs.tcd.ie, call +353 1 6081786, or fax +353 1 6772204.

PD Prolog 19:
wuarchive.wustl.edu:/mirrors/msdos/prolog/prolog19.arc (IBM PC)
aisun1.ai.uga.edu (128.192.12.9)

Portable Prolog System is an interpreter from the University of York.
Runs on any system having a Pascal compiler. For more information,
write to University of York, Software Distribution Officer, Department
of Computer Science, University of York, York, YO1 5DD, UK, call +44
(904) 59861, or fax +44 (904) 433744.

Qu-Prolog 3.2 and Ergo 4.0:

Qu-Prolog is a high-level language designed primarily for rapid
prototyping of interactive theorem provers and, more generally, for
symbolic computation on formal languages. Its object level includes
quantified terms and object variables. As an example, the interactive
theorem prover Ergo 4.0 is implemented in Qu-Prolog. The compactness
and high level of Ergo 4.0 source code demonstrate the advantages of
Qu-Prolog for such applications. Ergo includes a 'window inference'
method that is specifically designed to support hierarchical
goal-directed proofs and allow easy access to the context of a
subterm. Ergo also provides support for defining a variety of logics
and support for proving schematic theorems and answer extraction.
Ergo is being used to support the development of verified software.
The system has been tested only on a Sun4.
Qu-Prolog and Ergo are available by anonymous ftp from
ftp.cs.uq.oz.au:/pub/SVRC/
as software/qp.tar.Z and software/Ergo.tar. The tech report
techreports/tr93-18.ps.Z describes Qu-Prolog in detail. Send comments
to Peter Robinson <p...@cs.uq.oz.au>.

SB-Prolog:
cs.arizona.edu:/sbprolog
sbcs.sunysb.edu:/pub/sbprolog

Stony Brook Prolog runs on Sun4, Pyramid-98x, DEC3100, SGI Iris,
Amiga, and MS-DOS machines. Contact war...@sbcs.sunysb.edu for more
information. Two versions are available: version 2.5 is an
interpreter for Amigas and version 3.1 is an interpreter and compiler
for Unix and MSDOS/386.

SB-Hilog runs in SB-Prolog and Quintus Prolog and is available on
sbcs.sunysb.edu:/pub/hilog/

src.doc.ic.ac.uk [146.169.2.10] contains SBProlog 3.1 executables for
MS-DOS/386 in /computing/programming/languages/prolog/sbprolog,
filename sbpmsdos.zip.

nic.funet.fi contains SBProlog executables for Amiga in
/pub/amiga/fish/disks100-199/ff140.

Modular SB-Prolog (= SB-Prolog version 3.1 plus modules) is available
by anonymous FTP from
ftp.dcs.ed.ac.uk:/pub/dts/mod-prolog.tar.Z [129.215.160.5]
Includes interpreter for SPARC. For more information, write to
Brian Paxton <mpr...@dcs.ed.ac.uk>.

[NOTE: SB-Prolog is superseded by XSB (see below) and hence is
no longer supported by Stony Brook or the University of Arizona.
The only reason to continue using SB-Prolog is for DOS, since
XSB does not run under DOS and there are currently no plans to
port it to DOS.]

SLG:
The SLG system is a meta interpreter implementation of
goal-oriented deductive query processing and non-monotonic
reasoning with the following features:
* goal-oriented query evaluation of normal logic programs
under the well-founded semantics by Van Gelder, Ross
and Schliph;
* goal-oriented query evaluation of general logic programs
under the alternating fixpoint logic by Van Gelder, with
the restriction that the body of a clause has to be either
an existential conjunction of literals or a universal
disjunction of literals.
* goal-oriented query evaluation under the stable model semantics
by Gelfond and Lifchitz.
* integration with Prolog execution, and the use of Prolog syntax
for all programs.
The SLG system is freely available by anonymous ftp from Southern
Methodist University or SUNY at Stony Brook
seas.smu.edu:/pub/ [129.119.3.2]
sbcs.sunysb.edu:/pub/XSB/ [130.245.1.15]
as the file slg.tar.gz. Comments, requests, and bug reports should
be sent to Weidong Chen, <wc...@seas.smu.edu>, Computer Science and
Engineering, Southern Methodist University, Dallas, Texas 75275-0122,
phone 214-768-3097, or David Scott Warren, <war...@cs.sunysb.edu>,
Department of Computer Science, SUNY at Stony Brook, Stony Brook,
NY 11794-4400, phone 516-632-8454.

SWI Prolog:
swi.psy.uva.nl:/pub/SWI-Prolog/ [145.18.114.17] (Main source)
Files: pl-x.y.z.tar.gz (source, currently 2.8.0)
w32plxyz.exe (self-installing Windows 95/NT version)
refman/ (preformatted reference manual)
HTMLman/ (HTML version of the manual)
WWW: http://swi.psy.uva.nl/usr/jan/SWI-Prolog.html (home)
http://www.swi.psy.uva.nl/usr/jan/SWI-Prolog/Manual/Title.html (man)
List: pro...@swi.psy.uva.nl, subscribe to prolog-...@swi.psy.uva.nl
Author: Jan Wielemaker, j...@swi.psy.uva.nl.

Features: Complete, including module system, 2-way C-interface,
garbage collector (transparent to C-code), runtime generation,
auto-loading, do-what-i-mean and a very fast compiler. Edinburgh
compatible with lots of ISO and Quintus compatible extensions.

GUI (Portable X11 and Windows) using XPCE (in part 1 of the Prolog
Resource Guide). GUI Prolog development environment is under
development. Contact prolog-...@swi.psy.uva.nl.

Platforms: Unix (SunOs, Solaris, Linux, IRIX, HPUX, AIX, OSF/1
on the DEC/Alpha and many more) Win32 (Windows 95 and NT, may
be recompiled using MSVC 4.1 for Windows 3.1 under Win32s).

Free for non-commercial use. Licenses available for commercial
use (contact prolog-...@swi.psy.uva.nl).

Toy Prolog is an interpreter written in Pascal. About 3500 lines of
source. Free with "Prolog for Programmers" by Kluzniak and Szpakowicz
(Academic Press 1985). The Atari ST version is no longer supported.

TPM (Transparent Prolog Machine) is a demo version of LPA MacProlog
with the TPM debugger included. Runs on Apple Macintosh. It is
available by anonymous FTP from hcrl.open.ac.uk:/pub/software/.

Tricia is a free Prolog high-level emulator with interpreter available
by email from Uppsala University. Tricia currently runs on the Apple
Macintosh. It used to run on Sun3, Sun4, Apollo DN-3500/4500/5500 (OS
version 10.*) and HP-730's, but support for those platforms has been
discontinued. For more information, write to Uppsala University,
Tricia project, Computing Science Department, Box 311, S-751 05
UPPSALA, Sweden, fax +46 18 511925, or email to
tricia-...@csd.uu.se. It is available by anonymous ftp from
ftp.csd.uu.se:/pub/Tricia/
A copy is also available in the directory
/afs/umich.edu/group/itd/archive/mac/development/languages
if your site runs the Andrew File System, or by anonymous ftp from
mac.archive.umich.edu.

WAMCC 2.2 is a WAM-based Prolog to C compiler. It conforms more or
less to the Edinburgh standard, and includes most of the usual
built-in predicates, a top-level, a Prolog debugger and a WAM
debugger. WAMCC is designed to be easily extended (see clp(FD) in
[2-5], for example). WAMCC's speed is halfway between SICStus emulated
and SICStus native code on a Sparc (1.5 times faster and 1.5 times
slower, respectively). WAMCC requires GCC 2.4.5 or higher and has been
tested on Sparc workstations. It should be easily ported to 32-bit
machines with GCC. WAMCC is available free by anonymous ftp from
ftp.inria.fr:/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/wamcc/
For more information, write to Daniel Diaz <Danie...@inria.fr>,
INRIA Rocquencourt, FRANCE.

XSB is a Prolog-based Logic Programming System that extends the
standard functionality of Prolog with an implementation of OLDT
(tabling) and HiLog terms. It is a descendent of PSB-Prolog and
SB-Prolog. OLDT resolution is useful for recursive query computation,
allowing programs to terminate correctly in many cases where Prolog
does not. HiLog supports a type of higher-order programming in which
predicate symbols can be variable or structured. This allows
unification to be performed on the predicate symbols themselves in
addition to the arguments of the predicates. XSB includes an
optimizing compiler, C interface, a module system, list processing
libraries, and dynamic loading. XSB is a descendant of SB-Prolog.
XSB runs on Sun3, Sun4, 386/486 PCs (Linux and 386 BSD), SGI machines
(IRIX), HP 300/400 series (HP-UX) and NeXT, and can be compiled using
either the GNU C compiler or the Sun C compiler. Porting XSB to any
32-bit machine running Unix should be straightforward. THIS IS A BETA
RELEASE. XSB is available by anonymous ftp from
sbcs.sunysb.edu:/pub/XSB/XSB.tar.Z [130.245.1.15]
For more information, write to XSB Research Group, Computer Science
Department, SUNY at Stony Brook, Stony Brook, NY 11794, or send email to
xsb-c...@cs.sunysb.edu.