Copy Link
Add to Bookmark
Report
AIList Digest Volume 1 Issue 056
AIList Digest Saturday, 10 Sep 1983 Volume 1 : Issue 56
Today's Topics:
Professional Activities - JACM Referees & Inst. for Retraining in CS,
Artificial Languages - Loglan,
Knowledge Representation - Multiple Inheritance Query,
Games - Puzzle & Go Tournament
----------------------------------------------------------------------
Date: 8 Sep 83 10:33:25 EDT
From: Sri <Sridharan@RUTGERS.ARPA>
Subject: referees for JACM (AI area)
Since the time I became the AI Area Editor for the JACM, I have found
myself handicapped for lack of a current roster of referees. This
note is to ask you to volunteer to referee papers for the journal.
JACM is the major outlet for theoretical papers in computer science.
In the area of AI most of the submissions in the past have ranged over
the topics of Automated Reasoning (Theorem Proving, Deduction,
Induction, Default) and Automated Search (Search methods, state-space
algorithms, And/Or reduction searches, analysis of efficiency and
error and attendant tradeoffs). Under my editorship I would like to
broader the scope to THEORETICAL papers in all areas of AI, including
Knowledge Representation, Learning, Modeling (Space, Time, Causality),
Problem Formulation & Reformulation etc.
If you are willing to be on the roster of referees, please send me a
note with your name, mailing address, net-address and telephone
number. Please also list your areas of interest and competence.
If you wish to submit a paper please follow the procedures described
in the "instructions to authors" page of the journal. Copies of mss
can be sent to either me or to the Editor-in-Chief.
N.S. Sridharan [Sridharan@Rutgers] Area Editor, AI JACM
------------------------------
Date: Wed, 7 Sep 83 16:06 PDT
From: Jeff Ullman <ullman@Diablo>
Subject: Institute for Retraining in CS
[Reprinted from the SU-SCORE BBoard.]
A summer institute for retraining college faculty to teach computer
science is being held at Clarkson College, Potsdam, NY, this summer,
under the auspices of a joint ACM/MAA committee. They need lecturers
in all areas of computer science, to deliver 1-month courses. People
at or close to the PH. D. level are needed. If interested, contact Ed
Dubinsky at 315-268-2382 (office) 315-265-2906 (home).
------------------------------
Date: 6 Sep 83 18:15:17-PDT (Tue)
From: harpo!gummo!whuxlb!pyuxll!abnjh!icu0 @ Ucb-Vax
Subject: Re: Loglan
Article-I.D.: abnjh.236
[Directed to Pourne@MIT-MC]
1. Rumor has it that SOMEONE at the Univ. of Washington (State of, NOT
D.C.) was working on the [LOGLAN] grammar online (UN*X, as I recall).
I haven't yet had the temerity to post a general inquiry regarding
their locale. If they read your request and respond, please POST
it...some of us out here are also interested.
2. A friend of mine at Ohio State has typed in (by hand!) the glossary
from Vol 1 (the laymans grammar) which could be useful for writing a
"flashcard" program, but both of us are too busy.
Art Wieners
(who will only be at this addr for this week,
but keep your modems open for a resurfacing
at da Labs...)
------------------------------
Date: 7 Sep 83 16:43:58-PDT (Wed)
From: decvax!genrad!grkermit!chris @ Ucb-Vax
Subject: Re: Loglan
Article-I.D.: grkermit.654
I just posted something relevant to net.nlang. (I'm not sure which is
more appropriate, but I'm going to assume that "natural" language is
closer than all of Artificial Intelligence.)
I sent a request for information to the Loglan Institute, (Route 10,
Box 260 Gainesville, FL 32601 [a NEW address]) and they are just about
to go splashily public again. I posted the first page of their reply
letter, see net.nlang for more details. Later postings will cover
their short description of their Interactive Parser, which is among
their many new or improved offerings.
decvax!genrad!grkermit!chris
allegra!linus!genrad!grkermit!chris
harpo!eagle!mit-vax!grkermit!chris
------------------------------
Date: 2-Sep-83 19:33 PDT
From: Kirk Kelley <KIRK.TYM@OFFICE-2>
Subject: Multiple Inheritance query
Can you tell me where I can find a discussion of the anatomy and value
of multiple inheritance? I wonder if it is worth adding this feature
to the design for a lay-person's language, called Players, for
specifying adventures.
-- kirk
------------------------------
Date: 24 August 1983 1536-PDT (Wednesday)
From: Foonberg at AEROSPACE (Alan Foonberg)
Subject: Another Puzzle
[Reprinted from the Prolog Digest.]
I was glancing at an old copy of Games magazine and came across the
following puzzle:
Can you find a ten digit number such that its left-most digit tells
how many zeroes there are in the number, its second digit tells how
many ones there are, etc.?
For example, 6210001000. There are 6 zeroes, 2 ones, 1 two, no
threes, etc. I'd be interested to see any efficient solutions to this
fairly simple problem. Can you derive all such numbers, not only
ten-digit numbers? Feel free to make your own extensions to this
problem.
Alan
------------------------------
Date: 5 Sep 83 20:11:04-PDT (Mon)
From: harpo!psl @ Ucb-Vax
Subject: Go Tournament
Article-I.D.: harpo.1840
ANNOUNCING
The First Ever
USENIX
COMPUTER
##### #######
# # # #
# # #
# #### # #
# # # #
# # # #
##### #######
##### #### # # ##### # # ## # # ###### # # #####
# # # # # # # ## # # # ## ## # ## # #
# # # # # # # # # # # # # ## # ##### # # # #
# # # # # ##### # # # ###### # # # # # # #
# # # # # # # # ## # # # # # # ## #
# #### #### # # # # # # # # ###### # # #
A B C D E F G H j K L M N O P Q R S T
19 + + + + + + + + + + + + + + + + + + + 19
18 + + + + + + + + + + + + + + + + + + + 18
17 + + + O @ + + + + + + + + + + + + + + 17
16 + + + O + + + O + @ + + + + + @ + + + 16
15 + + + + + + + + + + + + + + + + + + + 15
14 + + O O + + + O + @ + + + + + + + + + 14
13 + + @ + + + + + + + + + + + + + + + + 13
12 + + + + + + + + + + + + + + + + + + + 12
11 + + + + + + + + + + + + + + + + + + + 11
10 + + + + + + + + + + + + + + + + + + + 10
9 + + + + + + + + + + + + + + + + + + + 9
8 + + + + + + + + + + + + + O O O O @ + 8
7 + + O @ + + + + + + + + + O @ @ @ @ @ 7
6 + + @ O O + + + + + + + + + O O O @ + 6
5 + + O + + + + + + + + + + + + O @ @ + 5
4 + + + O + + + + + + + + + + + O @ + + 4
3 + + @ @ + @ + + + + + + + + @ @ O @ + 3
2 + + + + + + + + + + + + + + + + + + + 2
1 + + + + + + + + + + + + + + + + + + + 1
A B C D E F G H j K L M N O P Q R S T
To be held during the Summer 1984 Usenix conference in Salt Lake
City, Utah.
Probable Rules
-------- -----
1) The board will be 19 x 19.
This size was chosen rather than one of the smaller boards because
there is a great deal of accumulated Go "wisdom" that would be
worthless on smaller boards.
2) The board positions will be numbered as in the diagram above. The
columns will be labeled 'A' through 'T' (excluding 'I') left to
right. The rows will be labeled '19' through '1', top to bottom.
3) Play will continue until both programs pass in sequence. This may
be a trouble spot, but looks like the best approach available.
Several alternatives were considered: (1) have the referee decide
when the game is over by identifying "uncontested" versus "contested"
area; (2) limit the game to a certain number of moves; all of them
had one or another unreasonable effect.
4) There will be a time limit for each program. This will be in the
form of a limit on accumulated "user" time (60 minutes?). If a
program goes over the time limit it will be allowed some minimum
amount of time for each move (15 seconds?). If no move is generated
within the minimum time the game is forfeit.
5) The tournament will use a "referee" program to execute each
competing pair of programs; thus the programs must understand a
standard set of commands and generate output of a standard form.
a) Input to the program. All input commands to the program will
be in the form of lines of text appearing on the standard
input and terminated by a newline.
1) The placement of a stone will be expressed as
letter-number (e.g. "G7"). Note that the letter "I"
is not included.
2) A pass will be expressed as "pass".
3) The command "time" means the time limit has been exceeded
and all further moves must be generated within the shorter
minimum time limit.
b) Output from the program. All output from the program will be
in the form of lines of characters sent to the "standard
output" (terminated by a newline) and had better be unbuffered.
1) The placement of a stone will be expressed as
letter-number, as in "G12". Note that the letter "I"
is not included.
2) A pass will be expressed as "pass".
3) Any other output lines will be considered garbage and
ignored.
4) Any syntactically correct but semantically illegal move
(e.g. spot already occupied, ko violation, etc.) will be
considered a forfeit.
The referee program will maintain a display of the board, the move
history, etc.
6) The general form of the tournament will depend on the number of
participants, the availability of computing power, etc. If only a
few programs are entered each program will play every other program
twice. If many are entered some form of Swiss system will be used.
7) These rules are not set in concrete ... yet; this one in
particular.
Comments, suggestions, contributions, etc. should be sent via uucp
to harpo!psl or via U.S. Mail to Peter Langston / Lucasfilm Ltd. /
P.O. Box 2009 / San Rafael, CA 94912.
For the record: I am neither "at Bell Labs" nor "at Usenix", but
rather "at" a company whose net address is a secret (cough, cough!).
Thus notices like this must be sent through helpful intermediaries
like Harpo. I am, however, organizing this tournament "for" Usenix.
------------------------------
End of AIList Digest
********************
