HDTenEightyP/NetNews huggingface dataset:
From: jkeithly@halcyon.com (John Keithly)
Subject: Request for Logo Training Assistance
Organization: The 23:00 News and Mail Service
Date: Thu, 5 Nov 1992 19:03:14 GMT

I am posting the following message for Ms. Sally Laughon since she
does not have access to Usenet, although she does have an email
account.  The message which follows was originally uploaded by
Sally to members of the KidLink Listserver.  Please, send your 
responses to her directly.

   ---John Keithly  
===================================================================

From: Sally Laughon <LAUGHON@VTVM1.BITNET>
Subject:      To LOGO teachers

Please give me your assistance while I design a LOGO teaching unit,
6-9 weeks long, for high school students, ages 14-18.

1.  What topics can be covered well in a 6 to 9 week time?  Please
mark with an X before each topic.

      graphics commands
      procedures
      recursion
      variables - local and global
      program organization
      arithmetic applications
      words and lists
      coordinate commands
      interactive commands
      TEST commands
      music
      combining text and graphics
      turtle shape editor

2.  Are there other topics that need to be included?  Please add to the
list.

3.  In what order would you teach the topics listed above?  Rank from
1-13 or create your own groupings if you desire.

4.  How long would it take to teach the concepts listed above (your
best estimate!)?

5.  Please desdrive a project or activity that is especially successful
with your students.

6.  Name the books, resources (author, publisher) you find well suited
for students, ages 14-18.

7.  How do you evaluate student learning?

8.  Do you know other LOGO teachers I should contact, electronically
or by phone?

Please send your responses to me directly since I am not a member of
all of these lists.  Also, repost freely!

aTdHvAaNnKcSe! (Thanks in advance!)
Sally

+-------------------------------------------------------------------+
| Sally Laughon           BITNET: laughon@vtvm1                     |
| Computer Department   Internet: laughon@vtvm1.cc.vt.edu           |
| Northcross School              slaughon@rvgs.vak12ed.edu          |
| Roanoke, VA USA          Voice: 703 989-6641 FAX: 703 989-7299    |
+-------------------------------------------------------------------+


Newsgroups: comp.lang.logo
From: gwlester@cpu.com (Gerald W. Lester)
Subject: Re: Request for Logo Training Assistance
Organization: Computerized Processes Unlimited, Metairie, LA, (504)-889-2784
Date: Fri, 6 Nov 1992 19:14:24 GMT
Reply-To: gwlester@cpu.com

In article <1992Nov5.190314.23476@nwnexus.WA.COM>, jkeithly@halcyon.com (John Keithly) writes:
>I am posting the following message for Ms. Sally Laughon since she
>does not have access to Usenet, although she does have an email
>account.  The message which follows was originally uploaded by
>Sally to members of the KidLink Listserver.  Please, send your 
>responses to her directly.
>
>
>Please send your responses to me directly since I am not a member of
>all of these lists.  Also, repost freely!
>
>aTdHvAaNnKcSe! (Thanks in advance!)
>Sally
>
>+-------------------------------------------------------------------+
>| Sally Laughon           BITNET: laughon@vtvm1                     |
>| Computer Department   Internet: laughon@vtvm1.cc.vt.edu           |
>| Northcross School              slaughon@rvgs.vak12ed.edu          |
>| Roanoke, VA USA          Voice: 703 989-6641 FAX: 703 989-7299    |
>+-------------------------------------------------------------------+

Sally,

	When you are through getting your replies, could you summarize them for
the group and have John post them or at least send them to me since I am very
interested in what you hear.

Thanks,
==========================================================================
* Gerald W. Lester                        !   Voice:  (504)-889-2784     *
* Computerized Processes Unlimited        !   FAX:    (504)-889-2799     *
* 4200 S. I-10 Service Road, Suite #205   !   E-Mail: gwl@cpu.com        *
* Metairie, LA  70001                     !                              *
==========================================================================
From: cdsm@doc.ic.ac.uk (Chris D S Moss)
Newsgroups: comp.lang.prolog
Subject: Re: Prolog 1000
Date: 9 Nov 92 15:55:12 GMT
Organization: Department of Computing, Imperial College, University of London, UK.
NNTP-Posting-Host: swan.doc.ic.ac.uk

In article <1992Nov3.103148.16618@news.lrz-muenchen.de> draxler@next6.cis.uni-muenchen.de (Christoph Draxler) writes:
>This is just a modest proposal ... 
>
>*** How about distributing the Prolog 1000 list as a Prolog program? ***

I think there's only one problem with doing this when it is complete. That
is the confidentiality issue; the database contains a lot of very
useful names and addresses. We asked people to specify if they wanted
information to be kept private, so the potential problem isn't there
so much as with the Prolog vendors. I don't want to be party to
charges of poaching customers! We've asked the Prolog Vendors' Group
to adjudicate this issue and if that's cleared we'll probably make it
available by ftp in several formats.

>I recall a very nice information retrieval system called PSI by 
>Markus Fromherz, a stand-alone Prolog implementation for the Mac, which
>could be used for this...

but he hasn't submitted it to the Prolog 1000 yet!

Chris Moss
Newsgroups: comp.lang.prolog
From: gerd@intellektik.informatik.th-darmstadt.de (Gerd Neugebauer)
Subject: Re: Looking for a cross-referencer for Prolog
Date: Fri, 13 Nov 1992 09:57:57 GMT
Organization: TH Darmstadt

>>>>> On 11 Nov 92 23:20:09 GMT, milan@bcsaic.boeing.com (Milan Richter) said:

MR> I need a program (cross-referencer?) for Prolog programs that can answer
MR> questions like:

 [...]

MR> These questions translate into common graph algorithms, and I could use 
MR> Quintus Prolog library to write my own corss-referencer.

[...]

How about the cross referencer supplied with Quintus Prolog? Maybe it's a
starting point for your efforts (or serves your needs).
RTFM about library(xref) --- At least in version 3.1.1 I am using.

--
     ____   ___    __   ___       Gerd Neugebauer
    /   /  /___) /'  ) /___)     FG Intellektik, FB Informatik, TH Darmstadt
   (___/- (___  /   / (___      Alexanderstr. 10, D-6100 Darmstadt
 _____/_____________________   Phone: (+49) 6151 16-5382
(____/                        Net: gerd@intellektik.informatik.th-darmstadt.de
From: ridoux@irisa.fr (Olivier Ridoux)
Newsgroups: comp.lang.prolog
Subject: Re: History of Prolog?
Date: 11 Nov 92 10:11:14 GMT
Organization: IRISA, Rennes (Fr)

From article <10NOV199222091262@trentu.ca>, by mbrown@trentu.ca (MARTIN A. BROWN):

> 	Does anyone know of references or periodicals which describes 
> the specific circumstances responsible for the establishment of the Prolog 
> language.

Try the following :

@article{cohen:view:cacm:88,
     author = "J. Cohen",
     title =  "A View of the Origins and Development of {Prolog}",
     journal = "CACM",
     number = 1,
     volume = 31,
     year = 1988,
     pages = "38--43"
     }
@article{kowalski:early:cacm:88,
     author = "R. Kowalski",
     title =  "The Early Years of Logic Programming",
     journal = "CACM",
     number = 1,
     volume = 31,
     year = 1988,
     pages = "38--43"
     }          ^
                |
               bug

{As you can see, there is a bug in my references data-base.  Not
having the journal at hand, I cannot fix it today.  Today is holiday
in France: no library, no cafeteria, no nothing ...}

Olivier Ridoux
Organization: University of Illinois at Chicago
Date: Wednesday, 11 Nov 1992 11:38:30 CST
From: <U37956@uicvm.uic.edu>
Newsgroups: comp.lang.prolog
Subject: Retract static clauses, can't ?

Using Sicstus2.1 Prolog, I want to retract some facts (or clauses) which
were loaded from a file.
   Suppose in  mfile, there are facts:
          johnlikes(mary).
          marylikes(tom).

After starting prolog, i load the facts in the following way:
   |- ? [mfile].

When I try to remove a fact, such as:
   |- ? retract((marylikes(tom))).

I got error message which says static terms can't be retracted.

How can i retract the facts and how can i made the facts dynamic ?

Could anyone tell me?

Thanks in advance.
Newsgroups: comp.lang.prolog
From: torh@syma.sussex.ac.uk (Tor Houghton)
Subject: POPLOG for IBM compatibles?
Organization: University of Sussex
X-Newsreader: Tin 1.1 PL4
Date: Mon, 9 Nov 1992 16:14:35 GMT


Does POP-11 and/or PML (preferrably, although Standard ML will do fine)
exist for IBM compatible PC's?

Please reply through mail to: patrickt@cogs.susx.ac.uk

Cheers,

Tor.

-- 

----------------------------------------------------------------------
email: torh@cogs.susx.ac.uk           "Then we will wonder if machines
                                       will steal each others dreams."
From: awenn@matilda.vut.edu.au (Andrew Wenn)
Newsgroups: comp.lang.prolog
Subject: prolog 1000
Date: 11 Nov 92 22:15:39 GMT
Organization: Victoria University of Technology

Sorry to be a nuisance, but lately there have been a number of items
relating to Prolog 1000. I must have missed the first one or three so would 
the originator please either repost it or mail it to me at the address below.

Thanks   

Andrew Wenn.



---------------------------------------------------------------------------
Andrew Wenn          Victoria University of Technology
                     Footscray Campus.
                     awenn@matilda.vut.edu.au

                     phone 03 688 4342
                     fax   03 688 4804
---------------------------------------------------------------------------
Newsgroups: comp.lang.prolog
From: baustad@idt.unit.no (Jostein Baustad)
Subject: Re: Retract static clauses, can't ?
Reply-To: baustad@idt.unit.no (Jostein Baustad)
Organization: The Norwegian Institue of Technology
Date: Thu, 12 Nov 92 14:55:11 GMT

In article <BxKLHy.Foy@acsu.buffalo.edu>, v104n55k@ubvmsb.cc.buffalo.edu (David I Schwartz) writes:
|> > In article <92316.113830U37956@uicvm.uic.edu>, U37956@uicvm.uic.edu writes...
|> > >Using Sicstus2.1 Prolog, I want to retract some facts (or clauses) which
|> > >were loaded from a file.
|> > >   Suppose in  mfile, there are facts:
|> > >          johnlikes(mary).
|> > >          marylikes(tom).
|> > > 
|> > >After starting prolog, i load the facts in the following way:
|> > >   |- ? [Omfile].
|> > > 
|> > >When I try to remove a fact, such as:
|> > >   |- ? retract((marylikes(tom))).
|> > > 
|> > >I got error message which says static terms can't be retracted.
|> > > 
|> > >How can i retract the facts and how can i made the facts dynamic ?
|> > > 
|> > >Could anyone tell me?
|> > > 
|> > >Thanks in advance.
|> 
|> You can try abolish (ie, abolish(marylikes/1) ) but it is rather extreme.
|> 
|> Dave

All predicates that are dynamic (i.e. that may be asserted or retracted) have
to be declared so. Use

:- dynamic johnlikes/1, marylikes/1.

(The /1 is the arity of the predicate). I think the reason for this is
efficiency reasons, since non-dynamic (static) predicates can be compiled into
som more efficient representation. Hope this helps!

Jostein

-- 
*******************************************************************************
* Jostein Baustad                        * E-mail : baustad@idt.unit.no       *
* The Norwegian Institute of Technology  * Mail   : Klbuveien 122            *
* Division of CS and Telematics          *          N-7031 Trondheim          *
* Information and Knowledge Systems      *          Norway                    *
*******************************************************************************
* Queen's Park Rangers F.C. - SuperHoops ! If not us, who?; if not now, when? *
*******************************************************************************
From: milan@bcsaic.boeing.com (Milan Richter)
Newsgroups: comp.lang.prolog
Subject: Looking for a cross-referencer for Prolog
Date: 11 Nov 92 23:20:09 GMT
Organization: Boeing Computer Services

I need a program (cross-referencer?) for Prolog programs that can answer
questions like:

- what predicates does predicate X call directly?
- what predicates can be reached from predicate X? (transitive closure)
- what predicates call predicate X directly?
- from what predicates can predicate X be called? (closure again)
- could predicate X eventually call itself? 

These questions translate into common graph algorithms, and I could use 
Quintus Prolog library to write my own corss-referencer. Before I do that,
is there any such program available, either in public domain or commercially?
A Motif interface would be especially nice.

Thanks for help!

-- Milan Richter
Xref: sparky comp.lang.prolog:2034 comp.object:4135
From: zb@doc.ic.ac.uk (Zacharias Bobolakis)
Newsgroups: comp.lang.prolog,comp.object
Subject: Re: Object-Oriented Prolog
Date: 5 Nov 1992 12:04:31 GMT
Organization: Imperial College, London, U.K.
Distribution: world
NNTP-Posting-Host: sophia.doc.ic.ac.uk


In article <1992Nov5.003450.5731@kurango.cit.gu.edu.au>, lawley@kurango.cit.gu.edu.au (michael lawley) writes:
> thinman@netcom.com (Technically Sweet) writes:
> 
<stuff deleted>
> It's in the directory computing/programming/languages/prolog/icprolog.
> There is MacProlog source in a further subdirectory, lo, or you can grab the
> icprolog distribution, pd-ICP-0.90.tar.Z, which includes an icprolog version
> of L&O.  Unfortunately, there is essentially no documentation of L&O in the
> distribution other than the source :-) so you'll probably need the book to
> use it.
> 
> mike
> 
> -- 
>     michael lawley (lawley@cit.gu.EDU.AU).        The Unicycling Postgrad

The documentation for L&O is being prepared and it will be available very
soon together with the whole system. If anybody is in a hurry about it, just
email to me and I'll send you a draft of the manual in LaTeX format. 

The manual does not replace the book. It gives a brief description of the 
language and the system but the programming methodology behind it is described 
in the book `Logic & Objects' by Frank McCabe (Prentice Hall Intl.).

Together with the manual, there will be a few fixes in the code as well. So the
source will serve better than before as an on-line manual:-)

As the system (IC Prolog ][ but especially L&O on top of it) is still under 
development, we would appreciate any comments, suggestions, bug reports etc.

For IC Prolog ][, contact Damian Chu (dac@doc.ic.ac.uk) while for L&O itself
email to me (zb@doc.ic.ac.uk).

Regards,
Zac.
Xref: sparky comp.lang.prolog:2068 comp.object:4220
From: yac@doc.ic.ac.uk (Yannis Cosmadopoulos)
Newsgroups: comp.lang.prolog,comp.object
Subject: IC-Prolog
Date: 13 Nov 1992 11:49:31 GMT
Organization: Imperial College, London, U.K.
Distribution: world
NNTP-Posting-Host: sophia.doc.ic.ac.uk


After a number of requests and queries, here is an updated version of my last
posting.


> IC Prolog ][ is a new prolog with the following added features
> 1) Multi threading - allows multiple prolog threads to be run concurrently.
> 2) Parlog - the system includes a parlog component. Prolog threads and parlog can
>    comunicate through pipes. The parlog sub system is not included in the public
>    domain version as there is a small fee for this.
> 3) Communication primitives - the system includes TCP primitives for inter process
>     communication
> 4) Mailboxes - a high level communication system allowing multiple
>    senders/receivers of data.
  5) An implementation of Logic and Objects - an object oriented extension to
     prolog
> 
> There was a paper presented at Keele describing some features of the language
> which should hopefuly apear in the proceedings:
> ``I.C Prolog ][: a Language for Implementing Multi-Agent Systems'',
> Yannis Cosmadopoulos and Damian Chu
> in {\em  Tutorial and Workshop on Cooperating Knowledge Based Systems
> September 23-25, 1992, Keele University}
  Due to popular demand I have placed a postscript version of this file on
	laotzu.doc.ic.ac.uk (146.169.21.1)
  accessible via anonymous ftp in file
	/pub/icp-paper.ps.Z
  This directory is mirrored on src.doc.ic.ac.uk (146.169.2.1)
  as /computing/programming/languages/prolog/icprolog/
  so it should apear there soon.
> 
> For further information contact
> 	yac@doc.ic.ac.uk
> 	dac@doc.ic.ac.uk
> 
> Yannis

You can get a copy of IC-Prolog ][ for sun3, sun4 by anonymous ftp from
	src.doc.ic.ac.uk (146.169.2.1)
IC-Prolog ][ is in the directory
	/computing/programming/languages/prolog/icprolog/
in file
	pd-ICP-0.92.tar.Z
The directory also holds a subdirectory lo with a macintosh version of logic and
objects
From: cduguay@lcraft.ersys.edmonton.ab.ca (Claude Duguay)
Newsgroups: comp.lang.prolog
Subject: Re: prolog compiler
Date: Wed, 04 Nov 92 13:06:37 MST
Organization: LogiCraft Corp, Edmonton, AB, Canada

Randy.Baer@f310.n3603.z1.FIDONET.ORG (Randy Baer) writes:

>   I have Turbo Prolog, but have been told it is a kids toy.  Truth?

Surely you don't judge a piece of software on the basis of someone else's
opinion... The only legitimate objection people have to Turbo Prolog is its
non-standard approach. In its own domain (as a typed compiler) it excels
and its inability to run standard Prolog code is about to become a non-
issue.

Claude Duguay              cduguay@lcraft.ersys.edmonton.ab.ca 
Newsgroups: comp.lang.prolog
From: cpsigd01@ulkyvx.louisville.edu
Subject: Prolog Program Database
Date: Thu, 12 Nov 1992 18:47:30 GMT
Organization: University of Louisville

Recently there was a posting which gave a database for programs written in
PROLOG.  I somehow lost the file.  Would someone be kind engough to email it
to me at the address given below.  Thanks in advance.-- 
****************************************************************************
* Curt SIGDESTAD, Univ. Louisville  	    "OLD AGE AND TREACHERY WILL    *
* CPSIGD01@ULKYVX.CT.LOUISVILLE.EDU	     OVERCOME YOUTH AND SKILL."    *
* CPSIGD01@ULKYVX.BITNET	                                           *
* 			(502)588-7722   (502)588-8072 FAX                  *
****************************************************************************
From: roth@cs.wisc.edu (Bill Roth)
Newsgroups: comp.lang.prolog
Subject: Prolog Debuggers
Date: 8 Nov 92 19:40:28 GMT
Organization: U of Wisconsin CS Dept

Is there such a thing as a Prolog "debugger"? I'm doing work right now in 
building a rule-based debugger for a Prolog-based database language, 
and I was wondering if anything like this had been done before.

If anyone has seen anything like a  prolog rule debugger, could you 
please send me a reference?

Thanks.

-- 

-------------------------------------------------------------------
Bill Roth, University of Wisconsin Computer Sciences Dept.
Internet: roth@cs.wisc.edu. BITNET: ROTH@WISCPSL. HEPNET: PSL::ROTH
From: ainsjc@castle.ed.ac.uk (Network News)
Newsgroups: comp.lang.prolog
Subject: SB-Prolog and Sicstus
Date: 6 Nov 92 17:36:36 GMT
Organization: Edinburgh University


I'm trying to port a large program for Sicstus (well, originally for NIP
but now running under Sicstus) to SB-Prolog. Given that I move stuff
back and forth between the two Prologs a lot, ideally I'd like to add to
SB-Prolog to include some missing Sicstus commands.

Particularly, I'd like to add a multifile command to SB-Prolog. It seems
to me that this should be possible by slightly rewriting SB-Prolog's
consult predicate (which is in Prolog) and adding a multifile predicate
to the library. But, I'm short of time, so before I do this I'd like to
know whether anyone's already done it? Or whether anyone's added
anything else that might be useful in porting Sicstus prolog to
SB-Prolog?

Thanks.

Steffan.
From: mmh@cs.qmw.ac.uk (Matthew Huntbach)
Newsgroups: comp.lang.prolog
Subject: Re: Prolog Debuggers
Date: 9 Nov 92 09:33:24 GMT
Organization: Computer Science Dept, QMW, University of London, UK.

From: roth@cs.wisc.edu (Bill Roth)
>Is there such a thing as a Prolog "debugger"? I'm doing work right now in
>building a rule-based debugger for a Prolog-based database language,
>and I was wondering if anything like this had been done before.
>
>If anyone has seen anything like a  prolog rule debugger, could you
>please send me a reference?

There is a lot of work on Prolog debuggers. I think most of the
big conferences on logic programming have a paper or two on
debugging. Besides the usual trace-based debugging techniques,
Prolog also enables the technique of "declarative debugging"
which attempts to bring a logical automated approach to
debugging. The classic reference to this is E.Shapiro's thesis
"Algorithmic Program Debugging", published by MIT press. My own
thesis is also on this subject (unpublished, but copies
available on request).

Matthew Huntbach
Dept. of Computer Science
Queen Mary and Westfield College
Mile End Road
London E1 4NS, UK

email: mmh@dcs.qmw.ac.uk
From: ken@aiai.ed.ac.uk (Ken Johnson)
Newsgroups: comp.lang.prolog
Subject: Re: collapsing lists to tree
Date: 9 Nov 92 13:26:43 GMT
Followup-To: comp.lang.prolog
Organization: Bugs-R-Us


In article <Bx5CFy.I6F@gabriel.keele.ac.uk> csa09@keele.ac.uk (Paul
Singleton) writes:

#  I wish to collapse a list of lists into a tree by recursively factoring
#  out common initial elements, e.g.

The following code will do it.
The invocation is

   ?- collapse(+Lists,-Tree)

I think it is worth documenting the following restrictions: (a) it is
not bidirectional, (b) it does not enforce a canonical form of Tree, so
that Trees which contain the same information may compare as unequal,
(c) variables in Lists will be spuriously instantiated.  (Challenge:
Write a bi-directional version without using var/1).

Sample successful queries:

1.   ?- collapse([[a,b,d,e], [a,c,f,h], [a,c,f,i], [a,c,g,j], [k,l,m],
        [k,n]], Tree). 

   Tree=[[a,[b,[d,[e,[]]]],[c,[f,[h,[]],[i,[]]],[g,[j,[]]]]],[k,[l,[m,[]]],
     [n,[]]]]

which is a representation of

   a --- b --- d --- e
     \
      \  c --- f --- h
           \     \
            \     \  i
             \
               g --- j

   k --- l --- m
     \
      \  m


2. Your own example

   ?- collapse([[a,b,l,e],[a,b,o],[a,b,o,r,t]],Tree).

   Tree = [[a,[b,[l,[e,[]]],[o,[],[r,[t,[]]]]]]]

Note the use of [] as an end-of-sequence marker.  Without this, you
would not be able to work out that [a,b,o] and [a,b,o,r,t] are both
present in the tree, whereas [a,b,o,r] is absent.  (The need for a
marker scuppered my first attempt, by the way.)


% Code follows. Cut Here ------------ 8< ------------------------------------
%
%  Copyright Ken Johnson, November 1992.  You may use and distribute this
%  code freely, but please acknowledge the source, and if you sell copies
%  at a profit I want a share. 

% mode collapse(+,-).

collapse([],[]).

collapse([[]|Lists],[[]|More]) :-
	collapse(Lists,More).

collapse([[H|T]|Lists],[[H|Sub]|More]) :-
	group(H,[[H|T]|Lists],Grouped,Residue),
	collapse(Grouped,Sub),
	collapse(Residue,More).


group(_,[],[],[]).

group(X,[[X|T]|Lists],[T|Grouped],Residue) :-
	group(X,Lists,Grouped,Residue).

group(X,[[H|T]|Lists],Grouped,[[H|T]|Residue]) :-
	\+ (X = H),
	group(X,Lists,Grouped,Residue).



-- 
                                  //// Ken Johnson, A I Applications Institute
Don't get off while it's moving. ////       80 South Bridge, EDINBURGH EH1 1HN
                                ////                  E-mail ken@aiai.ed.ac.uk
                               ////       Phone 031-650 2756  Fax 031-650 6513
Newsgroups: comp.lang.prolog
From: zyang@ccu.umanitoba.ca (Z. Yang)
Subject: pointers needed on list processing
Keywords: sub sum, nested list
Organization: University of Manitoba, Winnipeg, Canada
Date: Mon, 9 Nov 1992 17:23:39 GMT

Hi, netters,

I am new in prolog and have some difficulty in list processing. What I want to
do is write a predicate, ie. called 'subsum', which does following,

?- subsum([L1,L2,...],NewList).
NewList = [Sum_of_L1,Sum_of_L2,...]

where L1, L2 etc. are lists themselves(could be nested).

Any pointers will be appreciated.
Thanks in advance to all kind souls.

-zgy