HDTenEightyP/NetNews huggingface dataset:
From: tim@quintus.com (Tim Lindholm)
Subject: Re: Logical Update View - history
Organization: Quintus Corporation, Palo Alto, CA
Date: Tue, 12 Jan 1993 21:21:33 GMT

In article <9301111701.AA30562@ifc6000.IFComputer.de>, andrew@ifc6000.IFComputer.de (Andrew Verden) writes:
> Hi,
> 	Does anyone know / remember where the 'logical update view' of the
> Prolog database stemmed from. For use with assert/retract predicates.
> Obviously it is what we want but how did we get it?
> 	Any good references to Prolog texts describing it to first-timers
> would also be apreciated.
> 
> Andrew

The idea and terminology was introduced in "Efficient Implementation of a
Defensible Semantics for Dynamic Prolog Code", by Richard O'Keefe and I,
in the Proceedings of the Fourth International Conference on Logic
Programming, published by the MIT Press.  The presentation in that paper
motivates the idea and develops the implementation from a "vanilla" WAM.
It should be accessible to anyone who knows how a WAM works.

-- Tim

Tim Lindholm				Manager, Prolog Technology Group
Quintus Corporation                     InterNet:       tim@quintus.com
2100 Geng Road                          FAX:            415 494 7608
Palo Alto, California 94303             Phone:          415 813 3844
From: levan@ms.uky.edu (Jerry LeVan)
Newsgroups: comp.lang.prolog
Subject: prolog for 3b2/1000
Keywords: prolog 3b2
Date: 6 Jan 93 14:46:40 GMT
Organization: University Of Kentucky, Dept. of Math Sciences

Hello,

I "manage" some 3b2/1000 model 70 computers. Some of our

faculty want access to prolog. The cost must be nominal,
or better free.

I have briefly looked at stoney brook prolog( well compiled
it on my A/UX system). It seems to require a "syscall" interface.

I looked in libc.a and found "syscall" but we don't have
any header files for syscall on the 3b2's (Rel 3.2.2).

I doubt that commercial vendors have bothered with the
3b2 family.

I have heard that CProlog may run on the 3b2's.

Any pointers/aid would be greatly appreciated.

I just read the FAQ but the 3b2 is weird enough so
that I would like to hear from somebody with a success
story.

Jerry LeVan (levan%eagle@eku.bitnet or matlevan@eku.bitnet
		or levan@ms.uky.edu)
From: ken@aiai.ed.ac.uk (Ken Johnson)
Newsgroups: comp.lang.prolog
Subject: Re: Making up sums of money from coins
Date: 8 Jan 93 17:32:49 GMT
Followup-To: comp.lang.prolog
Organization: William's Wonderful Wonky Widget Warehouse


The following code works, but I have not a clue how to generalise it. 
At least, I have not chanced upon a case where it does not give the best
answer.  The reason for the op/3 call will become clear in a minute,
although those over thirty will recognise it on sight:

:-  op(500, xf, '/-').

make(A/-,C) :-
	Sum is 12 * A,
	make(Sum,C).

make(A/B,C) :-
	Sum is A * 12 + B,
	make(Sum,C).

make(0,[]).

make(Sum,[Name|Rest]) :-
	Sixpences is Sum//6,			% If the number of sixpences
	coin(Name,Value),			% in the sum is an exact
	Value =< Sum,				% multiple of 4, then do not
	\+ (	0 is Sixpences mod 4,		% allocate a half crown.
		Value is 30			% No clue how to generalise
	   ),					% this to other currencies.
	Residue is Sum - Value,			% The LCM of 4 and 5 is 20 so
	make(Residue,Rest).			% 10/- is dispensed as a
						% ten shilling note, not as
						% five florins (wrong)
% Coins; must be in order of decreasing value.	

coin('ten shilling note',120).
coin('half-crown',30).
coin(florin,24).
coin(shilling,12).
coin(sixpence,6).
coin('threepenny bit',3).
coin(penny,1).

% Sample Run

This program understands the traditional way of writing `four shillings'
as 4/- and four shillings and elevenpence as 4/11. 

 ?- make(4/-,X).
     X=[florin,florin]

 ?- make(4/6,X).
     X=[half-crown,florin]

 ?- make(5/-,X).
     X=[half-crown,half-crown]

 ?- make(5/11,X).
     X=[half-crown,half-crown,sixpence,threepenny bit,penny,penny]


Ken Johnson

-- 
Son, all the pretty, intelligent, healthy     #    Ken Johnson, AIAI,
young women are taken. It's a basic rule of   #    80 South Bridge, Edinburgh
the universe, and if you don't like it, go    #    Tel 031-650 2756 
somewhere else.        -- my dad  1906-1992   #    Fax 031-650 6513
Newsgroups: comp.lang.prolog
From: kielmann@isa.informatik.th-darmstadt.de (Thilo Kielmann)
Subject: Re: SWI-Prolog on an Amiga
Date: Wed, 6 Jan 1993 17:28:19 GMT
Organization: TU Darmstadt

In article <lenn.726319485@du9ds4>, lenn@du9ds4.fb9dv.uni-duisburg.de (Heiner Lennackers) writes:
> Does anybody now something about the SWI-Prolog.
> It comes from the university in Amsterdam, Netherlands. It can be installed
> to many computer-architectures like sun, pc(linux) and atari. 
> So it can be installed to atari, i dont see any reason, why it could not
> be installed an an amiga.
> Did anyone can give me some hints to do this.
> 
> Bye 
>   Heiner
>   

Everything what's missing is a volunteer to do the port.
How about you?


Thilo

Newsgroups: comp.lang.prolog
From: bevemyr@sics.se (Johan Bevemyr)
Subject: Length of dereferencing chains
Organization: Swedish Institute of Computer Science, Kista
Distribution: comp
Date: Tue, 12 Jan 1993 13:09:13 GMT


I need a reference to the first paper that showed that
most variable chains are of length one. Does anyone know
who first did this?

Regards, 
    Johan Bevemyr
Newsgroups: comp.lang.prolog
From: ridoux@irisa.fr (Olivier Ridoux)
Subject: Grotesque
Organization: IRISA, Rennes (Fr)
Date: Fri, 8 Jan 93 09:04:50 GMT


> I realised a while back that you can use DCGs for many programs that
> don't look like parsing.  My favorite (and most grotesque) is flatten:
> 
> flatten(List, FlattenedList):-
>         phrase(flatten(List), FlattenedList).
> 
> flatten([]) --> [].
> 
> flatten([Head|Rest]) -->
>         flatten(Head),
>         flatten(Rest).
> 
> flatten(List) -->
>         [List].

I cannot see what is so *grotesque* in trying to give a condensed
expression of the regularities a computation contains.  

I suppose you disapprove of using DCG for something which seems the
opposite of syntactic analysis.  However, especially in Prolog, one
should be used with non-directional thinking.

Olivier Ridoux
From: huang@deakin.OZ.AU (Weiguang Huang)
Newsgroups: comp.lang.prolog
Subject: Re: How to parse "I say 'I love you'" to ["I", "say", "'I love you'"]
Date: 6 Jan 1993 10:35:43 +1100
Organization: Deakin University, Victoria, Australia
NNTP-Posting-Host: sol.deakin.oz.au

In article <8085@skye.ed.ac.uk> ken@aiai.ed.ac.uk (Ken Johnson) writes:
>
>In article <1i97a9INN8h@sol.deakin.OZ.AU> huang@deakin.OZ.AU (Weiguang
>Huang) writes:
>
># but how to parse to ["I", "say", "I love you"] ?
>
>The following will do what you want, but I don't think what you describe
>is really what you want to do.  Instead of a list, you should really
>generate a term expressing the structure of the original, so [I, say, I,
>love, you] should really parse to a term such as
>
>   say('I',love('I',you)).

>?-  phrase(report(R),['I',say,'I',love,you]).
>
>     R=[I,say,I,love,you]


	All variables in my program are a string or a list of string, instead
of term nor word nor atom. I want to parse a string "I say 'I love you'" to
a list of string ["I", "say", "'I love you'"].

-? tok("I say 'I love you'", R).

R=["I", "say", "'I love you'"]

	How to do so ?












Newsgroups: comp.lang.prolog
From: hassink@cs.UAlberta.CA (Hassink Brian John)
Subject: Stony Brook Prolog v3.1 for Amiga?
Organization: University of Alberta, Edmonton, Canada
Date: Wed, 13 Jan 1993 01:35:05 GMT

I've heard that it's available, but I have'nt had any luck
finding it. Can anybody confirm it's availability and if so,
where to find it.

Brian
hassink@cs.ualberta.ca
From: andrew@ifc6000.IFComputer.de (Andrew Verden)
Newsgroups: comp.lang.prolog
Subject: Logical Update View - history
Date: 11 Jan 93 17:05:25 GMT
Organization: InterFace Computer GmbH Garmischer Str. 4 D-8000 Muenchen 2
X-Organization:               GERMANY
X-Mailer: ELM [version 2.3 PL0]

Hi,
	Does anyone know / remember where the 'logical update view' of the
Prolog database stemmed from. For use with assert/retract predicates.
Obviously it is what we want but how did we get it?
	Any good references to Prolog texts describing it to first-timers
would also be apreciated.

Andrew

-- 
Dr. Andrew R. Verden,

InterFace Computer GmbH,	email:  andrew@IFComputer.de
Postfach 12 07 40,		Tel:    +49 89 510 86-36
Garmischer Str. 4,		Fax:    +49 89 510 86-28
8000 Muenchen 12.
Newsgroups: comp.lang.prolog
From: ludemann@quintus.com (Peter Ludemann)
Subject: Re: British coinage problem
Keywords: iterative deepening, DCG
Organization: Quintus Corporation, Palo Alto, CA
Date: Fri, 8 Jan 1993 22:03:55 GMT

/* Problem: to find the smallest number of old British coins
   that sum up to some amount.

   Technique: iterative deepening, with a limit from the first
   solution found.  (If the limit isn't provided, there would
   be infinite backtracking if you tried to use this predicate
   to find all solutions.)  The iterative deepening calls sum//1
   with the lists [_], [_,_], [_,_,_] up to the limit length.
*/

shortest_sum(Sum, Coins) :- 
	sum(Sum, Coins1), !, /* we want one solution for a bound */
	length(Coins1, MaxLength),
	shortest_sum(Sum, Coins, 1, MaxLength),
	!. /* and no need to compute any more solutions */

shortest_sum(Sum, Coins, Length, MaxLength) :-
	Length =< MaxLength,
	shortest_sum2(Sum, Coins, Length, MaxLength).

shortest_sum2(Sum, Coins, Length, _) :-
	length(Coins, Length), /* create Coins list of given Length */
	sum(Sum, Coins).
shortest_sum2(Sum, Coins, Length, MaxLength) :-
	Length2 is Length + 1,
	shortest_sum(Sum, Coins, Length2, MaxLength).

/* Here is John Dowding's DCG method for generating lists of
   possible solutions (I've removed one cut from his code): */

sum(Sum, Coins) :- phrase(sum(Sum), Coins).

sum(Sum) --> coin(V), {V =< Sum, Rest is Sum-V}, sum(Rest).
sum(0) --> [].

coin(120) --> ['ten shilling note'].
coin(30)  --> ['half-crown'].
coin(24)  --> [florin].
coin(12)  --> [shilling].
coin(6)   --> [sixpence].
coin(3)   --> ['threepenny bit'].
coin(1)   --> [penny].

- Peter Ludemann
From: thom@ecrc.de (Thom Fruehwirth)
Subject: British coinage problem
Keywords: Keep simple problems simple
Reply-To: thom@ecrc.de
Organization: European Computer-Industry Research Centre GmbH.
Date: Thu, 7 Jan 1993 14:13:22 GMT

min_coins(Value,Coins):- list(Coins),sum_coins(Coins,Value).

list([]).
list([X|L]):- list(L).

sum_coins([],0).
sum_coins([Coin|Coins],Sum):-
	coin(Coin,Value),
	Value =< Sum,
	NewSum is Sum-Value,
	sum_coins(Coins,NewSum).

coin('ten shilling note', 120).
coin(       'half-crown',  30).
coin(           'florin',  24).
coin(         'shilling',  12).
coin(         'sixpence',   6).
coin(   'threepenny bit',   3).
coin(            'penny',   1).

% thom
From: dowding@ai.sri.com (John Dowding)
Newsgroups: comp.lang.prolog
Subject: Worst use of a DCG you've ever seen
Date: 7 Jan 93 22:43:12 GMT
Followup-To: comp.lang.prolog
Organization: SRI International, Menlo Park, CA
In-reply-to: ken@aiai.ed.ac.uk's message of 5 Jan 93 18:31:12 GMT

In article <8090@skye.ed.ac.uk> ken@aiai.ed.ac.uk (Ken Johnson) writes:

   Secondly: After that, I have written the largest-fit solution to the
   problem as a DCG!

   (B) The problem expressed as a DCG

	     sum(S) --> coin(V), {V =< S, !, T is S-V}, sum(T).
	     sum(0) --> [].

	     coin(120) --> ['ten shilling note'].
	     coin(30)  --> ['half-crown'].
	     coin(24)  --> [florin].
	     coin(12)  --> [shilling].
	     coin(6)   --> [sixpence].
	     coin(3)   --> ['threepenny bit'].
	     coin(1)   --> [penny].


I realised a while back that you can use DCGs for many programs that
don't look like parsing.  My favorite (and most grotesque) is flatten:

flatten(List, FlattenedList):-
	phrase(flatten(List), FlattenedList).

flatten([]) --> [].

flatten([Head|Rest]) -->
	flatten(Head),
	flatten(Rest).

flatten(List) -->
	[List].


--
John Dowding
dowding@ai.sri.com
From: Kino.Coursey@f2206.n124.z1.fidonet.org (Kino Coursey)
Sender: FredGate@ocitor.fidonet
Newsgroups: comp.lang.prolog
Subject: Delphi OR-parallel systems
Date: Thu, 07 Jan 1993 18:50:00

I just came accross an interesting model of exploiting OR-parallelism
in PROLOG code. As I am writting a PROLOG interperter for use in a
network enviroment (MS Windows/NT) I was wondering if anyone had any
information on progress, references or implementation of the Delphi
model. The Dephi model uses bit strings to specify a deterministic 
path in a non-deterministic program. These strings are called 
oracles and thus the name Delphi for entire model. Individual 
processors use the oracles to determine what path follow in a given 
program. Thus there is no communication of enviroments or bindings, 
just the control information needed to reconstruct a path. Since the 
model is so simple I am tempted to implement it if I could get more 
information. Two references I do have are:
[Alsh88a] Alshawi,w. and D.B. Moran," The Delphi Model and Some 
Preliminary Experiments", Fifth International Conference and 
Symposium on Logic Programming, pp.1578-1589 (15-19 Aug,1988)
[Cloc86a] Clocksin, W.F. and H. Alshawi, "A Method for Efficiently 
Executing Horn Clause Programs using Multiple Processors",New 
Generation Computing,5 (1988) pp.361-376
.
The method reminds me of Genetic Algorithms and work in chess on 
engines like HITECH or DEEP THOUGHT. It might be nice to have a 
quick parallel PROLOG machine for any MS Windows or OS/2 network.
    I am also intrested in want people would like in a SMALL 
interperter for the MS Windows enviroment and in general. I read 
some of the discussions on fast arrays, and even though it is 
non-logical and violates pure PROLOG I may include direct array 
facilites in my system. What else would you like ?
   And Does anyone have anything on CODERS PROLOG. I know its a C 
based PROLOG libarary but is it any good. How does it compare with 
more standard prologs?  And what are the requirements if you include
it in an embedded system ? royalties ?
                                            THANKS IN ADVANCE
                                            KINO COURSEY
 * Origin: The Interocitor*AI/Robotics*214-258-1832 (1:124/2206)
Newsgroups: comp.lang.prolog
From: bimbart@cs.kuleuven.ac.be (Bart Demoen)
Subject: Re: Logical Update View - history
Organization: Dept. Computerwetenschappen K.U.Leuven
Date: Mon, 11 Jan 1993 20:51:58 GMT

andrew@ifc6000.IFComputer.de (Andrew Verden) writes:

> Obviously it is what we want but how did we get it?
The ISO committee on Prolog standardisation found it impossible to decide
on this issue until

E. Boerger, B. Demoen `A framework to specify database update views for Prolog'
Proceedings of the Third International Symposium on Programming Language 
Implementation and Logic Programming Passau, August 1991, pp. 147-158


The following paper also contains something about the logical update view:

C. Moss "Cut and Paste - Defining the impure primitives of Prolog" ICLP 86
686-694, 1986 London


Bart Demoen
From: fleurey@esonvm2.VNET.IBM.COM (Claude Fleurey)
Date: Tue, 5 Jan 93 14:54:49 FST
Newsgroups: comp.lang.prolog
Subject: Processing syntax errors within DCG rules
Disclaimer: This posting represents the poster's views, not those of IBM
News-Software: Usenet 3.1

   I am looking for a scheme allowing to write DCG rules abble to process
   efficiently syntax errors:
     . to display relevant error messages
     . to re-establish (eventually) the parsing process.

   I found the naive approach - introducing 'catch-all' grammar rules -
   not enough precise. Being more deterministic, on the other hand,
   decreases the declarative aspect of the rules and leads consequently
   to a more tedious overall design ...

   Thank you

   Claude Fleurey
Newsgroups: comp.lang.prolog
From: rao@cs.mu.OZ.AU (Kotagiri Ramamohanarao)
Subject: 2nd call for papers for VLDB Special Issue
Originator: rao@munta.cs.mu.OZ.AU
Reply-To: rao@cs.mu.OZ.AU (Kotagiri Ramamohanarao)
Organization: Computer Science, University Of Melbourne, Australia
Date: Tue, 5 Jan 1993 04:09:49 GMT



			2nd Call for Papers


The VLDB Journal:  Special Issue on Prototypes of Deductive Database Systems



The VLDB Journal is planning a special issue on Prototypes of Deductive
Database Systems. Potential authors are encouraged to submit original
papers describing prototype deductive database systems. Papers should
address the issues below.


  o Query and Update Language Description

  o Computational Model

  o Optimisation Techniques

  o Implementation and System Architecture

  o Performance Measurements

  o Applications


Potential authors are encouraged to submit original, journal quality papers
to the special issue editor.


      Professor Kotagiri Ramamohanarao          Fax: +61 3 282 2444
      Department of Computer Science            E-Mail: rao@cs.mu.oz.au
      University of Melbourne
      Parkville, 3052
      Victoria, Australia



  Send 6 copies of a complete manuscript of no more than 35 type-written, 
double-spaced pages.  For more specific information see the Guidelines 
for Manuscript Preparation of the VLDB Journal which can be obtained through 
the special issue editor or the responsible editor-in-chief Hans J. Schek
(schek@inf.ethz.ch). All papers will be reviewed through the Journal's
editorial board.

Important dates:


     March 1, 1993            Due date for manuscript
     June 1, 1993             Notification of acceptance
     August 1, 1993           Due date for final revised version


A preliminary statement of your intention to submit would be appreciated.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Prof. Ramamohanarao Kotagiri                              rao@cs.mu.OZ.AU
Department of Computer Science                         FAX +61 3 348 1184
The University of Melbourne                            Ph. +61 3 344 5230
Parkville, 3052
AUSTRALIA

Newsgroups: comp.lang.prolog
From: levan@ms.uky.edu (Jerry LeVan)
Subject: SB-Prolog woes
Keywords: SB-Prolog,3b2,decstation,A/UX
Date: Fri, 8 Jan 1993 23:47:38 GMT
Organization: University Of Kentucky, Dept. of Math Sciences

Sigh,

I have successfully compiled SBProlog for A/UX using some simple
patches found in wuarchive.wustl.edu. It does startup ok and
I can execute the statistics command (I don't know anything yet
about prolog).

However when I move the source to our 3b2 and decstations I am able
to compile the interpreter with very minor changes. However when
I start prolog on the 3b2. It complains about finding a clause that
is too long and then terminates with the message:
	Halt. Program terminated normally.

The DecStation does not complain about the long clause but does
immediately give the same halt message.

On both the 3b2 and Decstation the banner/prompt
"SB-Prolog Version 3.1
| ?-"

never get printed (but it does with my A/UX system).

Does this sound familiar to anybody?

********************
I have nifty Pascal/C/Lisp solutions to the eight queens problem.
Does there a nice solution in Prolog to the problem? If so could
somebody email a heavily commented solution to the problem.
********************

Thanks,

Jerry LeVan (levan@ms.uky.edu)

Newsgroups: comp.lang.prolog
From: vanroy@prl.dec.com (Peter Van Roy)
Subject: Re: Why can't integers become principal functors?
Organization: Digital Equipment Corporation - Paris Research Laboratory
Distribution: comp
Date: Fri, 8 Jan 1993 12:54:00 GMT

In article <CHIK.93Jan7114812@ss38.icot.or.jp>, chik@icot.or.jp (Takashi Chikayama) writes:
> Can somebody explain why integers cannot be the principal functor of
> non-atomic functors?  Are there any theoretical reasons?  Any
> implementational difficulties?  Or just for compatibility with
> previous implementations?
> 
> Takashi Chikayama

There is no fundamental reason why not.  Maybe it was done because
it was imagined it would make it easier to implement efficient
arithmetic.  As an example of the other approach, the LIFE language
(and a fortiori the Wild_LIFE interpreter) allows numbers (and
strings too) as main functors, since arguments may be attached to
any sort, and numbers are sorts.

Peter
Newsgroups: comp.lang.prolog
From: mcovingt@aisun3.ai.uga.edu (Michael Covington)
Subject: Which Prologs lack if-then-else ?
Organization: AI Programs, University of Georgia, Athens
Date: Thu, 7 Jan 1993 03:57:14 GMT

Which commercial Prologs nowadays lack the if-then-else (p -> q ; r)
construction?

Arity is the only one I know of.  I'm speaking of Prologs that are
otherwise very close to the Edinburgh or draft ISO language, not
renegades, of course.

-- 
:-  Michael A. Covington     internet mcovingt@uga.cc.uga.edu :    *****
:-  Artificial Intelligence Programs       phone 706 542-0358 :  *********
:-  The University of Georgia                fax 706 542-0349 :   *  *  *
:-  Athens, Georgia 30602-7415 U.S.A.     amateur radio N4TMI :  ** *** **
From: arc1@ukc.ac.uk (Tony Curtis)
Newsgroups: comp.lang.prolog
Subject: Re: ye ancient British coinage problem
Keywords: prolog, coins
Date: 6 Jan 93 17:07:10 GMT
Organization: Computing Lab, University of Kent at Canterbury, UK.

Here's a (hopefully right) solution to Ken's minimum-coin-count problem
for old British coins.

tony

%
% No guarantees, use it if you will.  If you do, please
% acknowledge the source.  If you make money from the code
% then give me a share too!
%
% Tony Curtis
%

%
% these have to be sorted mono. descending
%
coin('ten shilling note', 120).
coin(       'half-crown',  30).
coin(           'florin',  24).
coin(         'shilling',  12).
coin(         'sixpence',   6).
coin(   'threepenny bit',   3).
coin(            'penny',   1).

%
% entry point
%
%           solve(+Sum, ?Coins)
%
% Generate a list of all the possible starting coins <= the
% initial value.
%
solve(0, []).
solve(Sum, Coins) :-
        Sum > 0,
	findall((Value, [Coin]), ok_coin(Coin, Value, Sum), FirstValues),
	search(FirstValues, Sum, Coins).

%
% generate solutions until the required sum appears
% in the coin list
%
search(Values, Sum, Coins) :-
	member((Sum, Coins), Values),
	!.
search(Values, Sum, Coins) :-
	iterate_solution(Values, Sum, VClist),
	search(VClist, Sum, Coins).

%
% each member of the list is (Value, [Coins]).  Value tracks
% the accumulated total of the coins in Coins.  Coins is a list
% of coin names
%
% for each value-coins pair, get the next lowest coin which can be
% used, and add its value to Value and the name to Coins.
%
iterate_solution([], _, []).
iterate_solution([(Value, Coins) | T1], Sum, [(NewValue, NewCoins) | T2]) :-
	SumLeft is Sum - Value,
	ok_coin(Coin, ThisValue, SumLeft),
	!,
	NewValue is ThisValue + Value,
	append(Coins, [Coin], NewCoins),
	iterate_solution(T1, Sum, T2).

%
% A coin is ok if it is <= the current sum
%
ok_coin(Coin, Value, Sum) :-
	coin(Coin, Value),
	Value =< Sum.
From: le9miiwa@cine88.cineca.it
Newsgroups: comp.lang.prolog
Subject: Re: prolog for 3b2/1000
Date: 8 Jan 93 18:35:21 +0100
Summary: C-Prolog on 3b2's at Olivetti
Reply-To: lazarus@dmm06.dmm01.crsmi9.cine88.cineca.it
Keywords: C-Prolog, 3b2, Olivetti
Organization: CINECA, Italian Interuniversity comp. centre

In article <1993Jan6.94640.11442@ms.uky.edu>, levan@ms.uky.edu (Jerry LeVan) writes:

> 
> I have heard that CProlog may run on the 3b2's.
> 
> Any pointers/aid would be greatly appreciated.
> 

Once upon a time there was a version of C-Prolog
running on 3b2 at Olivetti - it was more or less
free for universities.

Then they (well, we) moved from 3b2 to Olivetti LSX -
and from C-Prolog to Quintus Prolog - and I moved
away from Olivetti.

So I do not know whether you will be able to find
what you need.

Anyway you could try and contact:

Enrico Botto
OLIVETTI Systems & Networks
viale Cristoforo Colombo, 49
Trezzano s/N  MI  ITALY
tel.: +39 2 44570234
e-mail: enrico@trzmac.ico.olivetti.it


Buona fortuna, ciao
    marco

=====================================================
Marco Lazzari
ISMES - Divisione Modelli Matematici
viale Giulio Cesare, 29
I-24123  Bergamo  ITALY
tel.: +39 35 307330/1
e-mail lazarus@dmm06.dmm01.crsmi9.cine88.cineca.it
       le9miiwa@cine88.cineca.it
=====================================================