HDTenEightyP/NetNews huggingface dataset:
From: s911190@yallara.cs.rmit.OZ.AU (Kym R Thompson)
Newsgroups: comp.lang.logo
Subject: HELP WANTED installing DOSLOGO, MSWLOGO
Keywords: doslogo, mswlogo
Date: 8 Oct 92 00:57:20 GMT

I am having some problems setting up DOSLOGO and MSWLOGO 2.0.
They run, BUT:

DOSLOGO - SET EDITOR=<myeditor> is just ignored !
        - new files all end up in the \LOGO directory,
          rather than in \LOGO\WORK - how do I tell the
          program where to put them ?
        - (presumably related) a message on start-up reports
          (correctly) that there is no LOGO.INI file -
          what do I put in this ?

MSWLOGO - The HELP command produces the message "Help file
          missing ...", even though it (LOGO.HLP) is there !
        - I keep having to reach for the rodent to reactivate
          the command entry cursor in the "Commander" -
          is there something I am missing, or is this just
          the way this system works ?
        - Once a "Status" window has been displayed, how can 
          I get rid of it again (other than just dragging it
          offscreen) ?

Kym Thompson - s911190@yallara.cs.rmit.oz.au
Computer Studies, Nth. Metro College of TAFE, Melbourne, Australia
Newsgroups: comp.lang.logo
From: lars@ramsey.cs.laurentian.ca (Larry Singleton)
Subject: MS WIN3.1 LOGO?
Summary: Lookinh for MS WIN3.1 LOGO
Keywords: LOGO
Organization: Dept. of Computer Science, Laurentian University, Sudbury, ON
Date: Wed, 7 Oct 1992 16:32:01 GMT


I recently saw a post that said someone had a new version of
LOGO for MS WIN3.1.  Could someone repost it, or send me E-mail
and tell me where/how to find it.

Thank you in advance,

                                            
                             LARS



*********************************************
* You can only bang your head against the   *
* wall so many times!!!                     *
*********************************************

lars@ramsey.cs.laurentian.ca
MATH/COSC Department
Laurentian University
Sudbury, ON
From: brent@ssd.csd.harris.com (Brent Benson)
Newsgroups: comp.lang.logo
Subject: Re: um, maybe this is a silly question
Date: 14 Oct 92 18:46:51 GMT
	<1992Oct13.035329.19258@pasteur.Berkeley.EDU>
	<1992Oct13.144544.18182@sctc.com>
	<92Oct14.032327.23449@acs.ucalgary.ca>
Distribution: usa
Organization: Harris Computer Systems

quigley@acs.ucalgary.ca (Martyn Thomas Quigley) writes:

>>Most problem solving that people routinely do shouldn't require the
>>level of engineering required to convert recursion into interation.

> Don't Lisp compilers routinely convert tail recursion source into
> iterative code?  I always thought so, but...should we do it
> ourselves?

I think a more relevant point is that beginning programmers don't
often know the difference between a tail recursive function and a
non-tail recursive function (i.e. whether it can be compiled into an
iterative form).  On the other hand, I think that learning (and
teaching) the difference is not that hard and is worth whatever effort
it does take.  This knowledge fosters a more thorough understanding of
interpreters, compilers, machines, etc.  Things that are very
important for a programmer to understand.





--
Brent Benson                     
Harris Computer Systems
Newsgroups: comp.lang.logo
From: matt@volga.Berkeley.EDU (Matt Wright)
Subject: Re: um, maybe this is a silly question
Organization: University of California, at Berkeley
Distribution: usa
Date: Fri, 16 Oct 1992 20:20:26 GMT

Max Hailperin <max@nic.gac.edu> writes:
>I've got a factorial problem, like maybe
>   6 * 5 * 4 * 3 * 2 * 1.
>
>Gee, I wonder if I can transform that into a simpler problem with the
>same answer.

That's the rabbit.  If you can teach kids to try to transform a problem into
a simpler problem *with the same answer*, why not teach them to notice that
an answer to a simpler problem is part of the answer to this one.

Forcing the simpler problem to have the *same* answer (not just a helpful
answer) makes your recursion come out tail-recursive, which is nice
efficiency but otherwise just a restriction.

How about "I want to know if the word HELLO is somewhere in the tree 
[[HI] [GOOD [BYE FOR [NOW]] [MY [LOVE]]] YOU [SHOULD SAY] [[HELLO]]]"

How do you transform that into a simpler problem with the same answer?  That
kind of thinking is good for some problems but not all problems.

On the other hand, I'm impressed by your chain of thought; it really is a
quite nice way of motivating the tail-recursive solution.

>[Voila, a rabbit!  Is this what you call "boring ... facts to
> memorize"?  I'd call it more like a general problem solving
> heuristic, fit to go into the personal tool-kit right alongside
> 'Gee, I wonder if there is a smaller problem which, if I knew the
>  answer to it, would make it easy to find the answer to this
>  problem?']

Certainly not "boring facts to memorize"!  It is a general problem solving
heuristic.  To my mind, it's just a special case of the second heuristic you
mention, specially tuned up to produce tail recursive programs.  But
nevertheless, stating it the way you did makes it seem more like computer
science and less like an efficiency hack to me.

-Matt
Newsgroups: comp.lang.prolog
From: gupta@nmsu.edu (Gopal Gupta)
Subject: Logic Programming as an introductory programming paradigm
Organization: NMSU Computer Science
Date: Mon, 12 Oct 1992 16:06:38 GMT


		   Second Call for Participation

		Logic Programming as an Introductory
			Programming Paradigm

		Informal Birds-of-a-Feather Session
		
		Joint International Conference and 
		Symposium on Logic Programming '92

		      Tuesday, Nov 10th, 1992
			   6:00PM -- 8:30PM

		  Organizers: J. Reinfelds and G. Gupta

This informal session is  devoted to  discussion on  using  the  logic 
programming  paradigm to teach programming to beginners. The  emphasis 
is on  teaching  logic  programming (rather than Prolog), and  the aim 
is to induce beginners to learn ``declarative thinking." This approach 
can be  contrasted with  the functional programming  approach that has 
been becoming increasingly popular recently.

The discussion  is open to  all the participants in the conference who 
are  invited  to present  their  views on  (but  not  limited  to) the 
following issues:

1) Why is  Logic  Programming  a  more  suitable paradigm for teaching 
	programming to beginners?
2) Is there a need for  using LP for this purpose, or is FP enough, or
	is some other approach better?
3) How to evaluate the success of such an enterprise?
4) Your  experiences  related  to  using  LP  to  teach programming to
	beginners.

Dissenting views are specially welcome.  

As part of the session  we will  relate our  experience  with using LP 
(and a closely co-ordinated  sister course in discrete Math and Logic) 
to teach programming to Freshman students  at New Mexico State. Others 
are welcome to relate their experiences too. 

Please note  that the primary focus of the session will be on teaching 
logic programming to beginner programmers. Discussion related to teach-
ing Logic Programming to people other than beginners is not encouraged.

Please  send email (to gupta@nmsu.edu  or  juris@nmsu.edu) if  you are 
interested in participating. Please indicate in your email if you just 
want to attend the session or  whether you  intend to  present a short 
position paper too. Those who have already expressed interest need not
do so again.


---------------------------------------------------------------------
Gopal Gupta
Department of Computer Science	   email: gupta@nmsu.edu
Box 30001, Dept. 3CU		      	  gupta@compsci.bristol.ac.uk
New Mexico State University	   Ph: +1 (505) 646 6236 
Las Cruces, NM 88003-0001	   Fax: +1 (505) 646 6218
USA
---------------------------------------------------------------------

	 
Newsgroups: comp.lang.prolog
From: jah@cs.mu.OZ.AU (James Harland)
Subject: Programme for the  Workshop on Deductive Databases at JICSLP'92
Originator: jah@munta.cs.mu.OZ.AU
Reply-To: jah@cs.mu.OZ.AU (James Harland)
Organization: Department of Computer Science, University of Melbourne
Date: Wed, 14 Oct 1992 00:21:58 GMT



			Workshop Programme

		Workshop on Deductive Databases

	         Saturday, 14 November, 1992

		    in conjunction with the
       Joint International Conference and Symposium on Logic Programming
		November 9-13, 1992, Washington D.C., USA



8.30 --- 9.00 Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli
Equivalence, Query-Reachability and Satisfiability in Datalog Extensions

9.00 --- 9.30 Zahidul A. Khandaker, Jose A. Fernandez, Jack Minker 
A Tractable Class of Disjunctive Deductive Databases

9.30 --- 10.00 Inderpal Singh Mumick, Kenneth A. Ross 
An Architecture for Declarative Object-Oriented Databases 

10.00 --- 10.30 
Alexandre Lefebvre, Peter Bernus, Rodney Topor 
Query Transformation for Accessing Heterogenous Databases  

10.30 --- 11.00  Break  

11.00 --- 11.30  
Devin E. Smith 
An Integrated Reactor Physics and Source Term Calculation Based on
Deductive Database Principles   

11.30 --- 12.00 
Jiawei Han, Tong Lu 
N-Queens Problem Revisited: A Deductive Database Approach  

12.00 --- 1.30 Lunch  

1.30 --- 2.00  
John Harrison, Suzanne W. Dietrich 
Maintenance of Materialized Views in Deductive Databases: An Update
Propagation Approach  

2.00 --- 2.30 
Ashish Gupta, Dinesh Katiyar, Inderpal Singh Mumick 
Counting Solutions to the View Maintenance Problem 

2.30 --- 3.00  
Ashish Gupta, Jeffrey D. Ullman  
Generalizing Conjunctive Query Containment for View Maintenance and
Integrity Constraint Verification   

3.00 --- 3.30  Break  

3.30 --- 4.00  
Hakan Jakobsson 
On Join-Order Optimal Compositions and Optimizing Recursive Queries 

4.00 --- 4.30  
Ling Liu, Jiawei Han 
Counting Compressed Method 

4.30 --- 5.00  
Shinichi Morishita 
An alternating fixpoint tailored to magic programs 

5.00 --- 5.30 
Surajit Chaudhuri
Finding Nonrecursive Envelopes for Recursive Datalog Predicates


	There were a further 8 papers accepted for the workshop. However,
as there was only one day available, it was not possible to allow each
accepted paper to be presented at the workshop.
From: billaud@greco-prog.fr (Michel BILLAUD)
Newsgroups: comp.lang.prolog
Subject: Re: Comprehensive understanding of logic languages
Date: 8 Oct 92 07:17:06 GMT
Reply-To: billaud@geocub.UUCP (Michel BILLAUD)
Organization: LaBRI - Universite Bordeaux I - France

In article <1992Oct8.071027.9935@greco-prog.fr> billaud@geocub.UUCP (Michel BILLAUD) writes:
sorry for posting in french, my intention was to send a mail, but
i pressed the wrong key and the &$%$& rn doesnt want to cancel my
own postings!
M.
-- 
Michel BILLAUD                 :  billaud@geocub.greco-prog.fr
Departement d'Informatique     :  phone W: 56.84.57.92  // 56.84.69.22
IUT "A", Universite Bordeaux I :  "Personne n'est exempt de dire des sottises.
33405 Talence  (FRANCE)        :   Le malheur est de les dire curieusement"
From: arjen@disnet.uucp (Arjen Duursma)
Newsgroups: comp.lang.prolog
Subject: Re: Uncompiled prolog
Date: 8 Oct 92 06:37:58 GMT
Organization: Disnet, IDE Maassluis, The Netherlands

liggio@cunixf.cc.columbia.edu (Vincent J. Liggio) writes:

>Is there a source out there where the original 'evolving' uncompiled prolog
What is 'evolving' uncompiled prolog ?
>can be gotten from, or is Turbo (which I have) and other compiled versions
>the only ones available?
Since when does there exist such a thing as Turbo "prolog" other than in
the minds of those who try to sell it.

I am not sure but I think that any real prolog will fit your
requirements.

>Vince
From: T.S.K.Homeed@bradford.ac.uk (TSK HOMEED)
Newsgroups: comp.lang.prolog
Subject: SB-prolog Complier
Date: 15 Oct 92 10:52:30 GMT
Organization: University of Bradford, UK
Originator: 90908303@muser

Hi ,
I got Sb-prolog compiler from the network but after I install it I could not 
compile any prolog program. People who use this compiler please help me.
 *- when I write sbprolog with or without the prolog-file name nothing 
    come to me.
 * So how I can compile and load  a file , what is the extention of the prolog-program (like aunt.pro, aunt.plm, or aunt.nothing ) please if you know any thing help. 
Newsgroups: comp.lang.prolog
From: brady@cs.tcd.ie (Michael Brady)
Subject: Is Jocelyn Paine out there
Followup-To: comp.lang.prolog
Organization: University of Dublin, Trinity College
Date: Mon, 12 Oct 1992 09:50:44 GMT

Net Friends:

A prolog enthusiast without access to the net would like to get the public
domain libraries and so on that Jocelyn Paine (?) has compiled recently.
Could someone either mail me the info for acessing the site, or mail him
directly?
He is Dave Brown, and his email is: brownd%ewsvax.decnet@mdcgwy.mdc.com

Thanks

---------------------
Mike Brady
Computer Science Department, Trinity College Dublin, Ireland
From: feldman@bimacs.BITNET (Ronen Feldman)
Newsgroups: comp.lang.prolog
Subject: Prologs Under MS-Windows
Keywords: prolog, ms-windows
Date: 11 Oct 92 12:26:42 GMT
Organization: Math & CS, BarIlan U, Ramat-Gan, Israel

I am looking for prologs that run under MS-Windows
(I am not lloking for prologs that can run in a dos box under windows)

Please let me know of any products that you heard of (even PDC prolog if they have windows version) including a contact address and

Please email directly:

feldman@bimacs.biu.ac.il

Thanks

Ronen
From: roland@sun-2.cs.uct.ac.za (Roland Paterson-Jones)
Newsgroups: comp.lang.prolog
Subject: public domain library (was Re: Is Jocelyn Paine out there)
Date: 16 Oct 92 06:54:55 GMT
Article-I.D.: sun-2.roland.719218495
Organization: Computer Science Department, University of Cape Town

In <brady-121092104809@brady.cs.tcd.ie> brady@cs.tcd.ie (Michael Brady) writes:

>Net Friends:

>A prolog enthusiast without access to the net would like to get the public
>domain libraries and so on that Jocelyn Paine (?) has compiled recently.

Could somebody please post the address of aforementioned library 
(or mail to me direct).

Thanks
--
Roland P-Jones			aka roland@uctcs.cs.uct.ac.za
University of Cape Town		 or roland@sun-2.cs.uct.ac.za
South Africa
From: popx@vax.oxford.ac.uk
Newsgroups: comp.lang.prolog
Subject: Prolog libraries
Date: 13 Oct 92 09:24:28 GMT
Organization: Oxford University VAX 6620

Following Mike Brady's request, I'm reposting info on my library. I'm
still waiting for contributions, by the way.

                                                                 Jocelyn


The library is available by anonymous FTP from the Imperial College
archive. The archive's FTP address is
    src.doc.ic.ac.uk

The equivalent numerical address is
    146.169.2.1

You access this archive in the normal way. Give your login name as
    anonymous
and use your Email address for the password. If, having logged in, you
find that your system can't cope with the messages from the FTP (one
symptom of this may be that when you do an 'ls', you get the message
'can't build data connection'; another may be system responses not
arriving until after the following command), then log out, and log in
again, with - as the first character of the password. This trick applies
to most FTP systems, by the way.

The entries live in the directory
        computing/programming/languages/prolog/pd-software
with a short-cut entry of:
        packages/prolog-pd-software
I.e., to access it, 'cd' to either of the above.

All entries are stored as <entry>.tar.Z. They are in compressed TAR
format, so once you have fetched them, uncompress, and then de-tar the
result. Users of Unix systems should have no problem with this, since
tar and uncompress are standard utilities. Those using other systems may
not be so lucky, though they are now available for VMS, at least.

The file README gives a brief summary of the contents of the directory.
Newsgroups: comp.lang.prolog
From: lee@munta.cs.mu.OZ.AU (Lee Naish)
Subject: Re: simple list processing predicates
Organization: Department of Computer Sci, University of Melbourne
Date: Thu, 15 Oct 1992 07:34:33 GMT

In article <9210122012.AA08759@enuxha.eas.asu.edu> gomez@enuxha.eas.asu.edu (JL Gomez) writes:
>I've been learning PROLOG and building up some list predicates.
> 
>One of them is a subsequence predicate which returns yes if the elements
>in the first list match the elements in the second list.
>
>The others are rotate predicates like:
>
>rotate([a,b,c,d,e],2,X).
>X = [c,d,e,a,b]
>
>which rotates right, and then
>
>rotate([a,b,c,d,e,f],-2,X]
>X = [e,f,a,b,c,d]


	% true if Sub is a "subsequence" (not necessarily contiguous)
	% of Seq
subseq([], _).
subseq(A.Sub, A.Seq) :-
	subseq(Sub, Seq).
subseq(Sub, _.Seq) :-
	subseq(Sub, Seq).

	% rotates list to right or left (shift can be negative)
rotate(List, Shift, RotatedList) :-
	length(List, Len),
	LenH is (Shift + Len) mod Len,
	length(H, LenH),
	append(H, T, List),
	append(T, H, RotatedList).
Newsgroups: comp.lang.prolog
From: dziadzka@informatik.hu-berlin.de (M.Dziadzka)
Subject: Re: Copy of ISO standard for Prolog
Organization: Humboldt University, Department of Computer Science
Date: Thu, 15 Oct 1992 14:36:02 GMT

In article <1992Oct14.105623.1@cgsvax.claremont.edu> goldsmig@cgsvax.claremont.edu writes:
>Does anyone have knowledge of where I can apply for a copy of the draft ISO
>standard for Prolog?

puffin.doc.ic.ac.uk:/languages/prolog/prolog-std



-- 
Mirko Dziadzka 		        e-mail: try one of:
Humboldt-University Berlin, 	dziadzka@hp832.informatik.hu-berlin.de
Department of Computer Science  dziadzka@informatik.hu-berlin.de
From: arjen@disnet.uucp (Arjen Duursma)
Newsgroups: comp.lang.prolog
Subject: Re: Rotating lists (Was: (none))
Date: 13 Oct 92 11:11:33 GMT
Organization: Disnet, IDE Maassluis, The Netherlands

tyamamot (Taro Yamamoto) writes:

>I am learning the language too. But, I got the following idea.
>I am looking for any more elegant solution...
Arent we all :-)

>FYI.

>-Taro Yamamot
>tyamamot@adobe.com

>rotate(List, Shift, RotatedList) :-
>	Shift > 0, !,
>		length(List, TotLen), Shift2 is TotLen - Shift,
>		rot(List, Shift2, RotatedList).
I would not recommend the use of length

>rotate(List, Shift, RotatedList) :-
>	Shift < 0, !,
>		Shift2 is -Shift,
>		rot(List, Shift2, RotatedList).			

>rot(List, Shift, RotatedList) :- !,
>	append(SubList1, SubList2, List), length(SubList2, Len), Len =:= Shift, !,
>	append(SubList2, SubList1, RotatedList).
or append
>rot(List, Shift, RotatedList) :-
>		length(List, Len),
>		Shift2 is Len - Shift, !, rot(List, Shift2, RotatedList).

To avoid length, just let the items of a list go by.
To avoid append, use difference lists.

Fast attempt (definately not tested):

rotate(List,Shift,RotatedList) :-
	Shift < 0,!,NewShift is -Shift,
	rotate(RotatedList,NewShift,List).
rotate(List,Shift,RotatedList) :-
	rot(Shift,List,RotatedList,L-L).

rot(0,L1,L2,L2-L1) :- !. /* this is the append */
rot(X,[H|T],RotatedList,Dh-[H|Dt]) :-
	NewX is X - 1,
	rot(NewX,T,RotatedList,Dh-Dt).

It should work both ways.

Greetings

Arjen
From: timd@ed.ac.uk (Tim Duncan)
Newsgroups: comp.lang.prolog
Subject: Re: references to PARLOG ?
Date: 12 Oct 92 11:02:06 GMT
Reply-To: T.Duncan@ed.ac.uk
Organization: AI Applications Institute, University of Edinburgh

In article <aet.718701527@munagin>, aet@mullian.ee.mu.OZ.AU (bert thompson) writes:
|> 
|> i am using PARLOG, but unfortunately have no good references.
|> can anyone suggest some good references?


@book{Conlon,
  author = 	 "Tom Conlon",
  title = 	 "{Programming in Parlog}",
  publisher = 	 "Addison-Wesley",
  year = 	 1989,
  note = 	 "{\sc isbn:} 0-201-17450-2"
}

@book{Gregory,
  author = 	 "Steve Gregory",
  title = 	 "{Parallel Logic Programming in Parlog: The Language and its
		  Implementation}", 
  publisher = 	 "Addison-Wesley",
  year = 	 1987,
  note = 	 "{\sc isbn:} 0-201-19241-1"
}


+----------------------------------------------------------------------+
|   Tim Duncan, AI Applications Institute, University of Edinburgh,    |
|    80 South Bridge, Edinburgh EH1 1HN, Scotland, United Kingdom.     |
+----------------------------------------------------------------------+
|   Tel: +44 31 650 2747  Email: timd@ed.ac.uk  FAX: +44 31 650 6513   |
+----------------------------------------------------------------------+
From: posegga@margaux.ira.uka.de (Joachim Posegga)
Newsgroups: comp.lang.prolog
Subject: Looking for unfolding program
Date: 15 Oct 92 10:42:23
Organization: Karlsruhe University, Dept of Comp Science, FRG
Distribution: comp
NNTP-Posting-Host: i12s3.ira.uka.de


Does anyone know of a PD program for unfolding Prolog clauses?
(E.g. translate a :- b,c  and b :- e into a :- e,c)

Thanks in advance

	Joachim.
From: gomez@enuxha.eas.asu.edu (JL Gomez)
Newsgroups: comp.lang.prolog
Subject: (none)
Date: 12 Oct 1992 15:33:20 -0500
Organization: UTexas Mail-to-News Gateway
NNTP-Posting-Host: cs.utexas.edu

I've been learning PROLOG and building up some list predicates.
 
One of them is a subsequence predicate which returns yes if the elements
in the first list match the elements in the second list.  So, for example
the query:

subseq([a,b],[b,c,a]).

returns no, whereas

subseq([a,b],[a,c,b])

returns yes.  Remember, this is not subset which I can write.  

The others are rotate predicates like:

rotate([a,b,c,d,e],2,X).
X = [c,d,e,a,b]

which rotates right, and then

rotate([a,b,c,d,e,f],-2,X]
X = [e,f,a,b,c,d]

rotates left.
 
Thanks for the help in writing these!
--
gomez@enxuha.eas.asu.edu
From: cyberman@toz.buffalo.ny.us (Cyberman)
Newsgroups: comp.lang.prolog
Subject: Re: question about adding
Date: 9 Oct 92 00:39:49 GMT
X-Maildoor: WaflineMail 1.00r


   Bert Edens was espousing about 'Question about adding',
   on [10-05-92  12:05] to All!
 BE> Greetings...

    YEAH well HI! :)

 BE> I wanted to get some suggestions on the best way to attack a
 BE> problem. I'm writing an adventure-type of game (no, not for a class :-)
 BE> and wanted to know the quickest way to add up their total hit points.
 BE> The fact is stored like:
 BE> monster(orc,4).

    this may not be as difficult as you might imagine.

 BE> where the latter is the number of hit points. What I want to do is add
 BE> up a group of them and get the total hit points for an attack party.
 BE> For example, it might be:
 BE> monster(orc,4). monster(kobold,5). monster(goblin,8).
 BE> and I want to add them up.

    This all depends on how you have it stored, if the monster
    group is a dbasedomain then you can use findall.

    group_hp(Hp_):-findall(Hp,monster_group(_,Hp),Hp_list),
        add_list(Hp_list,0,Hp_).

    add_list([],Total,Total).
    add_list([H|T],Running_total,Result):-
        New_running_total = H + Running_total,
        add_list(T,New_running_total,Result).

                Stephen Cyberman@Toz.Buffalo.NY.US
                Scripted at Thu  10-08-1992  11:01:20

... If it weren't for the last minute Windoze would not be done.
--- Blue Wave/QWK v2.10
From: hassan@prl.dec.com (Hassan Ait-Kaci)
Newsgroups: comp.lang.prolog
Subject: Re: ILPS'93
Date: 8 Oct 92 16:40:21 GMT
Organization: Digital Equipment Corporation - Paris Research Laboratory

In article <1992Oct8.111645.4211@prl.dec.com>, I wrote:
> 
> Has the call fo submissions to the next ISLP been out yet? If so, can
> someone send it to me? If not, is there any info on where and when
> ISLP will take place?
> 

Thanks to all that sent me the CFP for ICLP'93. What I am looking for is
that of the International *Symposium*, not the conference.

Thanks again.

-hak