From in%@vtcs1 Fri May 15 04:07:59 1987 Date: Fri, 15 May 87 04:07:49 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #117 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:20 EDT Received: from relay.cs.net by RELAY.CS.NET id ae27862; 12 May 87 3:19 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa19728; 12 May 87 3:16 EDT Date: Mon 11 May 1987 23:51-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #117 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Tuesday, 12 May 1987 Volume 5 : Issue 117 Today's Topics: Administrivia - BITNET Distribution, AI Tools - Source Code Archives ---------------------------------------------------------------------- From: SCHNEIDER Daniel Subject: Re: Administrivia - BITNET Distribution Newsgroups: mod.ai Organization: University of Geneva, Switzerland HI, Lot's of people in Switzerland (and elsewhere too I guess) have access to both BITNET and usenet, sometimes on two different machines, e.g. there is very often a VMS/BITNET and a UNIX/usenet VAX around. ... so maybe you could ask all these people to use rn (i.e. the newsgroup system) on unix and tell them that this way they save a lot of space for *themselves*. A lot of people (even on unix) just don't know about mod.ai ! -Daniel Daniel K.Schneider ISSCO, University of Geneva, 54 route des Acacias, 1227 Carouge (Switzerland) Tel. (..41) (22) 20 93 33 ext. 2114 to VMS/BITNET: to UNIX/EAN (preferable): BITNET: SCHNEIDER@CGEUGE51 shneider%cui.unige.chunet@CERNVAX ARPA: SCHNEIDER%CGEUGE51.BITNET@WISCVM shneider@cui.unige.CHUNET or: shneider%cui.unige.chunet@ubc.csnet uucp: mcvax!cernvax!cui!shneider [I've held this message a lot longer than I should have, partly because I don't really understand what goes on on the other side of the gateways. I'm not sure, for instance, whether mod.ai is still mod.ai since the recent name reorganization. Anyway, there is a moderated newsgroup and an unmoderated one (comp.ai, formerly net.ai); together they provide all that is in the Arpanet AIList digests plus occasionally a little bit more that I choose not to pass along. You can certainly cut mailer costs if you drop direct digest delivery in favor of the Usenet newsgroup distribution. For those of you with access to BITNET, redistribution via the FINHUTC LISTSERV utility should also be prefered to direct distribution. (FINHUTC seems to be the only such LISTSERV at the moment; I'm told that other LISTSERVs will pass AIList signups on to that host.) -- KIL] ------------------------------ Date: Wed, 1 Apr 87 10:21:04 EST From: ucbcad!ames!rutgers!harvard!panda!suntzu!rmc@ucbvax.Berkeley.EDU Subject: Re: Policy - Source Code Archives [The following tells all you would ever want to know about the mod.sources code redistribution. I give up on trying to make a summary of how one would access the AI Expert code (if it has even been submitted). Anyone who figures that out might send us a little summary. Meanwhile Lawrence Leff tells me that the North Texas AI Association has nearly finished setting up a redistribution system for code and for report lists. Thanks, everyone! -- KIL] Well, here be the articles wherein i found the information on SIMTEL-20 and mod.sources. I think the SIMTEL article is from the moderator of their archives, and the mod.sources one definitely is. I kept all the mail headers in the hopes that they will make it easier to contact them (always difficult on an amorphous net.) R Mark Chilenskas decvax!genrad!panda!rmc >From panda!genrad!mit-eddie!mirror!sources-request Article: 737 of mod.sources Path: teddy!panda!genrad!mit-eddie!mirror!sources-request >From: sources-request@mirror.TMC.COM Newsgroups: mod.sources Subject: v09INF1: Introduction to mod.sources Message-ID: <2127@mirror.TMC.COM> Date: 6 Mar 87 21:13:12 GMT Sender: rs@mirror.TMC.COM Lines: 191 Approved: rs@mirror.TMC.COM Submitted by: Rich Salz Mod.sources: Volume 9, Info 1 Archive-name: index9.1 This is the first of two introductory messages about mod.sources. This one describes how to submit source to mod.sources, where the archive sites are, and how to contact them. The companion articles lists all previously-published mod.sources articles. I am always looking for suggestions on how to improve the usefulness of mod.sources, and can be contacted as listed below. -Rich Salz -------------------------------------------------------- SUBMITTING SOURCE FOR PUBLICATION Items intended for posting should be sent to mirror!sources; requests for missing copies or other queries should be sent to mirror!sources-request. In Australia, Robert Elz is a "sub-moderator"; people there can work with him (kre@munnari.OZ) to get postings out more easily. If you want verification of arrival, so say in a cover note, or at the beginning of your submission, if it is small. I try to verify that a program works, and if I can't get it to work, I may hold up posting it for a couple of days. Please note that, except in rare cases, source without documentation and a Makefile will not be published. The backlog from receival to posting is now about two weeks; this will probably shrink down to one week in the upcoming weeks. When you send mail, MAKE SURE to include a return address relative to some well-known site(s). When all else fails, my conventional address and phone number are: Rich $alz Mirror Systems 2067 Massachusetts Avenue Cambridge, MA 02140 617-661-0777 --------------------------------------------------------------------------- THE STRUCTURE OF MOD.SOURCES ARTICLES Each posting in mod.sources is called an "issue"; there are 100 issues to a volume. The division is arbitrary, and has varied greatly in the past. There are two types of articles in mod.sources; sources and "information postings." They can be distinguished by the subject line: Subject: v07INF8: Index for Volume 7 and other info This first word in the title identifies this as the eight info posting in volume seven. Similarly, the subject line shown below: Subject: v07i081: Public-domain Unix kernel identifies this as the 81st source article in Volume 7. Large sources are broken up into smaller pieces, and have subject lines that look like this: Subject: v07i082: System VI Source Distribution, Part03/08 The first few lines of an article are auxiliary headers that look like this: Submitted by: root@freeware.ATT.COM Mod.sources: Volume 7, Issue 82 Archive-name: new-login The "Submitted by" is the author of the program. If you have comments about the sources published in mod.sources, this is the person to contact. When possible, this address is in domain form, otherwise it is a UUCP bang path relative to site "mirror" (my machine). The second line repeats the volume/issue information for the aide of NOTES sites and automatic archiving programs. The Archive-name is the "official" name of this source in the archive. Large postings will have names that look like this: Archive-name: patch2/Part01 Please try to use this name when requesting that sources be mailed to you. Also, note that the "part number" given in the title, and the archive name given in the auxiliary header need not be identical. ------------------------------------------------------------- ACCESSING THE MOD.SOURCES ARCHIVE The complete mod.sources archives are fairly large: Volume Size (Kbytes) 1 4004 2 1204 3 3434 4 4220 5 390 6 4220 7 3976 8 4416 There are several active archive sites around the net. I am particularly interested in helping set up a BITNET archive. A French archive site is being set up, and it may be extended to provide full European coverage; I will post more information as soon as things are settled. When you request something before Volume 6, please make sure to be as descriptive as possible as articles before then do not have official names. Several sites below will send tapes through the mail. For those sites, send a 1/2" mag tape WITH RETURN POSTAGE and RETURN MAILER. Tapes without postage or mailer will not be returned. No other methods (COD, etc.) are available; please don't ask. Finally, please note that I am Rich $alz, rs@mirror; Rick Adams is rick@seismo, and Rich Kulawiec is rsk@j.cc.purdue.edu; we appreciate the extra effort to get our names right. :-) 1. Phil Burdi has an archive on-line; contact usenet@cuae2.ATT.COM for more info. He has also set up an off-hours UUCP login providing anonymous UUCP access to the archives. The L.sys (Systems file) entry looks like: (for HoneyDanBer UUCP users) cuaepd Wk1830-0530,Sa,Su ACU 1200 3129643773 in:--in: pduucp (for other UUCP users) cuaepd Any1830-0530 ACU 1200 3129643773 in:--in: pduucp Retrieve the file cuaepd!~/netnews/mod.sources/howto.snarf and follow the directions therein. 2. Pyramid Technology has an archive arranged topically, and in compressed tar files. They are happy to take new UUCP connections. They are also somewhat willing to make tapes for people to come by and pick up, provided you call WELL in advance and bring lunch money. This is being managed by Claudia Dimmers and/or Carl Gutekunst. Contact pyramid!usenet for more info. 3. Robert Elz (kre@munnari.OZ) keeps mod.sources in different ways depending on his available disk space; contact him for more info. 4. Thos Sumner at UCSF will respond to requests for material, but cannot promise an ongoing commitment. Anyone requesting material via mail should supply a path from ucbvax. Anyone requesting tape should contact me first. Contact him at thos@cca.ucsf.edu, or ucbvax!ucsfcgl!cca.UCSF!thos 5. Tom Patterson at Washington University can make 800/1600/6250 BPI tar tapes. If you give him a "real good reason," he can also make 1600 BPI VMS BACKUP or ANSI tapes. Send your tape, mailer, and postage to Tom at: Engineering Computer Lab, Bryan 509 Lindell & Skinker Blvd Washington University St. Louis, MO 63130 For best results, first send mail to wucs!archive (you stand a better chance of getting processed quickly that way). 6. Jim Thompson (otto!jim) can make 1600 and 6250 tar and cpio tapes, as well as VMS backup in a real pinch. He will also provide a temporary UUCP login for interested parties at 1200 or 2400 baud. His postal address is: Jim Thompson c/o Sun Teleguide 2551 Green Valley Pkwy Henderson, Nv. 89015 (702) 454-4636 7. Of course, I have a complete set of archives. I can mail individual postings, make files available for UUCP, and will send tapes (1600 BPI tar; 6250 or cpio in a crunch). Last time I checked, it cost about $3 to send a 2400' tape across the country in a padded envelope via first-class mail. 8. Rick Adams (rick@seismo.CSS.GOV) provides archive access to those on the Internet. Access is available directly via anonymous FTP (Outside of 9am-7pm EST M-F.) The files are in a directory mod.sources, then a sub-directory Volume[1-7]. They are named as closely as possible to the names in the Index. Files that have not been assigned a "short name" reside in the directory sources/mod temporarily. Send tape, mailer, and postage to Rick at: Center for Seismic Studies 1300 North 17th Street, Suite 1450 Arlington, VA 22209-3871 9. Internet sites may also retrieve archives from j.cc.purdue.edu via anonymous ftp. The archive is in the directory "mod.sources", subdivided into "volume1", etc. Due to disk space considerations, many of the sources are compressed; these may be recognized by the ".Z" suffix. If you don't have compress & friends, they are in ~ftp/pub/compress.shar for the taking. This is being managed by Rich Kulawiec (Wombat), pucc-j!rsk, rsk@j.cc.purdue.edu. If your host tables don't grok "j.cc.purdue.edu", try "purdue-asc.arpa". They would appreciate it if you would avoid large file transfers in the middle of the day. [Rick also points out that the FTP'able archies also contain mod.amiga, a bunch of kermit sources, news 2.11, rn 4.3, nntp, and whatever else happens to be in ~ftp/pub at the moment.] 10. The CSNET CIC has been doing a fair amount of work to bring their automated retrieval up-to-speed. They now have a complete archive, and are making things available as quickly as possible (they have special legal restrictions on what they can distribute, so everything may not be available). Look in the latest issue of the CSNET Forum, or contact postmaster@sh.cs.net. ________ >From panda!genrad!decvax!ucbvax!ucbcad!ames!styx!lll-lcc!seismo!brl-adm !brl-smoke!w8sdz Article: 2430 of comp.sys.ibm.pc Path: teddy!panda!genrad!decvax!ucbvax!ucbcad!ames!styx!lll-lcc!seismo!brl-adm !brl-smoke!w8sdz >From: w8sdz@brl-smoke.ARPA (Keith B. Petersen ) Newsgroups: comp.sys.ibm.pc Subject: Re: "pr" for dos Message-ID: <5665@brl-smoke.ARPA> Date: 7 Mar 87 04:28:30 GMT References: <286@micropro.UUCP> <1108@uwmacc.UUCP> <2120@tekgvs.TEK.COM> <1129@uwmacc.UUCP> Reply-To: w8sdz@brl.arpa (Keith B. Petersen (WSMR|towson) ) Distribution: na Organization: Ballistic Research Lab (BRL), APG, MD. Lines: 106 Status: RO To obtain up to five files in a single request message by netmail from the public domain archives kept on SIMTEL20.ARPA, send a message to: ARCHIVE-REQUEST@SIMTEL20.ARPA or via uucp: ...!ucbvax!simtel20.arpa!archive-request ...!uw-beaver!simtel20.arpa!archive-request ...!decwrl!simtel20.arpa!archive-request ...!lll-crg!simtel20.arpa!archive-request ...!ut-sally!simtel20.arpa!archive-request ...!harvard!simtel20.arpa!archive-request [do NOT use host "seismo" - they are blocking messages from the server] The message body must contain lines beginning with the keyword SEND, one SEND line for each file requested. Case is not significant. The general syntax of a SEND line is: SEND format filename In general, a filename consists of the following components: device:file.type.generation "device:" is usually PD:, and the combination of PD: is expected unless an alias has been advertised of the form "alias:", which takes the place of both device and directory fields. The generation field should be left off in order to default to the highest generation number so you can be sure of getting the latest version of the file requested. "file.type" follows the usual filenaming conventions. In all formats listed below, if the file to be sent is larger than 55K, the file is sent in numbered parts. The parts must be reassembled in order and edited to remove any headers, preface, and trailers before the process can be reversed to reconstruct the original file. Allowable formats are: SEND HELP This file you are reading now. SEND INFO A detailed description of the SIMTEL20 Archives, which includes this file, pointers to certain key files, and descriptions of various file transfer programs and related utilities. SEND BOOTSTRAP A brief quick reference listing of filenames of the key utilities used to reconstruct files sent by the compression and encoding techniques listed below. SEND DIR filespec This format returns a CRC list of the requested files, and is the only format which allows wildcard filenames (but not wildcard directory names). The list is sent as an ASCII text file. The wildcard characters are "*" and "%". The asterisk means any number of characters, while the percent sign means exactly one character. Either or both may appear in any combination in either or both the file or type fields, while only the asterisk may appear in the generation field. SEND RAW filename If the file is ASCII, it is sent as-is, regardless of size. This format is the least efficient over network and mail gateway resources. Use this format only if you absolutely must. With the four formats listed below, if the file is ASCII and under 25k characters, it is sent as-is, as if RAW format was requested. Binary files are always processed according to the requested format. However, a request for ARC or SQ processing of files with type ".ARC", ".LBR", or ".%Q%" is ignored and the original file is either uuencoded or hexified (if possible), according to the requested format. If the file was not sent RAW, a short preface is inserted at the front of the message describing the process actually taken and a CRC entry describing the original file. SEND ARE filename or SEND filename The original file is made into a uuencoded ARC file. SEND ARH filename The original file is made into a hexified ARC file if the ARC file is under 64K bytes long. Otherwise, an apology is returned instead of the requested file. SEND SQE filename The original file is made into a uuencoded SQueezed file. SEND SQH filename The original file is made into a hexified SQueezed file if the Squeezed file is under 64K bytes long. Otherwise, an apology is returned instead of the requested file. To get started in finding your way around the SIMTEL20 archives, send a message to the server with the request: SEND INFO -- --Keith Petersen Arpa: W8SDZ@SIMTEL20.ARPA Uucp: {bellcore,decwrl,harvard,lll-crg,ucbvax,uw-beaver}!simtel20.arpa!w8sdz GEnie Mail: W8SDZ ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 15 04:08:15 1987 Date: Fri, 15 May 87 04:08:03 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #118 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:23 EDT Received: from relay.cs.net by RELAY.CS.NET id ac27927; 12 May 87 3:32 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa19798; 12 May 87 3:28 EDT Date: Tue 12 May 1987 00:00-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #118 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Tuesday, 12 May 1987 Volume 5 : Issue 118 Today's Topics: Queries - Design Info for Expert Systems & Publicly available Expert Systems? & KA Workshop Proceedings & Post-Graduate Research in Visual Recognition using AI, Conference - IJCAI Information, Philosophy - The Symbol Grounding Problem ---------------------------------------------------------------------- Date: 7 May 87 04:53:54 GMT From: oliveb!intelca!mipos3!omepd!psu-cs!psueea!lendaris@ames.arpa (George G. Lendaris) Subject: Wanted: Design Info re: Operational Expert Systems For the last year I have been studying papers which give a high level treatment of design con- siderations for expert systems in various con- texts. Currently, I am studying a book by Sowa titled "Conceptual Structures". I am now interested in more detailed descriptions of operational expert systems to gain familiarity with "lower level" issues that need attention in actually realizing the representation and manipu- lation of "knowledge". I would like a reasonably detailed description (in English) of the "nitty gritties" of such an imple- mentation. Leads to people who might have such information will be greatly appreciated. Please send to lendaris@psueea.UUCP Thanks in advance. George G. Lendaris Professor of Systems Science and Electrical Engineering ------------------------------ Date: 8 May 87 07:48:18 GMT From: arman@locus.ucla.edu Subject: Publicly available Expert Systems? Dear colleagues, I was wondering if there are any publicly availble Expert Systems out there. It doesn't really matter what machine it is running on, or what language it is written in, I just want to look at some real (and maybe) working code. I would also appreciate any pointers to places (universities) where I could get expert systems from. Please Email responses and I shall summarize the results if there is any interest. Thank You, (in advance) Arman Bostani, arman@cs.ucla.edu [...] ------------------------------ Date: Fri, 8 May 87 09:46:24 edt From: dg1v#@andrew.cmu.edu (David Greene) Subject: KA workshop proceedings Can anyone tell me where I can get the proceedings from : Knowledge Acquisition for Knowledge-Based Systems Workshop, Banff, Alberta, Canada, November 2-7, 1986. Also is there any information about future workshops? Thanks in advance. - David Greene dg1v@andrew.cmu.edu ------------------------------ Date: Tue, 12 May 87 15:55:24 +1000 From: J.T. Teh Subject: Information wanted on Post Graduate research in Visual Recognition using AI Information wanted on Post Graduate research in Visual Recognition using AI I am an Honours student at the University of Melbourne, Australia and am interested in persuing a PostGraduate degree in the field of Visual Recognition systems using Prolog. My Honours project is to develop a Visual Recognition system to run on the Apple Macintosh Plus using Prolog. I am looking for information about universities in the United States, UK or within Australia that are involved and with experience in this area of research. If anyone has any information or names of people of whom I should contact, could they mail me directly? Thanks in advance. Or, if you know of anyone who might know, could you please redirect this article to them? Thank you. J.T. Teh =========================== UUCP: {seismo,mcvax,ukc,ubc-vision}!munnari!jteh or {seismo,mcvax,ukc,ubc-vision}!mulga!jteh ARPA: jteh%munnari.oz@seismo.css.gov or jteh%mulga.oz@seismo.css.gov CSNET: jteh%munnari.oz@australia or jteh%mulga.oz@australia Postal Address: J.T. Teh c/o Department of Computer Science University of Melbourne Parkville, Melbourne, Australia 3052. -------- J.T Teh "He is no fool who gives up what he cannot keep to gain what he cannot lose." - James Elliot ------------------------------ Date: Sun, 10 May 87 16:27:31 BST From: "G. Joly" (Birkbeck) Subject: Re: IJCAI information (Vol 5 # 111). Can I echo Chang Bang in a request for info on IJCAI-87? I would like to know if there is any financial support available from IJCAII (the sponsors). I note that US citizens can get support for air travel from abroad (this was announced in the digest). I have not seen any mention of sources of support in the conference brochure. (I have applied to local (U.K.) sources for partial support.) Gordon Joly, Computer Science, Birkbeck College, Malet Street, LONDON WC1E 7HX. +44 1 631 6468 ARPA: gjoly@cs.ucl.ac.uk BITNET: UBACW59%uk.ac.bbk.cu@AC.UK UUCP: ...!seismo!mvcax!ukc!bbk-cs!gordon ------------------------------ Date: Mon 11 May 87 10:09:11-PDT From: Georgia Navarro Subject: Early Registration for IJCAI [Forwarded by Laws@STRIPE.SRI.COM.] The deadline for early registration for IJCAI in Milan is JUNE 15. The registration fee has to be in lira. IT TAKES AT LEAST 3 WEEKS TO GET A CHECK FROM THE BofA. Also, there is a special on hotel accomodations, but that check is supposed to be there no later than May 30. [...] ------------------------------ Date: Sat, 9 May 87 11:45:17 EDT From: harnad@Princeton.EDU Subject: The Symbol Grounding Problem [Also forwarded to the Neuron Digest. -- KIL] To define a SUBsymbolic "level" rather than merely a NONsymbolic process or phenomenon one needs a formal justification for the implied up/down-ness of the relationship. In the paradigm case -- the hardware/software distinction and the hierarchy of compiled programming languages -- the requisite formal basis for the hierarchy is quite explicit. It is the relation of compilation and implementation. Higher-level languages are formally compiled into lower level ones and the lowest is implemented as instructions that are executed by a machine. Is there anything in the relation of connectionist processes to symbolic ones that justifies calling the former "sub"-symbolic in anything other than a a hopeful metaphorical sense at this time? The fact that IF neural processes are really connectionistic (an empirical hypothesis) THEN connectionist models are implementable in the brain defines a super/sub relationship between connectionist models and neural processes (conditional, of course, on the validity -- far from established or even suggested by existing evidence -- of the empirical hypothesis), but this would still have no bearing on whether connectionism can be considered to stand in a sub/super relationship to a symbolic "level." There is of course also the fact that any discrete physical process is formally equivalent in its input/output relations to some turing machine state, i.e., some symbolic state. But that would make every such physical process "subsymbolic," so surely turing equivalence cannot be the requisite justification for the putative subsymbolic status of connectionism in particular. [Has Turing-equivalence of connectionist systems been established? My understanding is that asynchronous analog systems need not be "discrete physical processes" or finite algorithms. -- KIL] A fourth sense of down-up (besides hardware/software, neural implementability and turing-equivalence) is psychophysical down-upness. According to my own bottom-up model, presented in the book I just edited (Categorical Perception, Cambridge University Press 1987), symbols can be "grounded" in nonsymbolic representations in the following specific way: Sensory input generates (1) iconic representations -- continuous, isomorphic analogs of the sensory surfaces. Iconic representations subserve relative discrimination performance (telling pairs of things apart and judging how similar they are). Next, constraints on categorization (e.g., either natural discontinuities in the input, innate discontinuities in the internal representation, or, most important, discontinuities *learned* on the basis of input sampling, sorting and labeling with feedback) generate (2) categorical representations -- constructive A/D filters which preserve the invariant sensory features that are sufficient to subserve reliable categorization performance. [It is in the process of *finding* the invariant features in a given context of confusable alternatives that I believe connectionist processes may come in.] Categorical representations subserve identification performance (sorting things and naming them). Finally, the *labels* of these labeled categories -- now *grounded* bottom/up in nonsymbolic representations (iconic and categorical) derived from sensory experience -- can then be combined and recombined in (3) symbolic representations of the kind used (exclusively, and without grounding) in contemporary symbolic AI approaches. Symbolic representations subserve natural language and all knowledge and learning by *description* as opposed to direct experiential acquaintance. In response to my challenge to justify the "sub" in "subsymbolic" when one wishes to characterize connectionism as subsymbolic rather than just nonsymbolic, rik%roland@sdcsvax.ucsd.edu (Rik Belew) replies: > I do intend something more than non-symbolic when I use the term > sub-symbolic. I do not rely upon "hopeful neural analogies" or any > other form of hardware/software distinction. I use "subsymbolic" > to refer to a level of representation below the symbolic > representations typically used in AI... I also intend to connote > a supporting relationship between the levels, with subsymbolic > representations being used to construct symbolic ones (as in subatomic). The problem is that the "below" and the "supporting" are not cashed in, and hence just seem to be synonyms for "sub," which remains to be justified. An explicit bottom-up hypothesis is needed to characterize just how the symbolic representations are constructed out of the "subsymbolic" ones. (The "subatomic" analogy won't do, otherwise atoms risk becoming subsymbolic too...) Dr. Belew expresses some sympathy for my own grounding hypothesis, but it is not clear that he is relying on it for the justification of his own "sub." Moreover, this would make connectionism's subsymbolic status conditional on the validity of a particular grounding hypothesis (i.e., that three representational levels exist as I described them, in the specific relation I described, and that connectionistic processes are the means of extracting the invariant features underlying the categorical [subsymbolic] representation). I would of course be delighted if my hypothesis turned out to be right, but at this point it still seems a rather risky "ground" for justifying the "sub" status of connectionism. > my interest in symbols began with the question of how a system might > learn truly new symbols. I see nothing in the traditional AI > definitions of symbol that helps me with that problem. The traditional AI definition of symbol is simply arbitrary formal tokens in a formal symbol system, governed by formal syntactic rules for symbol manipulation. This general notion is not unique to AI but comes from the formal theory of computation. There is certainly a sense of "new" that this captures, namely, novel recombinations of prior symbols, according to the syntactic rules for combination and recombination. And that's certainly too vague and general for, say, human senses of symbol and new-symbol. In my model this combinatorial property does make the production of new symbols possible, in a sense. But combinatorics is limited by several factors. One factor is the grounding problem, already discussed (symbols alone just generate an ungrounded, formal syntactic circle that there is no way of breaking out of, just as in trying to learn Chinese from a Chinese-Chinese dictionary alone). Other limiting factors on combinatorics are combinatory explosion, the frame problem, the credit assignment problem and all the other variants that I have conjectured to be just different aspects of the problem of the *underdetermination* of theory by data. Pure symbol combinatorics certainly cannot contend with these. The final "newness" problem is of course that of creativity -- the stuff that, by definition, is not derivable by some prior rule from your existing symbolic repertoire. A rule for handling that would be self-contradictory; the real source of such newness is probably partly statistical, and again connectionism may be one of the candidate components. > It seems very conceivable to me that the critical property we will > choose to ascribe to computational objects in our systems symbols > is that we (i.e., people) can understand their semantic content. You are right, and what I had inadvertently left out of my prior (standard) syntactic definition of symbols and symbol manipulation was of course that the symbols and manipulations must be semantically interpretable. Unfortunately, so far that further fact has only led to Searlian mysteries about "intrinsic" vs. "derived intentionality" and scepticism about the the possibility of capturing mental processes with computational ones. My grounding proposal is meant to answer these as well. > the fact that symbols must be grounded in the *experience* of the > cognitive system suggests why symbols in artificial systems (like > computers) will be fundamentally different from those arising in > natural systems (like people)... if your grounding hypothesis is > correct (as I believe it is) and the symbols thus generated are based > in a fundamental way on the machine's experience, I see no reason to > believe that the resulting symbols will be comprehensible to people. > [e.g., interpretations of hidden units... as our systems get more > complex] This is why I've laid such emphasis on the "Total Turing Test." Because toy models and modules, based on restricted data and performance capacities, may simply not be representative of and comparable to organisms' complexly interrelated robotic and symbolic functional capacities. The experiential base -- and, more important, the performance capacity -- must be comparable in a viable model of cognition. On the other hand, the "experience" I'm talking about is merely the direct (nonsymbolic) sensory input history, *not* "conscious experience." I'm a methodological epiphenomenalist on that. And I don't understand the part about the comprehensibility of machine symbols to people. This may be the ambiguity of the symbolic status of putative "subsymbolic" representations again. > The experience lying behind a word like "apple" is so different > for any human from that of any machine that I find it very unlikely > that the "apple" symbol used by these two system will be comparable. I agree. But this is why I proposed that a candidate device must pass the Total Turing Test in order to be capture mental function. Arbitrary pieces of performance could be accomplished in radically different ways and would hence be noncomparable with our own. > Based on the grounding hypothesis, if computers are ever to understand > NL as fully as humans, they must have an equally vast corpus of > experience from which to draw. We propose that the huge volumes of NL > text managed by IR systems provide exactly the corpus of "experience" > needed for such understanding. Each word in every document in an IR > system constitutes a separate experiential "data point" about what > that word means. (We also recognize, however, that the obvious > differences between the text-base "experience" and the human > experience also implies fundamental limits on NL understanding > derived from this source.)... In this application the computer's > experience of the world is second-hand, via documents written by > people about the world and subsequently through users'queries of > the system We cannot be talking about the same grounding hypothesis, because mine is based on *direct sensory experience* ("learning by acquaintance") as oppposed to the symbol combinations ("learning by description"), with which it is explicitly contrasted, and which my hypothesis claims must be *grounded* in the former. The difference between text-based and sensory experience is crucial indeed, but for both humans and machines. Sensory input is nonsymbolic and first-hand; textual information is symbolic and second-hand. First things first. > I'm a bit worried that there is a basic contradiction in grounded > symbols. You are suggesting (and I've been agreeing) that the only > useful notion of symbols requires that they have "inherent > intentionality": i.e., that there is a relatively direct connection > between them and the world they denote. Yet almost every definition > of symbols requires that the correspondence between the symbol and > its referent be *arbitrary*. It seems, therefore, that your "symbols" > correspond more closely to *icons* (as defined by Peirce), which > do have such direct correspondences, than to symbols. Would you agree? I'm afraid I must disagree. As I indicated earlier, icons do indeed play a role in my proposal, but they are not the symbols. They merely provide part of the (nonsymbolic) *groundwork* for the symbols. The symbol tokens are indeed arbitrary. Their relation to the world is grounded in and mediated by the (nonsymbolic) iconic and categorical representations. > In terms of computerized knowledge representations, I think we have > need of both icons and symbols... And reliable categorical invariance filters. And a principled bottom-up grounding relation among them. > I see connectionist learning systems building representational objects > that seem most like icons. I see traditional AI knowledge > representation languages typically using symbols and indices. One of > the questions that most interests me at the moment is the appropriate > "ontogenetic ordering" for these three classes of representation. > I think the answer would have clear consequences for this discussion > of the relationship between connectionist and symbolic representations > in AI. I see analog transformations of the sensory surfaces as the best candidates for icons, and connectionist learning systems as as possible candidates for the process that finds and extracts the invariant features underlying categorical representations. I agree about traditional AI and symbols, and my grounding hypothesis is intended as an answer about the appropriate "ontogenetic ordering." > Finally, this view also helps to characterize what I find missing > in most *symbolic* approaches to machine learning: the world > "experienced" by these systems is unrealistically barren, composed > of relatively small numbers of relatively simple percepts (describing > blocks-world arches, or poker hands, for example). The appealling > aspect of connectionist learning systems (and other subsymbolic > learning approaches...) is that they thrive in exactly those > situations where the system's base of "experience" is richer by > several orders of magnitude. This accounts for the basically > *statistical* nature of these algorithms (to which you've referred), > since they are attempting to build representations that account for > statistically significant regularities in their massive base of > experience. Toy models and microworlds are indeed barren, unrealistic and probably unrepresentative. We should work toward models that can pass the Total Turing Test. Invariance-detection under conditions of high interconfusability is indeed the problem of a device or organism that learns its categories from experience. If connectionism turns out to be able to do this on a life-size scale, it will certainly be a powerful candidate component in the processes underlying our representational architecture, especially the categorical level. What that architecture is, and whether this is indeed the precise justification for connectionism's "sub" status, remains to be seen. Stevan Harnad {seismo, psuvax1, bellcore, rutgers, packard} !princeton!mind!harnad harnad%mind@princeton.csnet harnad@mind.princeton.edu (609)-921-7771 ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 15 04:08:27 1987 Date: Fri, 15 May 87 04:08:16 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #119 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:26 EDT Received: from relay.cs.net by RELAY.CS.NET id ae27927; 12 May 87 3:32 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa19809; 12 May 87 3:30 EDT Date: Tue 12 May 1987 00:07-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #119 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Tuesday, 12 May 1987 Volume 5 : Issue 119 Today's Topics: Application - Grammar Checkers, AI Tools - Academic Release of NU-Prolog System ---------------------------------------------------------------------- Date: 8 May 87 08:32:10 GMT From: humu!uhccux!todd%nosc.UUCP@sdcsvax.ucsd.edu (The Perplexed Wiz) Reply-to: todd@uhccux.UUCP (The Perplexed Wiz) Subject: Re: grammar checkers I would rather see mainstream AI-related topics given space in AIList rather than take up more space with yet another "grammar checker" related messsage. And while I accept the criticism of my comments in the spirit of academic give and take in the exchange of ideas, I will make, I hope, the final comment in this discussion and then consider it closed for the moment. I wish the two following commentators "Linda G. Means" gilbert@aimmi.UUCP (Gilbert Cockton) had *read* what I said before they reacted. I wrote: >I think that if these style checking tools are used in conjunction ^^^^^^^^^^^^^^^^^^^ *********** >with the efforts of a good teacher of writing, then these style ^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^ >checkers are of great benefit. It is better that children learn a >few rules of writing to start with than no rules at all. Of course, >reading lots of good examples of writing and a good teacher are still ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ *** ^^^^^^^^^^^^^^^^^^^^^^^^ *** >necessary ^^^^^^^^^ I don't think that anyone would seriously suggest that these borderline "AI" programs be used *exclusively* to teach children (or people of any other age group) to write. My thanks to Ken Laws for allowing this interesting little discussion to take place here instead of forcing us to move it to AI-ED (where it probably belongs, I admit). Now, let's get back to mainstream AI :-) Todd Ogasawara, U. of Hawaii Computing Center UUCP: {ihnp4,seismo,ucbvax,dcdwest}!sdcsvax!nosc!uhccux!todd ARPA: uhccux!todd@nosc.MIL INTERNET: todd@uhccux.UHCC.HAWAII.EDU [NL-KR@CS.ROCHESTER.EDU has also been reprinting these messages. -- KIL] ------------------------------ Date: Fri 8 May 87 10:08:45-PDT From: PAT Subject: Grammar Checkers On 'Style checkers'. Of course one shouldnt criticise to extremes, and no doubt a competent adult would find these things useful sometimes. That wasnt what I was complaining about: it was using them to INFLUENCE children. The word was chosen carefully. Marvin isnt going to think that the thing should be taken as an authority on how to write, or that in order to write well he should simply arrange that the style checker doesnt find any problems. But if they are used to grade or influence the way children write in a school setting, that is exactly what almost all kids will rapidly decide. ( Unless an extraordinarily good teacher is in charge, and maybe even then. Just think of the pressures on a teacher to come to rely on the programs judgement, and on a pupil to take the machine as authoritative. The machine finds no fault with Joes essay and complains about Bettys, but the teacher gives Betty a higher grade..... ) Pat Hayes ------------------------------ Date: 9 May 87 18:17:44 GMT From: gilbert@aimmi.UUCP (Gilbert Cockton) Reply-to: gilbert@aimmi.UUCP (Gilbert Cockton) Subject: Grammar Checkers In article MINSKY@OZ.AI.MIT.EDU writes: >I agree with Todd, Ogasawara: one should not criticise to extremes. What does this mean? I thought accuracy was the only goal in criticism, not avoiding the ends of some quaint invented continuum. Can we have a style checker which rates our extremity with marks out of 10 (0 for credulous and 10 for rampant scepticism perhaps :-)) > I also used it to establish a "gradient". The early >chapters are written at a "grade level" of about 8.6 and the book ends >up with grade levels more like 13.2 - using RightWriter's quaint >scale. How about MIT turning some of its resources towards VALIDATING this quaint gradient? Do you seriously think there is any real computable ordering, partial or otherwise, which can be applied to your chapters and actually square up with any of our everyday evaluations of text complexity? If so, where's the beef? How would US data square up with European data. English teachers in the UK, for example, do not apply unimaginative inflexible rules to students' writing, so it could be that many educated English students will be turned off by an 8.6 introduction. Luckily we have not yet been carried away with the belief that all complex ideas can have banal presentations without bowdlerisation creeping in. Doubtless your style checker would ask me to drop 'bowdlerise'? What should I have used instead, given that I want an EXACT synonym with all its connotations? When I taught, I would have advised my students to find a dictionary (many of them carried them anyway - and I taught children from a wide range of cultural and economic backgrounds). God knows what the French would say to a mechanical style checker (a Franglais remover would go down well though). Finally, how on earth do these style checkers know which words will be commonly understood? Surely they don't use word frequency in newspapers or something like that? Does the overuse of a word in the media imply universal understanding of/consensus on its meaning - eg. 'moral', 'freedom', 'extreme', 'quaint', 'seriously', 'inflexible' etc? Does the limited use of a word in the media imply universal ignorance - eg. 'ok', 'alright', 'balls', 'claptrap', 'space cadet', 'avid', 'stroppy', 'automaton'? I would not regard any of the criticisms of style checkers I have read as 'extreme' at all. The difference seems to be one of gross credulity versus informed criticism. People who know nothing about good style will believe all the things which the style checker hackers have MADE UP - I defy any style checker implementor to point to a sound experimental/statistical basis for the style rules they have palmed off onto their gullible customers. Perhaps they did at least read some books by self-proclaimed authorities, but this would only shift the charge from invention to uncritical acceptance. I'd still be unimpressed. This may sound extreme - that however is irrelevant. The point is, am I accurate?. Note that my substantial assertions are few: i) Style don't compute. Verify by Chinese characters test between a style checker and the editors of the New Yorker (US) or the Listener (UK). Other quality magazine editors will do. Can you spot the editors' critiques? ii) The current 'reading age' metrics have no validity. They are bogus psychometric tools. Operationally I am saying that their will be no strong correlation (say r > 0.9, p < 0.001) between the reading age of text and a reader's performance on a comprehension test. Allow the author to add a glossary and the correlation will weaken. People can learn new words you know. iii) Current measures of popular understanding of words are equally bogus and there is NO decent research to back it up. There has been some good work on correlating vocabulary with educational achievement, but this tells us nothing about the typical adult's vocabulary. Every assertion above is falsifiable, so let's all forget about emotive subjective concepts like extremity (= I disagree a lot and wish you hadn't said that) and get back to an objective, informed debate. The motion is: "All computer based style checkers can stunt the literary growth of their users" A second order effect is that, although 1,000 chimpanzees could between them type out the works of Shakespeare given enough time, they would fail miserably if their output had to be passed by a computer style checker. To be, or not to be, that is the question. >> Sentence starts with infinitive Sentence has no subject. Whether it is .... >> "Whether" may not be understood by people who just read comics. (? spelling mistake = weather ?). -- Gilbert Cockton, Scottish HCI Centre, Ben Line Building, Edinburgh, EH1 1TN JANET: gilbert@uk.ac.hw.aimmi ARPA: gilbert%aimmi.hw.ac.uk@cs.ucl.ac.uk UUCP: ..!{backbone}!aimmi.hw.ac.uk!gilbert ------------------------------ Date: Thu, 7 May 87 22:56 EDT From: Brad Miller Reply-to: miller@cs.rochester.edu Subject: re: grammar checkers Date: Mon, 4 May 87 12:18 EST From: "Linda G. Means" An aside to Ken Laws: You questioned whether the topic of automatic style checkers is appropriate to AILIST: is it AI? I believe it is. The study of computational stylistics is a difficult natural language problem with a long history. [...] - Linda Means GM Research Laboratories means%gmr.com@relay.cs.net Personally, I suspect the question is should the discussion be carried in AIList or moved to NL-KR. NL-KR is, indeed, already picking it up; further such things are directly in NL-KR's scope, and the idea of the list was to be somewhat subtractive from AIList, keeping traffic on Ken's list a little lower. Brad Miller nl-kr-request@cs.rochester.edu miller@cs.rochester.edu miller@acorn.cs.rochester.edu ------------------------------ Date: Fri, 08 May 87 12:19:01 +1000 From: munnari!mulga.oz!jas@seismo.CSS.GOV Subject: Announcement of availability of new Prolog system If the following announcement is suitable for posting in either of these newsgroups, would you be able to forward it to the list ASAP. Thanks, jas - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - John Shepherd Department of Computer Science, University of Melbourne, CSNET: jas%mulga.oz@australia Parkville, 3052, ARPA: jas%mulga.oz@seismo.css.gov AUSTRALIA UUCP: ...!munnari!mulga!jas Announcement: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Subject: Academic Release of NU-Prolog System Version 1.1 of the NU-Prolog system is now available for release to academic institutions (schools, colleges, universities). NU-Prolog is a second generation Prolog system which incorporates a number of important advances in Logic Programming implementation. NU-Prolog was implemented as part of the Machine Intelligence Project+ in the Department of Computer Science at the University of Melbourne. It is the successor to Lee Naish's successful MU-Prolog system and attempts to move Prolog closer to the ideals of Logic Programming by allowing the user to program in a style closer to first order logic. In addition, it provides substantial performance gains over interpreted systems such as MU-Prolog. NU-Prolog has the following features: * compiles Prolog programs into machine code for an enhanced version of the Warren abstract machine (implementing the delay/coroutine style of programming of MU-Prolog) * incorporates a database system based on superimposed codeword indexing which can store general Prolog terms in external databases for fast retrieval by NU-Prolog programs; the database system makes use of the superjoin algorithm to perform efficient join operations * uses "when" declarations (the successor to MU-Prolog's "wait") to control the execution of NU-Prolog programs according to the availability of data * implements a large set of built-in predicates, including many Quintus Prolog predicates; most DEC-10/Edinburgh/MU-Prolog library predicates are available through compatibility libraries The NU-Prolog system contains the following major components: * "nc", the NU-Prolog compiler * "np", a simple interpreter-style interface which implements the standard Edinburgh Prolog style debugging facilities and has a sophisticated query language for accessing external database predicates * "nac", a program for adding control information to NU-Prolog programs written in a purely logical style * "nit", a program for reporting common errors in NU-Prolog programs (cf. Unix/C's "lint") NU-Prolog runs under Unix System V and Berkeley BSD Unix 4.?. It has been implemented on the following machines: Elxsi 6400, Vax 11/780, Perkin Elmer 3240, Sun workstations, Pyramid 98x, Integrated Solutions Workstations. The system comes complete with a manual and all source code. The preferred distribution medium is 1/2" tape, Unix tar-format at 1600bpi. There is a A$400.00 fee to cover distribution costs. In order to obtain a copy of the system, you must first complete a licence agreement with the University of Melbourne. Licences can be obtained by contacting: NU-Prolog Distribution Department of Computer Science University of Melbourne Parkville, Victoria, 3052 AUSTRALIA or CSNET: mip%munnari.oz@australia ARPA: mip%munnari.oz@seismo.css.gov UUCP: ...!munnari!mip (maybe, mip@munnari.uucp) ACSnet: mip@munnari.oz The system will be demonstrated at the Fourth International Conference on Logic Progrmaming in Melbourne later in May. + The Machine Intelligence Project has been assisted in the development of NU-Prolog by: the Commonwealth Department of Science, the Australian Research Grants Scheme, the University of Melbourne and Pyramid Technology, Aust. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 15 04:09:23 1987 Date: Fri, 15 May 87 04:09:15 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #120 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:35 EDT Received: from relay.cs.net by RELAY.CS.NET id ad04348; 13 May 87 1:08 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa08986; 13 May 87 1:07 EDT Date: Tue 12 May 1987 21:41-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #120 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Wednesday, 13 May 1987 Volume 5 : Issue 120 Today's Topics: Reports - NMSU Computer and Cognitive Science Abstracts (1 of 2) ---------------------------------------------------------------------- Date: Sun, 10 May 87 16:07:45 MDT From: yorick%nmsu.csnet@RELAY.CS.NET Subject: Computer and Cognitive Science Abstracts (1 of 2) ABSTRACTS OF MEMORANDA IN COMPUTER AND COGNITIVE SCIENCE Computing Research Laboratory New Mexico State University Box 30001 Las, Cruces, NM 88003. Kamat, S.J. (1985), Value Function Approach to Multiple Sensor Integration, MCCS-85-16. A value function approach is being tried for integrating multiple sensors in a robot environment with known objects. The state of the environment is characterized by some key parameters which affect the performance of the sensors. Initially, only a handful of discrete environmental states will be used. The value of a sensor or a group of sensors is defined as a function of the number of possible object contenders under consideration and the number of contenders that can be rejected after using the sensor information. Each possible environmental state will have its effect on the function, and the function could be redefined to indicate changes in the sampling frequency and/or resolution for the sensors. A theorem prover will be applied to the sensor information available to reject any contenders. The rules used by the theorem prover may be different for each sensors, and the integration is provided by the common decision domain. The values for the different sensor groups will be stored in a database. The order of use of the sensor groups will be according to the values, and can be stored as the best search path. The information in the database can be adaptively updated to provide a training methodology for this approach. Cohen, M. (1985), Design of a New Medium for Volume Holographic Information Processing, MCCS-85-17. An optical analog of the neural networks involved in sensory processing consists of a dispersive medium with gain in a narrow band of wavenumbers, cubic saturation, and a memory nonlinearity that may imprint multiplexed volume holographic gratings. Coupled mode equations are derived for the time evolution of a wave scattered off these gratings; eigenmodes of the coupling matrix $$kappa$$ saturate preferentially, implementing stable reconstruction of a stored memory from partial input and associative reconstruction of a set of stored memories. Multiple scattering in the volume reconstructs cycles of associations that compete for saturation. Input of a new pattern switches all the energy into the cycle containing a representative of that pattern; the system thus acts as an abstract categorizer with multiple basins of stability. The advantages that an imprintable medium with gain biased near the critical point has over either the holographic or the adaptive matrix associative paradigms are (1) images may be input as non-coherent distributions which nucleate long range critical modes within the medium, and (2) the interaction matrix $$kappa$$ of critical modes is full, thus implementing the sort of `full connectivity' needed for associative reconstruction in a physical medium that is only locally connected, such as a nonlinear crystal. Uhr, L. (1985), Massively Parallel Multi-Computer Hardware = Software Structures for Learning, MCCS-85-19. Suggestions are made concerning the building and use of appropriately structured hardware/software multi-computers for exploring ways that intelligent systems can evolve, learn and grow. Several issues are addressed such as: what computers are, the great variety of topologies that can be used to join large numbers of computers together into massively parallel multi-computer networks, and the great sizes that the micro-electronic VLSI (``very large scale integration'') technologies of today and tomorrow make feasible. Finally, several multi-computer structures that appear especially appropriate as the substrate for systems that evolve, learn and grow are described, and a sketch of a system of this sort is begun. Partridge, D. (1985), Input-Expectation Discrepancy Reduction: A Ubiquitous Mechanism, MCCS-85-24. The various manifestations of input-expectation discrepancy that occurs in a broad spectrum of research on intelligent behavior is examined. The point is made that each of the different research activities highlights different aspects of an input-expectation reduction mechanism and neglects others. A comprehensive view of this mechanism has been constructed and applied in the design of a cognitive industrial robot. The mechanism is explained as both a key for machine learning strategies, and a guide for the selection of appropriate memory structures to support intelligent behavior. Ortony, A., Clore, G. & Foss, M. A. (1985), Conditions of Mind, MCCS-85-27. A set of approximately 500 words taken from the literature on emotion was examined. The overall goal was to develop a comprehensive taxonomy of the affective lexicon, with special attention being devoted to the isolation of terms that refer to emotions. Within the taxonomy we propose, the best examples of emotion terms appear to be those that (a) refer to [i]internal, mental[xi] conditions as opposed to physical or external ones, (b) are clear cases of [i]states[xi], and (c) have [i]affect[xi] as opposed to behavior or cognition as their predominant referential focus. Relaxing one or another of these constraints yields poorer examples or nonexamples of emotions; however, this gradedness is not taken as evidence that emotions necessarily defy classical definition. Wilks, Y. (1985), Machine Translation and Artificial Intelligence: Issues and their Histories, MCCS-85-29. The paper reviews the historical relations, and future prospects for relationships, between artificial intelligence and machine translation. The argument of the paper is that machine translation is much more tightly bound into the history of artificial intelligence than many realize (the MT origin of Prolog is only the most striking example of that), and that it remains, not a peripheral, but a crucial task on the AI agenda. Coombs, M.J. (1986), Artificial Intelligence Foundations for a Cognitive Technology: Towards The Co-operative Control of Machines, MCCS-85-45. The value of knowledge-based expert systems for aiding the control of physical and mechanical processes is not firmly established. However, with experience, serious weaknesses have become evident which, for solution, require a new approach to system architecture. The approach proposed in this paper is based on the direct manipulation of models in the control domain. This contrasts with the formal syntactic reasoning methods more conventionally employed. Following from work on the simulation of qualitative human reasoning, this method has potential for implementing truly co-operative human/computer interaction. Coombs, M.J., Hartley, R. & Stell J.F. (1986), Debugging User Conceptions of Interpretation Processes, MCCS-85-46. The use of high level declarative languages has been advocated since they allow problems to be expressed in terms of their domain facts, leaving details of execution to the language interpreter. While this is a significant advantage, it is frequently difficult to learn the procedural constraints imposed by the interpreter. Thus, declarative failures may arise from misunderstanding the implicit procedural content of a program. This paper argues for a \fIconstructive\fR approach to identifying poor understanding of procedural interpretation, and presents a prototype diagnostic system for Prolog. Error modelling is based on the notion of a modular interpreter, misconceptions being seen as modifications of correct procedures. A trace language, based on conceptual analysis of a novice view of Prolog, is used by both the user to describe his conception of execution, and the system to display the actual execution process. A comparison between traces enables the the correct interpreter to be modified in a manner which progressively corresponds to the user's mental interpreter. Dorfman, S.B. & Wilks, Y. (1986), SHAGRIN: A Natural Language Graphics Package Interface, MCCS-85-48. It is a standard problem in applied AI to construct a front-end to some formal data base with the user's input as near English as possible. SHAGRIN is a natural language interface to a computer graphics package. In constructing SHAGRIN, we have chosen some non-standard goals: (1) SHAGRIN is just one of a range of front-ends that we are fitting to the same formal back-end. (2) We have chosen not a data base in the standard sense, but a graphics package language, a command language for controlling the production of graphs on a screen. Parser output is used to generate graphics world commands which then produce graphics PACKAGE commands. A four-component context mechanism incorporates pragmatics into the graphics system as well as actively aids in the maintenance of the state of the graph world. Manthey, M.J. (1986), Hierarchy in Sequential and Concurrent Systems or What's in a Reply, MCCS-85-51. The notion of hierarchy as a tool for controlling conceptual complexity is justifiably well entrenched in computing in general, but our collective experience is almost entirely in the realm of sequential programs. In this paper we focus on exactly what the hierarchy-defining relation should be to be useful in the realm of concurrent programming. We find traditional functional dependency hierarchies to be wanting in this context, and propose an alternative based on shared resources. Finally we discuss some historical and philosophical parallels which seem to have gone largely unnoticed in the computing literature. Huang, X-M (1986), A Bidirectional Chinese Grammar in A Machine Translation System, MCCS-85-52. The paper describes a Chinese grammar which can be run bidirectionally, ie., both as a parser and as a generator of Chinese sentences. When used as a parser, the input to the grammar is single Chinese sentences, and the output would be tree structures for the sentences; when used as a generator, tree structures are the input, and Chinese sentences, the output. The main body of the grammar, the way bidirectionality is achieved, and the performance of the system with some example sentences are given in the paper. Partridge, D. & Wilks, Y. (1986), Does AI have a methodology different from Software Engineering?, MCCS-85-53. The paper argues that the conventional methodology of software engineering is inappropriate to AI, but that the failure of many in AI to see this is producing a Kuhnian paradigm ``crisis''. The key point is that classic software engineering methodology (which we call SPIV: Specify-Prove-Implement-Verify) requires that the problem be circumscribable or surveyable in a way that it is not for areas of AI like natural language processing. In addition, it also requires that a program be open to formal proof of correctness. We contrast this methodology with a weaker form SAT ( complete Specification And Testability - where the last term is used in a strong sense: every execution of the program gives decidably correct/incorrect results) which captures both the essence of SPIV and the key assumptions in practical software engineering. We argue that failure to recognize the inapplicability of the SAT methodology to areas of AI has prevented development of a disciplined methodology (unique to AI, which we call RUDE: Run-Understand-Debug-Edit) that will accommodate the peculiarities of AI and also yield robust, reliable, comprehensible, and hence maintainable AI software. Slator, B.M., Conley, W. & Anderson, M.P (1986), Towards an Adaptive Front-end, MCCS-85-54. An adaptive natual language interface to a graphics package has been implemented. A mechanism for modelling user behavior operating over a script-like decision matrix capturing co-occurrence of commands is used to direct the interface, which uses a semantic parser, when ambiguous utterances are encountered. This is an adaptive mechanism that forms a model of a user's tendencies by observing the user in action. This mechanism provides a method for operating under conditions of uncertainty, and it adds power to the interface - but, being a probabilistic control scheme, it also adds a corresponding element of nondeterminism. A hidden operator experiment was conducted to collect utterance files for a user-derived interface development process. These empirical data were used to design the interface; and a second set, collected later, was used as test data. Lopez, P., Johnston, V. & Partridge, D. (1986), Automatic Calibration of the Geometric Workspace of an Intelligent Robot, MCCS-85-55. An intelligent robot consisting of an arm, a single camera, and a computer, functioning in an industrial environment, is described. A variety of software algorithms that compute and maintain, at task-execution time, the mappings between robot arm, work environment (the robot's world), and camera coordinate systems, are presented. These mappings are derived through a sequence of arm movements and subsequent image ``snapshots'', from which arm motion is detected. With the aid of world self-knowledge (i.e., knowledge of the length of the robot arm and the height of the arm to the base pivot), the robot then uses its ``eye'' to calculate a pixel-to-millimeter ratio in two known planes. By ``looking'' at its arm at two different heights, it geometrically computes the distance of the camera from the arm, hence deriving the mapping from the camera to the work environment. Similarly, the calculation of the intersection of two arm positions (where wrist location and hypothetical base location form a line) gives a base pivot position. With the aid of a perspective projection, now possible since the camera position is known, the position of the base and its planar angle of rotation in the work environment (hence the world to arm mapping) is determined. Once the mappings are known, the robot may begin its task, updating the approximate camera and base pivot positions with appropriate data obtained from task-object manipulations. These world model parameters are likely to remain static throughout the execution of a task, and as time passes, the old information receives more weight than new information when updating is performed. In this manner, the robot first calibrates the geometry of its workspace with sufficient accuracy to allow operation using perspective projection, with performance ``fine-tuned'' to the nuances of a particular work environment through adaptive control algorithms. Fass, D. (1986), Collative Semantics: An Approach to Coherence, MCCS-85-56. Collative Semantics (CS) is a domain-independent semantics for natural language processing that focusses on the problem of coherence. Coherence is the synergism of knowledge (synergism is the interaction of two or more discrete agencies to achieve an effect of which none is individually capable) and plays a substantial role in cognition. The representation of coherence is distinguished from the representation of knowledge and some theoretical connections are established between them. A type of coherence representation has been developed in CS called the semantic vector. Semantic vectors represent the synergistic interaction of knowledge from diverse sources (including the context) that comprise semantic relations. Six types of semantic relation are discriminated and represented: literal, metaphorical, anomalous, novel, inconsistent and redundant. The knowledge description scheme in CS is the senseframe, which represents lexical ambiguity. The semantic primitives in senseframes are word-senses which are a subset of the word-senses in natural language. Because these primitives are from natural language, the semantic markerese problem is avoided and large numbers of primitives are provided for the differentiated description of concepts required by semantic vectors. A natural language program called meta5 uses CS; detailed examples of its operation are given. McDonald, D.R. & Bourne, L.E. Jr. (1986), Conditional Rule Testing in the Wason Card Selection Task, MCCS-85-57. We used the Wason card selection task, with variations, to study conditional reasoning. Disagreement exists in the literature, as to whether performance on this task improves when the problem is expressed concretely and when instructions are properly phrased. In order to resolve some inconsistencies in previous studies, we examined the following variables, (1) task intructions, (2) problem format, and (3) the thematic compatibility of solution choices with formal logic and with pre-existing schemas. In Experiment 1, performance was best in an 8-card, rather than a 4-card or a hierarchical decision-tree format. It was found in Experiment 2 that instructions directing subjects to make selections based on ``violation'' of the rule, rather than assessing its truth or falsity, resulted in more correct responses. Response patterns were predictable in part from formal logical considerations, but primarily from mental models, or schemas, based on (assumed) common prior experience and knowledge. Several explanations for the findings were considered. Partridge, D, McDonald, J., Johnston, V. & Paap, K. (1986) AI Programs and Cognitive Models: Models of Perceptual Processes, MCCS-85-60. We examine and compare two independently developed computer models of human perceptual processes: the recognition of objects in a scene and of words. The first model was developed to support intelligent reasoning in a cognitive industrial robot - an AI system. The second model was developed to account for a collection of empirical data and known problems with earlier models - a cognitive science model. We use these two models, together with the results of empirical studies of human behaviour, to generate a generalised model of human visual processing, and to further our claim that AI modelers should be more cognizant of empirical data. A study of the associated human phenomena provides an essential basis for understanding complex models as well as valuable constraints in complex and otherwise largely unconstrained domains. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 15 04:09:40 1987 Date: Fri, 15 May 87 04:09:28 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #121 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:38 EDT Received: from relay.cs.net by RELAY.CS.NET id ab04362; 13 May 87 1:14 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa09003; 13 May 87 1:12 EDT Date: Tue 12 May 1987 21:45-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #121 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Wednesday, 13 May 1987 Volume 5 : Issue 121 Today's Topics: Reports - NMSU Computer and Cognitive Science Abstracts (2 of 2) ---------------------------------------------------------------------- Date: Sun, 10 May 87 16:07:45 MDT From: yorick%nmsu.csnet@RELAY.CS.NET Subject: Computer and Cognitive Science Abstracts (2 of 2) Computing Research Laboratory New Mexico State University Box 30001 Las, Cruces, NM 88003. Krueger, W. (1986) Transverse Criticality and its Application to Image Processing, MCCS-85-61. The basis for investigation into visual recognition of objects is their representation. One appealing approach begins by replacing the objects themselves by their bounding surfaces. These then are represented by surfaces which have been smoothed according to various prescriptions. The resulting smoothed surfaces are subjected to geometric analysis in an attempt to find critical events which correspond to ``landmarks'' that serve to define the original object. Many vision researchers have used this outline, often incorporating it into a larger one that uses the critical events as constraints in surface generation programs. To deal with complex objects these investigators have proposed a number of candidates for the notion of critical event, most of which take the form of zero-crossings of some differentially defined quantity associated to surfaces (e.g. Gaussian curvature, etc.). Many of these require some a posteriori geometric conditioning (e.g. planarity) in order to be visually significant. In this report, we introduce the notion of a transverse critical line of a smooth function defined on a smooth surface. Transverse criticality attempts to capture the trough/crest behavior manifested by quantities which are globally defined on surfaces (e.g. curvature troughs and crests, irradiance troughs and crests). This notion can be used to study both topographic and photometric surface behavior and includes, as special cases, definitions proposed by other authors, among which notions are the regular edges of Phillips and Machuca [PM] and the interesting flutings of Marr [BPYA]. Applications are made to two classes of surfaces which are important in computer vision height surfaces and generalized cones. Graham, N. & Harary, F. (1986) Packing and Mispacking Subcubes into Hypercubes, MCCS-85-65. A node-disjoint packing of a graph G into a larger graph H is a largest collection of disjoint copies of G contained in H; an edge disjoint packing is defined similarly, but no two copies of G have a common edge. Two packing numbers of G into H are defined accordingly. It is easy to determine both of these numbers when G is a subcube of a hypercube H. A mispacking of G into H is a maximal collection of disjoint copies of G whose removal from H leaves no subgraph G, such that the cardinality of this collection is minimum. Two mispacking numbers of G into H are defined analogously. Their exact determination is quite difficult but we obtain upper bounds. Dietrich, E. & Fields, C. (1986), Creative Problem Solving Using Wanton Inference: It takes at least two to tango, MCCS-85-70. This paper introduces \fBwanton inference\fR, a problem solving strategy for creative problem solving. The central idea underlying wanton inference is that creative solutions to problems are often generated by ignoring boundaries between domains of knowledge and making new connections between previously unassociated elements of one's knowledge base. The major consequence of using the wanton inference strategy is that the size of search spaces is greatly increased. Hence, the wanton inference strategy is fundamentally at odds with the received view in AI that the essence of intelligent problem solving is limiting the search for solutions. Our view is that the problem of limiting search spaces is an artificial problem in AI, resulting from ignoring both the nature of creative problem solving and the social aspect of problem solving. We argue that this latter aspect of problem solving provides the key to dealing with the large search spaces generated by wanton inference. Ballim, A. (1986), The Subjective Ascription of Belief to Agents, MCCS-85-74. A computational model for determining an agent's beliefs from the viewpoint of an agent known as the system is described. The model is based on the earlier work of Wilks and Bien(1983) which argues for a method of dynamically constructing nested points of view from the beliefs that the system holds. This paper extends their work by examining problems involved in ascribing beliefs called meta-beliefs to agents, and by developing a representation to handle these problems. The representation is used in ViewGen, a computer program which generates viewpoints. Partridge, D. (1986), The Scope and Limitations of First Generation Expert Systems, MCCS-85-43. It is clear that expert system's technology is one of AI's greatest successes so far. Currently we see an ever increasing application of expert systems, with no obvious limits to their applicability. Yet there are also a number of well-recognized problems associated with this new technology. I shall argue that these problems are not the puzzles of normal science that will yield to advances within the current technology; on the contrary, they are symptoms of severe inherent limitations of this first generation technology. By reference to these problems I shall outline some important aspects of the scope and limitations of current expert system's technology. The recognition of these limitations is a prerequisite of overcoming them as well as of developing an awareness of the scope of applicability of this new technology. Gerber, M., Dearholt, D.W., Schvaneveldt, R.W., Sachania, V. & Esposito, C. (1987), Documentation for PATHFINDER: A Program to Generate PFNETs, MCCS-87-47. This documentation provides both user and programmer documentation for PATHFINDER, a program which generates PFNETs from symmetric distance matrices representing various aspects of human knowledge. User documentation includes instructions for input and output file formats, instructions for compiling and running the program, adjustments to incomplete or incompatable data sets, a general description of the algorithm, and a glossary of terms. Programmer documentation includes a detailed description of the algorithm with an explanation of each function and procedure, and hand execution examples of some of the more difficult to read code. Examples of input and output files are included. Ballim, A. (1986) Generating Points of View, MCCS-85-68. Modelling the beliefs of agents is normally done in a static manner. This paper describes a more flexible dynamic approach to generating nestings which represent what the system believes other agents believe. Such nestings have been described in Wilks and Bien (1983) as has their usefulness. The methods presented here are based upon those described in Wilks and Bien (ibid) but have been augmented to handle various problems. A system based on this paper is currently being written in Prolog. The Topological Cubical Dimension of a Graph Frank Harary MCCS-86-80 A cubical graph G is a subgraph of some hypercube $Q sub n$. The cubical dimension cd(G) is the smallest such n. We verify that the complete graph $K sub p$ is homeomorphic to a cubical graph H \(sb $Q sub p-1$. Hence every graph G has a subdivision which is a cubical graph. This enables us to define the topological cubical dimension tcd(G) as the minimum such n. When G is a full binary tree, the value of tcd is already known. Computer scientists, motivated by the use of the architecture of a hypercube for massively parallel supercomputers, defined the dilation of an edge e of G within a subdivision H of G as the lenth of the image of e in H, and the dilation of G as the maximum dilation of an edge of G. The two new invariants, tcd(G) and the minimum dilation of G among all cubical subdivisions H of G, are studied. CP: A Programming Environment for Conceptual Interpreters M.J. Coombs and R.T. Hartley MCCS-87-82 A conceptual approach to problem-solving is explored which we claim is much less brittle than logic-based methods. It also promises to support effective user/system interaction when applied to expert system design. Our approach is ``abductive'' gaining its power from the generation of good hypotheses rather than deductive inference, and seeks to emulate the robust cooperative problem-solving of multiple experts. Major characteristics include: (1) use of conceptual rather than syntactic representation of knowledge; (2) an empirical approach to reasoning by model generation and evaluation called Model Generative Reasoning; (3) dynamic composition of reasoning strategies from actors embedded in the conceptual structures; and (4) characterization of the reasoning cycle in terms of cooperating agents. Semantics and the Computational Paradigm in Cognitive Psychology Eric Dietrich MCCS-87-83 There is a prevalent notion among cognitive scientists and philosophers of mind that computers are merely formal symbol manipulators, performing the actions they do solely on the basis of the syntactic properties of the symbols they manipulate. This view of computers has allowed some philosophers to divorce semantics from computational explanations. Semantic content, then, becomes something one adds to computational explanations to get psychological explanations. Other philosophers, such as Stephen Stich have taken a stronger view, advocating doing away with semantics entirely. This paper argues that a correct account of computation requires us to attribute content to computational processes in order to explain which functions are being computed. This entails that computational psychology must countenance mental representations. Since anti-semantic positions are incompatible with computational psychology thus construed, they ought to be rejected. Lastly, I argue that in an important sense, computers are not formal symbol manipulators. Problem Solving in Multiple Task Environments Eric Dietrich and Chris Fields MCCS-87-84 We summarize a formal theory of multi-domain problem solving that provides a precise representation of the inferential dynamics of problem solving in multiple task environments. We describe a realization of the theory as an abstract virtual machine that can be implemented on standard architectures. We show that the behavior of such a machine can be described in terms of formally-specified analogs of mental models, and present a necessary condition for the use of analogical connections between such models in problem solving. An Automated Particulate Counting System for Cleanliness Verification of Aerospace Test Hardware \fIJeff Harris and Edward S. Plumer\fR MCCS-87-86 An automated, computerized particle counting system has been developed to verify the cleanliness of aerospace test hardware. This work was performed by the Computing Research Laboratory at New Mexico State University (CRL) under a contract with Lockheed Engineering and Management Services Company at the NASA Johnson Space Center, White Sands Test Facility. Aerospace components are thoroughly cleaned and residual particulate matter remaining on the components is rinsed onto 47 mm diameter test filters. The particulates on these filters are an indication of the contamination remaining on the components. These filters are examined under a microscope, and particles are sized and counted. Previously, the examination was performed manually; this operation has now been automated. Rather than purchasing a dedicated particle analysis system, a flexible system utilizing an IBM PC-AT was developed. The computer, combined with a digitizing board for image acquisition, controls a video-camera-equipped microscope and an X-Y stage to allow automated filter positioning and scanning. The system provides for complete analysis of each filter paper, generation of statistical data on particle size and quantity, and archival storage of this information for further evaluation. The system is able to identify particles down to 5 micrometers in diameter and discriminate between particles and fibers. A typical filter scan takes approximately 5 minutes to complete. Immediate operator feedback as to pass-fail for a particular cleanliness standard is also a feature. The system was designed to be operated by personnel working inside a class 100 clean room. Should it be required, a mechanism for more sophisticated recognition of particles based on shape and color may be implemented. Solving Problems by Expanding Search Graphs: Mathematical Foundations for a Theory of Open-world Reasoning Eric Dietrich and Chris Fields MCCS-87-88 We summarize a mathematical theory describing a virtual machine capable of expanding search graphs. This machine can, at least sometimes, solve problems where it is not possible to precisely and in detail specify the space it must search. The mechanism for expansion is called wanton inference. The theory specifies which wanton inferences have the greatest chance of producing solutions to given problems. The machine, using wanton inference, satisfies an intuitive definition of open-world reasoning. Software Engineering Constraints Imposed by Unstructured Task Environments Eric Dietrich and Chris Fields MCCS-87-91 We describe a software engineering methodology for building multi-domain (open-world) problem solvers which inhabit unstructured task environments. This methodology is based on a mathematical theory of such problem solving. When applied, the methodology results in a specification of program behavior that is independent of any architectural concerns. Thus the methodology produces a specification prior to implementation (unlike current AI software engineering methodology). The data for the specification are derived from experiments run on human experts. Multiple Agents and the Heuristic Ascription of Belief. Yorick Wilks and Afzal Ballim MCCS-86-75 A method for heuristically generating nested beliefs (what some agent believes that another agent believes ... about a topic) is described. Such nested beliefs (points of view) are esential to many processes such as discourse processing and reasoning about other agents' reasoning processes. Particular interest is paid to the class of beliefs known as \fIatypical beliefs\fR and to intensional descriptions. The heuristic methods described are emboddied in a program called \fIViewGen\fR which generates nested viewpoints from a set of beliefs held by the system. An Algorithm for Open-world Reasoning using Model Generation M.J. Coombs, E. Dietrich & R.T. Hartley MCCS-87-87 The closed-world assumption places an unacceptable constraint on a problem-solver by imposing an \fIa priori\fR notion of relevance on propositions in the knowledge-base. This accounts for much of the brittleness of expert systems, and their inability to model natural human reasoning in detail. This paper presents an algorithm for an open-world problem-solver. Termed Model Generative Reasoning, we replace deductive inference with a procedure based on the generation of alternative, intensional domain descriptions (models) to cover problem input, which are then evaluated against domain facts as alternative explanations. We also give an illustration of the workings of the algorithm using concepts from process control. Pronouns in mind: quasi-indexicals and the ``language of thought'' Yorick Wilks, Afzal Ballim, & Eric Dietrich MCCS-87-92 The paper examines the role of the natural-formal language distinction in connection with the "language of thought" (LOT) issue. In particular, it distinguishes a realist-uniform/attributist-uniform approach to LOT and seeks to link that distinction to the issue of whether artificial intelligence is fundamentally a science or engineering. In a second section, we examine a particular aspect of natural language in relation to LOT: pronouns/indexicals. The focus there is Rapaport's claims about indexicals in belief representations. We dispute these claims and argue that he confuses claims about English sentences and truth conditions, on the one hand, with claims about beliefs, on the other. In a final section we defend the representational capacity of the belief manipulation system of Wilks, Bien and Ballim against Rapaport's published criticisms. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 15 04:09:49 1987 Date: Fri, 15 May 87 04:09:41 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #122 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:41 EDT Received: from relay.cs.net by RELAY.CS.NET id ac04388; 13 May 87 1:20 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa09054; 13 May 87 1:19 EDT Date: Tue 12 May 1987 21:51-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #122 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Wednesday, 13 May 1987 Volume 5 : Issue 122 Today's Topics: Queries - Connection Graphs & Xerox/Apollo Compatibility, Administrivia - USENET Side of AIList, Education - Grammar Checkers & Teaching Programming, Literature - Data Flow References ---------------------------------------------------------------------- Date: Tue, 12 May 87 10:15:18 -0100 From: enea!kuling!nilsh@seismo.CSS.GOV (Nils Hagner) Subject: CONNECTION GRAPHS CONNECTION GRAPHS ================= Me and my friend is just about starting a little project on the Connection Graphs of Kowalski. Now, the problem is that we're having a hard time finding appropriate literature. Our special interest is parallel execution of logic programs with the use of Connection Graphs. As far as we know there are a larger research project going on in the University of Maryland. We would like to get in touch with people involved with these Connection Graphs and, if possible, get hold of papers concerning particularly parallel processing with Connection Graphs. E-mail: nilsh@kuling.UUCP S-mail: Nils Hagner, Studentvagen 14:51, 752 34 Uppsala, SWEDEN ------------------------------ Date: 8 May 87 20:22:00 EDT From: Daniel (D.R.) Zlatin Subject: Xerox and Apollo compatibility Hello! We have a network of Xerox Lisp Machines (1109's and 1186's) with file server and printer. Lately, the question of compatibility with other vendor's networks has arisen. Does anyone have any first-hand experience trying to make Xerox machines talk to a file server on an Apollo network? The generalization to other Unix-based workstations would also be of interest. Thanks!! Daniel Zlatin, Bell-Northern Research, Ottawa, Ontario DANIEL@BNR.BITNET [This might get a better response on the INFO-1100@SUMEX.STANFORD.EDU or WorkS list. -- KIL] ------------------------------ Date: Tue, 12 May 87 10:49:04-1000 From: scubed!sdcsvax!uhccux.UHCC.HAWAII.EDU!nosc!humu!todd@seismo.CSS. GOV (The Perplexed Wiz) Subject: Clarification - USENET side of AIList Ken, there are two USENET newsgroups discussing AI. 'comp.ai' used to be called 'net.ai' and is unmoderated. 'comp.ai.digest' is a moderated group that is made up of the individual articles which you bundle up into AIList. Hope this information is useful...todd Todd Ogasawara, U. of Hawaii Computing Center UUCP: {ihnp4,seismo,ucbvax,dcdwest}!sdcsvax!nosc!uhccux!todd ARPA: uhccux!todd@nosc.MIL INTERNET: todd@uhccux.UHCC.HAWAII.EDU ------------------------------ Date: 12-May-1987 2145 From: shimono%tkov58.DEC@decwrl.DEC.COM (Takao 'Ta?i' Shimono) Subject: Re: V5 #117 1. mod.ai was renamed to comp.ai.digest. 2. I don't think we can get "AI Expert" code from SIMTEL-20. Because it was posted to comp.ai, not to mod.sources. than?, -Ta?i (Takao shimono%tkov58.DEC@decwrl.DEC.COM) /DEC-Japan/SWS/AITC/studio.h Project Hatena Tokyo ------------------------------ Date: Tue, 12 May 87 09:21:02 CDT From: preece%mycroft@gswd-vms.ARPA (Scott E. Preece) Subject: Re: Grammar Checkers Out of curiosity, would any of the automated checkers people have been talking about have caught the "their" for "there" error in the following: > ii) The current 'reading age' metrics have no validity. > They are bogus psychometric tools. Operationally I am > saying that their will be no strong correlation (say r > > 0.9, p < 0.001) between the reading age of text and a > reader's performance on a comprehension test. Allow the > author to add a glossary and the correlation will weaken. > People can learn new words you know. -- scott preece gould/csd - urbana uucp: ihnp4!uiucdcs!ccvaxa!preece arpa: preece@gswd-vms ------------------------------ Date: 11 May 87 14:12:12 GMT From: seismo!sun!cwruecmp!nitrex!rbl@rutgers.edu ( Dr. Robin Lake ) Subject: Re: books on common lisp & prolog In article <12300321403.18.AKBARI@CS.COLUMBIA.EDU> AKBARI@CS.COLUMBIA.EDU (John C. Akbari) writes: >>Can anyone make a comparison between Wilensky's "CommonLispCraft" and Tatar's >>"A Programmer's Guide to Common Lisp"? [...] >> Bill Roberts > >in general, experience points to several important needs when teaching >& selecting stuff: > >- students learn well by studying *working* examples, both in terms of >how to program as well as details like style, data abstraction, etc. >providing well-documented examples motivates all sorts of queries >regarding syntax, efficiency, portability, etc. as well. > Yes!! And it is amazing how we humans learn natural languages by first learning to read --- and THEN learning to write. Precious few computer programming texts ever use this approach. I taught C and reviewed texts for publishers for a decade before I found a lucid explaination of how to READ C.... and that was in a newsletter. Rob Lake ------------------------------ Date: 11 May 87 16:54:52 GMT From: jade!lemon.berkeley.edu!c60a-3ed@ucbvax.Berkeley.EDU (Sugih Jamin) Subject: Data Flow Summary Hello, I posted a question about references to Data Flow. A person asked me to send him the answers I get, but all the mails bounced back, and I thought this might be useful to other people on the net, so here they are: =============================================================================== I found "Data Flow Computing" by John A. Sharp publ. by Ellis Horwood useful -- =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= voice: (918) 660-4047 Mark Logicon, Inc. uucp: ...rutgers!okstate!apctrc!zmel0a P.O.B 3385 ditto: zmel0a@.apctrc.UUCP Tulsa, OK 74102 =============================================================================== You want this: %A Philip C. Treleaven %A David R. Brownbridge %A Richard P. Hopkins %T Data-Driven and Demand-Driven Computer Architecture %J Computing Surveys %V 14 %N 1 %D March 1982 %P 93-143 %K Required, CR Categories and Subject Descriptors: C.0 [Computer System Organization]: General - hardware/software interfaces; system architectures; C.1.2 [Processor Architecture]: Multiple Data Stream Architectures (Multiprocessors); C.1.3 [Processor Architecture]: Other Architecture Styles - data flow architectures; high level language architectures; D.3.2 [Programming Languages]: Language Classifications - data-flow languages; macro and assembly languages; very high-level languages General Terms: Design Additional Key Words and Phrases: Demand = driven architecture, data = driven architecture %X * The aim of this paper is to identify the concepts and relationships that exist both within and between the two areas of research of data-driven and demand-driven architectures. >From the Rock of Ages Home for Retired Hackers: --eugene miya NASA Ames Research Center eugene@ames-aurora.ARPA "You trust the `reply' command with all those different mailers out there?" "Send mail, avoid follow-ups. If enough, I'll summarize." {hplabs,hao,ihnp4,decwrl,allegra,tektronix,menlo70}!ames!aurora!eugene =============================================================================== P.C. Treleaven, D.R. Brownridge, R.P. Hopkins: "Data-driven and demand-driven computer architecture", Computing Surveys, vol. 14, no.1, pp. 93-143 (1982) Martin Rathke Institut f}r Informatik Universit{t Stuttgart Herdweg 51 D-7000 Stuttgart West Germany =============================================================================== That's all. Thank's to all. (I still can't figure out how to use refer.) Sugih Jamin (c60b-jk@buddy.Berkeley.EDU) ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 15 04:11:26 1987 Date: Fri, 15 May 87 04:11:08 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #123 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:57 EDT Received: from relay.cs.net by RELAY.CS.NET id aq11889; 14 May 87 1:41 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa04673; 14 May 87 1:37 EDT Date: Wed 13 May 1987 21:59-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #123 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Thursday, 14 May 1987 Volume 5 : Issue 123 Today's Topics: Seminars - Should Feigenbaum and Ginsberg Talk to Each Other? (SU) & ONTIC: Knowledge Representation for Mathematics (MCC) & PARLOG and Prolog: A Marriage of Convenience (MCC) & Unframing the Frame Problem (UTexas) & Concurrent Logic Programming Languages (MCC) & Coda: An extended debugger for PROLOG (MCC) & Some Graph Theoretic Models in AI (MCC) & Causal Reasoning as Nonmonotonic Temporal Reasoning (SU), Conference - Computer Vision Workshop ---------------------------------------------------------------------- Date: 11 May 87 1633 PDT From: Vladimir Lifschitz Subject: Seminar - Should Feigenbaum and Ginsberg Talk to Each Other? (SU) SHOULD ED FEIGENBAUM AND I TALK TO EACH OTHER? Matt Ginsberg, Stanford (SJG@SAIL.STANFORD.EDU) Thursday, May 14, 4:15pm Bldg. 160, Room 161K In a previous talk, I argued on philosophical grounds that the time has come for the "neats" and "scruffies" in AI to begin to resolve their differences by working on problems of interest to each other. I suggested that, if one were to view the scruffy programs as performing two distinct tasks, one being conventional inference, and the other being some sort of "bookkeeping" with the results, insights could be obtained that would be of interest to both the formal and informal camps. In this talk, I discuss the application of this idea to problems of interest to the informal camp. Specifically, I will discuss the construction of a "flexible" expert sytem shell that can be easily tailored to solve problems using a variety of different methods, simply by changing an explicit set of bookkeeping functions. I will show the system using first-order logic to simulate a digital circuit, as suggested by Genesereth in his DART work, using an ATMS to diagnose the same digital circuit, as suggested recently by deKleer, solving a simple problem in default reasoning, and then solving the same problem more efficiently by using bookkeeping functions that include both default and justification information. ------------------------------ Date: Fri 3 Apr 87 08:39:00-CST From: Ellie Huck Subject: Seminar - ONTIC: Knowledge Representation for Mathematics (MCC) Please join the AI Group for the following talk: David McAllester MIT AI Lab April 7 - 10:30am MCC Auditorium "Ontic: A Knowledge Representation Language for Mathematics" Ontic is an interactive system for developing and verifying mathematics. The system appears to be able to verify "proofs" that are only one to three times longer than corresponding previously published English arguments. Furthermore, the structure of the machine readable proofs closely matches the structure of the English arguments. Ontic's ability to read concise proofs is based on a mechanism for automatically finding and applying information from a lemma library containing hundreds of mathematical facts. Starting with only the axioms of Zermello Fraenkel set theory, the Ontic system has been used to build a data base of definitions and lemmas culminating in a proof of the Stone representation theorem for Boolean lattices. This proof involves an ultrafilter construction and is similar in complexity to the Tychonoff theorem that an arbitrary product of compact spaces is compact. This talk will discuss the structure of Ontic's machine readable proofs, the automatic theorem proving mechanisms used, and the empirically observed differences between Ontic's proofs and English arguments. April 7 - 10:30am MCC Auditorium ------------------------------ Date: Mon 6 Apr 87 15:30:39-CDT From: Ellie Huck Subject: Seminar - PARLOG and Prolog: A Marriage of Convenience (MCC) Please join the AI Program for the following speaker: Steve Gregory Imperial College April 8 - 10:00am MCC Auditorium "PARLOG and Prolog: A Marriage of Convenience" Joint Research with Keith Clark) PARLOG and Prolog are suited to distinct application areas because of a fundamental difference. PARLOG (and other committed choice languages) feature stream and-parallelism, while Prolog (and its parallel variants) allow don't-know non-determinism. These two properties are not easily combined efficiently. In this talk, we present a new combination of PARLOG and Prolog which features "don't-know non-deterministic stream and-parallelism". This makes PARLOG suitable for AI applications. We show how this can be achieved with only minor extensions to existing PARLOG and Prolog implementations. April 8 - 10:00am MCC Auditorium ------------------------------ Date: Tue 14 Apr 87 13:17:08-CDT From: AI.CHRISSIE@R20.UTEXAS.EDU Subject: Seminar - Unframing the Frame Problem (UTexas) UNFRAMING THE FRAME PROBLEM Dennis de Champeaux Hewlett Packard Labs Palo Alto, California Date: Thursday, April 16, 1987 Time: 3:00 pm - 4:00 pm Where: Taylor Hall 3.128 COFFEE 2:30 pm, TAYLOR 3.128 The predicate calculus in uncommitted to any ontology. Consequently it has a nearly boundless domain of application. The price of this generality is that some pervasive properties of the domain are represented at great implementation cost. The Frame Problem is an example par excellence. To cope with this problem, we propose to employ a fragment of intensional logic. Consequently frame axioms or their equivalent have only to be injected for those entities that are affected by an event, i.e., those for which a new extension must be introduced. The situation calculus allows the description of a state of affairs to coexist with the history. This property is preserved in our proposal. The formalism has been implemented in the context of program verification. ------------------------------ Date: Thu 16 Apr 87 11:20:45-CDT From: Ellie Huck Subject: Seminar - Concurrent Logic Programming Languages (MCC) As announced earlier, please join the AI Program for the following talk: Concurrent Logic Programming Languages Vijay A. Saraswat CSD CMU April 17 - 9:30am MCC Auditorium In this talk we present the language CP(!,|,&), which, together with languages such as Concurrent Prolog and GHC explores the space of concurrent logic programming (CLP) languages. Theoretically, CLP languages offer a simple model of concurrent computation; practically, they offer a powerful pointer-based, concurrent programming vehicle that supports new paradigms of computation. We illustrate the conceptual simplicity of CLP languages by presenting a simple formal semantics for (Flat) CP(!,|,&), showing how to extend the semantic techniques to GHC and Concurrent Prolog, and proving some relationships between these languages. We show that there is a natural definition of the relationship `IS-A-SUBSET-OF' between CLP languages, and that: GHC is-a-subset-of CP(!,|) is-a-subset-of (Safe) Concurrent Prolog We also present the notion of CONSISTENT COMPLETENESS of LP languages and argue that it serves to identify those languages which may legitimately be called (Horn) LOGIC programming languages. We show: CP(!,|,&), and hence GHC, is consistently complete. Concurrent Prolog and (sequential) Prolog (with cut) are not. On the practical side, of the various styles of programming supported by CP, perhaps the most novel is that of CONCURRENT, CONTROLLABLE constraint systems. We argue that purely declarative search formalisms, whether they are based on dependency-directed backtracking (as in Steele's thesis or the work of Bruynooghe et al) or bottom-up breadth-first definite clause theorem provers (deKleer's ATMS) or built-in general purpose heuristics (Laurier's ALICE) are unlikely to be efficient enough to serve as the basis of a GENERAL PURPOSE programming formalism which supports the notion of constraint-based computation. CP allows the user to express domain-specific heuristics and CONTROL the forward search process based on eager propagation of constraints and early detection of determinacy and contradiction. This control follows naturally from the alternate metaphor of viewing constraints as processes that communicate by exchanging messages. The language, in addition, provides naturally for the dynamic generation and hierarchical specification of constraints, for concurrent exploration of alternate solutions, for pruning and merging sub-spaces and for expressing preferences over which portions of the search space to explore next. Friday - April 17 9:30am MCC Auditorium ------------------------------ Date: Fri 24 Apr 87 11:34:28-CDT From: Ellie Huck Subject: Seminar - Coda: An extended debugger for PROLOG (MCC) Please join the AI Program for the following speaker: David Plummer University of Texas April 29 - 10:00am MCC Auditorium Coda: An extended debugger for PROLOG ===================================== In this talk I will describe @b, an extension of the @i standard debugger which presents more information about the execution of the program to the user as the program is debugged. @b extends the standard debugger in a number of ways. First, @b allows the user to interact with the pattern matching computation step. Thus the reason for the failure of a particular goal may be more precisely determined by the programmer. Second, @b displays the program trace in terms of the clauses of the program rather than the goals that are executed. Thus, the program trace is directly related to the program that was written, and is at a level more appropriate to the programmer than that of the standard debugger. Finally, @b allows finer control over the information that is displayed by the debugger, by an extended command set and a more powerful language for describing " spy points". April 29 - 10:00am MCC Auditorium ------------------------------ Date: Tue 5 May 87 09:02:33-CDT From: Ellie Huck Subject: Seminar - Some Graph Theoretic Models in AI (MCC) Please join the AI Program for the following speaker: Frank Harary Consultant May 7 at 10:00am MCC Auditorium "Some Graph Theoretic Models in AI" Trees and other graphs abound in AI theory, e.g., in: a) Searching trees and labeling them b) Three proofs from the apochryphal "Best Book of Mathematical Proofs": 1) The ramsly number of a triangle is 6 2) Every self-complementary graph has diameter 2 or 3 3) Every weakly connected nontrivial acryclic digraph has a receiver c) On converting a theorem into a game d) On games and game trees Thursday, May 7 10:00am MCC Auditorium ------------------------------ Date: Wed, 13 May 87 17:11:10 PDT From: Amy Lansky Subject: Seminar - Causal Reasoning as Nonmonotonic Temporal Reasoning (SU) CAUSAL REASONING AS NONMONOTONIC TEMPORAL REASONING Yoav Shoham (SHOHAM@SCORE.STANFORD.EDU) Stanford University 11:00 AM, MONDAY, May 18 SRI International, Building E, Room EJ228 This talk will address the following topics: * A definition of the problems of Qualification and Extended Prediction, and their relation to the Frame Problem. * An outline of a semantical approach to nonmonotonic logics. * A definition of a specific nonmonotonic epistemic logic, the logic of Chronological Ignorance, and a demonstration of its utility in solving the two problems mentioned above. I will argue that the above analysis explains the meaning of causation, and its central role in commonsense reasoning. VISITORS: Please arrive 5 minutes early so that you can be escorted up from the E-building receptionist's desk. Thanks! ------------------------------ Date: Mon 11 May 87 13:08:24-PDT From: Keith Price Subject: Conference - Computer Vision Workshop WORKSHOP ON COMPUTER VISION IEEE COMPUTER SOCIETY FONTAINEBLEAU HILTON, MIAMI BEACH, FLORIDA NOVEMBER 30-DECEMBER 2, 1987 General Chair: Program Chairs: Keith Price Narendra Ahuja Institute for Robotics and Thomas Huang Intelligent Systems, MC 0273 Coordinated Science Laboratory Electrical Engineering - Systems University of Illinois University of Southern California 1101 W. Springfield Ave Los Angeles, CA 90089 Urbana, IL 61801 price@ganelon.usc.edu ahuja@uicsl.csl.uiuc.edu Tel: (213) 743-5526 Tel: (217) 333-1837 Papers are solicited on the following and related topics: Image structure (edges, regions, High level vision texture, ...) Vision guided manipulation, Segmentation and 2-D description navigation 3-D from 2-D (motion, stereo, Vision systems texture, ...) Industrial vision Shape and 3-D description Human visual perception Range imaging Model based vision REVIEW OF PAPERS In order to maintain quality of papers and consistency in the reviewing standards, all papers will be reviewed by two members of the program committee (membership yet to be announced). The program committee will then make the final selections. Papers will be accepted either for regular peresentations (6 proceedings pages) or poster presentations (3 proceedings pages). It is important that regular papers report on new and interesting research ideas; research proposals and minor changes to old ideas are discouraged. Poster presentations could be less complete or present novel results of established techniques. SUBMISSION OF PAPERS Each paper should be complete and have a cover sheet with the title, authors' names, primary address, index terms including at least one of the above topics, and the type of paper (regular or poster). The cover page will not be sent to the reviewers. The body of the paper must contain the title of the paper and an abstract of about 250 words, followed by the text of the paper. The authors' names and organization should not be on the body of the paper. The length of the paper should not exceed: 25 double spaced typed pages for regular papers (including about 6000 words of text and illustrations), or 12 double spaced typed pages for poster papers (including about 3000 words of text and illustrations). Four copies of papers should be sent to: Narendra Ahuja Coordinated Science Laboratory University of Illinois 1101 W. Springfield Avenue Urbana, Illinois 61801 The deadline for submission of papers is July 14, 1987. Authors will be notified of acceptance by late August 1987. Final camera ready copies of the papers will be due at IEEE early in October 1987. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Tue May 19 03:20:10 1987 Date: Tue, 19 May 87 03:20:03 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #124 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Tue, 19 May 87 03:11 EDT Received: from relay.cs.net by RELAY.CS.NET id aa06429; 18 May 87 1:49 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa08948; 18 May 87 1:50 EDT Date: Sun 17 May 1987 22:24-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #124 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 18 May 1987 Volume 5 : Issue 124 Today's Topics: Queries - Behavioral Simulation Sources & IntelligenceWare & AI in Third-World Countries & OPS5 Programs Source Library & Biomedical Vision or Expert Systems, Application - Grammar Checkers, Humor - Artificial Life, Seminars - Planlunch Time Change (SRI) & Exploration and Adaptation in Design (CMU) & Probabilistic Analysis of Algorithms (SU) & AND-Parallelism of Logic Programming (KAIST) & Inheritance Hierarchies: Semantics and Unification (UTexas) ---------------------------------------------------------------------- Date: 13 May 87 16:27:41 GMT From: mcvax!nikhefh!u13@seismo.css.gov (Rene van 't Veen) Subject: sources wanted I am posting this for a friend of mine without access to the net, but I will accept any replies. My friend is writing a thesis about Artificial Intelligence, especially about programs that simulate pathological behaviour. ( Like PARRY from Colby ). My friend would be interested in public-domain programs that do this sort of thing, to play a little with them. Source can be in : C ( preferred ), Pascal, Modula-2, Lisp ( Xlisp ), Icon, Basic, Prolog, Fortran. Thanks in advance ... Please e-mail to u13@nikhefh.UUCP ...!seismo!mcvax!nikhefh!u13 R. van 't Veen .. mcvax!nikhefh!u13. All opinions are my own. ------------------------------ Date: 14 May 87 18:37:34 GMT From: super.upenn.edu!operations.dccs.upenn.edu!shaffer@RUTGERS.EDU (Earl Shaffer) Subject: IntelligenceWare Does anyone have any practical experience with InteliigenceWare's Intelligence/Compiler product? ============================================================================== Earl Shaffer - University of Pennsylvania - Data Communications Department "Time was invented so that everything wouldn't happen at once." Steven Wright ============================================================================== ------------------------------ Date: Sat, 16 May 87 15:36:30 -0700 From: "Jose A. Ambros-Ingerson" (Dept of ICS, U of California, Irvine) Subject: AI in Third-World Countries Could you please post this in the AIList? Can you suggest other boards where it would appropriate to post? [sent to AIList and AI-ED] AI IN THIRD WORLD COUNTRIES We are interested in constructing a global picture of the impact AI is having in the Third World and of the implications this impact can have upon these countries in the future. We would therefore like to assess the current state of AI in the Third World, especially: - Current AI research in Third World Countries (3WC). - Current AI research in the US/Europe related to Third World problems or applications. Research outlines and papers would be most appreciated. - Current Applied AI in 3WC. Which applications (Expert Systems, ICAI, Planning, Robotics, etc.) are being considered for what purpose? Are there any systems currently in use? Any AI companies targeting products at 3WCs? - Social impacts of AI in 3WC. Reorganization of the work-place, unemployment, economic repercussions, cultural transformations, etc. We'd also like to assess how the Third World sees the future of AI, and more specifically, whether there are any: - Government programs for the support/funding of AI research and development. Like the Fifth Generation Project, MCC, Strategic Computing, Alvey or Espirit. - AI graduate programmes and undergrate courses in 3WC universities. Please mail information to either jose@bonnie.uci.edu in the USA, or wobcke@esgr.essex.ac.uk in the United Kingdom or send copies of papers or other information to me at Jose A. Ambros-Ingerson Dept. of Information and Computer Science University of California Irvine, CA, 92717, USA. The information obtained will be collated and summarized and made available to researchers on request. If enough interest is manifest a network forum for the interchange of ideas amongst researchers working in similar areas could be considered. Thanks for your assistance, Jose A. Ambros-Ingerson. ------------------------------ Date: Fri, 15 May 87 15:45:40 EDT From: Alexander Pasik Subject: OPS5 Programs source library We at columbia have compiled a library of OPS5 programs. We are making them available to the general public for benchmarking, analysis, or any other production system related research. We are eager to expand this library so any submissions are welcome. If you have an OPS5 program to add to our library, send its net address and any instructions to me (al@cheshire.columbia.edu) and I will pull the systems over. If you wish to use the library it is available via anonymous ftp on columbia.edu in the directory prosys. This directory contains one subdirectory per system. Alexander Pasik Department of Computer Science Columbia University New York, NY 10027 ------------------------------ Date: Fri, 15 May 87 From: knewton@watdcsu Subject: vision query (and reply) hello : I am looking for any refences having anything to do with the following : computer-assisted identification of cells/tissue; biomedical expert systems; general computer vision and pattern recognition algorithms. I seem to remember someone, maybe from York University in Toronto, posting something on vision , but I can't seem to remember or be able to find it. If you can help me, just email me. glen newton knewton@watdcsu [There are two vision lists: Vision-List@ADS.ARPA (machine vision) and CVNET%YORKVM1@WISCVM.WISC.EDU (primarily biological vision). There is also an enormous literature, growing by over a thousand papers per year. See, for instance, the IEEE conferences on Computer Vision and Pattern Recognition. There have also been conferences on medical vision (cell classification, CAT-scanning, tumor detection, etc.). The annual IEEE conferences on pattern recognition are even larger than those on vision, but very little is directly applicable to biological vision problems. You should check out back issues of Computer Vision, Graphics, and Image Processing (formerly Computer Graphics and Image Processing) or IEEE Transactions on Pattern Analysis and Machine Vision. -- KIL] ------------------------------ Date: 13 May 87 20:41:53 GMT From: john@viper.lynx.mn.org (John Stanley) Reply-to: john@viper.UUCP (John Stanley) Subject: Re: Grammar Checkers In article <8705121527.AA01698@gswd-vms.ARPA> preece%mycroft@GSWD-VMS.ARPA (Scott E. Preece) writes: >Out of curiosity, would any of the automated checkers people have >been talking about have caught the "their" for "there" error in.... I don't know about the ones people have been talking about, but I do know there is a program under development that can handle "there" vs "their" or, for that matter, the "two" vs "too" vs "to". It's a new program, not yet released, but should be out by the end of the year. The company working on it is a small Minnesota based company working on AI related software products for mini/micro/word-processor applications. --- John Stanley (john@viper.UUCP) Software Consultant - DynaSoft Systems UUCP: ...{amdahl,ihnp4,rutgers}!{meccts,dayton}!viper!john ------------------------------ Date: 14 May 1987, 00:01:30 EDT From: Norman Haas Subject: Humor - Artificial Life (In case this point hasn't already been made, re the "Artificial Life" confer- ence announcement a few issues back:) Why stop with life? Let's go all the way: 1. Artificial Culture and Civilization, including Artificial Natural Languages 2. Artificial Science, including Artificial Research in the field of Artificial Intelligence ------------------------------ Date: Thu, 14 May 87 15:41:28 PDT From: Amy Lansky Subject: PLANLUNCH TIME CHANGE The time for next week's Planlunch has been changed to 2PM. --- Sorry about any inconvenience.... CAUSAL REASONING AS NONMONOTONIC TEMPORAL REASONING Yoav Shoham (SHOHAM@SCORE.STANFORD.EDU) Stanford University 2:00 PM, MONDAY, May 18 SRI International, Building E, Room EJ228 ------------------------------ Date: 14 May 87 09:50:47 EDT From: Patricia.Mackiewicz@isl1.ri.cmu.edu Subject: Seminar - Exploration and Adaptation in Design (CMU) SPECIAL SEMINAR TOPIC: CYCLOPS: A Computational Model of Exploration & Adaptation In Design SPEAKER: Dundee Navinchandra, MIT WHEN: Thursday, May 14, 1987 at 10:00 am WHERE: Doherty Hall 3313, CMU ABSTRACT: A design system has two basic and essential components: a @b(search) component and a @b(knowledge) based reasoning component. Designs are generated by searching the state space of designs, and knowledge is used to keep the search manageable. @b(Search Component:) The first part of our research has been in understanding how designers deal with multiple interacting criteria. Criteria in design problems can be in the form of constraints, goals or objectives. It is the job of the designer to produce an artifact that simultaneously satisfies all the criteria. In the process of achieving this, the designer has to relax constraints and tradeoff among objectives. Our system uses pareto-optimality to identify and present the user with critical tradeoffs in the design problem. The program also helps the designer @b(explore) the design space by systematically relaxing constraints and looking for interesting alternatives. @b(Knowledge-based Component:) The second part of our research is aimed at developing a technique for recognizing and adapting interesting designs. This is done through a precedents-based reasoning system. Precedents are frames that hold knowledge about past design experiences from within and without the current domain. These experiences are used to recognize interesting designs. A design is labeled as interesting if its characteristics cause the reminding of a precedent that was previously labeled as interesting. Precedents are also used to @b(adapt) designs that have problems. A technique, called @i(demand posting) has been developed for solving design problems by reasoning analogically from the database of precedents. The above ideas have been implemented in the domain of Landscape Architecture. The program is called CYCLOPS. ------------------------------ Date: 15 May 1987 1027-PDT (Friday) From: Tanya Walker Subject: Seminar - Probabilistic Analysis of Algorithms (SU) Computer Science Colloquium PLACE: Terman Auditorium TIME: 4:15-5:15 DATE: May 19, 1987 TITLE: An Introduction to the Probabilistic Analysis of Combinatorial Algorithms SPEAKER: Richard Karp, Computer Science Dept, UC Berkeley In fields such as operations research, artificial intelligence and computer-aided design, algorithms are often used that perform well in practice even though there is no theoretical guarantee of their good performance. The simplex algorithm for linear programming is perhaps the most notable example of this phenomenon. It is a major challenge to algorithm designers to provide a theoretical foundation for such quick-and-dirty heuristic algorithms. One approach is through probabilistic analysis, in which one defines a probability distribution over the set of instances of a problem, and the endevors to prove that some fast, simple algorithm performs well with high probability. The speaker will discuss this approach, using examples related to set partitioning, bin packing and linear programming. He will then make an assessment of the strengths and weaknesses of probabilistic analysis as a method of validating quick-and-dirty algorithms. ------------------------------ Date: Sat, 9 May 87 15:48:58+0900 From: Dongwook Shin Subject: Seminar - AND-Parallelism of Logic Programming (KAIST) KAIST CS SEMINAR AND-Parallelism of Logic Programming K. M. Choe choe@cosmos.kaist.ac.kr 11 May, 4:00 - Professor Choe will present a seminar on AND_Parallelism of logic programming. He is an assistant professor at KAIST. The abstract of this seminar is described below. ABSTRACT In this seminar, some of the speaker's recent contributions to the AND-Parallelism of logic programming are to be presented. First, a brief explanation on the AND/OR-Parallelism is to be given. And then (1) the incompleteness of Conery's backtracking model and it's solution, (2) the increased efficiency in combining the "fork" and "join" scheme, (3) the definitions and the efficient handling multiple failures, and (4) the multiple backtrackings in general case are to be described in sequence. ------------------------------ Date: Fri 15 May 87 10:50:11-CDT From: Ellie Huck Subject: Seminar - Inheritance Hierarchies: Semantics and Unification (UTexas) Please join the AI Program for the following talk: Gert Smolka Universitat Kaiserslauten May 20 - 2:00pm AI Conference Room 2.502 "Inheritance Hierarchies: Semantics and Unification" Inheritance hierarchies are employed in knowledge representation and object-oriented programming as a means of representing taxonomically organized data. In our approach, inheritance hierarchies are built up from so-called feature types, which are ordered by subtyping and whose elements are records. Every feature type comes with a set of features corresponding to the fields of its record elements. Given an inheritance hierarchy, so-called feature terms are used to denote sets of values. Unification of two feature terms computes a feature term denoting the intersection of their denotations. Feature unification is employed in logic programming and computational linguistics. In this talk, we express feature types and inheritance hierarchies as algebraic types in order-sorted equational logic. This reduction provides a meaningful initial algebra semantics and a well understood notion of equality. In particular, our framework supports the combination of algebraic types and inheritance hierarchies. Feature unification turns out to be unification with respect to equational axioms and to subsume order-sorted and untyped unification. We specify a unitary feature unification algorithm by a set of simplification rules and prove its soundness and completeness with respect to the model-theoretic semantics. May 20 - 2:00pm AI Conference Room 2.502 ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Thu May 21 03:19:17 1987 Date: Thu, 21 May 87 03:19:12 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #125 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Thu, 21 May 87 03:16 EDT Received: from relay.cs.net by RELAY.CS.NET id aa28543; 21 May 87 1:49 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa06903; 21 May 87 1:40 EDT Date: Wed 20 May 1987 22:06-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #125 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Thursday, 21 May 1987 Volume 5 : Issue 125 Today's Topics: Bindings - Mailing List for Lucid Users, Queries - Consistency and Completeness Checking & Knowledge-Based Document Retrieval, AI Tools - Commonlisp for IBM/AT & Chart Parser References, Philosophy - The Symbol Grounding Problem, Humor - Spelling Correction for Jabberwocky ---------------------------------------------------------------------- Date: Mon, 18 May 1987 11:10 EDT From: "Scott E. Fahlman" Subject: Mailing List for Lucid Users We have set up an ARPAnet mailing list, "lucites@c.cs.cmu.edu", for the exchange of information related to Lucid Common Lisp. This mailing list is meant to function as a sort of informal users' group; it is not under the control of Lucid, though some Lucid people will receive it. "Lucites" is an appropriate channel for queries, programming hints, and the sharing of software (large programs can be announced but should not be distributed over this mailing list). "Lucites" is not an appropriate channel for bug reports, commercial announcements, or sales pitches. Because our machine's capacity to forward mail is limited, we must reserve the right to refuse any request to add more than two recipients to the list from any given site; if you have three or more people who want to receive this mail, you are expected to set up you own local redistribution list or to direct the mail to a bulletin board that your people can access. (If anyone wants to set up a version of this list without such restrictions, please contact us and we will gladly turn the task over to you.) To get your name on the list, send mail to "lucites-request@c.cs.cmu.edu". Requests sent to us personally will be ignored. Requests sent to the mailing list as a whole will result in scorn and abuse being heaped upon you. If any address on the list starts bouncing mail sent to it, it will be excised from the list at once. Scott E. Fahlman David B. McDonald Computer Science Department Carnegie-Mellon University ------------------------------ Date: Tue, 19 May 87 10:09:30 SST From: Eng-Lian Lim Subject: References on consistency and completeness checking WANTED!!! I urgently need references on consistency and completeness checking on rule-based expert systems with 1st order predicates, including possible reasoning and approximate reasoning. Many thanks in advance... Regards - Eng-Lian Lim MAIL TO: ISCLIMEL@NUSVM <--- BitNet ------------------------------ Date: Tue, 19 May 87 13:44:40+0900 From: mcvax!csd.kaist.ac.kr!ywkim@seismo.CSS.GOV (Kim Young Whan) Subject: References on Knowledge-based Document Retrieval I'm writing a Ph.D Thesis about Knowledge Based System for Document Retrieval, especially about rule based system using uncertainty handling mechanism (Bayesian, D-S Theory, Fuzzy Set Theory). I'm looking for any reference having anything to do with it. I'm also interesting in public-domain programs that are related to this field. Sources written in LISP(Common LISP, GCLISP,Frantz-LISP, Zeta LISP) would be preferred. The information obtained will be collected and summarized and made available to researcher on request. Thanks for your assistance. Young-Whan Kim Dept. of CS KAIST P.O.Box 150, Cheongryang Seoul, 131 Republic of Korea. ywkim%csd.kaist.ac.kr@relay.cs.net(from cs-net) ywkim%csd.kaist.ac.kr@wiscvm.wisc.edu(from bitnet) ------------------------------ Date: 19 May 87 17:03:00 GMT From: mcvax!unido!iaoobelix!wagner@seismo.css.gov Subject: Re: Commonlisp for IBM/AT ? - (nf) [ National lineeater week... ] How about GCLISP? It is a nice system including editor, compiler and provides a sensible CommonLISP environment even on the relatively small IBM PCs. Juergen Wagner, (USENET) ...seismo!unido!iaoobel!wagner ("Gandalf") Fraunhofer Institute IAO, Stuttgart ------------------------------ Date: 20 May 87 01:47:46 GMT From: decvax!dartvax!uvm-gen!emerson@ucbvax.Berkeley.EDU (Tom "Oliver W. Jones" Emerson) Subject: Chart Parser and Related References Many people have requested sources for further research into chart parsers. I have also included several sources related to parsing formalisms: Hirakawa, H. "Chart Parsing in Concurrent PROLOG". TR-008, ICOT, Tokyo, Japan: May 1983 Kay, M. "Experimenting with a Powerful Parser", Proc. 2nd Int. COLING, August 1967 Winograd, T. Language as a Cognitive Process, Volume 1: Syntax. Addison-Wesley, 1983 Relating to Parsing Formalisms: Emerson, T. "Parsing Formalisms", AI EXPERT, May 1987 Matsumoto, Y., Tanaka, H., Hirakawa, H., Miyoshi, H., Yasukawa, H., Mukai, K. and Yokoi, T. "BUP: A Bottom Up Parser Embedded in PROLOG" ICOT, 1983 ------------------------------ Date: 20 May 87 03:21:31 GMT From: mind!harnad@princeton.edu (Stevan Harnad) Subject: The symbol grounding problem John X. Laporta Apollo Computer, Chelmsford, MA wrote: > You say that symbols are grounded in nonsymbolic sensory input. > You propose a model of segmentation... by which discontinuities > in the input map to segment boundaries... I wonder what you do with > the problem of segmentation of the visual spectrum. > ...spectral segmentations differ widely across cultures. > The problem is that these breaks and their number vary widely... > what system intervenes to choose the set a particular culture favors > and asserts as obvious? What is the filter in the A/D converter? More recent evidence seems to suggest that color segmentation does not vary nearly as widely as had been believed (see M. Bornstein's work). There may be some variability in the tuning of color boundaries, and some sub-boundaries may be added sometimes, but the focal colors are governed by our innate color receptor apparatus and they seem to be universal. The partial flexibility of the boundaries -- short and long term -- must be governed by learning, and the learning must consist of readjustment of boundary locations as a function of color naming experience and feedback, or perhaps even the formation of new sub-boundaries where there are none. The innate color-detector mechanism would be the A/D filter in the default case, and learning may set some of the boundary fine-tuning parameters. The really interesting case, though, and one that has not been tested directly yet, is the one where boundary formation occurs de novo purely as a result of learning. This does not happen with evolutionarily "prepared" categories such as colors (although it may have happened in phylogeny), but it may happen with arbitrary learned ones (e.g., perhaps musical semitones). Here the A/D filter would be acquired from categorization training alone: labeling with feedback. In simple one-dimensional continua, what would be acquired would simply be some sort of a threshold detector, but with more complex multidimensional stimuli the feature-filter would have to be constructed by a more active inductive process. This may be where connectionist algorithms come in. Another important factor in the selectivity of the A/D feature-filter is the "context" of alternatives: the sample of confusable members and nonmembers of the categories in question on the basis of which the features must be extracted; these also focus the uncertainty that the filter must resolve if it is to generate reliable categorization performance. All this is described in the book under discussion (Categorical Perception: The Groundwork of Cognition, Cambridge University Press 1987, S. Harnad, Ed.). -- Stevan Harnad (609) - 921 7771 {bellcore, psuvax1, seismo, rutgers, packard} !princeton!mind!harnad harnad%mind@princeton.csnet harnad@mind.Princeton.EDU ------------------------------ Date: Mon 18 May 87 12:27:57-PDT From: Lee Altenberg Subject: Humor - Spelling Correction After reading about PROFS, I discovered that my PC-WRITE software has a spell-checker with a "Guess" feature that is like PROFS. Below are three actual revisions of Jabberwocky produced by PC-WRITE, "Jabbing:, "Jabs", and "Suppress", employing the first, second, and third guesses, respectively, of PC-WRITE. Some of the poetic leaps I think you'll find extraordinary. AI is a whole new frontier. The religious and political overtones are those of PC-WRITE, not my own. Jabbing 'Tweak brim, and the slits tow Did gyrfalcon and gimmicks in the wac: All min were the boron, And the moment ratification outgrow. "Beware the Jabbing, my son! The jaws that bite, the claws that catch! Beware the Judaism bird, and shun The frustrate Bandies!" He took is vortex sword in hand: Long time the many foe he sought - So rested he by the Tumult tree, And stood awhile in thought. And, as in ufos thought he stood, The Jabbing, with eyes of flame, Came whiffs through the tulip wood, And burch as it came! One, two! One, two! And through and through The vortex blade went snickered-snack! He left it dead, and with its head He went galvanic back. "And hast thou slain the Jabbing? Come to my arms, my beams boy! O fracas day! Callous! Called! He chortled in his joy. 'Tweak brim, and the slits tow Did gyrfalcon and gimmicks in the wac: All min were the boron, And the moment ratification outgrow. Jabs 'Tweaks brimful, and the slitter toward Did gyrfalcons and gimpy in the wacky: All minaret were the borough, And the momentarily ratified outgrows. "Beware the Jabs, my son! The jaws that bite, the claws that catch! Beware the Judas bird, and shun The frustrated Banding!" He took his vortices sword in hand: Long time the mao foe he sought - So rested he by the Tumultuous tree, And stood awhile in thought. And, as in uganda thought he stood, The Jabs, with eyes of flame, Came whig through the tulips wood, And burden as it came! One, two! One, two! And through and through The vortices blade went snider-snack! He left it dead, and with its head He went galvanism back. "And hast thou slain the Jabs? Come to my arms, my bean boy! O fraction day! Calloused! Calligraphy! He chortled in his joy. 'Tweaks brimful, and the slitter toward Did gyrfalcons and gimpy in the wacky: All minaret were the borough, And the momentarily ratified outgrows. Suppress 'Ts farewells, and the sled advice Did gro and compel in the vow: All mimeos were the breakups, And the mm radios outcrop. "Beware the Suppress, my son! The jaws that bite, the claws that catch! Beware the Shipshape bird, and shun The freeing Bandersnatch!" He took his barfly sword in hand: Long time the manikin foe he sought - So rested he by the Automation tree, And stood awhile in thought. And, as in abbeys thought he stood, The Suppress with eyes of flame, Came affluence through the atlas wood, And fairfield as it came! One, two! One, two! And through and through The barfly blade went snigger-snack! He left it dead, and with its head He went clamping back. "And hast thou slain the Suppress? Come to my arms, my baying boy! O barbecues day! Call! Call! He chortled in his joy. 'Ts farewells, and the sled advice Did gro and compel in the vow: All mimeos were the breakups, And the mm radios outcrop. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sat May 23 03:15:27 1987 Date: Sat, 23 May 87 03:15:16 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #126 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sat, 23 May 87 03:05 EDT Received: from relay.cs.net by RELAY.CS.NET id ac09232; 22 May 87 15:24 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa23339; 22 May 87 15:18 EDT Date: Fri 22 May 1987 11:08-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #126 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Friday, 22 May 1987 Volume 5 : Issue 126 Today's Topics: Seminar - Object Communication in Allegro (SU), Review - AI and Simulation Workshop, Conferences - National Conference on AI & Knowledge Acquisition Workshop & Symbolics LISP Users Meeting & Office Information Systems & AI Tutorials at Foothill College ---------------------------------------------------------------------- Date: 20 May 1987 1254-PDT (Wednesday) From: Taleen Marashian Subject: Seminar - Object Communication in Allegro (SU) WHO: Mark Linton of Stanford University (CSL-EE) WHEN: Thursday, May 28, 1987; 4:15 p.m. WHERE: Magaret Jacks Hall, Room 352 TITLE: "Object Communication in Allegro" ABSTRACT: Large scale object-oriented systems must be able to span machines while providing efficient and transparent access to small objects. To build a distributed programming environment, we are using the concept of an object space that provides remote access to a group of objects. Object spaces are managed by independent servers that unify the traditional concepts of commands and files, thereby simplifying the problems of data management and concurrency control. Objects communicate with remote objects synchronously or asynchronously, multiplexing messages through an underlying connection between spaces. We are implementing a prototype system, named Allegro, in which software objects are distributed across multiple object spaces. In this talk, we describe the Allegro object model, the protocol for accessing remote objects, the runtime support necessary for building the servers, and the current implementation. ------------------------------ Date: Thu, 21 May 87 10:26:23 PDT From: Mike Hamilton, AI Magazine Subject: Review - AI and Simulation Workshop Report on the 1986 Artificial Intelligence and Simulation Workshop Richard B. Modjeski US Army Concepts Analysis Agency, Advanced Research Projects Office 8120 Woodmont Ave, Bethesda, MD 20814 The first Artificial Intelligence (AI) and simulation workshop was held during the National Conference on Artificial Intelligence (AAAI) on August 11, 1986 at the University of Pennsylvania (Wharton Hall). It was attended by over 40 participants from academic, government, and industrial institutions. It included paper presentations, informal discussions, and a panel summary of AI and simulation applications in the areas of: 1) State of the art and future directions in AI and simulation (Authur Gerstenfeld, Worcester Polytechnic Institute); 2) AI problem solving using simulation (Y.V. Ramana Reddy, University of West Virginia); 3) Knowledge representation issues related to simulation (Marilyn Stelzner, Intellicorp); 4) Engineering issues related to AI and simulation (Dick Modjeski, US Army Concepts Analysis Agency). Individual presentations given in each of the above areas of the workshop are published in a technical report distributed by the Defense Technical Information Center (DTIC Number AD-A174 053). A copy of the report can be obtained by calling DTIC at (202)274-6847/6874. The fields of computer simulation and artificial intelligence offer each other something of value. The methods and techniques of each discipline offer a fresh approach to revitalizing each other. The intersection of AI and simulation may offer a unique application of computer science that may be of use to both fields. Many of the concepts in this area of AI applied from simulation are developed from engineering and computer science application experiments. Some formalisms have appeared but much work needs to be done to establish relations between constructs and processes. Applications developed using combinations of AI and simulation techniques by universities, industry, and government have demonstrated that this aspect of AI is already maturing as a useful area of development. LTC Russell E. Frew, Program Manager of the Air-Land Battle Management Project, Defense Advanced Research Projects Agency (DARPA), suggested that their was growing interest in applying AI and simulation within the Department of Defense. A request was made that proposals for research in this area be sent to DARPA. The Second Workshop on AI and Simulation will be held on July 14, 1987 in conjuction with the AAAI-87 Conference in Room 316-B of South Campus Center, University of Washington, Seattle. This workshop is open to Conference attendees and will provide another opportunity for researchers and applications designers to exchange ideas and debate issues in this growing area of interest. ------------------------------ Date: Wed, 20 May 87 09:49:47 PDT From: AAAI Subject: Conference - National Conference on AI, July 13-17, 1987 AAAI-87 JULY 13-17, 1987 (a month earlier this year!) SEATTLE, WASHINGTON Just a reminder that the pre-registration deadline date for the National Conference on AI is June 12. If you would like more information about the program, send a msg to AAAI-Office @sumex-aim.stanford.edu or call 415-328-3123 (PST 7 am-5:30 pm). ------------------------------ Date: 18 May 87 20:02:12 GMT From: bcsaic!john@june.cs.washington.edu (John Boose) Subject: Conference - Knowledge Acquisition Workshop at Reading, England CALL FOR PAPERS FIRST EUROPEAN WORKSHOP ON KNOWLEDGE ACQUISITION FOR KNOWLEDGE-BASED SYSTEMS Reading University, England 1st-3rd September 1987 A workshop on Knowledge Acquisition for Knowledge-Based Systems will be held at Reading University, England, from 1st-3rd September 1987. Topics include: - Transfer of expertise - systems which interview experts and structure knowledge - Knowledge engineering - manual techniques, training knowledge engineers - Induction of knowledge from examples - Extraction of knowledge from text - Knowledge acquisition methodologies The attendence at the workshop will be limited to 30 people. Four copies of an extended abstract (up to 8 pages, double spaced) or a full-length paper should be sent to Tom Addis or Brian Gaines before July 1, 1987. Reading University is near Heathrow Airport and a short train journey from central London. The workshop is residential and accomodation may be booked at the University through Tom Addis. Co-Chairmen: Tom Addis (Tom.Addis@reading.ac.uk) Department of Computer Science University of Reading Whitenights, PO Box 220, Reading RG6 2AX, UK John Boose (john@boeing.com) Boeing Advanced Technology Center Boeing Computer Services M/S 7L-64 PO Box 24346, Seattle, WA, 98124, USA Brian Gaines (gaines@calgary.cdn) Department of Computer Science University of Calgary, Calgary, Alberta, Canada T2N 1N4 -- John Boose, Boeing Artificial Intelligence Center arpa: john@boeing.com uucp: uw-beaver!uw-june!bcsaic!john ------------------------------ Date: Tue, 19 May 1987 17:11 CDT From: CS.PURVIS@R20.UTEXAS.EDU Subject: Conference - Symbolics LISP Users Meeting SLUG 87 Symbolics LISP Users Group Meeting July 6-10, 1987 The Third Annual Symbolics LISP Users Group Meeting will be held in Seattle, Washington at the University of Washington from July 6-10, 1987. This is the week before the AAAI Conference, so participants can coordinate their travel plans if they plan to attend that conference. Inexpensive accommodations on the university campus are available and can be reserved on the registration form that is being mailed out. TUTORIALS: The first two days of the Meeting will be devoted to full-day and half-day tutorials. Below is a list of tutorial topics: Tutorial instructor ================================================================== AI Program Design (Monday -- F) Elaine Rich Overview of Site Administration (Monday -- F) Symbolics Ed. Services Color Graphics I (Mon. - a.m.) Dave Dyer Color Graphics II (Mon. - p.m.) Dave Dyer Color Graphics III (Mon. - p.m.) Symbolics Graphics Introduction to ART (Tuesday -- F) Inference Corporation Building Knowl. Sys. Interfaces (Tues. - a.m.) IntelliCorp Programming Productivity I (Tues. - a.m.) Symbolics Ed. Services Programming Productivity II (Tues. - p.m.) Symbolics Ed. Services Elaine Rich, from MCC, is author of the textbook, "Artificial Intelligence". Dave Dyer is the principle software developer of Symbolics color graphics system software. The tutorials taught by Inference and IntelliCorp will feature their expert system development tools, ART, and KEE, respectively. CONFERENCE SESSIONS: The remaining three days of the Meeting will feature presentations by users and members of the Symbolics technical staff. Planned topics * New Product Announcements * Networking * Expert System Tools and Environments * The SLUG software library * The Common Lisp standard and proposed extensions to it * "Programming Pearls" on the Lisp Machine * Software Engineering Methodology in Genera 7 REGISTRATION: Registration for the conference is $90. Each full-day tutorial is $90, and each half-day tutorial is $45. Registration forms are being mailed out concurrent with this announcement. Requests for additional forms and questions concerning the conference and tutorials should be directed to: Martin Purvis SLUG-87 Chairman Computer Science Department 2.124 Tayor Hall University of Texas Austin, TX 78712 USA (512) 471-9555 cs.purvis@r20.utexas.edu Questions concerning registration and housing should be directed to: Conference Management/SLUG University of Washing, GH-25 Seattle, Washington 98195 USA (206) 543-2300 ------------------------------ Date: Thu, 21 May 87 09:59:59 edt From: rba@flash.bellcore.com (Robert B. Allen) Subject: Conference - Office Information Systems CONFERENCE ON OFFICE INFORMATION SYSTEMS Palo Alto, CA - March 23-25, 1988 Sponsored by: ACM-SIGOIS IEEE Computer Society TC-OA In Cooperation with IFIP W.G. 8.4 COIS is a conference concerned with intelligent processing of information in organizations - topics of interest include: Effects of Technology on Human Organizations Information Systems Object-Oriented and Intelligent Databases Planning Systems Computer-Supported Cooperative Work Information Retrieval Multimedia/Hypertext Systems Organizational Design Distributed Artificial Intelligence User Models Voice/Video/Graphics Interconnect PROGRAM COMMITTEE: G. Bracchi (Milan), S. Christodoulakis (Waterloo), Bruce Croft (UMass), Peter DeJong (MIT), Les Gasser (USC), Eli Gerson (San Francisco), Irene Greif (Lotus), Benn Konsynski (Harvard), Yoshifumi Masunaga (Tokyo), Norm Meyrowitz (Brown), Alain Michard (INRIA), Juzar Motiwalla (Singapore), John Mylopoulos (Toronto), Bill Newman (London), Margi Olson (NYU), Fausto Rabitti (Pisa), Ron Rice (USC), Jeff Rulifson (Syntelligence), Chris Schmandt (MIT), Lucy Suchman (Xerox PARC), Dennis Tsichritzis, Geneva), C.J. van Rijsbergen (Glasgow), Andrew Whinston (Purdue), Thomas Wu (NPS), Stan Zdonik (Brown) CONFERENCE COMMITTEE: Najah Naffah (General Chair, Bull), Bob Allen (Program Chair, Bellcore), Dave Choy (IBM, SJ), Skip Ellis (MCC), Carl Hewitt (MIT), Fred Lochovsky (Toronto), Bob Root - (Treasurer, Bellcore), Sig Treu (Pittsburgh), Alex Verrijn-Stuart (Leiden) KEYNOTE SPEAKER: TERRY WINOGRAD INFORMATION FOR AUTHORS: Submissions by September 21, 1987. Papers will be judged for technical merit by appropriate subgroups of the program committee. Submissions (max. 3500 words) may be made either on paper (5 copies) or on some standard electronic medium to: Conference on Office Information Systems Dr. Robert B. Allen 2A-367 Bell Communications Research Morristown, NJ 07960 ------------------------------ Date: Thu 21 May 87 18:20:17-PDT From: Marcelo Hoffmann Subject: Conference - AI Tutorials at Foothill College IEEE in association with the Foothill College CIS Department is offering tutorials on AI technologies and applications Date: Saturday, June 13, 1987, 8:30 A.M. to 5:00 P.M. Location: Foothill College, Los Altos, California Subjects: AI Application Track PC based expert systems- Paul Harmon, lecturer & consultant AI in Finance-Dr. Richard Duda, Senior Scientist, Syntelligence AI Project Management - Tom Schwarz, AI Editor EE Times AI Technology Track Neural networks- Robert Hecht-Neilsen, Hecht Neilsen Neurocomputer Corporation Claude Cruz-Young, IBM Research Center(PA) John Vovodsky, President of Neurotech Intelligent Interfaces- Shelley Horwitz, SRI International AI Hardware- Robert Keller, Quintus Anoop Gupta, Stanford University Shing Kong, UC Berkeley George Adams, Research Institute for Advanced Computer Science Program Schedule: 8:00 Registration 8:30-10:30 Intelligent Interfaces, AI in finance 10:30-10:45 Break 10:45-12:45 AI Hardware; AI Project Managment 12:45:1:45 Lunch 2:00-4:00 Neural Networks; PC Based Expert Systems ---------------------------------------------------------------- REGISTRATION FORM Fees _____ $85 for IEEE Members Name__________________Title____________ who reg. before 6/1 Company Name __________________________ _____ $90 for IEEE Members Address________________________________ who reg. on site ________________________________ _____ $95 non members on IEEE Membership #______________________ site (space avail.) Daytime phone# ( )___________________ _____ $90 non members before 6/1 _____ $65 full-time students Make checks out to SVC/CS and mail to: IEEE Council Office 701 Welsh Rd., #2205 Palo Alto, CA 94304 For additional information call IEEE Council at(415) 327-662 ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 22 18:04:02 1987 Date: Fri, 22 May 87 18:03:56 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #127 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 22 May 87 18:02 EDT Received: from relay.cs.net by RELAY.CS.NET id ah09038; 22 May 87 14:51 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa23127; 22 May 87 14:51 EDT Date: Fri 22 May 1987 11:12-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #127 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Friday, 22 May 1987 Volume 5 : Issue 127 Today's Topics: Bindings - sci.philosophy.tech List, Queries - FRL and Analogy & CLIPS: Parallel Version & Perceptual Primitives & KNOWOL by IMCO--Intelligent Machine Company, Application - Grammar Checkers, Humor - Word Proof takes the Jabberwocky Test, AI Tools - Scheme References ---------------------------------------------------------------------- Date: 21 May 87 11:37:58 GMT From: mcvax!botter!klipper!biep@seismo.css.gov (J. A. "Biep" Durieux) Subject: Zeno, quantum, semantics, Hofstadter, philosophy, inuitionism Please learn (as I just did) that there is an (as yet unmoderated) forum to discuss philosophy of logic, math, and science. It is sci.philosophy.tech . Please at least cross-post all philosophical articles to that group, and let follow-ups go there. Many people don't want to wade through many newsgroups to see if there are any philosophical articles. Are infinitesimals physically possible? Can (programming/natural) languages describe their own semantics (and what are the prerequisites)? Does the Aspect experiment imply faster-than-light information transfer? What does "meaning" mean (and: does this question mean anything if one doesn't know what "to mean" means)? What do the results of Heisenberg and Goedel imply for the possibility of knowledge? Is there a fundamental difference between the subjects of discourse for mathematics and natural languages? All these discussions don't belong where they pop up now. They belong in sci.philosophy.tech. Thanks for reading this. -- Biep. (biep@cs.vu.nl via mcvax) My F-key has autorepeat ------------------------------ Date: Thu, 21 May 87 14:32:00 CDT From: GE0242%SIUCVMB.BITNET@wiscvm.wisc.edu Subject: FRL and Analogy I am looking for a copy of public domain code for a frame-based representation language such as FRL, KRL, etc., written in Franz Lisp. If anyone has a copy that they wouldn't mind distributing, I would appreciate hearing from you. Also, I would like to hear from people doing research in analogical problem solving. Pointers to CURRENT research will be very much appreciated. Thanks in advance... Tom Eskridge Dept of Computer Science Southern Illinois University at Carbondale Carbondale, Il. 62901 BITNET: ge0242 at SIUCVMB ------------------------------ Date: 19 May 87 20:49:00 GMT From: lopez@p.cs.uiuc.edu Subject: CLIPS: Parallel Version CLIPS: C Language's Integrated Production System. (NASA/Cosmic) If anyone out there is using CLIPS and knows of any features they would like to see in a new parallel version of the language, please feel free to send your comments to me. The new version should be done for the world to use by early December. F. Lopez ------------------------------ Date: Thu, 21 May 87 11:43 EDT From: LEN MOSKOWITZ Subject: Request for assistance I'm working on a memory model that learns concepts from scratch. Given events consisting of sensory input (e.g. for the vision modality, some description of scenes), it will (hopefully) learn appropriate groupings of features that define concepts. I am looking for sets of primitives that can describe sensory perceptions. The primitives need not be "correct" nor "exhaustive" when evaluated for psychological/perceptual validity, but they should be "adequate" to describe the range of features they apply to. I have one set of visual primitives (Irving Biederman's from SUNY Buffalo's Psych department) that may handle volumetric descriptions of objects describable by count nouns. To fill out the vision primitives, I think I need textural, motion, size, orientation, and color/brightness/contrast primitives too. I'm also looking for perceptual primitives for the other sensory modalities (aural, tactile, olfactory, kinesthetic...). Any pointers would be greatly appreciated. Len Moskowitz moskowitz@bendix.com (CSnet) moskowitz%bendix.com@relay.cs.net (ARPAnet) moskowit@topaz.rutgers.edu (alternate ARPAnet) rutgers!topaz!moskowit (uucp) ------------------------------ Date: Wed, 13 May 87 08:08:46 PDT From: lambert%cod@nosc.mil Subject: How can I find KNOWOL by IMCO--Intelligent Machine Company? I'm looking for Intelligent Machine Company's PC expert system tools KNOWOL &/or KNOWOL+, which were recently advertised (Nov 86 AI Expert) and reviewed (Mar 87 Computer Language). So far, all leads (ad, publisher, phone directory service) have terminated at a telephone number which is "no longer in service" (813-844-3262). Does either the company or the product still exist? D. Lambert REPLY TO: lambert@nosc.mil ------------------------------ Date: 21 May 87 11:35:11 GMT From: gilbert@aimmi.UUCP (Gilbert Cockton) Reply-to: gilbert@aimmi.UUCP (Gilbert Cockton) Subject: Re: Grammar Checkers In article <974@viper.UUCP> viper!john (John Stanley) writes: > > I don't know about the ones people have been talking about, but I >do know there is a program under development that can handle "there" >vs "their" or, for that matter, the "two" vs "too" vs "to". Anyone got one for "which" versus "that"? -- Gilbert Cockton, Scottish HCI Centre, Ben Line Building, Edinburgh, EH1 1TN JANET: gilbert@uk.ac.hw.aimmi ARPA: gilbert%aimmi.hw.ac.uk@cs.ucl.ac.uk UUCP: ..!{backbone}!aimmi.hw.ac.uk!gilbert ------------------------------ Date: Thu 21 May 87 17:36:08-PDT From: Ed Brink Subject: Word Proof takes the Jabberwocky Test Inspired by the research presented to me this morning, I decided to put Word Proof (version 1) to the Jabberwocky test. I used a slightly different decision rule: I picked the first suggestion that scanned, or if none did, the one that came closest. Word Proof appears to know more words than PCWrite, which does not surprise me a bit. WP is primarily a spelling checker; PCWrite does it as sideline. Anyhow, here goes: Jabberers 'Twangs brailling, and the slithery totes Did gore and gamble in the wake: All misty were the broodiest, And the mole wraths outraged. "Beware the Jabberer, my son! The jaws that bite, the claws that catch! Beware the Jumbo bird, and shun The furious Balderdash!" He took his vernal sword in hand: Long time the mangoes foe he sought - So rested he by the Tumult tree, And stood awhile in thought. And, as in unfit thought he stood, The Jabberer, with eyes of flame, Came whiffing through the turkey wood, And burbled as it came! One, two! One, two! And through and through The vernal blade went snicker-snack! He left it dead, and with its head He went galloping back. "And hats thou slain the Jabberer? Come to my arms, my bearish boy! O fractious day! Callow! Calmly!" He chortled in his joy. 'Twangs brailling, and the slithery totes Did gore and gamble in the wake: All misty were the broodiest, And the mole wraths outraged. ..Ed ------------------------------ Date: 21 May 87 18:42:41 GMT From: trh@arizona.edu Subject: Response to Scheme Ref Question The response to my request for information on two Scheme references has been so overwhelming that I have decided to summarize the infor- mation I have received. Thanks to everyone who replied, with special thanks to the people at Indiana, who were most encouraging. About THE BOOKS: Will Clinger of Tektronix, (Beaverton, OR) provides: > Friedman, Haynes, Kohlbecker, & Wand > Fundamental Abstractions of Programming Languages > This book, in draft form, is used in the undergraduate programming > languages course, C 311, at Indiana University. > I expect the book will be published later this year or early next year. > Until then, you might be able to get a copy from the Indiana University > bookstore. One of the authors, Dan Friedman, is more cautious stating only that: > ...is class notes that will be a book published > with MIT-Press & McGraw-Hill sometime in the future. Ken Dickey , also of Tektronix, and Dan Friedman gave the same reference: > "Programming with Continuations", > Program Transformations and Programming Environments > ed: P. Pepper, Springer Verlag, 1984, Pg 263-274. Several people supplied ADDRESSES FOR THE AUTHORS. For Dr. Friedman: > dfried@iuvax.cs.indiana.edu > For Chris Haynes > Both may (apparently) be reached by Smail at: Computer Science Department Lindley Hall Indiana University Bloomington, IN 47405 Finally, Daniel Schneider at the University of Geneva, Switzerland passed on some ADDITIONAL (new?) REFERENCES which he had received from Dr Haynes: C. T. Haynes and D. P. Friedman, ``Abstracting timed preemption with engines," to appear in {\it Computer Languages.} An earlier version of this paper appeared in the 1984 Lisp Conf. Proc. C. T. Haynes, D. P. Friedman and M. Wand, ``Obtaining coroutines with continuations," {\it Computer Languages,\/} Vol. II, No.~3/4 (1986), 143--153. D. P. Friedman and C. T. Haynes, ``Embedding continuations in procedural objects," to appear in {\it ACM Trans. Progr. Lang. Sys.\/} An earlier version appeared in the 1985 POPL. C. T. Haynes, ``Logic continuations," {\it Proceedings of the Third Int'l. Conf. on Logic Programming\/} (July, 1985), London, England, {\it Lecture Notes in Computer Science,\/} Vol.~225, Springer-Verlag, Berlin (1985), 671--685. Revised version to appear in {\it The Journal of Logic Programming.\/} This paper gives an embedding of Prolog into Scheme. R. K. Kybvig, D. P. Friedman, and C. T. Haynes, ``Expansion-passing style: beyond conventional macros," {\it Proceedings 1986 ACM Symposium on LISP and Functional Programming\/} (Aug., 1986), 143--150. Proposes a better macro facility for Scheme and other Lisp like languages. D. P. Friedman, C. T. Haynes and E. E. Kohlbecker, ``Programming with continuations," {\it Program Transformation and Programming Environments,\/} (P. Pepper, Ed.), Springer-Verlag, Berlin (1984), 263--274. Once again, thanks to everyone who responded! -Tom (trh@arizona) ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Thu May 28 13:34:30 1987 Date: Thu, 28 May 87 13:34:25 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #128 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Thu, 28 May 87 13:32 EDT Received: from relay.cs.net by RELAY.CS.NET id ab14343; 28 May 87 3:32 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa13843; 28 May 87 3:30 EDT Date: Wed 27 May 1987 23:01-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #128 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Thursday, 28 May 1987 Volume 5 : Issue 128 Today's Topics: Theory - Subsymbolic Pointers & IR Semantics & Symbol Grounding ---------------------------------------------------------------------- Date: Thu, 21 May 87 13:01:33 n From: DAVIS%EMBL.BITNET@wiscvm.wisc.edu Subject: framing problems I'd like to briefly say that perhaps an even more astounding problem than that proposed by Stevan Harnad is that connected with the means by which literate, intelligent and interested persons can totally obscure the central core of an idea by the use of unnecessarily obtuse jargon. If we're going to discuss the more philosphical end of AI (*yes please!*), then we don't *have* to throw everyone else off the track by bogging down the chat in a maze of terms intended to have *such* a precise meaning as to prevent anyone but the author from truly grasping the intended meaning. Hofstadter's mention of the journal "Art - Language" in metamagical themas should be than just humourous - it should have warned us all about the dangers of ridiculously narrow terminology. thankyou, and goodnight (yaaaawn!) paul davis netmail: davis@embl.bitnet "and when calculating the promise, remember this - the real of the matter - `to shatter tradition makes us *feel* free, but tradition, is a static defence against a chaotic community, and what do we gain by destroying it'?" ------------------------------ Date: Thu, 21 May 87 12:56:10 PDT From: rik%roland@sdcsvax.ucsd.edu (Rik Belew) Subject: Subsymbolic pointers & IR Semantics I now see why you consider my use of ``subsymbolic'' sloppy. It is because you have a well thought out, concrete proposal for three distinct representational levels that captures extremely well the distinctions I was trying to make. In the main, I think I accept and even like your ``psycho-physically grounded'' symbol theory. I do have a few questions, however. \section{Icon/Pointer/Symbol != Icon/Category/Symbol} First, what evidence causes you to postulate iconic and categorical representations as being distinct? Your distinction appears to rest on differences between the types of performance at task these two representations each ``subserve.'' Apart from a relatively few cognitive phenomena (short-term sensory storage, perhaps mental imagery) I am aware of little evidence of ``... continuous, isomorphic analogues of the sensory surfaces'' that is the basis of your iconic representations. In any case, I see great difficulty in distinguishing between such representations and ``... constructive A/D filters which preserve the invariant sensory features'' based simply on performance at any particular task. More generally, could you motivate your ``subserve'' basis for classifying cognitive representations. I use ``icon'' to mean much the same as your ``categorical representations'' (which I'm sure will cause us no end of problems as we discuss these issues!). These representations --- whatever they are called --- are characterized by their direct, albeit statistical, relationship with sensory features. This distinguishes icons from ``symbols'' which are representations without structural correspondence with the environment. Your, more restricted, notion of ``symbol'' seems to differ in two major respects: its emphasis on the systematicity of symbols; and its use of LABELS (of categories) as the atomic elements. I accept the systematicity requirement, but I believe your labeling notion confounds several important factors. First, I believe you are using labels to mean POINTERS: computationally efficient references to more elaborate and complete representations. Such pointers correspond closely to Peirce's notion of INDICES, and are valuable not only for pointing from symbols to icons (the role you intend for labels) but also from one place in the symbolic representation to another. Consider Peirce's view on the primacy of pronouns. However, I have come to use the term ``pointer'' instead of ``index'' because I also mean to refer to the vast economy of representation afforded by such representational devices, as recognized by computer science. Pointers have obviously been an integral part of traditional data structures in computer science since the beginning. Quillian's use of TOKEN --> TYPE pointers is still a classic example of their benefit to AI knowledge structures. More recently, many connectionists have taken this pointer quality to be what they mean by ``symbol.'' For example, Touretzky and Derthick say: \begin{quotation} Intelligence seems to require the ability to build complex structures and to refer to them with simpler objects that may be passed among processes easily. In this paper we use ``symbol'' to denote such objects... Symbols in Lisp are mobile [one of five properties Touretzky ascribes to symbols] because their addresses are easily copied and passed around. In connectionist models where symbols are identified with activity in particular units, symbols are not mobile. [Touretzky \& Derthick, ``Symbol structures in connectionist networks'' IEEE COMPCON 1987] \end{quotation} A more sophisticated form of pointer has been discussed by Hinton as what he calls a ``reduced description.'' The idea here is to allow the pointer to contain some reduced version of the description to which it is pointing. (For example, consider the use of tag bits in some computer architectures that indicate whether the pointer address refers to an integer, a real, a string, etc.) If the reduced description is appropriately constructed, the pointer itself may contain sufficient information and so the computational overhead of following it to the full description can be avoided. In general, however, it might seem impossible to construct such appropriate reduced descriptions. But if a PROCESS view of cognition is adopted, rather than relying on a STATIC structure to encode all information , such generalized pointers become more conceivable: reduced descriptions correspond to PARTIALLY ACTIVE representations which, when more FULLY ACTIVE, lead to more completely specified descriptions. The other feature of your labeling notion that intrigues me is the naming activity it implies. This is where I see the issues of language as becoming critical. I would go so far as to propose that truly symbolic representations and language are co-dependent. I believe we agree on this point. It is important to point out that by claiming true symbol manipulation arose only as a response to language, I do not mean to belittle the cognitive abilities of pre-lingual hominids. Current connectionist research is showing just how powerful iconic (and perhaps categorical) representations can be. By the same token I use the term language broadly, to include the behavior of other animals for example. In summary, it seems to me that the aspect of symbols connectionism needs most is something resembling pointers. More elaborate notions of symbol introduce difficult semantic issues of language that can be separated and addressed indepently (see below). Without pointers, connectionist systems will be restricted to ``iconic'' representations whose close correspondence with the literal world severly limits them from ``subserving'' most higher (non-lingual) cognitive functioning. \section{Total Turing Test} While I agree with the aims of your Total Turing Test (TTT), viz. capturing the rich interrelated complexity characteristic of human cognition, I have never found this direct comparison to human performance helpful. A criterion of cognitive adequacy that relies so heavily on comparison with humans raises many tangential issues. I can imagine many questions (e.g., regarding sex, drugs, rock and roll) that would easily discriminate between human and machine. Yet I do not see such questions illuminating issues in cognition. On the other hand, I also want to avoid the ``... Searlian mysteries about `intrinsic' vs. `derived' intentionality....'' Believe it or not, it is exactly these considerations that has led me to the information retrieval task domain. I did not motivate this well in my last message and would like to give it another try. \section{Semantics in information retrieval} First, let's do our best to imagine providing an artificial cognitive system (a robot) with the sort of grounding experience you and I both believe necessary to full cognition. Let's give it video eyes, microphone ears, feedback from its affectors, etc. And let's even give it something approaching the same amount of time in this environment that the developing child requires. I want to make two comments on this Gedanken experiment. First, the corpus of experience acquired by such a robot is orders of magnitude more complex than any system today. Second, there is no doubt that even such a complete system as this would have a radically different experience of the world than our own. In short, I simply mean to highlight the huge distance between the psycho-physical experience of any artificial system and any human. The communication barrier between the symbols of man and the symbols of machine to which I referred in my last message is a consequence of this distance. When we say ``apple'' I would expect the symbol in our heads to have almost no correspondence to the symbol ``apple'' in any computers. Since I see such a correspondence as a necessary precondition to the development of language, I am not hopeful that language between man and machine can develop in the same fashion as language develops within a species. So the question for me becomes: how might we give a machine the same rich corpus of experience (hence satisfying the total part of your TTT) without relying on such direct experiential contact with the world? The answer for me (at the moment) is to begin at the level of WORDS. I view the enormous textual databases of information retrieval (IR) systems as merely so many words. I want to take this huge set of ``labels,'' attached by humans to their world, as my primitive experiential database. The task facing my system, then, is to look at and learn from this world. This experience actually has two components. The textbase itself provides the first source of information, viz., how authors use and juxtapose words. The second, ongoing source of experience are the interactions with IR users, in which people use these same words and then react positively or negatively to my systems interpretation of those words. The system then adapts its (connectionist) representation of the words and documents so as to reflect what the consensus of its users indicate by these words. In short, I am using the original authors and the browsing users as the systems ``eyes'' into the human world. I am curious to see what structural relationship arise among these words, via low level connectionist learning procedures, to facilitate access to the IR database. ------------------------------ Date: Fri, 22 May 87 11:12:29 EDT From: harnad@Princeton.EDU Subject: Symbol Grounding - Pt. 1 This is part 1 of a response to a longish exchange on the symbol grounding problem. Rik Belew asks: > ... [1] what evidence causes you to postulate iconic and categorical > representations as being distinct?... Apart from a relatively few > cognitive phenomena (short-term sensory storage, perhaps mental > imagery), I am aware of little evidence of "continuous, isomorphic > analogues of the sensory surfaces" [your "iconic" representations]. > [2] I see great difficulty in distinguishing between such > representations and "constructive A/D filters [`categorical' > representations] which preserve the invariant sensory features" based > simply on performance at any particular task. More generally, could > you [3] motivate your ``subserve'' basis for classifying cognitive > representations. [1] First of all, short-term sensory storage does not seem to constitute *little* evidence but considerable evidence. The tasks we can perform after a stimulus is no longer present (such as comparing and matching) force us to infer that there exist iconic traces. The alternative hypthesis that the information is already a symbolic description at this stage is simply not parsimonious and does not account for all the data (e.g., Shepard's mental rotation effects). These short-term effects do suggest that iconic representations may only be temporary or transient, and that is entirely compatible with my model. Something permanent is also going on, however, as the sensory exposure studies suggest: Even if iconic traces are always stimulus-bound and transient, they seem to have a long-term substrate too, because their acuity and reliability increases with experience. I would agree that the subjective phenomenology of mental imagery is very weak evidence for long-term icons, but successful performance on some perceptual tasks drawing on long-term memory is at least as economically explained by the hypothesis that the icons are still accessible as by the alternative that only symbolic descriptions are being used. In my model, however, most long-term effects are mediated by the categorical representations rather than the iconic ones. Iconic representations are hypothesized largely to account for short-term perceptual performance (same/difference judgment, relative comparisons, similarity judgments, mental rotation, etc.). They are also, of course, more compatible with subjective phenomenology (memory images seem to be more like holistic sensory images than like selective feature filters or symbol strings). [2] The difference between isomorphic iconic representations (IRs) and selective invariance filters (categorical representations, CRs) is quite specific, although I must reiterate that CRs are really a special form of "micro-icon." They are still sensory, but they are selective, discarding most of the sensory variation and preserving only the features that are invariant *within a specific context of confusable alternatives*. (The key to my approach is that identifying or categorizing something is never an *absolute* task but a relative, context-dependent one: "What's that?" "Compared to What?") The only "features" preserved in a CR are the ones that will serve as a reliable basis for sorting the instances one has sampled into their respective categories (as learned from feedback indicating correct or incorrect categorizing). The "context" (of confusable alternatives), however, is not a short-term phenomenon. Invariant features are provisional, and always potentially revisable, but they are parts of a stable, long-term category-representational system, one that is always being extended and updated on the basis of new categorization tasks and samples. It constitutes an ever-tightening approximation. So the difference between IRs and CRs ("constructive A/D filters") is that IRs are context-independent, depending only on the comparison of raw sensory configurations and on any transformations that rely on isomorphism with the unfiltered sensory configuration, whereas IRs are context-dependent and depend on what confusable alternatives have been sampled and must then be reliably identified in isolation. The features on which this successful categorization is based cannot be the holistic configural ones, which blend continuously into one another; they are features specifically selected and abstracted to subserve reliable categorization (within the context of alternatives sampled to date). They may even be "constructive" features, in the sense that they are picked out by performing an active operation -- sensory, comparative or even logical -- on the sensory input. Apart from this invariant basis for categorization (let's call these selectively abstracted features "micro-iconic") all the rest of the iconic information is discarded from the category filter. [3] Having said all this, it is easy to motivate my "subserve" as you request: IRs are the representations that subserve ( = are required in order to generate successful performance on) tasks that call for holistic sensory comparisons and isomorphic transformations of the unfiltered sensory trace (e.g., discrimination, matching, similarity judgment) and CRs are the representations required to generate successsful performance on tasks that call for reliable identification of confusable alternatives presented in isolation. As a bonus, the latter provide the grounding for a third representational system, symbolic representations (SRs), whose elementary symbols are the labels of the bounded categories picked out by the CRs and "fleshed out" by the IRs. These elementary symbols can then be rulefully combined and recombined into symbolic descriptions which, in virtue of their reducibility to grounded nonsymbolic representations, can now refer to, describe, predict and explain objects and events in the world. Stevan Harnad {seismo, psuvax1, bellcore, rutgers, packard} !princeton!mind!harnad harnad%mind@princeton.csnet harnad@mind.princeton.edu (609)-921-7771 ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Thu May 28 13:36:51 1987 Date: Thu, 28 May 87 13:36:46 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #129 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Thu, 28 May 87 13:35 EDT Received: from relay.cs.net by RELAY.CS.NET id ac15192; 28 May 87 6:23 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa14671; 28 May 87 6:23 EDT Date: Wed 27 May 1987 23:44-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #129 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Thursday, 28 May 1987 Volume 5 : Issue 129 Today's Topics: Theory - Symbol Grounding ---------------------------------------------------------------------- Date: 22 May 87 18:08:53 GMT From: mind!harnad@princeton.edu (Stevan Harnad) Subject: Re: The symbol grounding problem (Part 2 of 2) Rik Belew writes: > I use ``icon'' to mean much the same as your ``categorical > representations''... their direct, albeit statistical, > relationship with sensory features... distinguishes icons from > ``symbols'', which are representations without structural > correspondence with the environment. The criterion for being iconic is physical isomorphism ( = "structural correspondence"). This means that the relationship between an object and its icon must be a physically invertible (analog) transformation. In my model, iconic representations are isomorphic with the unfiltered sensory projection of the input they represent, whereas categorical representations are only isomorphic with selected features of the input. In that sense they are "micro-iconic." The important point is that they are selective and based on abstracting some features and discarding all the rest. The basis of selection is: "What features do I need in order to categorize this input correctly, relative to other confusable alternatives I have encountered and may encounter in the future?" To call the input an "X" on the basis of such a selective, context-governed feature filter, however, is hardly to say that one has an "icon" of an "X" in the same sense that iconic representations are icons of input sensory projections. The "structural correspondence" is only with the selected features, not with the "object" being named. On the other hand, the complete absence of any structural correspondence whatever is indeed what distinguishes both iconic and categorical representations from symbolic ones. The heart of my symbol grounding proposal is that in allowing you to speak of (identify, label, categorize) "X's" at all, categorical representations have provided you with a set of elementary labels, based on nonsymbolic representations, that can now ground an otherwise purely syntactic symbol system in the objects and events to which it refers. Note, though, that the grounding is a strong constraint, one that renders the symbolic system no longer the autonomous syntactic module of conventional AI. The system is hybrid through-and-through. The relations between the three kinds of representation are not modular but bottom-up, with the nonsymbolic representations supporting the symbolic representations' relation to objects. Most of the rules for symbol binding, etc. are now constrained in ways that depart from the freedom of ungrounded formal systems. > Your, more restricted, notion of ``symbol'' seems to differ in two > major respects: its emphasis on the systematicity of symbols; and its > use of LABELS (of categories) as the atomic elements. I accept > the systematicity requirement, but I believe your labeling notion > confounds several important factors... > First, I believe you are using labels to mean POINTERS: > computationally efficient references to more elaborate and complete > representations... valuable not only for pointing from symbols > to icons (the role you intend for labels) but also from one place in > the symbolic representation to another... > many connectionists have taken this pointer quality to be > what they mean by "symbol." I believe my grounding proposal is a lot more specific than merely a pointing proposal. Pointing is, after all, a symbol-to-symbol function. It may get you to an address, but it won't get you from a word to the nonsymbolic object to which it refers. The labeling performance that categorical representations subserve, on the other hand, is an operation on objects in the world. That is why I proposed grounding elementary symbols in it: Let the arbitrary labels of reliably sorted object categories be the elementary symbols of the symbolic system. Such a hybrid system would continue to have most of the benefits of higher-order systematicity (compositionality), but with nonsymbolic constraints "weighing down" its elementary terms. Consider ordinary syntactic constraints to be "top-down" constraints on a symbol-system. A grounded hybrid system would have "bottom-up" constraints on its symbol combinations too. As to the symbolic status of connectionism -- that still seems to be moot. > The other feature of your labeling notion that intrigues me is > the naming activity it implies. This is where I see the issues > of language as becoming critical. ...truly symbolic representations and > language are co-dependent. I believe we agree on this point... > true symbol manipulation arose only as a response to language > Current connectionist research is showing just how > powerful iconic (and perhaps categorical) representations can > be... I use the term language broadly, to > include the behavior of other animals for example. Labeling and categorizing is much more primitive than language, and that's all I require to ground a symbol system. All this calls for is reliable discrimination and identification of objects. Animals certainly do it. Machines should be able to do it (although until they approach the performance capacity of the "Total Turing Test" they may be doing it modularly in a nonrepresentative way). Language seems to be more than labeling and categorizing. It also requires *describing*, and that requires symbol-combining functions that in my model depend critically on prior labeling and categorizing. Again, the symbolic/nonsymbolic status of connectionism still seems to be under analysis. In my model the provisional role of connectionistic processes is in inducing and encoding the invariant features in the categorical representation. > the aspect of symbols [that] connectionism > needs most is something resembling pointers. More elaborate notions of > symbol introduce difficult semantic issues of language that can be > separated and addressed independently... Without pointers, > connectionist systems will be restricted to ``iconic'' representations > whose close correspondence with the literal world severely limits them > from ``subserving'' most higher (non-lingual) cognitive functioning. I don't think pointer function can be divorced from semantic issues in a symbol system. Symbols don't just combine and recombine according to syntactic rules, they are also semantically interpretable. Pointing is a symbol-to-symbol relation. Semantics is a symbol-to-object relationship. But without a semantically interpretable system you don't have a symbol system at all, so what would be pointing to what? For what it's worth, I don't personally believe that there is any point in connectionism's trying to emulate bits and pieces of the virtues of symbol systems, such as pointing. Symbolic AI's problem was that it had symbol strings that were interpretable as "standing for" objects and events, but that relation seemed to be in the head of the (human) interpreter, i.e., it was derivative, ungrounded. Except where this could be resolved by brute-force hard-wiring into a dedicated system married to its peripheral devices, this grounding problem remained unsolved for pure symbolic AI. Why should connectionism aspire to inherit it? Sure, having objects around that you can interpret as standing for things in the world and yet still manipulate formally is a strength. But at some point the interpretation must be cashed in (at least in mind-modeling) and then the strength becomes a weakness. Perhaps a role in the hybrid mediation between the symbolic and the nonsymbolic is more appropriate for connectionism than direct competition or emulation. > While I agree with the aims of your Total Turing Test (TTT), > viz. capturing the rich interrelated complexity characteristic > of human cognition, I have never found this direct comparison > to human performance helpful. A criterion of cognitive > adequacy that relies so heavily on comparison with humans > raises many tangential issues. I can imagine many questions > (e.g., regarding sex, drugs, rock and roll) that would easily > discriminate between human and machine. Yet I do not see such > questions illuminating issues in cognition. My TTT criterion has been much debated on the Net. The short reply is that the goal of the TTT is not to capture complexity but to capture performance capacity, and the only way to maximize your confidence that you're capturing it the right way (i.e., the way the mind does it) is to capture all of it. This does not mean sex, drugs and rock and roll (there are people who do none of these). It means (1) formally, that a candidate model must generate all of our generic performance capacities (of discriminating, identifying, manipulating and describing objects and events, and producing and responding appropriately to names and descriptions), and (2) (informally) the way it does so must be intuitively indistinguishable from the way a real person does, as judged by a real person. The goal is asymptotic, but it's the only one so far proposed that cuts the underdetermination of cognitive theory down to the size of the ordinary underdetermination of scientific theory by empirical observations: It's the next best thing to being there (in the mind of the robot). > First, let's do our best to imagine providing an artificial cognitive > system (a robot) with the sort of grounding experience you and I both > believe necessary to full cognition. Let's give it video eyes, > microphone ears, feedback from its affectors, etc. And let's even > give it something approaching the same amount of time in this > environment that the developing child requires... > the corpus of experience acquired by such a robot is orders of magnitude > more complex than any system today... [yet] even such a complete > system as this would have a radically different experience of the > world than our own. The communication barrier between the symbols > of man and the symbols of machine to which I referred in my last > message is a consequence of this [difference]. My own conjecture is that simple peripheral modules like these will *not* be enough to ground an artificial cognitive system, at least not enough to make any significant progress toward the TTT. The kind of grounding I'm proposing calls for nonsymbolic internal representations of the kind I described (iconic representations [IRs] and categorical representations [CRs]), related to one another and to input and output in the way I described. The critical thing is not the grounding *experience*, but what the system can *do* with it in order to discriminate and identify as we do. I have hypothesized that it must have IRs and CRs in order to do so. The problem is not complexity (at least not directly), but performance capacity, and what it takes to generate it. And the only relevant difference between contemporary machine models and people is not their *experience* per se, but their performance capacities. No model comes close. They're all special-purpose toys. And the ultimate test of man/machine "communication" is of course the TTT! > So the question for me becomes: how might we give a machine the > same rich corpus of experience (hence satisfying the total part > of your TTT) without relying on such direct experiential > contact with the world? The answer for me (at the moment) is > to begin at the level of WORDS... the enormous textual > databases of information retrieval (IR) systems... > I want to take this huge set of ``labels,'' attached by humans to > their world, as my primitive experiential database... > The task facing my system, then, is to look at and learn from this > world:... the textbase itself [and] interactions with IR users... > the system then adapts its (connectionist) representation... Your hypothesis is that an information retrieval system whose only source of input is text (symbols) plus feedback from human users (more symbols) will capture a significant component of cognition. Your hypothesis may be right. My own conjecture, however, is the exact opposite. I don't believe that input consisting of nothing but symbols constitutes "experience." I think it constitutes (ungrounded) symbols, inheriting, as usual, the interpretations of the users with which the system interacts. I don't think that doing connectionism instead of symbol-crunching with this kind of input makes it any more likely to overcome the groundedness problem, but again, I may be wrong. But performance capacity (not experience) -- i.e., the TTT -- will have to be the ultimate arbiter of these hypotheses. -- Stevan Harnad (609) - 921 7771 {bellcore, psuvax1, seismo, rutgers, packard} !princeton!mind!harnad harnad%mind@princeton.csnet harnad@mind.Princeton.EDU ------------------------------ Date: 27 May 87 15:55:33 GMT From: diamond.bbn.com!aweinste@husc6.harvard.edu (Anders Weinstein) Subject: Re: The symbol grounding problem (Part 2 of 2) In article <770@mind.UUCP> harnad@mind.UUCP (Stevan Harnad) writes: > >The criterion for being iconic is physical isomorphism >( = "structural correspondence"). This means that the relationship >between an object and its icon must be a physically invertible >(analog) transformation. As I've seen you broach this criterion a few times now, I just thought I'd remind you of a point that I thought was clearly made in our earlier discussion of the A/D distinction: loss of information, i.e. non-invertibility, is neither a necessary nor sufficient condition for analog to digital transformation. Anders Weinstein ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Thu May 28 13:45:57 1987 Date: Thu, 28 May 87 13:45:51 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #130 Status: RO Received: from relay.cs.net by vtcs1.cs.vt.edu; Thu, 28 May 87 13:43 EDT Received: from relay.cs.net by RELAY.CS.NET id aa14343; 28 May 87 3:31 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa13833; 28 May 87 3:29 EDT Date: Wed 27 May 1987 23:53-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #130 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Thursday, 28 May 1987 Volume 5 : Issue 130 Today's Topics: Queries - Philosophy and Complexity Theory & Prolog Interpreter in C Available (Wanted/Offered) & Graduate Schools with a Good AI Program, Bindings - Les Kitchen & Interactive Fiction Discussion, Applications - Knowledge-Based Document Retrieval & Knowledge from Databases Summary, Humor - Artificial Reasoning, Review - Spang Robinson Report 3/5, May 1987 ---------------------------------------------------------------------- Date: 25 May 87 14:14:46 GMT From: munnari!basser.cs.su.oz!ray@seismo.CSS.GOV Subject: Philosophy, Artificial Intelligence and Complexity Theory Lately I've been chating informally to a philosopher/friend about common interests in our work. He was unfamiliar with the concept of the TIME TO COMPUTE consequences of facts. Furthermore, the ramifactions of intractability (ie. if P != NP is, as we all suspect, true) seemed to be new to my friend. The absolute consequences are hard to get across to a non-computer scientist; They always say "but computers are getting faster all the time...". I'm digging around for references in AI on these ideas. This isn't my area. Can anyone suggest some? I've dug up a couple of relevant papers: "Some Philosophical Problems from the Standpoint of Artificial Intelligence", McCarthy and Hayes, 1969. I think this is the most obvious starting point, with its description of the frame problem. However, the authors seem to discuss the issue from the standpoint of what a formalism must contain so that the system is CAPABLE of computing what it needs rather than the TIME to compute these things (please correct me if I'm wrong). This is hardly suprising, as it predates the seminal P=NP? work. "The Tractability of Subsumption in Frame-Based Description Languages", Brachman and Levesque, AAAI-84. This paper is relevant, but too implementation specific for what I want. I want something more general and preferably philosophically oriented. *NOTE*: I'm certainly NOT implying that AI is impossible! But the notion of intractability is one that must be addressed. I'm sure it has been addressed. I'm just chasing a few references, more for the benefit of my colleague than myself. Raymond Lister Basser Department of Computer Science University of Sydney NSW 2006 AUSTRALIA ACSnet: ray@basser ARPANET: ray%basser.oz@seismo.arpa ------------------------------ Date: 22 May 87 19:49:57 GMT From: sundc!hadron!inco!mack@seismo.css.gov (Dave Mack) Subject: Prolog Interpreter in C Available (Wanted/Offered) I am looking for a public domain Prolog interpreter. I am also offering to post one to the USENET, depending on the response I get to this posting. The reason for the strange form of this request is that I no longer have time to hack at my version of Prolog. My implementation is an incomplete Clocksin-Mellish syntax interpreter. Many of the built-in functions are not yet implemented and it has several major bugs ("cut" doesn't work quite right, for example.) It does correctly parse CM prolog and performs resolution (mostly) correctly. It is written in C for BSD4.2, but should be easily portable System V, since about the only OS dependent feature is "index". If I get a reasonable number of positive responses to this posting, I will finish documenting the beast and ship a couple of shar files to comp.sources.unix. If you want a copy, let me know. If you manage to fix any of the bugs, mail me the diffs. I'll test them and post them to the net. Happy Hacking! Dave Mack McDonnell Douglas-Inco, Inc. (home of the laser-guided hamburger) 8201 Greensboro Drive DISCLAIMER: Until they pay me for McLean, VA 22101 them, my opinions are my own. Call (703)883-3911 for prices. ...!seismo!sundc!hadron!inco!mack ------------------------------ Date: 26 May 87 15:58:22 GMT From: hp-sdd!nick@sdcsvax.ucsd.edu (Nick Flor) Subject: Need info on grad schools with a good AI program Could someone e-mail me a list of graduate schools with a good AI program. (Like the top 25 or top 10) If not, a pointer to where I could find this information in a concise form would also be helpful. Sorry to ask this question. I know it gets asked alot, I just never payed attention before. Thanks in advance. Nick -- + Disclaimer: The above opinions are my own, not necessarily my employers'. / Nick V. Flor / ..hplabs!hp-sdd!nick / Hewlett Packard, San Diego Division * "What's going down in this world, you got no idea. Believe me."-The Comedian - "Less Thunder with the Mouth, More Lightning with the Fists." - The Ripper ------------------------------ Date: Mon, 25 May 87 16:28 EDT From: "Les Kitchen." Subject: Binding (actually setq) >From 1st of July 1987: Les Kitchen Department of Computer Science University of Western Australia Nedlands, W.A. 6009 AUSTRALIA munnari!wacsvax.oz!les@seismo.css.gov les%wacsvax.oz@australia.csnet ------------------------------ Date: 27 May 87 15:43:22 GMT From: oliveb!pyramid!tcgould!engst@ames.arpa (Adam C. Engst) Subject: Interactive fiction Hi, I am currently starting a discussion group on misc.misc that deals with interactive fiction. Interactive fiction has as its basic concept that of non-linear text, though there are many other additions that can (and should) be added for the enhancment of the text. If you are unsure as to what interactive fiction is, read misc.misc. Somewhere in there (among many other good articles mostly calling for AI-based systems) is my brief description of interactive fiction. I would like the opinion of AI workers in order to determine the level at which AI can be used to help advance interactive fiction, either now or in the future. I accept all email, but I can't guarantee any responses since I have terrible luck with paths. So, please check it out, and if you are interested, join the discussion. I hope to have it large enough soon to get our own newsgroup to stop bothering everyone else in misc.misc. Adam Engst pv9y@cornella.bitnet engst@batcomputer.tn.cornell.edu ------------------------------ Date: Thu, 21-MAY-1987 09:19 EST From: FOXEA%VTVAX3.BITNET@wiscvm.wisc.edu Subject: Reply - Knowledge-Based Document Retrieval [Forwarded from the IRList Digest by Laws@STRIPE.SRI.COM.] Date: Tue, 19 May 87 13:44:40+0900 From: Kim Young Whan Subject: References on Knowledge-based Document Retrieval I'm writing a Ph.D Thesis about Knowledge Based System for Document Retrieval, especially about rule based system using uncertainty handling mechanism (Bayesian, D-S Theory, Fuzzy Set Theory). [...] Young-Whan Kim Dept. of CS KAIST P.O.Box 150, Cheongryang Seoul, 131 Republic of Korea. ywkim%csd.kaist.ac.kr@relay.cs.net(from cs-net) ywkim%csd.kaist.ac.kr@wiscvm.wisc.edu(from bitnet) [Note: there has been quite a lot of work on this. There will be a special issue of Information Processing and Management out this summer on this topic. Several papers at the ACM SIGIR Conf. on R&D in Information Retrieval in New Orleans in a few weeks will be about this - I will announce how to get proceedings from ACM when they become available. There was a 2 part article in JASIS by Biswas et al. recently. Notable other systems include I3R by Croft and Thomson, RUBRIC by Tong et al., CODER by Fox et al, CANSEARCH by Pollitt, ... Also, there are abstracts in issues of ACM SIGIR Forum. If you are not an ACM SIGIR member, I encourage joining -- it still only costs $6 to ACM members, but dues will jump to $12 soon. - Ed] ------------------------------ Date: 22 May 87 20:50:19 GMT From: necntc!ci-dandelion!bunny!gps0@ames.arpa (Gregory Piatetsky-Shapiro) Subject: Knowledge from Databases? A follow-up This is a promised follow-up on the subject of extracting knowledge from databases. I have received about a dozen replies and my thanks to all the respondents. I have also tried to reply individually, but not always succeeded (all blame is on the mailer). I have found two recent references in this area. The Spring, 1987 issue of IEEE Expert contains a good article by Michael Walker on "How Feasible is Automated Discovery?". This article also contains references to other relevant systems, including Meta-Dendral, AM, Bacon, RX, Prospector and others. There is also an article by Gio Wiederhold et al, on "KSYS: An Architecture for Integrating Databases and Knowledge Bases". It was submitted to IEEE transactions on Software Engineering and it can be obtained by writing to Prof. Wiederhold at Stanford. I have found that there is some work on extracting expert system rules from databases at GM (contact samy@gmr.com). There is also a company in Hawaii working on automatic analysis of medical databases and there is a small start-up in Boston area working on extracting data models from databases. However, none of the above have published anything. There are some commercial expert system tools that interface to databases: Intellicorp has KEE Connection to interface KEE to SQL databases Inference is working on a similar tool for ART Arity Prolog has an interface to SQL Guru from mdbs combines an ES and DBMS (and other stuff). Insight 2+ interfaces to dbase II, III VP Expert also has an interface to dbase II, III Mad Intelligent Systems from San Jose, CA has produced Relational Lisp - Lisp extended by relational operations Herman Rubin from Purdue expressed doubts that it is possible to come up with new theories in a mechanical way. He says >I do not trust anyone to come up with anything new by that device. Data >analysis is necessary, but it should only be done by geniuses, or at least >very bright people, who are constantly aware of the dangers of incorrect >analysis, or even accidently incorrect analysis. True - "extracting knowledge from data" will not come up with radically new theories. However this approach can and does come up with new relationships, the general form of which is known - look at Bacon, Meta-Dendral, RX, Prospector. >If Kepler had one more decimal place to work with, his laws would not fit; >The data analysis problem is to get theories >which are certainly incorrect, and which fit "more or less." An excellent observation. But who says that a computer cannot search for relations that hold more or less? In fact, accounting for approximate relationships is a must prerequisite in analyzing any real data, and it was done before. Comments are welcome. ------------------------------ Date: 21 May 87 11:35:26 GMT From: gilbert@aimmi.UUCP (Gilbert Cockton) Reply-to: gilbert@aimmi.UUCP (Gilbert Cockton) Subject: Re: Humor - Artificial Life In article <8705180545.AA27470@ucbvax.Berkeley.EDU> NHAAS@IBM.COM (Norman Haas) writes: >(In case this point hasn't already been made, re the "Artificial Life" confer- >ence announcement a few issues back:) > > Why stop with life? Let's go all the way: > > 1. Artificial Culture and Civilization, including > Artificial Natural Languages > 2. Artificial Science, including > Artificial Research in the field of Artificial Intelligence Nah - that's not all the way. We also need 3. Artificial reasoning. This is when people who nothing about epistemology (philosophical and anthropological/sociologial aspects) or psychology lock themselves away on an AI project and make things up about how people reason. I may be oldfashioned, but I do miss empirical substance and conceptual coherence :-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) -- Gilbert Cockton, Scottish HCI Centre, Ben Line Building, Edinburgh, EH1 1TN JANET: gilbert@uk.ac.hw.aimmi ARPA: gilbert%aimmi.hw.ac.uk@cs.ucl.ac.uk UUCP: ..!{backbone}!aimmi.hw.ac.uk!gilbert ------------------------------ Date: Mon, 25 May 1987 13:38 CST From: Leff (Southern Methodist University) Subject: Review - Spang Robinson Report 3/5, May 1987 Spang Robinson Report, May 1987, Volume 3 No. 5 (Summary) The lead article is on difficulties that LISP machine vendors have had. Currently, here is the breakdown of how many of each machine is installed for AI applications: DEC 5000 SUN 1800 Apollo 600 Tektronix 100 Lisp Machines Symbolics 4000 Xerox 2500 TI 1500 LMI 500 Integrated Inference Machines has just entered the market. DEC reports that 30 percent of DEC's AI sales are MicroVAXEN with ten per cent being the high end 800 machines. DEC has put all AI efforts under Bill Johnson and two buildings will be dedicated to AI activities with 300 people involved. They also have a table of all LISP Machine Vendors as well as general purpose machine vendors entering the AI market indicating pricing, number of units sold for AI and AI software available for each machine. They estimate that the revenue for sales of conventional machines to do AI is about the same as that for LISP machine with both groups totalling about $200 million each. There is also a nice table summarizing the activities and machines for both LISP Machine companies and conventional machine vendors entering the AI market. +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- The next article discusses Gold Hill's Gold Works, an expert sytem. The system requires 5 MB extended memory, 512K of RAM and 7MB of disk space. The system interfaces with Lotus, dBASE, C, and Assembler as well as Mice and EGA drivers. The system supports frames, multiple inheritance, object oriented programming, forward and backward chaining, the RETE algorithm, an agenda mechanism, a screen editor for developing the presentation part of the expert system and a dependency Network which can be used in multiple words type applicatons. It costs $5,000 between now and July 31 with the price at $7500 thereafter. $-$-$-$-$-$-$-$-$-$-$-$ SHORTS -$-$-$-$-$-$-$-$-$-$-$-$-$-$-$-$-$-$- The AI Show at Long Beach drew 3438 attendees. Teknowledge reports third quarter revenues of $4,469,000 and a net loss of $721,000. The former head of Sperry's AI center has founded PEAKSolutions in Minneapolis which provides AI services. Eloquent Systems is now marketing its in-house developed AI toolkit optimized for real-time multi-user applications. This company also developed systems for the hotel industry. Teknowledge will be marketing Framatomes's AI tool, K1. CP international will be selling a natural language interface for their text retrieval system, STRATUS. Two banks have licensed Syntelligence's Lending Advisor, an expert system to assist loan officers. Larry Geisel who used to be president of Carnegie Group is now president of Intelligent Technology Group. _-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_- They also have a list of papers on LISP machines and reviews of The T Programming Language: A Dialect of LISP by Stephen Slade PROLOG: A Relational Language and Its Applications by John Malpas Prolog Programming: Applications for Database Systems, Expert Systems, and Natural Language Systems by Claudia Marcus ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun May 31 03:18:03 1987 Date: Sun, 31 May 87 03:17:49 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #131 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sun, 31 May 87 03:06 EDT Received: from relay.cs.net by RELAY.CS.NET id aa02946; 30 May 87 0:49 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa12757; 30 May 87 0:50 EDT Date: Fri 29 May 1987 21:08-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #131 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Saturday, 30 May 1987 Volume 5 : Issue 131 Today's Topics: Bibliography - Leff order.addresses6 & ai.bib53TR ---------------------------------------------------------------------- Date: Mon, 25 May 1987 13:38 CST From: Leff (Southern Methodist University) Subject: order.addresses6 Laboratory for Computer Science research Rutgers University New Brunswick, NJ 08903 Center for Supercomputing Research and Development University of Illinois 305 Talbot Lab 104 S. Wright Street Urbana, IL 61801-2932 Department of Computer Science 915 Patterson Office Tower University of Kentucky Lexington, Kentucky 40506-0027 L. A. Stratmann Department of Computer Science Rice University P. O. Box 1892 Houston, Texas 77251 Robot Systems Division University of Michigan Ann Arbor, Michigan 48109 Department of Computer Science University of Illinois at Urbana-Champaign 1304 West Springfield AVenue Urbana, Illinois 61801 Department of Computer Sciences Technical REport Center Taylor Hall 2.124 The University of Texas at Austin Austin, Texas 78712-1188 Diane Speekman USC/Information Sciences Institute 4676 Admiralty Way, Ste. 1001 Marina del Rey, CA 90292-6695 ------------------------------ Date: Mon, 25 May 1987 13:38 CST From: Leff (Southern Methodist University) Subject: ai.bib53TR %A N. V. Murray %A E. Rosenthal %T Theory Links %I State University of New York at Albany, Department of Computer Science %R 86-3 %K AI11 %X We develop the notiton of theory link, which is a generalization of ordinary link to a set of literals that are simultaneously unsatisfiable relative to a given set of clauses. We show that theory links may be 'activated' in much the same manner as ordinary links when inferencing with respect to the given set of clauses. Several link deletion results are shown to hold for theory links, and several examples, including Schubert's Steamroller, are presented using first-order theory links. %A N. V. Murray %A E. Rosenthal %T Path Dissolution for Propositional Logic %I State University of New York at Albany, Department of Computer Science %R 86-6 %K AI10 Prawitz matrix reduction semantic graphs path resolution Noetherean %A M. Balaban %A N. V. Murray %T Logic Programming with LOGLISP %I State University of New York at Albany, Department of Computer Science %R 86-9 %K AT08 AI11 T01 %A M. Balaban %T The Generalized-Concept Approach to Knowledge Representation: A Frame Like Interface to Logic %I State University of New York at Albany, Department of Computer Science %R 86-12 %K Generalized-Concept Model AI10 AI16 AA25 %X see Tech Report 86-13 for extended version of the same paper %A M. Balaban %A N. V. Murray %T A First Order Calculus for Temporal Knowledge %I State University of New York at Albany, Department of Computer Science %R 86-26 %K AI10 AI16 %A M. Balaban %T The Generalized-Concept (G-C) Formalism- An Object Oriented, Logic Framework for Knowledge Representation in AI %I State University of New York at Albany, Department of Computer Science %R 86-27 %K AI10 AI16 %A A. Ginsberg %A S. M. Weiss %A P. Politakis %T Automatic Knowledge Base Refinement for Classification Systems %I Rutgers University %R CBM-TR-148 %K SEEK SEEK2 AI03 AI01 %X system to refine knowledge bases automatically %A C. V. Apte %A S. M. Weiss %T An Expert Systems Methodology for Control and Interpretation of Applications Software %I Rutgers University %R CBM-TR-149 %K AA03 AI01 AA15 %X System for the Control and Interpretation of interactive software systems %A A. Van der Mude %T Some Formal Properties of Version Spaces %I Rutgers University %R DCS-TR-201 %K AI04 AI16 Inductive Inference %X Version Spaces are a method for learning a general model which describes some input data, by keeping track of a number of equally likely alternative models (versions) consistent with the data, while deleting unacceptable models and adding new versions as the need arises %A T. Imielinski %T Complexity of Query Processing in the Deductive Databases with Incomplete Information %I Rutgers University %R DCS-TR-206 %K AA09 AI10 %X The Query Processing problem on relation databases with intensions built from Linear Horn clauses, prefixes of the type all, some, all and conjunctive queries. Two properties are described which determine the decidability of query processes. A query is given which has exponential lower bound. %A T. Imielinski %T Domain Abstraction and Limited Reasoning %I Rutgers University %R DCS-TR-207 %K O04 AI10 AI11 %X Approximate reasoning methods for first order logic %A R. M. Keller %T The Role of Explicit Contextual Knowledge in Learning Concepts to Improve Performance %I Rutgers University %R ML-TR-7 %K AI03 AI01 %$ 15.00 %X Difficulties in using concept learning methods to improve an existing systems performance. %A W. Ludwell Harrison %T Compiling Lisp for Evaluation on a Tightly Coupled Multiprocessor %R CSRD Report No. 565 %I Center for Supercomputing Research and Development, University of Illinois %D MAR 1986 %K T01 H03 %X 281 pages %A Santosh Abraham %A J. Patel %T Parallel Garbage Collection on a Virtual Memory System %I Center for Supercomputing Research and Development, University of Illinois %R 620 %D AUG 1987 %K T01 H03 %X to appear in 1987 International Conference on Parallel Processing %A W. Marek %A M. Truszyczynski %T Incompleteness of Information in Rule-Based Systems: The Role of Minimal Sets %R 87-87 %I Department of Computer Science, University of Kentucky %K AI01 AI16 %A W. Marek %T A Natural Semantics for Modal Logic Over Databases %R 88-87 %I Department of Computer Science, University of Kentucky %K AA09 AI10 %A Tom Altman %A Suresh Easwar %T Rotation-Invariant Enclodings for Linear-Time Shape Matching Algorithms %R 89-87 %I Department of Computer Science, University of Kentucky %K AI06 O06 %A W. Marek %A M. Truszyczynski %T Forcing Autoepistemic Statements %R 90-87 %I Department of Computer Science, University of Kentucky %K AI16 %A Robert Cartwright %T Types as Intervals %R TR84-5 %I Department of Computer Science, Rice University %D NOV 1984 %$ 2.50 %K AI16 AI15 %X To accommodate polymorphic data types and operations, several computer scientists - most notably MacQueen, Plotkin, and Sethi -- have proposed formalizing types as ideas. Although this approach is intuitively appealing, the resulting type system is both complex and restrictive because the type constructor that creates function types in [sic] not monotonic, and hence not computable. As a result, types cannot be treated as data values, precluding the formalization of type constructors and polymorphic program modules (where types are values) as higher order computable functions. Moreover, recursive definitions of new types do not necessarily have solutions. .sp sp This paper proposes a new formulation of types -- called intervals-- that subsumes the theory of types as ideals, yet avoids the pathologies caused by non-monotonic type constructors. In particular, the set of interval types contains the set of ideal types as a proper subset and all the primitive type operations on intervals are extensions of the corresponding operations on ideas. Nevertheless, all of the primitive interval type constructors including the function type constructor and type quantifiers are computable operations. Consequently, types are higher order data values that can be freely manipulated within programs. %A Robert Hood %T Efficient Applicative Operations on Recursive Data Structures %R TR 85-515 %I Department of Computer Science, Rice University %D FEB 1985 %K T01 %$ 1.20 %X Gives O(1) time and space functions in Pure Lisp for a given set of operations to manipulate recursive data structures such as LISP's S expressions including array-like selection. %A Hans Boehm %A Alan Demers %A James Donahue %T A Programmers' Introduction t0o Russel %R TR 85-16 %I Department of Computer Science, Rice University %D MAR 1985 %$ 1.95 %X Russell is a programming language based on the view that a data type is simply a collection of operations which can itself be manipulated. This permits compile-type checking with the flexibilities of languages supporting dynamic typing. %A William G. Golson %T A Complete Proof System for an Acceptance Refusal Model of CSP %R TR 85-19 %D APR 1985 %I Department of Computer Science, Rice University %K AA09 Concurrent Sequential Processes Hoare %$ 2.25 %A Paul Besl %A Ramesh Jain %T An Overview of Three-Dimensional Object Recognition %R RSD-TR-19-84 %I Robot Systems Division, University of Michigan %K AI06 %$ 4.50 %A Paul Besl %A Ramesh Jain %T Surface Characterization for Three-Dimensional Object Recognition in Depth Maps %R RSD-TR-20-84 %I Robot Systems Division, University of Michigan %K AI06 %$ 5.00 %A I. K. Sethi %A Ramesh Jain %T Finding Trajectories of Point in Monocular Image Sequence %R RSD-TR-3-85 %I Robot Systems Division, University of Michigan %K AI06 %$ 2.50 %X finding the same physical point in more than one dimension, formulated as an optimization problem for the case of several nonrigid objects in a scene. %A Richard A. Volz %A Tony C. Woo %A Jan D. Wolter %T Optimal Algorithms for Symmetry Detection in Two and Three Dimensions %I Robot System Division, University of Michigan %R RSD-TR-5-85 %K O06 %$ 2.50 %X Algorithms for finding rotational and involutional symmetries in point sets, polygons nad polyhedrons. Time is O(n) for polygons and O(nlogn) for two and three-dimensional point sets. Polyhedra with planar connected surface graphs can be done in O(n) time. %A Mubarak Shah %A Arun Sood %A Ramesh Jain %T Pulse and Staircase Models for Detecting Edges at Multiple Resolution %I Robot Systems Division, University of Michigan %R RSD-TR-7-85 %K AI06 %$ 2.50 %A P. S. Bhugra %A T. N. Mudge %T Comparisons Between Ada and Lisp %I Robot Systems Division, University of Michigan %R RSD-TR-9-85 %K AI06 %$ 2.00 %A T. F. Knoll %A R. C. Jain %T Recognizing Partially Visible Objects Using Feature Indexed Hypotheses %I Robot Systems Division, University of Michigan %R RSD-Tr-10-85 %K AI06 %$ 2.50 %A S. M. Hyanes %A Ramesh Jain %T Event Detection and Correspondence %I Robot Systems Division, University of Michigan %R RSD-Tr-12-85 %K AI06 %$ 2.00 %X Detection of changes in uniformly accelerated motion of objects from pictures of their movement %A Paul Besl %A Kurt Skifstad %A Ramesh Jain %T Objective Dimensionality Reduction Using Out-of-Class Covariance %I Robot Systems Division, University of Michigan %R RSD-TR-17-85 %K O06 AI06 O04 %$ 3.00 %X Non-hierarchical statistical decision algorithms spend a significant portion of their time entertaining incorrect hypotheses in multiple class, pattern recognition problems. Maximum-likelihood multivariatie-Gaussian (MLMVG) hypotheses testing is a common example of such a statistical pattern rognition technique. It is shown that the use of out of class covariance matrices can significantly reduce the run-time computations required to make MLMVG decisions. The Analysis directly leads to an objective dimensionality reduction (ODR) technique that indicate the preferred, intrinsic dimensionality omultiple class decision spaces given the training data. Run-time computatio/ns are reduced even further using these reduced dimension class decision spaces with dimensionality reduction technique to stress the essential concepts of out-of-class covariance. The theory has been applied to a nine(9) class, twenty-seven (27) feature, automatic visual solder joint inspection problem with excellent results; run-time computations are reduced by more than a factor of three while maintaining excellent design performance. %A Shih-Ping Liou %A Ramesh C. Jain %T Detecting Road Edges Using Hypothesized Vanishing Points %R RSD-TR-18-85 %I Robot Systems Division, University of Michigan %K AI06 AA19 %$ 2.50 %A Suk In Yoo %T A Methodology For Solving Problems in Artificial Intelligence %R RSD-TR-20-85 %I Robot Systems Division, University of Michigan %K AI03 A* heuristic function traveling salesman robot planning consistent labelling theorem proving %$ 11.50 %A Ramesh Jain %A Sandra L. Bartlett %A Nancy O'Brien %T Motion Stereo Using Ego-Motion Complex Logarithmic Mapping %I Robot Systems Division, University of Michigan %R RSD-TR-3-86 %K AI06 %$ 2.50 %X Obtaining and using stereo information from a moving camera %A Charles J. Conrad %A N. Harris McClamroch %T The Drilling Problem: A Stochastic Modeling and Control Example in Manufacturing %I Robot Systems Division, University of Michigan %R RSD-TR-4-86 %K AA26 %$ 2.50 %A Paul Besl %A Ramesh Jain %T Segmentation Through Symbolic Surface Descriptions %I Robot Systems Division, University of Michigan %R RSD-TR-5-86 %K AI06 %$ 3.00 %A Pual Joseph Besl %T Surfaces in Early Range Image Understanding %I Robot Systems Division, University of Michigan %R RSD-TR-10-86 %K AI06 %$ 18.00 %A Rajeev Agrawal %A Ramesh Jain %T An Overview of Tactile Sensing %I Robot Systems Division, University of Michigan %R RSD-TR-11-86 %K AI06 AI07 %$ 2.50 %A Jerry Lee Turney %T Recognition of Partially Occluded Parts %I Robot Systems Division, University of Michigan %R RSD-TR-16-86 %K AI06 AI07 AA26 %$ 7.00 %T Behavior of Edges in Scale Space %I Robot Systems Division, University of Michigan %R RSD-2-87 %K AI06 %A Daniel Pual Miranker %T TREAT: A New and Efficient Match Algorithm for AI Production Systems %I University of Texas at Austin, Department of Computer Sciences %R TR-87-03 %K AI01 H03 O06 %X The algorithm which was designed specifically for the DADO parallel machine in fact is more efficient on sequential machines as well. %A Allan Collins %A Ryszard Michalski %T The Logic of Plausible Reasoning: A Core Theory %I Department of Computer Science, University of Illinois at Urbana- Champaign %R NO. 951 %D FEB 1986 %A John A. Bentrup %A Gary J. Mehler %A Joel D. Riedesel %T INDUCE 4: A Program for Incrementally Learning Structural Descriptions from Examples %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 958 %D FEB 1987 %K AI04 %A Peter Haddawy %T A Variable Precision Logic Inference System Employing the Dempster-Shafer Uncertainty Calculus %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 959 %D DEC 1986 %K O04 Construction Project Cost Estimation %A R. S. Michalski %A A. B. Baskin %A C. Uhrik %A T. Channik %T The ADVISE.1 Meta-Expert System: The General Design and a Technical Description %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 962 %D JAN 1987 %K AI01 %A Kaihu Chen %T The Inductive Acquisition of Temporal Knowledge %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 964 %D DEC 1986 %K AI04 O03 %A Ryszard S. Michalski %T Two-Tiered Concept Meaning, Inferential Matching and Conceptual Cohesiveness %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 968 %D JUN 1986 %K AI04 %A Kenneth D. Forbus %T The Qualitative Process Engine %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1288 %D DEC 1986 %K AT15 qualitative physics %A Kenneth D. Forbus %T The Logic of Occurrence %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1300 %D DEC 1986 %K Zeno's paradox pruning %A Mitchell D. Lubas %T A Knowledge-Based Design aid for the Construction of Software Systems %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1304 %D NOV 1986 %K AA08 %A Larry Rendell %A Powell Benedict %A Howard Cho %T Concept Acquisition from Examples: Measurement of System Performance and Suggestions for Improved Design %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1315 %D JAN 1987 %K AI04 %A Dedre Gentner %T Evidence for A Structure-Mapping Theory of Analogy and Metaphor %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1316 %D DEC 1986 %K AI02 %A Larry Rendell %T Conceptual Knowledge Acquisition in Search %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1317 %D JAN 1987 %K AI03 AI04 %A Larry Rendell %A Raj Seshu %A david Tcheng %I Department of Computer Science, University of Illinois at Urbana- Champaign %T Robust Concept Learning Using Dynamically-Variable Bias %R 1318 %D MAR 1987 %K AI04 %A Larry Rendell %T Layered Concept Learning and Its Advantages %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1320 %D MAR 1987 %K AI04 %A L. V. Kale %T "Completeness" and "Full Parallelism" of Parallel Logic Programming Schemes %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1321 %D FEB 1987 %K H03 AI10 %A Larry Rendell %T Representations and Models for Concept Learning %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1324 %D MAR 1987 %K AI04 %T ANTITHESIS: A STUDY IN CLAUSE COMBINING AND DISCOURSE STRUCTURE %A William C. Mann %A Sandra A. Thompson %R ISI/RS-87-171 %D April 1987 %I USC/Information Sciences Institute %X approx. 30 pages .sp sp AI research in text generation needs a strong linguistically justified descriptive theory as a basis for creating methods by which programs can write multiparagraph texts. This paper sketches Rhetorical Structure Theory, which has been designed to support text generation, and then applies RST to describing a particular class of discourse constructs. .sp sp There is no consensus as to the status of clause combining relations relative to larger texts. This paper demonstrates a clause combining relation that is also found as part of larger text structures, and shows how this fact can be used to explain cases in which contrastive clause combining appears between clauses that are not in fact in contrast. The appropriate generalization is that the relations of clause combining and the relations of general text structure are the same. Use of this generalization should make AI text planning and text generation significantly easier. %T NOTES ON THE ORGANIZATION OF THE ENVIRONMENT OF A TEXT GENERATION GRAMMAR %A Christian Matthiessen %R ISI/RS-87-177 %D April 1987 %I USC/Information Sciences Institute %K AI02 %X approx. 52 pages .sp 1 sp 1 One of the tasks in designing a text generation system is to organize the environment of the grammatical component of the generation system in such a way that it supports the grammatical resources in generation. This report discusses the methods used for the Penman generation system to infer aspects of the organization of the knowledge base and other components of the environments of the Nigel grammar of the Penman system. It is shown how the design task can be broken down into a number of very explicit demands on the environment. In the main part of the report, the results of application of such an approach is sketched, with particular emphasis on the general organization of the knowledge base and the discourse model parts of the environment. %T Systemic Grammar and Functional Unification Grammar and Representational Issues In Systemic Functional Grammar %A Christian Matthiessen %A Robert Kasper %R ISI/RS-87-179 %D April 1987 %I USC/Information Sciences Institute %X approx. 55 pages .sp sp SYSTEMIC GRAMMAR AND FUNCTIONAL UNIFICATION GRAMMAR: Systemic Functional Grammar (SFG) and Functional Unification Grammar (FUG) are superficially very different approaches to grammatical knowledge, but they share an underlying comparability that runs very deep. FUG shares with systemic descriptions an emphasis on the functions of linguistic objects, and an explicit representation of feature choices. This paper explores how a systemic grammar can be represented in FUG notation, as a step toward creating a grammatical analysis program for English. Because FUG has been developed as a computational tool, expressing a systemic grammar in FUG notation allows new computational techniques to be applied to it. Among other benefits, this program will make it possible to study how much the grammatical functions of sentences are recoverable from them. It will also provide a method to test the amount of ambiguity implicit in a systemic description, a topic which has so far been inaccessible. This use of FUG as an alternate representation for SFG may have some additional benefits for both frameworks. It provides some solutions to problems in systemic notation which are described by Matthiessen (in this volume). Several extensions to the FUG framework are also suggested by this study. .sp sp REPRESENTATIONAL ISSUES IN SYSTEMIC FUNCTIONAL GRAMMAR: Nigel is a large diverse computational grammar for text generation. Its framework is an implementation of Systemic Functional Theory of grammar and it constitutes a context in which the representation of systemic theory can be explored and studied. .sp sp This paper surveys the representational devices used in the Nigel grammar and the representational issues that they raise in relation to systemic theory. These issues are diagnosed in the light of the metafunctional differentiation of systemic theory. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun May 31 03:18:26 1987 Date: Sun, 31 May 87 03:18:07 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #132 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sun, 31 May 87 03:09 EDT Received: from relay.cs.net by RELAY.CS.NET id aa03652; 30 May 87 4:06 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa13658; 30 May 87 4:04 EDT Date: Fri 29 May 1987 21:13-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #132 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Saturday, 30 May 1987 Volume 5 : Issue 132 Today's Topics: Bibliography - Leff ai.bib51C ---------------------------------------------------------------------- Date: Wed, 27 May 1987 12:15 CST From: Leff (Southern Methodist University) Subject: defs for ai.bib51C D MAG105 Computer Vision, Graphics and Image Processing\ %V 36\ %N 2-3\ %D NOV-DEC 1986 D MAG106 Pattern Recognition\ %V 19\ %N 6\ %D 1986 D BOOK62 Annual Review of Computer Science\ %I Annual Reviews Inc\ %C Palo Alto, CA\ %D 1986 D BOOK63 Proceedings of the Sixth International Conference on Robot Vision and S ensory Controls\ %I IFS Publications Limited\ %C Kempston D BOOK64 Automata, Languages and Programming (Rennes 1986)\ %V 226\ %S Lecture Notes in Computer Science\ %I Springer-Verlag\ %C Berlin-Heidelberg-New York\ %D 1986 D MAG107 Cybernetics\ %V 22\ %N 3\ %D MAY-JUN 1986 D MAG108 Computer Vision, Graphics and Image Processing\ %V 37\ %N 2\ %D FEB 1987 D MAG109 Computer Vision, Graphics and Image Processing\ %V 37\ %N 3\ %D MAR 1987 D MAG110 Journal of Parallel and Distributed Computing\ %V 4\ %N 1\ %D FEB 1987 D BOOK65 Proceedings of the IEEE Computer Society - 1986 International\ Conference on Computer Languages (Miami Florida, October 27-30 1986)\ %I IEEE Computer Society\ %D 1986\ %C Washington D. C. D MAG112 Pattern Recognition Letters\ %V 12\ %N 1\ %D JAN 1987 D MAG114 Computer Vision, Graphics and Image Processing\ %V 38\ %N 1\ %D APR 1987 ------------------------------ Date: Wed, 27 May 1987 12:15 CST From: Leff (Southern Methodist University) Subject: ai.bib51C %A D. M. C. Francesetti %T Expert Systems and DSS for Strategic Planning %B Managing Advanced Manufacturing Technology %E A. Voss %I IFS Publications Limited %D 1986 %P 319-326 %K AA26 %A T. Chart %T Human Versus Machine - A Comparison of a Computer Expert System with Human Experts in the Diagnosis of Vaginal Discharge %J International Journal of Bio-Medical Computing %V 20 %N 1-2 %D JAN 1987 %P 71-78 %K AA01 AI01 %A A. Bouckaert %T Medical Diagnosis - Are Expert Systems Needed %J International Journal of Bio-Medical Computing %V 20 %N 1-2 %D JAN 1987 %P 123-134 %K AA01 AI01 %A H. W. Glaser %A P. Thompson %T Lazy Garbage Collection %J Software Practice and Experience %P 1-4 %V 17 %N 1 %D JAN 1987 %K T01 %A R. Ballard %T Prospects for Expert Systems in Quality Management %J CME The Chartered Mechanical Engineer %V 34 %N 1 %P 16-18 %K AI01 AA05 %A S. Tan %A D. Juvin %B BOOK63 %P 49-60 %K AA26 AI06 %A W. J. Bogers %T Circular Array Sensor, Control Algorithm and Hardware for Fast Tracking of Planar Contours %B BOOK63 %P 69-80 %K AA26 AI06 AI07 %A G. W. Davis %T Classifying and Coping with Lighting Variation %B BOOK63 %P 89-90 %K AA26 AI06 %A G. Nicolas %A J. P. Hermann %T Inspection of Moulds by 3-Dimensional Vision %B BOOK63 %P 99-106 %K AA26 AI06 %A A. R. Desaintvincent %T 3-Dimensional Perceptory Systems for Autonomous Mobile Robots %B BOOK63 %P 127-138 %K AA19 AI07 AI06 %A M. Guichard %A A. Renault %T Industrial Use of Ultrasonic Ranging Sensors in Robotics %B BOOK63 %P 157-164 %K AI06 AI07 %A S. R. Ruocoo %T The Design of a 3D Vision Sensor for Robot Multisensory Feedback %B BOOK63 %P 187-196 %K AI06 AI07 %A A. Michel %T The Quantification of Qualitative Aspects - A Problem of Perception and Communication %B BOOK63 %P 209-216 %K AI08 AI16 AI06 %A Y. Li %A L. Wu %A D. H. Chen %T A Study on Direct Vision Sensor for Welding Visual Sensing %B BOOK63 %P 245-248 %K AI06 AA26 %A B. S. Barclay %T Sensing Techniques Applied to Electronics Assembly %B BOOK63 %P 249-266 %K AA26 AI06 AI07 %A J. C. Perez %T Holography and Image Analysis to Test IBM Modules Airproofness %B BOOK63 %P 267 %K AA26 AA04 AI06 %A Michael J. Hudak %A Daniel H. Marcellus %T Demon-Based Associative Memories %J Cybernetics and Systems %V 17 %N 4 %D 1986 %P 249-276 %A Amedeo Capelli %A Gianni Caracoglia %A Lorenzo Moretti %T Chunking Mechanism for a Knowledge Representation System %J Cybernetics and Systems %V 17 %N 4 %D 1986 %P 277-288 %K AI16 %A Germano Rosconi %T Applications of GSLT (General System Logical Theory) to Control in Transformation Systems %J Cybernetics and Systems %V 17 %N 4 %D 1986 %P 289 %K AI16 AI10 %A L. Wood %T Out of the Ivory Tower - The Major AI Software Developers Are Leaving the Lab and Attending to the Real World Demands of Corporate MIS %J Computer Decisions %V 19 %N 2 %D JAN 26, 1987 %K AI16 AA06 %A B. H. Rudall %T Contemporary Cybernetics (Automation; Behavioural Systems; Business Cybernetics; Innovations in Cybernetics; Legged Locomotion Study; Machine Intelligence; Machine Vision; Medical Cybernetics; Software Developments) %J Kybernetes %V 16 %N 1 %D 1987 %P 1-10 %K AI16 AT08 %A Guy Jumarie %T New Decision Rules in Statistical Pattern Recognition %J Kybernetes %V 16 %N 1 %D 1987 %K AI06 O04 %A E. Andreewsky %A V. Rosenthal %A D. Bourcier %T Preliminary Phase of Language Comprehension: Outline of a Systems Model %J Kybernetes %V 16 %N 1 %D 1987 %P 27-32 %K AI02 %A Khaled M. Bugrara %A Cynthia A. Brown %T On the Average Case Analysis of Some Satisfiability Model Problems %J Inform. Sci %V 40 %D 1986 %N 1 %P 21-37 %K AI03 %A Mao Kang Wu %T The Problem of No Relationship Between PI-Clash and the Order of Electrons in Mechanical Theorem Proving %J Shanghai Keji Daxue Xuebao %V 1986 %N 1 %P 99-106 %K AI11 %X Chinese with English summary %A V. V. Zadorozhnyi %T A Method for Synthesis of a Correct Pattern Recognition Algorithm for a Given Control Sample %J Zh. Vychisl. Mat. i. Mat. Fiz %V 26 %N 10 %P 1559-1566 %K O06 AI06 %X in Russian %A Sudarshan K. Dhall %A S. Lakshmivarahan %T Effect of Data Organization in A System of Interleaved Memories on the Performance of Parallel Search %J Inform. Sci %V 39 %D 1986 %N 3 %P 219-246 %K H03 AI03 %A Hoang Klem %A Pham Ngoc Khoi %T Some Aspects of Image Coding Based on Run Length Codes and Chain Codes %J Elektron. Informationsverarb. Kybernet. %V 22 %D 1986 %N 7-8 %P 411-421 %K O06 AI06 %A G. Gottlob %T Subsumption and Implication %J Information Processing Letters %V 24 %N 2 %D JAN 30, 1987 %P 109-112 %K AI11 %A B. Ackland %T Flute - An Expert Floorplanner for Full Custom VLSI Design %J IEEE Design and Test %V 4 %N 1 %D FEB 1987 %P 32-41 %K AA04 AI01 %A A. Kusiak %T Artificial Intelligence and Operations Research in Flexible Manufacturing Systems %J Infor %V 25 %N 1 %D FEB 1987 %P 2-12 %K AA26 %A Jia-Huai You %A P. A. Subrahmanyam %T E-Unification Algorithms for a Class of Confluent Term Rewriting Systems %B BOOK64 %P 454-463 %K AI11 %A Wen Jun Wu %T A Mechanization Method of Geometry. I Elementary Geometry %J Chinese Quart. J. Math %V 1 %D 1986 %N 1 %P 1-14 %K AA13 AI11 %A S. G. Vorob'ev %T Applications of Conditional Systems of Permutations of Terms in Program Verification %J Programmirovanie %V 1986 %N 4 %P 3-14 %D 1986 %K AI11 AA08 %X in Russian %A G. von Trzebiatowski %A B. Bank %T On the Convergence of the Fuzzy Clustering Algorithm "Fuzzy Isodata" %J Z. Agew. Math. Mech %V 66 %D 1986 %N 6 %P 201-208 %K O04 O06 %A Egidijus Ostasevicius %T Recognition of Random Processes Described by a Mixture of Normal Distributions %J Statist. Problemy Upravieniya No. 71 %D 1985 %P 9-18 %K O06 AA12 %A Heikki Mannila %A Esko Ukkonen %T The Set Union Problem with Backtracking %B BOOK64 %P 236-246 %K AI03 %A Neil V. Murray %T On Deleting Links in Semantic Graphs %B BOOK64 %P 404-415 %K AI16 %A Sarit Kraus %A Daniel J. Lehmann %T Knowledge, Belief and Time %B BOOK64 %P 186-195 %K AI16 %A Giorgio Levi %T Logic Programming: The foundations, the Approach and the Role of Concurrency %B Current Trends in Concurrency (Noordwijkerhout, 1985) %I Lecture Notes in Computer Science %V 224 %I Springer-Berlin-New York %P 396-441 %D 1986 %K AI11 H03 AA08 %A Mikulas Hermann %A Igor Privara %T On Nontermination of of Knuth-Bendix Algorithm %B BOOK64 %P 146-156 %K AI14 AI11 %A L. Fribourg %T A Strong Restriction of the Inductive Completion Procedure %B BOOK64 %P 105-115 %K AI14 AI11 %A Antonio Di Nola %A Witold Pedrycz %A Salvatore Sessa %T Coping with Uncertainty for Knowledge Acquisition and Inference %J Kybernetes %V 15 %D 1986 %N 4 %P 243-249 %K AI16 O04 %A Hirofumi Yokouchi %T Retraction Map Categories and Their Applications to the Construction of Lambda Calculus Models %J Inform. and Control %V 71 %D 1986 %N 1-2 %P 33-86 %K T01 %A Colin Stirling %T A Compositional Reformulation of Owicki-Grie's Partial Correctness Logic for a Concurrent While Language %B BOOK64 %P 407-415 %K AA08 %A A. Pnueli %T Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends %B BOOK64 %P 510-584 %K AA08 AI16 AI11 %A Ernst-Rudiger Olderog %T Process Theory: Semantics, Specification and Verification %B Current Trends in Concurrency (Noordwijkerhout, 1985) %I Lecture Notes in Computer Science %V 224 %I Springer-Berlin-New York %P 442-509 %D 1986 %K AA08 %A Ketan Mulmuley %T Fully Abstract Submodels of Typed Lambda Calculi. Twenty-Fifth Annual Symposium on Foundations of Computer Science (Singer Island, Fla.) %J J. Comput. System Sci. %V 33 %D 1986 %N 1 %P 3-46 %K AA08 T01 %A Jozef Hooman %A Wiullem P. De Roever %T The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP %B Current Trends in Concurrency (Noordwijkerhout, 1985) %I Lecture Notes in Computer Science %V 224 %I Springer-Berlin-New York %P 343-395 %D 1986 %A M. Coppo %A M. Dezani-Ciancaglini %A M. Zacchi %T Type Theories, Normal Forms, and $D sub inf$ Lambda models %J Information and Computation %V 72 %N 2 %D FEB 1987 %P 85-116 %K AA08 %A C. D. Hurt %T Conceptual Citation Differences in Science, Technology and Social Sciences Literature %J Information Processing and Management %V 23 %N 1 %D 1987 %P 1-6 %K AA14 %A Jorge Moser %A Richard Christoph %T Management Expert Systems (M. E. S.): A Framework for Development and Implementation %J Information Processing and Management %V 23 %N 1 %D 1987 %K AA06 AI01 %A Marcia J. Bates %T Interaction in Information Systems: A Review of Research from Document Retrieval to Knowledge Based Systems by N. J. Belkin and A. Vickery %J Information Processing and Management %V 23 %N 1 %D 1987 %K AT07 AA14 %A D. H. Freedman %T AI Meets Corporate Mainframe %J Infosystems %V 34 %N 2 %D FEB 1987 %P 32-37 %K AA06 %A S. A. Kurtz %A M. J. O'Donnell %A J. S. Royer %T How to Prove Representation-Independent Independence Results %J Information Processing Letters %V 24 %N 1 %D JAN 15, 1987 %P 5-10 %K AI16 %A R. S. Bird %A J. Hughes %T An Alpha Beta Algorithm: An Exercise in Program Transformation %J Information Processing Letters %V 24 %N 1 %D JAN 15, 1987 %P 53-58 %K AA08 AI03 %A Yaser S. Abu-Mostafa %A Demetri Psaltis %T Optical Neural Computers %J Scientific American %V 256 %N 3 %D MAR 1987 %K AI06 AI12 %A Yu. N. Zhuravlev %A I. V. Sergienko %A V. I. Artemenko %A A. M. Chernyakova %T The Use of Classification Theory for Automated Selection of Algorithms in Program Packages %J MAG107 %P 270-278 %K AA08 %A N. I. Galagan %A Z. L. Rabinovich %T Intelligent Problem Solvers %J MAG107 %P 279-289 %K AI16 %A I - A. A. Voronkov %A A. I. Degtyarev %T Automatic Theorem Proving %J MAG107 %P 290-297 %K AI11 %A A. I. Degtyarev %A A. A. Voronkov %T Equality Control Methods in Machine Theorem Proving %J MAG107 %P 298-307 %K AI11 %A R. G. Bukharaev %A D. Sh. Suleimanov %T Development of Computer-Assisted Instruction Systems with Intelligent Capabilities %J MAG107 %P 308-317 %K AA07 %A V. I. Vasil'ev %A F. P. Ovsyannikova %T Learning Pattern Recognition with Prespecified Confidence %J MAG107 %P 318-326 %K AA06 %A A. S. Dolgopolov %T Automatic Spelling Correction %J MAG107 %P 332-339 %K AA15 %A V. M. Bondarovskaya %A L. A. Bogush %A I. Yu Kirichenko %T Development of Action-Planning Systems on the Basis of Psychological Studies of the Process of Solving Situation Transformation Problems %J MAG107 %P 391-398 %K AI08 AI09 AA11 %A G. M. Zarakovskii %A S. L. Rysakova %A P. S. Turzin %T Psychophysiological Optimization of the Set of Signs for Man-Machine Communication %J MAG107 %P 399 %K AI08 AA11 AA15 %A J. H. M.ter Brake %T The AI Development Environment POPLLOG %B Proceedings of Expert Systems: Available Hard- and Software %C Mol. Belgium %D 18-19 JUL 1986 %K T01 T02 T03 %X describes POPLOG which is an integrated combination of POP-11, PROLOG and Common LISP and Expert System development tools. %A J. H. Arbeter %T A Multi-Dimensional Video Imaging Processing Architecture %B Proc. SPI Int. Soc. Opt. Eng. (USA) %V 564 %P 81-86 %D 1985 %K AI06 %X This system is designed for the interpretation of TV systems in real-time. %A R. F. Bessler %T A Video Real-Time Pyramid Processor %B Proc. SPI Int. Soc. Opt. Eng. (USA) %V 564 %P 81-86 %D 1985 %K AI06 H03 %X This system simulates the human visual system and interpretes NTSC video at 30 frames per second. %A G. Y. Tang %T Expert System Makes Image Processing Easier %B Proc. SPIE Int. Soc. Opt. Engineering %V 635 %P 119-123 %K AI06 AI01 %X This system assists a user of image processing software. %A K. H. Feng %A K. Sugihara %A N. Sugie %T A Method for Extracting Three-Dimensional Information Using Cone-Shaped Beams of Light %J Syst. & Comput. Jpn. (USA) %V 17 %N 8 %P 70-9 %K AI06 %X Texture information is generated from a scene by using several point sources of light at different location. %A D. E. Guyer %A G. E. Miles %A M. M. Schreiber %A O. R. Mitchell %A V. C. Vanderbilt %T Machine Vision and Image Processing for Plant Identification %J Transactions of the ASAE %V 29 %N 6 %D NOV-DEC 1986 %P 1500-1507 %K AI06 AA23 %A A. Fanni %A A. Mura %T Artificial Intelligence and Expert Systems - Developments in the Electrotechnical and Electronic Fields %J L'Elettrotecnica %V 73 %N 12 %D DEC 1986 %K AA04 AI01 %X in Italian %A J. L. A. Van de Snepscheut %T "Algorithms for on-the-fly garbage collection" revisited %J Information Processing Letters %V 24 %N 4 %D MAR 2, 1987 %K T01 %A M. W. Kurzynski %T Diagnosis of Acute Abdominal Pain Using a Three-Stage Classifier %J Computers in Biology and Medicine %V 17 %N 1 %D 1987 %K AI01 AA01 %P 19-28 %A Patrick Cavanagh %T Reconstructing the Third Dimension: Interactions Between Color, Texture, Motion, Binocular Disparity and Shape %J MAG108 %K AI06 %P 171-195 %A Steven W. Zucker %A Lee Iverson %T From Orientation Selection to Optical Flow %J MAG108 %K AI06 %P 196-220 %A Julian Hochberg %T Machines Should Not See as People Do, but Must Know How People See %J MAG108 %K AI06 AI08 %P 221-237 %A Kent A. Stevens %A Allen Brookes %T Detecting Structure by Symbolic Constructions on Tokens %J MAG108 %K AI06 %P 238-260 %A Deborah Walters %T Selection of Image Primitives for General-Purpose Visual Processing %J MAG108 %K AI06 %P 261-298 %A Jacob Beck %A Anne Sutter %A Richard Ivry %T Spatial Frequency Channels and Perceptual Grouping in Texture Segregation %J MAG108 %P 299-330 %K AI06 %A Bean-Arie Jezekiel %A A. Zvi Meiri %T 3D Objects Recognition by Optimal Matching Search of Multinary Relations Graphs %J MAG109 %P 331-344 %K AI06 %A Michael Kass %A Andrew Witkin %T Analyzing Oriented Patterns %J MAG109 %P 362-385 %K AI06 %A Lawrence O'Gorman %A Arthur C. Sanderson %T A Comparison of Methods and Computation for Multi-Resolution Low-and-Band- Pass Transforms for Image Processing %J MAG109 %P 386-401 %K AI06 %A L. Brevdo %A S. Sideman %A R. Beyar %T A Simple Approach to the Problem of 3-d Reconstruction %J MAG109 %P 420-427 %K AI06 %A F. Golferini %A P. Facchin %T Computer Diagnosis of Primary Headaches in Children %J MAG109 %P 55-63 %K AI01 AA01 %A Gerhard X. Ritter %A Paul D. Gader %T Image Algebra Techniques for Parallel Image Processing %J MAG110 %P 7-44 %K AI06 H03 %A Eric B. Hinkle %A Jorge L. C. Sanz %A Anil K. Jain %A Dragutin Petkovit %T $P sup 3 E$: New Life for Projection-Based Image Processing %J MAG110 %P 45-78 %K AI06 H03 %A T. N. Mudge %A T. S. Abdel-Rahman %T Vision Algorithms for Hypercube Machines %J MAG110 %P 79-94 %K AI06 H03 %A Quentin F. Stout %T Supporting Divide-and-Conquer Algorithms for Image Processing %J MAG110 %P 95 %K AI06 H03 O06 %A Charles J. Malmborg %A Marvin H. Agee %A Gene R. Simons %A J. V. Choudry %T Articial Intelligence Series, Part 4: A Prototype Expert System for Industrial Truck Type Selection %J Industrial Engineering %V 19 %N 3 %D MAR 1987 %K AA05 AI01 %A S. K. Debray %T Towards Banishing the Cut from Prolog %B BOOK65 %P 2-12 %K T02 %A S. S. Epstein %T A Logic Programming Language with Descriptions %B BOOK65 %P 13-23 %K AI10 %A H. H. Chen %A I. P. Lin %A C. P. Wu %T LOGFOL- A Prolog-Based Frame-Oriented Language %B BOOK65 %P 24-33 %K T02 %A B. Jayaraman %A F. S. K. Silbermann %A G. Gupta %T Equational Programming - A Unifying Approach to Functional and Logic Programming %B BOOK65 %P 47-61 %K AI10 AI11 %A T. Murata %A D. Zhang %T A High-Level Petri Net Model for Parallel Interpretation of Logic Programs %B BOOK65 %P 123-135 %K H03 AI10 %A F. Y. Zhu %A S. D. Bedrosian %T Monochrome Images: An Approach to Choosing Fuzzy Distributions %J Journal of the Franklin Institute %V 322 %N 5-6 %D NOV-DEC 1986 %P 103-112 %K AI06 O04 %A Markus Lusti %T Knowledge Based Systems in Education - An Example From Financial Analysis %J Angewandte Informatik %N 1 %D JAN 1987 %P 12-19 %K AA07 AA06 %A N. Nansalmaa %T Application of the Rule of Inference in Informal Mathematical Proofs %J Cybernetics %V 22 %N 4 %D JUL-AUG 1986 %P 518-521 %K AA13 %A P. W. Woods %A C. J. Taylor %A D. H. Cooper %A R. N. Dixon %T The Use of Geometric and Grey-Level Models for Industrial Inspection %J MAG112 %P 11-18 %K AA05 AI06 %A F. Klein %A O. Kubler %T Euclidean Distance Transformations and Model-Guided Image Interpretation %J MAG112 %P 19-30 %K AI06 %A D. Cruse %A A. Wright %T The Use of Segmentation and Shape Recognition Techniques in Synthetic Aperture Radar Images %J MAG112 %P 41-48 %K AI06 AA18 %A H. Shvaytser %A S. Peleg %T Inversion of Picture Operators %J MAG112 %P 49-62 %K AI06 %A P. Grossmann %T Depth From Focus %J MAG112 %P 63-70 %K AI06 %A T. J. Fountain %A M. Postranecky %A G. K. Shaw %T The CLIP4S System %J MAG112 %P 71-80 %K AI06 %A H. H. S. Ip %A D. J. Potter %T Comparison of 2-D Gel Electrophoresis Images %J MAG112 %P 81-86 %K AA10 AI06 %A D. B. Sharman %A T. S. Durrani %T Goal Driven Parameter Evaluation for the Detection of Objects in SAR Data %J MAG112 %P 87 %K AI06 AA18 %A V. Lacroix %T Pixel Labeling in a Second Order Markov Mesh %J Signal Processing %V 12 %N 1 %D JAN 1987 %P 59-82 %K AI06 %A K. J. Kokjer %T The Information Capacity of the Human Fingertip %J IEEE Transactions on Systems, Man, and Cybernetics %V 17 %N 1 %D JAN-FEB 1987 %P 100-101 %K AA10 AI08 AI06 %A P. J. Werbos %T Building and Understanding Adaptive Systems: A Statistical/Numerical Approach to Factory Automation and Brain Research %J IEEE Transactions on Systems, Man, and Cybernetics %V 17 %N 1 %D JAN-FEB 1987 %P 7-20 %K AI08 AA05 %A G. Henrion %A R. Henrion %A H. J. Lunk %A V. Reidel %T Combination of Non-Supervised and Supervised Pattern Recognition Methods for Classification of Tungsten Materials %J Chemische Technik %V 38 %N 12 %D DEC 1986 %P 525-527 %K AA05 AI06 %X Article in German, Abstract in English and German %A D. I. Blockley %A J. F. Baldwin %T Uncertain Inference in Knowledge Based Systems %J Journal of Engineering Mechanics ASCE %V 113 %N 4 %D APR 1987 %P 467-481 %K AA05 O04 %A Zilla Sinuany-Stern %A Meir J. Rosenblatt %T Budgeting in Hierarchical Systems Under Uncertainty %J IIE Transactions %V 19 %N 1 %P 2-12 %D MAR 1987 %K AI13 O04 %A L. A. Marks %T Digital Enhancement of the Peripheral Admittance Plethysmogram %J IEEE Transactions on Biomedical Engineering %V 34 %N 3 %D MAR 1987 %P 192-198 %K AI06 AA01 %A R. S. Prasad %A T. M. Srinivasan %T An Image Processing Method for Cardiac Motion Analysis %J IEEE Transactions on Biomedical Engineering %V 34 %N 3 %D MAR 1987 %P 244-246 %K AA01 AI06 %A M. A. Bickel %T Automatic Correction to Misspelled Names - A Fourth Generation Language Approach %J Communications of the ACM %V 30 %N 3 %D MAR 1987 %P 224-228 %K AA15 %A Lowell Jacobson %A Harry Wechsler %T Derivation of Optical Flowing a Spatiotemporal-Frequency Approach %J MAG114 %P 29-64 %K AI06 %A Robert A. Hummel %A B. Kimia %A Stephen W. Zucker %T Deblurring Gaussian Blur %J MAG114 %P 66-80 %K AI06 %A George Harauz %A Richard Gordon %A Marin Van Heel %T Oblique Sampling of Projections for Direct-Three-Dimensional Reconstruction %J MAG114 %P 81-89 %K AI06 %A H. Westphal %A H. H. Nagel %T Exploiting Reflectance Properties to Analyze Images of Moving Objects Needs Local Constraints %J MAG114 %P 90 %K AI06 %A R. Moskowitz %T MIS Hedges on the AI Gamble %J Computer Decisions %V 19 %N 5 %D MAR 9, 1987 %P 58 %K AA06 ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sat May 30 03:31:05 1987 Date: Sat, 30 May 87 03:30:58 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #133 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sat, 30 May 87 03:26 EDT Received: from relay.cs.net by RELAY.CS.NET id ab03031; 30 May 87 1:05 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa12824; 30 May 87 1:04 EDT Date: Fri 29 May 1987 21:32-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #133 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Saturday, 30 May 1987 Volume 5 : Issue 133 Today's Topics: Queries - Pattern Recognition Keynote Speaker Wanted & Expert Systems for CAD & Approximate Structure Matching, Philosophy - Complexity Theory and Philosophy, Ethics - Text Critiquing and Eliza, Humor - Artificial Stupidity, Theory - The Symbol Grounding Problem ---------------------------------------------------------------------- Date: 21 May 87 16:00:42 GMT From: sun!sunburn!gtx!al@seismo.CSS.GOV (Al Filipski 839-0732) Reply-to: al@gtx.UUCP (Al Filipski 839-0732) Subject: keynote speaker wanted I am looking for a keynote speaker for a Symposium on Pattern Recognition and Machine Intelligence to be held in Wichita, Kansas in the Spring of 1988. The Symposium will be part of the annual meeting of the Southwest and Rocky Mountain Division of the American Association of the Advancement of Science and will be attended mostly by scientists from the Midwest. The speaker should be someone with a national reputation and a historical perspective on the field (PR/AI) and its relation to problems of interest to scientists. I would appreciate any advice and suggestions as to qualified speakers who might not be too expensive. Richard Duda (co-author of the text "Pattern Classification and Scene Analysis") has been recommended, but I can't find him. I tried SRI, but he is not there. Does anyone know where he is now? [Syntelligence; 1000 Hamlin Court; Sunnyvale, CA 94088. Phone (408) 745-6666. -- KIL] -------------------------------------------------------------- | Alan Filipski, GTX Corporation, | | 2501 W. Dunlap, | | Phoenix, Arizona 85021, USA | | | | (602)870-1696 | | | | {ihnp4,cbosgd,decvax,hplabs,seismo}!sun!sunburn!gtx!al | ------------------------------ Date: Fri, 29 May 87 09:15 EST From: SPANGLER%gmr.com@RELAY.CS.NET Subject: Wanted: Information on current work in Expert Systems for CAD I am beginning a survey of the current status of work in applying Expert Systems technology to Computer Aided Design. This survey is being done for the Knowledge Engineering group at General Motors. I would greatly appreciate any descriptions of or references to research in this area, as well as information on what CAD expert systems and expert system shells are available for purchase. -- Scott Spangler, spangler@gmr.com -- Advanced Engineering Staff, GM ------------------------------ Date: Thu, 28 May 87 09:28 EDT From: Roland Zito-Wolf Reply-to: Roland Zito-Wolf Subject: references re (approximate) structure matching I am looking for references regarding the matching of complex structures (matching on semantic networks or portions of networks) such as arise in doing retrieval operations on knowledge-bases so represented. Since the general mathcing problem is most likely intractable, I'm looking for approximate or incomplete techniques, such as partial match, resource-bounded match, matches using preference rules, etc. References which explore algorithms in detail, and implemented systems, would be especially useful. For example, does anyone know of a detailed description of the KRL matcher? Information on the more general problem of query/data-retrieval from semantic networks would also be useful. If there's sufficient interest, I'll post the results to the digest. Thanks in advance. Roland J. Zito-wolf Palladian Software 4 Cambridge Center Cambridge, Mass 02142 617-661-7171 RJZ%JASPER@LIVE-OAK.LCS.MIT.EDU ------------------------------ Date: 28 May 87 10:13:15 GMT From: tedrick@ernie.Berkeley.EDU (Tom Tedrick) Reply-to: tedrick@ernie.Berkeley.EDU (Tom Tedrick) Subject: Complexity and Philosophy >Lately I've been chating informally to a philosopher/friend about >common interests in our work. He was unfamiliar with the concept of the >TIME TO COMPUTE consequences of facts. Furthermore, the ramifactions of >intractability (ie. if P != NP is, as we all suspect, true) seemed to >be new to my friend. The absolute consequences are hard to get across >to a non-computer scientist; They always say "but computers are getting >faster all the time...". > >I'm digging around for references in AI on these ideas. This isn't my area. >Can anyone suggest some? I believe the philosophical consequences of complexity theory are enormous and that the field is wide open for someone with the ambition to pursue it. ------------------------------ Date: 29 May 87 15:48:17 GMT From: tanner@osu-eddie.UUCP (Mike Tanner) Reply-to: tanner@osu-eddie.UUCP (Mike Tanner) Subject: Re: Philosophy, Artificial Intelligence and Complexity Theory We have a paper to appear in this year's IJCAI called "On the computational complexity of hypothesis assembly", by Allemang, Tanner, Bylander, and Josephson. Hypothesis assembly is a part of many problem solving tasks. Eg, in medical diagnosis the problem is to find a collection of diseases which are consistent, plausible, and collectively explain the symptoms. Our paper analyzes a particular algorithm we've developed for solving this problem. The algorithm turns out to be polynomial under certain assumptions. But the problem of hypothesis assembly is shown to be NP-Complete, by reduction to 3-SAT, when those assumptions are violated. In particular, if there are hypotheses which are incompatible with each other it becomes NP-complete. (Another well known algorithm for the same problem, Reggia's generalized set covering model, is shown to be NP-complete also, by reduction to vertex cover.) The interesting part of the paper is the discussion of what this means. The bottom line is, people solve problems like this all the time without apparent exponential increase in effort. We take this to mean human problem solvers are taking advantage of features of the domain to properly organize their knowledge and problem solving strategy so that these complexity issues don't arise. In the particular case discussed in the paper the problem is the identification of antibodies in blood prior to giving transfusions. There exist pairs of antibodies that people simply cannot have both of, for genetic reasons. So we're in the NP-complete case. But, it is possible to reason up front about the antibodies and typically rule out one of each pair of incompatible antibodies (the hypotheses). Then do the assembly of a complete explanation. This results in assembly being polynomial. If you send me your land mail address I can send you a copy of the paper. Or you can wait for the movie. (Dean Allemang will present it in Milan.) -- mike ARPA: tanner@ohio-state UUCP: ...!cbosgd!osu-eddie!tanner ------------------------------ Date: Thu, 28 May 87 19:29:27 pdt From: Ethan Scarl Subject: Text Critiquing and Eliza The "grammar checker" discussions were stirring some old memories which I finally pinpointed: a 1973 debate (centered on Joe Weizenbaum and Ken Colby) over whether Eliza should be used for actual therapy. The heart of the grammar checker issue is whether a computational package of limited or doubtful competence should be given an authoritative role for some vulnerable part of our population (young students, or confused adults). What was most shocking in the Eliza situation (and may be true here as well) was the quick and profound acceptance of a mechanical confidante by naive users. Competent and experienced writers have no trouble discarding (or extrapolating from) Rightwriter's sillier outputs; the problem is with inexperienced or disadvanted users. Many of us were (are) enraged at this automated abuse as absurd, irresponsible, and even inhuman," only to be stopped short by a sobering argument: "if competent human help is scarce, then isn't this better than nothing?" The Rightwriter discussion summarizes/coheres rather well: Such systems are suggestive aids for competent writers and may be useful in tutoring the incompetent. Such systems will be unsuitable as replacement tutors for some time to come, but may be worthwhile (in time and effort expended for results achieved) as aids to be be used by a competent tutor or under the tutor's supervision. We are in deep trouble if there are no competent humans available to help others who need it. But the secondary question: "Is sitting in front of a CRT better than sitting in a closet?" can at least be tested empirically. In the Rightwriter case, I would expect that most students will quickly understand the the program's analytic limitations after they are pointed out by a teacher. However, the human teacher's perspective is essential. ------------------------------ Date: Thu, 28 May 87 09:35:48 pdt From: Eugene Miya N. Subject: Re: Humor - Artificial Life: actually artificial stupidity In article <23@aimmi.UUCP> Gilbert Cockton writes: > >Nah - that's not all the way. We also need > > 3. Artificial reasoning. > >This is when people who nothing about epistemology (philosophical and >anthropological/sociologial aspects) or psychology lock themselves away on >an AI project and make things up about how people reason. I may be >oldfashioned, but I do miss empirical substance and conceptual coherence >:-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) :-) :-):-) Permit me to add what I mentioned to John Pierce when he was a Chief Engineer over me: 4. Artificial stupidity And I got the comment about there being enough natural stupidity in the world. >From the Rock of Ages Home for Retired Hackers: --eugene miya NASA Ames Research Center eugene@ames-aurora.ARPA "You trust the `reply' command with all those different mailers out there?" "Send mail, avoid follow-ups. If enough, I'll summarize." {hplabs,hao,ihnp4,decwrl,allegra,tektronix,menlo70}!ames!aurora!eugene ------------------------------ Date: 28 May 87 05:46:28 GMT From: mind!harnad@princeton.edu (Stevan Harnad) Subject: Re: The symbol grounding problem Anders Weinstein of BBN wrote: > a point that I thought was clearly made in our earlier > discussion of the A/D distinction: loss of information, i.e. > non-invertibility, is neither a necessary nor sufficient condition for > analog to digital transformation. The only point that seems to have been clearly made in the sizable discussion of the A/D distinction on the Net last year (to my mind, at least) was that no A/D distinction could be agreed upon that would meet the needs and interests of all of the serious proponents and that perhaps there was an element of incoherence in all but the most technical and restricted of signal-analytic candidates. In the discussion to which you refer above (a 3-level bottom-up model for grounding symbolic representations in nonsymbolic -- iconic and categorical -- representions) the issue was not the A/D transformation but A/A transformations: isomorphic copies of the sensory surfaces. These are the iconic representations. So whereas physical invertibility may not have been more successful than any of the other candidates in mapping out a universally acceptable criterion for the A/D distinction, it is not clear that it can be faulted as a criterion for physical isomorphism. -- Stevan Harnad (609) - 921 7771 {bellcore, psuvax1, seismo, rutgers, packard} !princeton!mind!harnad harnad%mind@princeton.csnet harnad@mind.Princeton.EDU ------------------------------ Date: 29 May 87 00:46:47 GMT From: diamond.bbn.com!aweinste@husc6.harvard.edu (Anders Weinstein) Subject: Re: The symbol grounding problem Replying to my claim that >> ...loss of information, i.e. >> non-invertibility, is neither a necessary nor sufficient condition for >> analog to digital transformation. in article <786@mind.UUCP> harnad@mind.UUCP (Stevan Harnad) writes: > >The only point that seems to have been clearly made in the sizable discussion >of the A/D distinction on the Net last year (to my mind, at least) was that no >A/D distinction could be agreed upon ... > >In the discussion to which you refer above ... the issue was not the A/D >transformation but A/A transformations: isomorphic copies of the >sensory surfaces. These are the iconic representations. So whereas >physical invertibility may not have been more successful than any of >the other candidates in mapping out a universally acceptable criterion >for the A/D distinction, it is not clear that it can be faulted as a >criterion for physical isomorphism. Well the point is just the same for the A/A or "physically isomorphic" transformations you describe. Although the earlier discussion admittedly did not yield a positive result, I continue to believe that it was at least established that invertibility is a non-starter: invertibility has essentially *nothing* to do with the difference between analog and digital representation according to anybody's intuitive use of the terms. The reason I think this is so clear is that for any one of the possible transformation types -- A/D, A/A, D/A, or D/D -- one can find paradigmatic examples in which invertibility either does or does not obtain. A blurry image is uncontroversially an analog or "iconic" representation, yet it is non-invertible; a digital recording of sound in the audible range is surely an A/D transformation, yet it is completely invertible, etc. All the invertibility or non-invertibility of a transformation indicates is whether or not the transformation preserves or loses information in the technical sense. But loss of information is of course possible (and not necessary) in any of the 4 cases. I admit I don't know what the qualifier means in your criterion of "physical invertibility"; perhaps this alters the case. Anders Weinstein ------------------------------ Date: 29 May 87 15:27:31 GMT From: mind!harnad@princeton.edu (Stevan Harnad) Subject: Re: The symbol grounding problem aweinste@Diamond.BBN.COM (Anders Weinstein) of BBN Laboratories, Inc., Cambridge, MA writes: > invertibility has essentially *nothing* to do with the difference > between analog and digital representation according to anybody's > intuitive use of the terms... A blurry image is uncontroversially > an analog or "iconic" representation, yet it is non-invertible; > a digital recording of sound in the audible range is surely an A/D > transformation, yet it is completely invertible. [I]nvertibility... > [only] indicates whether... the transformation preserves or loses > information in the technical sense. But loss of information is... > possible in any of the 4 cases... A/D, A/A, D/A, D/D... > I admit I don't know what the qualifier means in your criterion > of "physical invertibility"; perhaps this alters the case. I admit that the physical-invertibility criterion is controversial and in the end may prove to be unsatisfactory in delimiting a counterpart of the technical A/D distinction that will be useful in formulating models of internal representation in cognitive science. The underlying idea is this: There are two stages of A/D even in the technical sense. Signal quantization (making a continuous signal discrete) and symbolization (assigning names and addresses to the discrete "chunks"). Unless the original signal is already discrete, the quantization phase involves a loss of information. Some regions of input variation will not be retrievable from the quantized image. The transformation is many-to-fewer instead of one-to-one. A many-to-few mapping cannot be inverted so as to recover the entire original signal. Now I conjecture that it is this physical invertibility -- the possibility of recovering all the original information -- that may be critical in cognitive representations. I agree that there may be information loss in A/A transformations (e.g., smoothing, blurring or loss of some dimensions of variation), but then the image is simply *not analog in the properties that have been lost*! It is only an analog of what it preserves, not what it fails to preserve. A strong motivation for giving invertibility a central role in cognitive representations has to do with the second stage of A/D conversion: symbolization. The "symbol grounding problem" that has been under discussion here concerns the fact that symbol systems depend for their "meanings" on only one of two possibilities: One is an interpretation supplied by human users -- "`Squiggle' means `animal' and `Squoggle' means `has four legs'" -- and the other is a physical, causal connection with the objects to which the symbols refer. The first source of "meaning" is not suitable for cognitive modeling, for obvious reasons (the meaning must be intrinsic and self-contained, not dependent on human mental mediation). The second has a surprising consequence, one that is either valid and instructive about cognitive representations (as I tentatively believe it is), or else a symptom of the wrong-headedness of this approach to the grounding problem, and the inadequacy of the invertibility criterion. The surprising consequence is that a "dedicated system" -- one that is hard-wired to its transducers and effectors (and hence their interactions with objects in the world) may be significantly different from the very *same* system as an isolated symbol-manipulating module, cut off from its peripherals -- different in certain respects that could be critical to cognitive modeling (and cognitive modeling only). The dedicated system can be regarded as "analog" in the input signal properties that are physically recoverable, even if there have been (dedicated) "digital" stages of processing in between. This would only be true of dedicated systems, and would cease to be true as soon as you severed their physical connection to their peripherals. This physical invertibility criterion would be of no interest whatever to ordinary technical signal processing work in engineering. (It may even be a strategic error to keep using the engineering "A/D" terminology for what might only bear a metaphorical relation to it.) The potential relevance of the physical invertibility criterion would only be to cognitive modeling, especially in the constrain that a grounded symbol system must be *nonmodular* -- i.e., it must be hybrid symbolic/nonsymbolic. The reason I have hypothesized that symbolic representations in cognition must be grounded nonmodularly in nonsymbolic representations (iconic and categorical ones) is based in part on the conjecture that the physical invertibility of input information in a dedicated system may play a crucial role in successful cognitive modeling (as described in the book under discussion: "Categorical Perception: The Groundwork of Cognition," Cambridge University Press 1987). Of course, selective *noninvertibility* -- as in categorizing by ignoring some differences and not others -- plays an equally crucial complementary role. The reason the invertibility must be physical rather than merely formal or conceptual is to make sure the system is grounded rather than hanging by a skyhook from people's mental interpretations. -- Stevan Harnad (609) - 921 7771 {bellcore, psuvax1, seismo, rutgers, packard} !princeton!mind!harnad harnad%mind@princeton.csnet harnad@mind.Princeton.EDU ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Tue Jun 2 03:26:07 1987 Date: Tue, 2 Jun 87 03:25:59 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #134 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Tue, 2 Jun 87 03:07 EDT Received: from relay.cs.net by RELAY.CS.NET id aa17662; 1 Jun 87 14:05 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa05188; 1 Jun 87 13:57 EDT Date: Mon 1 Jun 1987 09:27-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #134 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 1 Jun 1987 Volume 5 : Issue 134 Today's Topics: Seminars - Knowledge-Based Software Development Tools (SRI) & The Inverse Method (MCC) & So What if Macsyma is an Expert System? (TI), Conference - AI and SEA & CFP: CSCSI-88 (Canadian AI Conference) & HICSS-21, Rapid Prototyping & Theoretical Aspects of Reasoning about Knowledge ---------------------------------------------------------------------- Date: Wed, 27 May 87 16:49:56 PDT From: Amy Lansky Subject: Seminar - Knowledge-Based Software Development Tools (SRI) KNOWLEDGE-BASED SOFTWARE DEVELOPMENT TOOLS Douglas R. Smith (SMITH@KESTREL.ARPA) Kestrel Institute 11:00 AM, MONDAY, June 1 SRI International, Building E, Room EJ228 We describe some of the experimental knowledge-based software development tools under development at Kestrel Institute. In particular, we discuss systems for automatically performing algorithm design, deduction, optimization (finite differencing), data structure selection, and performance estimation. We show how these systems could cooperate in supporting the transformation of a formal specification of a schedule optimization problem into efficient code. VISITORS: Please arrive 5 minutes early so that you can be escorted up from the E-building receptionist's desk. Thanks! ------------------------------ Date: Thu 21 May 87 15:44:50-CDT From: Ellie Huck Subject: Seminar - The Inverse Method (MCC) Vladimir Lifschitz Stanford University May 27 - 10:00pm ACA Conference Room 2.806 "What is the Inverse Method?" A large part of work on proof procedures for predicate logic done in the Soviet Union in the sixties and seventies was based on the "inverse method", proposed by Sergey Maslov. This important work has not been duly appreciated outside the small circle of Maslov's associates. I will review the basic ideas of the method in the form which stresses its connection with resolution. May 27 - 10:00 ACA Conference Room ------------------------------ Date: Thu, 28 May 1987 12:37 CST From: Leff (Southern Methodist University) Subject: Seminar - So What if Macsyma is an Expert System? (TI) Texas Instruments Computer Science Center Lecture Series SO WHAT IF MACSYMA IS AN EXPERT SYSTEM? Prof. David Y. Y. Yun Southern Methodist University 10:00 am, Friday, 5 June 1987 North Building Cafeteria Room C-4 ABSTRACT The real question is how MACSYMA, or any other symbolic math system, can be used to help scientists and engineers. Existing symbolic math systems are too narrowly focused and too difficult to integrate with other computing capabilities. Such limitations keep these systems at the level of casual tools for scientists and engineers. Technologies in symbolic computing and system support have progressed sufficiently far for us to envision an integrated working environment that can not only provide expert performance on special problems through a large repository of knowledge bases, but also cater to individual needs by providing guidance and consultation on these available capabilities. We will first survey the current state of symbolic math systems by presenting sample capabilities. Then assess available techniques that will enable us to achieve such a goal. ------------------------------ Date: 22 May 1987 15:50:38 EDT From: Herve.Lambert@PS2.CS.CMU.EDU Subject: Conference - AI and SEA ARTIFICIAL INTELLIGENCE AND SEA 18 - 19 Juin 1987, Marseille (France) ________________ Organised by: Institut International de Robotique et d'Intelligence Artificielle de Marseille, 2 rue Henri Barbusse, 13241 Marseille cedex 1 Registration Information: Viviane Bernadac, IIRIAM, tel (33) 91 91 36 72 telex 440 860 telefax (33) 91 91 70 24 Address: IIRIAM 2 rue Henri Barbusse 13241 Marseille cedex 1 France PROGRAM OF THE CONFERENCE Thursday 18th June 1987: 8h30 - 9h00 Members reception 9h00 - 9h30 Welcome speech Jean-Francois Le Maitre, IIRIAM Session 1, chairman: Vieillard Baron, IRCN 9h30 - 10h00 Jean-Claude Rault, EC2, France State of the Art of expert systems applications 10h00 - 10h30 M.F. Mac Gowan, Cooperative Institute for Marine and Atmospheric Studies, Miami, USA Catcurv1, a fishery management expert system module 10h30 - 11h00 Break Session 2, chairman: Jean-Claude Rault, EC2 11h00 - 11h30 M. Alquier, ENSEEIHT, France Artificial Intelligence and Navigation in sail boat races. 11h30 - 12h00 J. Schoellkopf, S2O Developpement, France PNAO, an expert system for offshore positionning and navigation 12h00 - 12h30 J. Fox, University of Hawaii, USA Laser aided machine vision in the ocean 12h30 - 14h00 Lunch Session 3, chairman: Georges Thebaud, Comite Central des Armateurs de France 14h00 - 14h30 J.P. Poitou, CNRS, France The expert and the system, consequence for cognitive analysis: example in naval ship building 14h30 - 15h00 M. Daniel, J.M. Kobus, C. Sayettat, ENSAM, France Artificial Intelligence Techniques in CAD for fishing boats 15h00 - 15h30 B. Baret, M. Cayrol, J. Laforgue, IRCN, France Use of Artificial Intelligence in CAD: CAD evolution for the Steel Hull Design in Shipbuilding Industry 15h30 - 16h00 Break Session 4, chairman: Pierre Orsero, IMT 16h00 - 16h30 J.M. Andre, Laboratoire de Marcoussis, France CADOO, an expert system in spatial accomodations. 16h30 - 17h00 B. Neveu, INRIA, France SMECI, an expert system for breakwater conception 18h00 - 19h30 Cocktail at the City Hall of Marseilles Friday 19th June 1987 Session 5, chairman: Hubert Du Mesnil, Port Autonome de Marseille, France 9h30 - 10h00 R Baleydier, Port Autonome de Marseille, France Expert System of maintenance diagnostic fro handling container machine 10h00 - 10h30 D. Peguin, CEFI, France Expert System for long term harbour traffic prediction 10h30 - 11h00 Break Session 6, chairman: J.P. Fail, IFP 11h00 - 11h30 B. Hamidi, R. Tremollieres, IAE France Information and decision expert system in harbour management 11h30 - 12h00 M. Bennett, Cambridge Consultants LTD, UK Machine Intelligence and the underwater vehicle (ROV'S) 12h00 - 12h30 D. Lane, Heriot Watt University, Scotland The rational Cell: a modular KBS Architecture for the integration of diverse information processing operations. Applications in sector scan imagery. 12h30 - 14h00 Lunch Session 7, chairman: Michel Brechet, B+ Developpement, France 14h00 - 14h30 J.F. Strutt, Cranfield Institute of Technology, UK EXPRES, a rule-based pipeline design expert system 14h30 - 15h00 R. Nossum, Computas Expert Systems, Norway CPS/IF, an intelligent front-end to a Computer mapping package 15h00 - 15h30 M. Blaquiere, Centre de Recherches, CFP Total, France Simulation of processes for risk predictions 15h30 - 16h00 Break Session 8, chairman: C. Roger 16h00 - 16h30 J.P. Quilleveyre, Elf Aquitaine, France SERSO, an expert system for offshore platform reanalysis 16h30 - 17h00 S. Zeuthen, Norvegian Institute of technology, Norway STABRIG and PROLIX: knowledge-based systems for marine operations (semi-subs stability problems and mooring systems). ------------------------------ Date: Wed, 27 May 87 12:06:19 pdt From: Bob Woodham Subject: Conference - CFP: CSCSI-88 (Canadian AI Conference) Please post the following to AIList-Digest: C A L L F O R P A P E R S Canadian Artificial Intelligence Conference C S C S I - 8 8 Edmonton Convention Centre Edmonton, Alberta June 6 - 10, 1988 CSCSI-88 is the seventh biennial conference on Artificial Intelligence sponsored by the Canadian Society for Computational Studies of Intelligence/la Societe canadienne pour l'etude de l'intelligence par ordinateur (CSCSI/SCEIO). The 1988 conference will be held in Edmonton in conjunction with Graphics Interface '88 and Vision Interface '88. Contributions are requested describing original research results, either theoretical or applied, in all areas of Artificial Intelligence research. The following areas are especially of interest: Knowledge Representation Robotics Perception (Vision, Touch, Speech) Knowledge Acquisition and Maintenance Natural Language Understanding Cognitive Modelling Expert Systems and Applications Social Aspects of AI Reasoning (Formal, Qualitative) Architectures and Languages Learning Applications All submissions will be refereed by a Program Committee. Authors are requested to prepare full papers of no more than 5000 words in length and to specify in which area they wish their papers to be reviewed. All papers must contain a concise statement of the original contribution made to Artificial Intelligence research, with proper reference to the relevant literature. At the time of submission, authors must indicate if the paper has appeared, or has been submitted, elsewhere. Failure to do so will lead to automatic rejection. Figures and illustrations should be professionally drawn. Photographs, if included, should be of publication quality. All accepted papers will be published in the conference proceedings. As a condition of acceptance, the author, or one of the co-authors, will be required to present the paper at the conference. The international journal, Artificial Intelligence, has offered a best paper prize for the conference. Selection of a best paper will be done by the Program Committee. Three (3) copies of the paper due: October 31, 1987. Notification of acceptance or rejection: February 1, 1988. Camera ready copy due: March 28, 1988. Send papers and other correspondence to: Nick Cercone Bob Woodham School of Computing Science Department of Computer Science Simon Fraser University University of British Columbia Burnaby, B.C. V5A 1S6 Vancouver, B.C. V6T 1W5 CANADA CANADA (604) 291-4277 (604) 228-4368 nick@lccr.sfu.CDN woodham@vision.ubc.CDN sfulccr!nick@ubc-vision.UUCP woodham@ubc-vision.UUCP woodham@ubc.CSNET ------------------------------ Date: Fri, 29 May 1987 20:33 CST From: Leff (Southern Methodist University) Subject: Conference - HICSS-21, Rapid Prototyping CALL FOR PAPERS AND REFEREES "Rapid Prototyping of Large-Scale Software" Mini-Track HAWAII INTERNATIONAL CONFERENCE on SYSTEM SCIENCES (HICSS-21) SOFTWARE TRACK January 5-8, 1988 Murat M. Tanik Southern Methodist University Computer Science Department Dallas, TX 75275-0122 (214) 692-2854 CSNET: tanik@smu.uucp Mini-Track Concept: This mini-track involves the investigation of the ways of rapid development of large-scale software prototypes. Software developers are constantly faced with both a changing problem definition and a changing solution environment. This results in costly modification or replacement of software. Present systems do not address this problem adequately. A partial solution lies in the rapid development of software. The resulting rapid feedback could be used to effectively detect and resolve errors and inconsistencies in the problem definition. Prototyping provides early execution of software capabilities, to let end-users see the operational results of a system specification so that they can identify de ficiencies before the system is hardened into production code. To be effective, a prototype must be rapidly constructed and modified, so that the effort required to do the specification development and evaluation does not constraint system capabilities. Examples of suitable topics include: . The role of knowledge engineering in prototyping enviroments. . Rapid prototyping of real-time systems. . Rapid prototyping paradigms. . Graphics oriented user interfaces for prototyping systems. . Domain specific prototyping systems. . Stimulation/simulation environments for prototypes of real-time systems. . Support tools for prototyping environments. . Intelligent documentation/help systems for prototypes. . Reusability in prototyping environments. . Prototyping vs. simulation. The manuscript should be directed towards the research and development community and not the management community. Manuscripts should be 22-26 typewritten, double-spaced pages in length. Please do not send submissions that are significantly shorter or longer than this. The manuscript must contain original results and should not be submitted elsewhere while it is being evaluated for acceptance to HICSS-21. Manuscripts that have already appeared in publication will not be considered for this conference. Please send six copies of your manuscript to me before July 20, 1987. Each paper should have a title page which includes the title of the paper, the full name of its author(s), affiliation(s), complete physical and e-mail address(es), and telephone number(s). Each manuscript is put into a rigorous refereeing process. . Notifications of accepted papers will be mailed to the author on or before September 7, 1987. . Final papers in camera-ready form will be due by October 19, 1987. Your participation is invited as author, referee or both. Please contact me by e-mail or otherwise. ------------------------------ Date: 20 April 87 16:03-PDT From: VARDI%ALMVMA.BITNET@WISCVM.WISC.EDU Subject: Conference - Theoretical Aspects of Reasoning about Knowledge Call for Papers The Second Conference on THEORETICAL ASPECTS OF REASONING ABOUT KNOWLEDGE March 6-9, 1988, Monterey, California The 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, sponsored by the International Business Machines Corporation and the American Association for Artificial Intelligence, will be held March 6-9, 1988, at the Asilomar Conference Center in Monterey, California. While traditionally research in this area was mainly done by philosophers and linguists, reasoning about knowledge has been shown recently to be of great relevance to computer science and economics. The aim of the conference is to bring together researchers from these various disciplines with the intent of furthering our theoretical understanding of reasoning about knowledge. Some suggested, although not exclusive, topics of interest are: Semantic models for knowledge and belief Resource-bounded reasoning Minimal knowledge proof systems Analyzing distributed systems via knowledge Knowledge acquisition and learning Knowledge and commonsense reasoning Knowledge, planning, and action Knowledge in economic models You are invited to submit ten copies of a detailed abstract (not a complete paper) to the program chair: Moshe Y. Vardi IBM Research Almaden Research Center K53-802 650 Harry Rd. San Jose, CA 95120-6099, USA Telephone: (408) 927-1784 Electronic address: vardi@ibm.com, vardi@almvma.bitnet Submissions will be evaluated on the basis of significance, originality, and overall quality. Each abstract should 1) contain enough information to enable the program committee to identify the main contribution of the work; 2) explain the importance of the work - its novelty and its practical or theoretical implications; and 3) include comparisons with and references to relevant literature. Abstracts should be no longer than ten double-spaced pages. Program Committee: J. Barwise (Stanford University) P. van Emde Boas (University of Amsterdam) H. Kamp (University of Texas at Austin) K. Konolige (SRI International) Y. Moses (Weizmann Institute of Science) S. Rosenschein (SRI International) T. Tan (University of Chicago) M. Vardi (IBM Almaden Research Center) The deadline for submission of abstracts is August 31, 1987. Authors will be notified of acceptance by November 1, 1987 (authors who supply an electronic address might be notified earlier). The accepted papers will be due by December 15, 1987. Proceedings will be distributed at the conference, and will be subsequently available for purchase through the publisher. We hope to allow enough time between the talks for private discussions and small group meetings. In order to ensure that the conference remains relatively small, attendance will be limited to invited participants and authors of accepted papers. Support for the conference has been received from IBM and AAAI for partial subsidy of participants' expenses; applications for further support are pending. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Tue Jun 2 03:26:45 1987 Date: Tue, 2 Jun 87 03:26:36 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #135 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Tue, 2 Jun 87 03:14 EDT Received: from relay.cs.net by RELAY.CS.NET id ad19920; 1 Jun 87 21:42 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa08723; 1 Jun 87 21:42 EDT Date: Mon 1 Jun 1987 17:33-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #135 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Tuesday, 2 Jun 1987 Volume 5 : Issue 135 Today's Topics: Bindings - NL-KR the List, Theory - Philosophy and Computational Complexity, Applications - Computer Grading and the Law & Solid Geometry & The Synthesizer Generator ---------------------------------------------------------------------- Date: Fri, 29 May 87 17:11 EDT From: Brad Miller Subject: NL-KR the list... Is now available on USENET in group comp.ai.nlang-know-rep as part of the massive USENET project to have all arpa lists forwarded to their own groups. If you can receive this group and would prefer to read the digests there, please send a message to nl-kr-request@cs.rochester.edu so I can remove you from the separate mailing list. Brad Miller nl-kr moderator nl-kr-request@cs.rochester.edu [I have been forwarding the recent comp.ai linguistics discussion to the NL-KR list (instead of to the Arpanet AIList digest). Now that NL-KR is available via Usenet, I would suggest that the discussion move there. In that way the Usenet participants will not be missing out on the cogent repies of the NL-KR linguists. I assume that your submissions should go to nl-kr@cs.rochester.edu and that you can then read all of the replies on comp.ai.nlang-know-rep. -- KIL] ------------------------------ Date: Mon, 1 Jun 87 09:18:28 EDT From: "William J. Rapaport" Subject: philosophy and computational complexity A good _philosophical_ reference is: Christopher Cherniak, "Computational Complexity and the Universal Acceptance of Logic," _Journal of Philosophy_ 81 (1984) 739-758. William J. Rapaport Assistant Professor Dept. of Computer Science, SUNY Buffalo, Buffalo, NY 14260 (716) 636-3193, 3180 uucp: ..!{allegra,decvax,watmath,rocksanne}!sunybcs!rapaport csnet: rapaport@buffalo.csnet bitnet: rapaport@sunybcs.bitnet ------------------------------ Date: Mon 1 Jun 87 13:31:58-PDT From: PAT Subject: Re: Philosophy, AI, and Complexity Theory In reply to Ray Lister: the best overview is probably Hector Levesques Computers and Thought lecture delivered at the last IJCAI. Pat Hayes ------------------------------ Date: Sun, 29 Mar 87 03:15:44 cst From: Laurence Leff Subject: Computer Grading and the Law I propose the attached comment to Mr. Craig's Volume 5 #87 submission to ailist. In order to allow Mr. Craig an opportunity to either ammend his statement peacefully or to rebut my criticism, I request that Dr. Laws hold this until Mr. Craig has had an opportunity to respond. [He has apparently chosen not to, and Laurence has now asked me to forward this to the list. -- KIL] tektronix!videovax!dmc, Donald Craig, wrote in Volume 5, number 87 about his concern of student's essays being graded by machine. He also states "In law I have the right to be judged by a jury of my peers." drawing an analogy between a jury trial and a court case. The first concern is unfounded and the second statement is an overgeneralizaton. In a criminal case involving over six months of imprisonment you have the right to a jury trial. However, in criminal cases involving small penalties, the states may pass laws allowing convictions without a jury. (Source: the Criminal Procedure issue of Georgetown Law Review.) In a suit in equity, i. e. someone wants an injunction against you or a declaratory action, you do not have the right to a jury trial. In administrative cases, you do not have the right to a jury trial. (Source: "Administrative Law" by Davis, another law book) However, there must be "notice" and "hearing" if "life, liberty or property" is to be denied. "Property" has been interpreted by the courts to include such things as food stamp benefits (722 F 2d 933), driver licenses and high school diplomas (Debra P. v. Turlington 644 F 2d 397). After addressing the overbroad statement, we now address the substantive concern: can computers grade essays without some human in the loop. We find that legally, they cannot and furthermore we see the importance of an "explanation facility", a subject that has come up recently in AILIST. The issue of computers making judgements came up in Foggs versus Block, 722 F2d 933 (1983). In this case, the Commissioner reduced people's Food Stamp allottment due to a change in Statute. A computer program reduced the benefits and the card so announcing gave information regarding the required hearing. However, this notice was considered inadequate because insufficient information was provided to determine if an error was made. Thus any expert system making decisions impinging upon what the courts view as "property" must provide adequate explanation and must also provide some form of hearing procedure. Furthermore, some explanation of the hearing procedure must be provided so that people could take advantage of it. Although, there would be no legal problem with a first pass determination of the grade on a student's essay by computer program, it is clear that some human must be available to hear a student's objections and furthermore, that computer program must in some way indicate how the grade was determined. In the case you mentioned, a first pass grading could be done by computer as long as there was some procedure for complaints to be made to a human being with an appropriate hearing. (Due to the concepts of ripeness, it may be necessary that the grade for the course/quarter etc. was recorded since the error made by the computer on one essay may not be sufficient to change the final recorded grade. However, if the erroneous grading occurred often enough or was serious enough, the student would eventually have a complaint that could be heard.) ------------------------------ Date: Sun, 31 May 1987 14:56 CST From: Leff (Southern Methodist University) Subject: Re: Solid Geometry [...] Here are some references on converting from 2-D views to constructive solid geometry references. The difficulty is that simply going from three views along orthogonal axis to a 3-D physical description of the problem is ambiguous. That is true, even in the presence of the "hidden line" information that would not be available from a camera. In fact, for a given wire-frame (set of edges of the object), there are many possible corresponding solid objects. %A H. Yoshiura %A Kikuo Fujimura %A T. L. Kunii %T Top-Down Construction of 3-D Mechanical Object Shapes from Engineering Drawings %J COMPUTER %D December 1984 %P 32-40 %K AIME %W 14D %A M. Idesawa %T A System to Generate a Solid Figure from Three View %J BJSME %V 16 %P 216-225 %N 92 %D FEB 1973 %K CADCAM %W 05J %A M. A. Wesley %A G. Markowsky %T Fleshing OUt Projections %J IBM J. Research and Development %V 25 %N 6 %D NOV 1981 As mentioned in AILIST, there are two main methods of modeling objects in CAD/CAM: boundary representations and constructive solid geometry systems. CSG based systems provide some mechanism for converting to boundary representation as this is needed for such functions as display. This can be done in worst case O(N ** 3) time for the two-D case where N is the number of two dimensional objects and O(N ** 4) for three-D. However, the average case is linear! For an extremely clear discussion of these issues, see Tilove's thesis which is TM-38 from the PADL group. Going back from boundary representation to CSG is fairly straightforward. Looking at the problems of conversion from a canonical form perspective or cases where the object is represented parametrically is discussed in my papers. The argument that CSG systems cannot be put on micros is bogus. First of all Cubicomp has been selling a commercial CSG based system for micros for years. Second of all the original research versions of CSG done by the PADL group was done on an 11/40 containing 28K 16 bit words which is much more limited than an IBM-PC. ------------------------------ Date: Fri, 22 May 87 08:35:19 PDT From: Tim Teitelbaum Subject: The Synthesizer Generator [Forwarded from the Stanford bboard by Laws@STRIPE.SRI.COM.] Introducing the Synthesizer Generator: a tool for creating editors Thomas Reps Tim Teitelbaum Computer Science Department Computer Science Department University of Wisconsin Cornell University Madison, WI 53706 Ithaca, NY 14853 1. What is the Synthesizer Generator The Synthesizer Generator is a tool for creating editing environments for complex objects. The editor designer prepares a specification that includes rules defining a language's abstract syntax, context-sensitive relationships, display format, and concrete input syntax. From this specification, the Generator creates a full-screen editor for manipulating objects according to these rules. 2. Who might want to use the Synthesizer Generator? The Synthesizer Generator can be used by researchers who need to construct an editing environment for objects that can be described by a grammar. The Generator has been suc- cessfully used to create a Pascal editor with full static semantic checking, editors for C and Fortran 77, and many editors for program verification and proof editing. It has also been used to construct WYSIWYG editors for right- justified text and mathematical formulae. Using the Synthesizer Generator is much faster than producing a hand-crafted editor, just as using a compiler compiler is faster than writing a compiler. The Generator maintains abstract representations for objects and incor- porates algorithms for propagating context-sensitive infor- mation through the objects being manipulated. It also pro- vides the many mundane features that any editor must have, such as binding of key sequences to generic commands, creat- ing and manipulating buffers for edited objects, multiple windows, etc., that would otherwise distract the editor designer from his primary interest. The relative ease of generating editors makes the Generator ideal for prototype development and experimental use. 3. Are there serious applications beyond program editors? Applications of the Synthesizer Generator are not limited to editors for programming languages. At Cornell the Generator is being used to implement environments for formal reasoning that allow users to interactively construct proofs. Proofs are represented as trees whose nodes correspond to inference rules, while proof correctness is represented by context- sensitive constraints between the nodes of the tree. Two approaches to building such environments have been investi- gated: in one the environment designer hand-tailors a Syn- thesizer specification for a particular formal system [Reps and Alpern]; in the other, the Synthesizer Generator is used to implement an environment for defining formal systems that allows a user to interactively define a particular logic and to conduct formal reasoning in that logic. [Reps and Alpern] Reps. T. and Alpern, B. "Interactive Proof Checking," Eleventh POPL, 1984, 36-45. 4. How does it work? The Synthesizer Generator is particularly well suited for creating editors that enforce the syntax and static seman- tics of objects that can be described in a particular language. Each object to be edited is represented as a con- sistently attributed derivation tree. When these objects are modified, some of the attributes may no longer have con- sistent values; incremental analysis is performed by updat- ing attribute values throughout the tree in response to modifications. If an editing operation modifies an object in such a way that context-dependent constraints are violated, the attributes that indicate satisfaction of con- straints will receive new values; thus, these attributes can be used to annotate the display in order to provide the user with feedback about the existence of errors. Editor specifications are written in the Synthesizer Specification Language (SSL), which is based on the concepts of a term algebra and an attribute grammar, although certain features are tailored to the application domain of language-based editors. The Synthesizer Generator has two components: a) a translator that takes an SSL specification as input, and produces grammar tables as output, and b) an editor kernel that consists of an attributed-tree data-type and a driver for interactively manipulating attributed trees; the kernel takes input from the key- board and executes appropriate operations on the current tree. A shell program handles the details of invoking the transla- tor and producing a language-based editor from the resulting tables. 5. How to get a copy of the Generator The Generator is written in C and runs under Berkeley UNIX on VAX computers, Sun workstations (using SunWindows), and the IBM PC/RT. Porting to other versions of UNIX is straightforward. We are in the process of porting the Gen- erator to XWindows. Editors generated with the Synthesizer Generator will work on any crt terminal described in the UNIX termcap database. A keyboard description file speci- fies the layout of special function keys used by the gen- erated editors. The distribution, which is available for $200.00, consists of: a) Source and object code for the SSL translator and edi- tor kernel. b) A collection of demonstration editors and their specif- ications, including a Pascal editor with full static- semantic checking and several proof editors. c) A copy of The Synthesizer Generator Reference Manual. 6. References The Synthesizer Specification Language is described in: Reps, T. and Teitelbaum, T. The Synthesizer Genera- tor. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, Pittsburgh, Penn., Apr. 23-25, 1984. (Appeared as joint issue: SIGPLAN No- tices (ACM) 19, 5 (May 1984), and Soft. Eng. Notes (ACM) 9, 3 (May 1984), 42-48). A complete manual is available: Reps, T. and Teitelbaum, T. The Synthesizer Genera- tor Reference Manual. Department of Computer Sci- ence, Cornell University, Ithaca, NY, 14853, August, 1985. A description of the theory underlying the Generator may be found in: Reps, Thomas W. Generating Language-Based Environ- ments, The MIT Press, 1984. To request further information about acquiring a copy of the system, please respond with the name of your organization and your postal address to ARPA: synrels@gvax.cs.cornell.edu UUCP: {rochester, allegra}!cornell!synrels Bitnet: synrels@crnlcs.Bitnet USMail: Prof. Tim Teitelbaum Synthesizer Generator Distribution Dep't of Computer Science, Upson Hall Cornell University Ithaca, NY 14853 USA We will send you the terms of the distribution and copies of the distribution agreement. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Wed Jun 3 03:22:58 1987 Date: Wed, 3 Jun 87 03:22:48 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #136 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Wed, 3 Jun 87 03:08 EDT Received: from relay.cs.net by RELAY.CS.NET id ag20451; 1 Jun 87 23:49 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa09401; 1 Jun 87 23:48 EDT Date: Mon 1 Jun 1987 20:31-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #136 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Tuesday, 2 Jun 1987 Volume 5 : Issue 136 Today's Topics: Bibliography - Leff ai.bib50TR ---------------------------------------------------------------------- Date: Sun, 31 May 1987 14:56 CST From: Leff (Southern Methodist University) Subject: ai.bib50TR %A Ganesh C. Gopalakrishnan %A Mandayam K. Srivas %A David R. Smith %T Hierarchical Design of VLSI Systems Using Algebraic Specifications and Temporal Logic: On Automatic Synthesis of Controllers for VLSI Modules >From Their Functional Specifications %I Department of Computer Science, SUNY at Stony Brook %D Jan 1986 %K AA04 AI11 %R TR 86/01 %A Sanjay Manchanda %A Suzanne Dietrich %T Storing and Accessing Relations on Disk in a Prolog Database System %I Department of Computer Science, SUNY at Stony Brook %D JAN 1986 %R TR 86/08 %K AA09 T02 %A Michael Kifer %A R. Lozinskii %T Framework for an Efficient Implementation of Deductive Databases %I Department of Computer Science, SUNY at Stony Brook %D FEB 1986 %R TR 86/04 %K AA09 %A Saumya K. Debray %T Mode Inference and Abstract Interpretation in Logic Programs %I Department of Computer Science, SUNY at Stony Brook %D FEB 1986 %R TR 86/05 %K AI11 %A Michael Kifer %A E. Lozinskii %T Can We Implement Logic as a Database System %I Department of Computer Science, SUNY at Stony Brook %D FEB 1986 %R TR 86/06 %K AI11 AA09 %A Ganesh C. Goplakrishnan %A David Smith %A Mandayam K. Srivas %T From Algebraic Specifications to Correct VLSI Circuits %I Department of Computer Science, SUNY at Stony Brook %D JUN 1986 %R 86/13 %K AA04 %A Saumya K. Debray %A Prateek Mishra %T Denotational and Operational Semantics for Prolog %I Department of Computer Science, SUNY at Stony Brook %D JUL 1986 %R 86/15 %K T02 AA08 %A Sanjay Manchanda %A David Scott Warren %T Toward a Logical Theory of Database Updates %I Department of Computer Science, SUNY at Stony Brook %D JUL 1986 %R 86/19 %K AI11 AA09 %A R. Ramesh %A R. M. Verma %A T. Krishnaprasad %A I. V. Ramakrishnan %T Term Matching on Parallel Computer %I Department of Computer Science, SUNY at Stony Brook %D AUG 1986 %R 86/20 %K AI11 H03 %A Sanjay Manchanda %A Soumitra Sengupta %A David Scott Warren %T Concurrent Updates in a Prolog Database Systems %I Department of Computer Science, SUNY at Stony Brook %D Dec 1986 %R 86/28 %K AA09 T02 %A Jieh Hsiang %A Michael Rusinowitch %T ON Word Problems in Equational Theories %I Department of Computer Science, SUNY at Stony Brook %D DEC 1986 %R 86/29 %K AI14 %A Anita Wasilewska %T Definable Sets in Knowledge Representation Systems %I Department of Computer Science, SUNY at Stony Brook %D DEC 1986 %R 86/31 %K AI16 %A Anita Wasilewski %T On Automatic Learning %I Department of Computer Science, SUNY at Stony Brook %D DEC 1986 %R 86/34 %K AI04 %A Chilukuri K. Mohan %A Mandayam K. Srivas %A Deepak Kapurm %T On Proofs in System of Equations and Inequations %I Department of Computer Science, SUNY at Stony Brook %D JAN 1987 %R 87/02 %K AI14 %A Alexander Waibel %T Prosody and Speech Recognition (Thesis) %I Carnegie Mellon Computer Sciences %R CMU-CS-86-162 %D 1986 %K AI05 %A Maurice P. Herlihy %A Jeannette M. Wing %T Axioms for Concurrent Objects %I Carnegie Mellon Computer Sciences %R CMU-CS-86-154 %D 1986 %K AA08 %A Michael C. Browne %T An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic %I Carnegie Mellon Computer Sciences %R CMU-CS-86-156 %D 1986 %K AA08 %A Andrew W. Appel %A Guy J. Jacobson %T The World's Fastest Scrabble Program %I Carnegie Mellon Computer Sciences %D 1986 %R CMU-CS-86-153 %K AA17 AI03 %A H. T. Kung %A Jon A. Webb %T Mapping Image Processing Operations onto a Linear Systolic Machine %I Carnegie Mellon Computer Sciences %D 1986 %R CMU-CS-86-137 %K H03 AI06 Warp FFT Hough Transform connected component labeling relaxation %A Katsushi Ikeuchi %T Generating an Interpretation Tree From a CAD Model to Represent Object Configurations for Bin-Picking Trees %I Carnegie Mellon Computer Sciences %D 1986 %R CMU-CS-86-144 %K AI07 AA26 %A P. Helman %A R. Veroff %T Designing Deductive Databases %I University of New Mexico Computer Sciences %D 1986 %R CS86-5 %K AA09 %A James R. Slagle %A Michael R. Wick %A Marius O. Poliac %T Agness: A Generalized Network-Based Expert System Shell %I University of Minnesota, Computer Science Department %R CSci TR86-48 %D 1986 %K T03 %A Valdis Berzins %A Jeff Petty %T The DB Lisp Code Analyzer %I University of Minnesota, Computer Science Department %R CSci TR 86-56 %D 1986 %K T01 %A Jik H. Chang %A Oscar H. Ibarra %A Ting-Chuen Pong %A Stephen M. Sohn %T Two-Dimensional Convolution on a Pyramid Computer %I University of Minnesota, Computer Science Department %R CSci TR87-1 %D 1987 %K AI06 H03 %A Ting-Chuen Pong %T Matching Topographic Structures in Stereo Vision %I University of Minnesota, Computer Science Department %R CSci TR87-2 %D 1987 %K AI06 %T Recent Developments in NIKL %A Thomas Kaczmarek %A Raymond Bates %A Gabriel Robins %R ISI/RS-86-167 %I USC/Information Sciences Institute %D November 1986 %K AI16 %X NIKL (a New Implementation of KL-ONE) is one of the members of the KL-ONE family of knowledge representation languages. NIKL has been in use for several years and our experiences have led us to define and implement various extensions to the language, its support environment and the implementation. Our experiences are particular to the use of NIKL. However, the requirements that we have discovered are relevant to any intelligent system that must reason about terminology. This article reports on the extensions that we have found necessary based on experiences in several different testbeds. The motivations for the extensions and future plans are also presented. %T A Logical-Form and Knowledge-Base Design for Natural Language Generation %A Norman Sondheimer %A Bernhard Nebel %R ISI/RS-86-169 %D November 1986 %I USC/Information Sciences Institute %K AI02 %X This paper presents a technique for interpreting output demands by a natural language sentence generator in a formally transparent and efficient way. These demands are stated in a logical language. A network knowledge base organizes the concepts of the application domain into categories known to the generator. The logical expressions are interpreted by the generator using the knowledge base and a restricted, but efficient, hybrid knowledge representation system. The success of this experiment has led to plans for the inclusion of this design in both the evolving Penman natural language generator and the Janus natural language interface. %T Rhetorical Structure Theory: Descripton and Construction of Text %A William C. Mann %A Sandra Thompson %R ISI/RS-86-174 %I USC/Information Sciences Institute %D October 1986 %X Rhetorical Structure Theory (RST) is a theory of text structure that is being extended to serve as a theoretical basis for computational text planning. Text structure in RST are hierarchic, built on small patterns called schemas. The schemas which compose the structural hierarchy of a text describe the functions of the parts rather than their form characteristics. Relations between text parts, comparable to conjunctive relations, are a prominent part of RST's definitional machinery. .sp sp Recent work on RST has put it onto a new definitional basis. This paper describes the current status of descriptive RST, along with efforts to create a constructive version for use as a basis for programming a text planner. %T Automatic Compilation of Logical Specifications into Efficient Programs %A Donald Cohen %R ISI/RS-86-175 %D November 1986 %I USC/Information Sciences Institute %K AA08 %X We describe an automatic programmer, or "compiler" which accepts as input a predicate calculus specification of a set to generate or a condition to test, along with a description of the underlying representation of the data. This compiler searches a space of possible algorithms for the one that is expected to be most efficient. We describe the knowledge that is and is not available to this compiler, and its corresponding capabilities and limitations. This compiler is now regularly used to produce large programs. %T Towards Explicit Integration of Knowledge in Expert Systems %A Jack Mostow %A Bill Swartout %R ISI/RS-86-176 %D November 1986 %I USC/Information Sciences Institute %K AI16 O04 AA01 AI01 %X The knowledge integration problem arises in rule-based expert systems when two or more recommendations made by right-hand sides of rules must be combined. Current expert systems address this problem either by engineering the rule set to avoid it, or by using a single integration technique built into the interpreter, e.g., certainty factor combination. We argue that multiple techniques are needed and that their use -- and underlying assumptions -- should be made explicit. We identify some of the techniques used in MYCIN's therapy selection algorithm to integrate the diverse goals it attempts to satisfy, and suggest how knowledge of such techniques could be used to support construction, explanation, and maintenance of expert systems. %A M. Fanty %T Context-free Parsing in Connectionist Networks %I University of Rochester Computer Science Department %D NOV 1985 %R TR 174 %K H03 O06 %X algorithm to convert any context-free grammar into a connectionist network .br br 30 pages $1.25 %A D. H. Ballard %T Interpolation Coding: A Representation for Numbers in Neural Nets %I University of Rochester Computer Science Department %D MAY 1986 %R TR 175 %K O04 H03 O06 %X also discusses a method of combining evidence in neural nets .br br 30 pages $1.25 %A J. Aloimonos %A A. Basu %T Determining the Translation of a Rigidly Moving Surface Without Correspondence %I University of Rochester Computer Science Department %D JAN 1986 %R TR176 %K AI06 %X deal withs three dimensional translation of a textured object and uses four cameras .br br 20 pages, $1.00 %A J. Aloimonos %A I. Rigoutsos %T Determining the Three-Dimensional Motion of a Surface Patch Without Correspondence, Under Perspective Projection: (i) Planar Surfaces (ii) Curved Surfaces %I University of Rochester Computer Science Department %D DEC 1985 %R TR 178 %K AI06 stereo 3-D %X 35 pages, $1.50 %A J. F. Allen %A P. J. Hayest %T A Common-Sense Theory of Time %I University of Rochester Computer Science Department %D FEB 1987 %R TR 180 %K AI16 %X 32 pages, $1.50 .br br .br br Includes discussion of an axiomatization of time subsuming Allen's interval-based theory. %A D. B. Sher %T Optimal Likelihood Generators for Edge Detection Under Gaussian Additive Noise %I University of Rochester Computer Science Department %D AUG 1986 %R TR 185 %K O04 AI06 %X 9 pages, $0.75 %A D. Baldwin %T A Model for Automatic Design of Digital Circuits %I University of Rochester Computer Science Department %D JUL 1986 %R TR 188 %K AA04 %X 25 pages $1.25 .br br discusses partitioning of design tasks into algorithmic and knowledge-based parts %A J. A. Feldman %T Neural Representation of Conceptual Knowledge %I University of Rochester Computer Science Department %D JUN 1986 %R TR 189 %K AI12 AI16 %X 35 pages, $1.50 .br br discusses holographic models %A R. P. Loui %T A Presumptive System of Defeasible Inference %I University of Rochester Computer Science Department %D MAY 1986 %R TR 190 %K AI15 %X 20 pages, $1.25 %A R. P. Loui %T Real Rules of Inference: Acceptance and Non-Monotonicity in AI %I University of Rochester Computer Science Department %D SUMMER 1986 %R TR 191 %K AI15 %X 59 pages $2.25 %A D. Sher %T Evidence Combination Using Likelihood Generators %I University of Rochester Computer Science Department %D JAN 1987 %R TR 192 %K O04 AI16 %X 27 pages, $1.25 %A A. Mukherjee %T Self-calibration Strategies for Robot Manipulators %I University of Rochester Computer Science Department %D SEP 1986 %R TR 193 %K AI07 %X 105 pages, $3.75, PH. D. Thesis %A L. Hartman %T Generating Motor Behavior %I University of Rochester Computer Science Department %D OCT 1986 %R TR 195 %K AI09 naive physics %X 31 pages $1.50 .br br planning in a block world under naive physics axiomitization %A S. Hollbach %T Tinker Toy Recognition From 2D Connectivity %I University of Rochester Computer Science Department %D OCT 1986 %R TR 196 %K AI06 %X 22 pages, $1.25 %A D. Sher %T Advanced Likelihood Generators for Boundary Detection %I University of Rochester Computer Science Department %D JAN 1987 %R TR 197 %K AI06 O04 %X 50 pages, $2.00 %A I. Rigoutsis %T Homotopies: A Panacea or Just Another Method? %I University of Rochester Computer Science Department %D DEC 1986 %R TR 201 %K AI06 O06 %X discusses applications of a method for solving non-linear equations and its applicability to computer vision. %A Marek W. Lugowski %T Computational Metabolism %I Indiana University Computer Science Department %R 200 %K AI16 AI08 AI06 AI04 dynamical locally-coupled bottom-up architecture %X A new architecture for programming of dynamical systems. It consists of a tessellation into processors which undergo pairwise swaps. Processors come in several types; each type recognizes certain other ones. Recognition events result either in processor state change or a 2-processor swap. Model combines cellular automaton and connectionist featrures with probabilistic computation. Intended application: representation and computation of metaphors. %A Jacek Leszczylowski %A David Schmidt %T A Logic for Program Derivation and Verification %R TR-CS-86-2 %I Kansas State University, Computing and Information Sciences Department %K AI10 AI11 AA08 %A J. R. B. Cockett %A J. Herrera %T Prime Rule Based Methodologies Give Inadequate Control %R CS-85-60 %I University of Tennessee - Knoxville, Computer Science Department %K AI01 AA09 %A Janusz Kacprzyk %A Andrzej Ziolkowski %T Database Querying Schemes with Fuzzy Linguistic Quantifiers %R CS-86-62 %I University of Tennessee - Knoxville, Computer Science Department %K O04 AI02 AA09 %A Janusz Kacprzyk %T Enhancing Algorithmic/Procedural "Human Consistency" of Control Models by Using Some Representation of Common Sense Knowledge %R CS-86-63 %I University of Tennessee - Knoxville, Computer Science Department %K O04 AI13 %A Janusz Kacprzyk %A Jerzy Holubiec %T Towards a More Realistic Modeling of International Economic Cooperation via Fuzzy Mathematical Programming and Cooperative Games %R CS-86-64 %K AA11 O04 %I University of Tennessee - Knoxville, Computer Science Department %A Janusz Kacprzyk %A Cezary Iwanski %T A Generalization of Discounted Multistage Decision Making and Control Through Fuzzy Linguistic Quantifies: An Attempt to Introduce Commonsense Knowledge %R CS-86-66 %K O04 AI13 %I University of Tennessee - Knoxville, Computer Science Department %A Stanley H. Smith %A Mehmet Celenk %T A New, Systematic Method for Color Image Analysis II. Computer Implementation and Results %R Tech. Rep. EE 8610 %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %D MAR 1986 %K natural sceens AI06 %A Divyendu Sinha %T Operations on Unimodal Possibility Distributions that Characterize the Gray-Values of Images in the Fuzzy Settings Part I %R Tech Rep. EECS 8614 %D MAY 1986 %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %K AI06 O04 %A Divyendu Sinha %T Operations on Unimodal Possibility Distributions that Characterize the Gray-Values of Images in the Fuzzy Settings Part II %R Tech Rep. EECS 8615 %D MAY 1986 %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %K AI06 O04 %A Harrison E. Rowe %A Jung G. Shin %A Ta-Shing Chu %T Radio Imaging of Launch Vehicles and Payloads %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %D JUN 1986 %R TECH. Rep. EECS 8617 %K AI06 AA27 %X discussed problems in receiving radio images such as rain attenuation, clouds, etc. %A John S. Conery %T Closed Environments: Partitioned Memory Representation for Parallel Logic Programming %I Computer and InformationScience Department, University of Oregon %C Eugene, Oregon %R CIS-TR-86-02 %K AI11 H03 %A Kent A. Stevens %A Daniel P. Lulich %T Artifacts at the Limit of Resolution %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-04 %K AI06 AA10 AA01 %X A visual illusion which appears at the limit of resolution is used to investigate perceived artifacts of the convolution by Gaussian filters. Evidence is provided that implicate the smallest size operator at the retina and that suggest that the perceived shape of intensity changes is influenced by artifacts induced by the operator. %A Kent A. Stevens %A Allen Brookes %T Integrating Stereopsis with Monocular Interpretations of Planar Surfaces %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-05 %K AI06 AA10 AA01 %A Kent A. Stevens %A Allen Brookes %T Probing Depth in Monocular Images %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-06 %K AI06 AA10 AA01 %A Stephen Fickas %T Automating the Analysis Process %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-08 %K AA08 %X discusses the automation of requirements analysis %A John Conery %T Backward Execution in Nondeterministic AND-Parallel Systems %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-09 %K H03 AI10 %A Kent A. Stephens %A Allen Brooks %T Detecting Structure by Symbolic Constructions on Tokens %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-10 %K AI06 %X discusses the interpretation of dot patterns, comparison of feature detection structure-detection and energy-summation systems. %A Allen Brookes %A Kent A. Stevens %T The Analogy Between Stereo Depth and Brightness Contrast %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-11 %K AI06 AI08 AA01 AA10 %A Virginia M. Lo %A David Chen %T Intelligent Scheduling in Distributed Computing Systems %R CIS-TR-86-14 %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %K H03 AI01 %X applies expert system technology to task migration on distribution systems including dealing with out of date system load tables %A Kent A. Stevens %A Allen Brookes %T Theory of Depth Reconstruction in Stereopsis %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-15 %K AI06 AI08 AA01 AA10 ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Tue Jun 2 03:27:28 1987 Date: Tue, 2 Jun 87 03:27:19 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #137 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Tue, 2 Jun 87 03:22 EDT Received: from relay.cs.net by RELAY.CS.NET id ad21248; 2 Jun 87 3:03 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa10495; 2 Jun 87 3:03 EDT Date: Mon 1 Jun 1987 20:35-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #137 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Tuesday, 2 Jun 1987 Volume 5 : Issue 137 Today's Topics: Bibliography - Leff ai.bib49TR ---------------------------------------------------------------------- Date: Sun, 31 May 1987 14:56 CST From: Leff (Southern Methodist University) Subject: ai.bib49TR %A Fil Fuma %A Erick Krotkov %A John Summers %T The Pennsylvania Active Camera System %I University of Pennsylvania %R MS-CIS-86-15 %K AI06 %A Tim Finin %A Aravind K. Joshi %A Bonnie Lynn Webber %T Natural Language Interactions with Artificial Experts %I University of Pennsylvania %R MS-CIS-86-16 %K AI01 AI02 O01 %A Dale A. Miller %A Gopalan Nadathur %T Higher-Order Logic Programming %I University of Pennsylvania %R MS-CIS-86-17 %K AI10 T02 %A Eric Krotkov %T Focusing %I University of Pennsylvania %R MS-CIS-86-22 %K AI06 %X automatic focusing of a computer controlled camera %A Rusena Bajcsy %A Eric Krotkov %A Max Mintz %T Models of Errors and Mistakes in Machine Perception %I University of Pennsylvania %R MS-CIS-86-26 %K AI06 stereo %A Aravind K. Joshi %A Bonnie L. Webber %A Ralph M. Weischedel %T Some Aspects of Default Reasoning in Interactive Discourse %I University of Pennsylvania %R MS-CIS-86-27 %K AI02 %A Yuen-Wah Eva Ma %A Ramesh Krishnamurti %A Bhagirath Narahari %A Dennis G. Shea %A Kwang-shi Shu %T High Performance Special-Purpose Computer Architectures for Robotics Applications %I University of Pennsylvania %R MS-CIS-86-28 %K H03 AI06 AI07 %A Dale A. Miller %A Gopalan Nadathur %T Some Uses of Higher Order Logic in Computational Linguistics %I University of Pennsylvania %R MS-CIS-86-31 %K AI10 AI02 %A Robert Rubinoff %T Adapting Mumble: Experience with Natural Language Generation %I University of Pennsylvania %R MS-CIS-86-32 %K text generation %K AI10 T02 %A Ethel Schuster %T Towards a Computational Model of Anaphora in Discourse: References to Events and Actions %R MS-CIS-86-34 %I University of Pennsylvania %K AI02 %A Tim Finin %A David Drager %T $GUMS sub 1$: A General User Modeling System %R MS-CIS-86-35 %I University of Pennsylvania %K AI08 O01 AA15 %A Robert Kass %A Ron Katriel %A Tim Finin %T Breaking the Primitive Concept Barrier %R MS-CIS-86-36 %I University of Pennsylvania %K AI16 KL-ONE %X describes extensions to KL-ONE %A Anthony S. Kroch %A Aravind K. Joshi %T Analyzing Extraposition in A Tree Adjoining Grammar %R MS-CIS-86-37 %I University of Pennsylvania %K AI02 %A Martha Elizabeth Pollack %T Inferring Domain Plans in Question-Answering %R MS-CIS-86-40 %I University of Pennsylvania %K AI08 O01 %A Brant A. Cheikes %T Research in Artificial Intelligence at the University of Pennsylvania %R MS-CIS-86-41 %I University of Pennsylvania %K AT09 AI16 %A Susan B. Davidson %A Mark M. Winkler %T Conflict Resolution in Class Conflict Graph Analysis %R MS-CIS-86-43 %I University of Pennsylvania %K conflict resolution AI16 %A Jean H. Gallier %A Stan Raatz %T Extending SLD-Resolution to Equational Horn Clauses Using E-Unification %I University of Pennsylvania %R MS-CIS-86-44 %K AI10 %A Dale Miller %A Amy Felty %T An Integration of Resolution and Natural Deduction Theorem Proving %I University of Pennsylvania %R MS-CIS-86-47 %K AI11 %A Sharon A. Stansfield %T A Rudimentary Active Multimodal, Intelligent System for Object Categorization %I University of Pennsylvania %R MS-CIS-86-48 %K AI06 %A Mark Turner %T Texture Discrimination by Gabor Functions %I University of Pennsylvania %R MS-CIS-86-51 %K AI06 %A Megumi Kameyama %T A Property-Sharing Constraint in Centering %I University of Pennsylvania %R MS-CIS-86-52 %K AI02 pronoun resolution %A Dale Miller %T A Theory of Modules for Logic Programming %I University of Pennsylvania %R MS-CIS-86-53 %K AI10 %A Claire Socolovsky Caine %T An Expert System for Marine Umbrella Liability Insurance Underwriting %I University of Pennsylvania %R MS-CIS-86-54 %K AA06 %A Gerald P. Stoloff %T Lanpick -- An Expert System for Recommendation of Local Area Network Hardware and Software Products %I University of Pennsylvania %R MS-CIS-86-55 %K AA08 %A Franc Solina %T Object Recognition Using Function Based Category Models %I University of Pennsylvania %R MS-CIS-86-56 %K AI06 %A Robert Kaas %T The Role of User Modelling in Intelligent Tutoring System %I University of Pennsylvania %R MS-CIS-86-58 %K AA07 AI08 %A Jean H. Gallier %A Stan Raatz %T Refutation Methods for Horn Clauses with Equality Based on Unification %I University of Pennsylvania %R MS-CIS-86-59 %K AI10 %A Megumi Kameyama %T Japanese Zero Pronominal Bindings: Where Syntax and Discourse Meet %I University of Pennsylvania %R MS-CIS-86-60 %K AI02 %A Robert Kaas %A Tim Finin %T The Role of User Models in Question Answering Systems %I University of Pennsylvania %R MS-CIS-86-63 %K AI01 AI08 personal investment AA06 %A Aravind K. Joshi %T An Introduction to Tree Adjoining Grammars %I University of Pennsylvania %R MS-CIS-86-64 %K AI06 AT08 %A Alex Pelin %A Jean Gallier %T Solving Word Problems in Free Algebras Using Complexity Functions %I University of Pennsylvania %R MS-CIS-86-65 %K AI11 %A Jugal Kalita %A Sunish Shende %T Generation of Natural Language Text Describing a System of Asynchronous, Concurrent Processes %I University of Pennsylvania %R MS-CIS-86-66 %A Hugh F. Durrant-Whyte %T Integration, Coordination and Control of Multi-Sensor Robot Systems %I University of Pennsylvania %R MS-CIS-86-67 %K AI06 AI07 blackboard AI01 %A Greg Hager %A Hugh F. Durrant-Whyte %T Information and Multi-Sensor Coordination %I University of Pennsylvania %R MS-CIS-86-68 %K AI07 AI06 H03 %A Tim Finin %T NFL- A Novices Frame Language %I University of Pennsylvania %R MS-CIS-86-71 %K AT18 T01 T03 %A Bonnie Lynn Webber %T Two Steps Closer to Event Reference %I University of Pennsylvania %R MS-CIS-86-74 %K AI02 AI16 %A Greg Hagar %T Active Reduction of Uncertainty in Multi-Sensor Systems %I University of Pennsylvania %R MS-CIS-86-76 %K H03 O04 %A Lokendra Shastri %T Massive Parallelism in Artificial Intelligence %I University of Pennsylvania %R MS-CIS-86-77 %K H03 %A Lokendra Shastri %A Raymond L. Wairous %T Learned Phonetic Discrimination Using Connectionistic Networks %I University of Pennsylvania %R MS-CIS-86-78 %K H03 AI05 %A Linda Ness %T Reducing Linear Recursion to Transitive Closure %I University of Texas at Austin, Department of Computer Sciences %R TR-86-25 %K AA09 AI10 %D NOV 1986 %X shows how to deal with a recursively expressed logic program that is designed to query a database %A David A. Schmidt %A Jacek Leszczylowski %T On Developing a Logic for Program Derivation and Verification %I Iowa State University Computer Science Department %R TR#86-16 %D NOV 1986 %K AA08 AI10 intuitionistic type theory predicate calculus %A James M. Bieman %A Albert L. Baker %A Paul M. Clites %A David A. Gustafson %A Austin C. Melton %T A Standard Representation of Imperative Language Programs %I Iowa Sate University Computer Science Department %R TR #86-17 %D NOV 1986 %K AA08 %A Ken-Chih Liu %A Rajshekhar Sunderraman %T Applying an Extended Relational Model to Indefinite Deductive Databases %I Iowa State University Computer Science Department %R TR #86-18 %D NOV 1986 %K AI10 AA09 %A Jacek Leszczylowski %A Jan Maluszynski %T Logic Programming with External Procedures: Introducing S-Unification %I Iowa State University Computer Science Department %R TR #86-21 %D DEC 1986 %K AI10 %A Chen %A Chi %A Ost %A Sabbaugh %A Spring %T Scheme Graphics Reference Manual %I Indiana University Computer Science Department %R TR 144 %D 1984 %K T01 %A Daniel P. Friedman %A Pee-Hong Chen %T Prototyping Data Flow by Translation Into Scheme %I Indiana University Computer Science Department %R TR 147 %D 1983 %K T01 %A Mitchell Wand %T A Semantic Algebra for Logic Programming %I Indiana University Computer Science Department %R TR 148 %D August 1983 %K AI10 %A Kent Dybvig %T C-Scheme Reference Manual %I Indiana University Computer Science Department %R TR 149 %D SEP 1983 %K T01 %A J. Barnden %T On Short-Term Information-Processing in Connectionist Theories %I Indiana University Computer Science Department %R TR 152 %D JAN 1984 %K H03 %A D. Friedman %A C. Hayes %A E. Kohlbecker %A M. Wand %T Scheme 84 Interim Reference Manual %R TR 153 %D JUN 1985 %I Indiana University Computer Science Department %K T01 %A E. Kohlbecker %T eu-Prolog: Reference Manual and Report %R TR 155 %D APR 1984 %I Indiana University Computer Science Department %K T02 %A C. D. Halpern %T An Implementation of 2-Lisp %R TR 160 %D JUN 1984 %I Indiana University Computer Science Department %K T01 %A L. D. Sabbagh %T Scheme as an Interactive Graphics Programming Environment %R TR 166 %D FEB 1985 %I Indiana University Computer Science Department %K T01 %A J. A. Barnden %T Representations of Intensions, Representations as Intensions, and Propositional Attitudes %R TR 172 %D JUN 1985 %I Indiana University Computer Science Department %K AI02 AI16 %A Johnathan Rees %A W. D. Clinger %T Revised Report on Scheme %R TR 174 %D AUG 1986 %I Indiana University Computer Science Department %K AI06 %$ 6.00 %A M. W. Lugowski %T Why Artificial Intelligence is Necessarily Ad Hoc: One's Thinking/Approach/ Model/Solution Rides on One's Metaphors %R TR 176 %D AUG 1985 %I Indiana University Computer Science Department %K AI16 %$ 2.00 %A S. C. Kwasny %A J. Dalby %A R. Port %T Rules for Automatic Mapping Between Fast and Slow Speech %R TR 175 %D JUL 1985 %I Indiana University Computer Science Department %K AI05 %A Matthias Felleisen %T Transliterating Prolog into Scheme %R TR 182 %D OCT 1985 %I Indiana University Computer Science Department %K T01 T02 %A Christopher T. Haynes %T Logic Continuations %R TR 183 %D NOV 1985 %I Indiana University Computer Science Department %K AI10 %A John A. Barnden %T Imputations and Explications: Representational Problems in Treatments of Propositional Attitudes %R TR 187 %D JAN 1986 %I Indiana University Computer Science Department %K AI16 %A Erich J. Smythe %T The Pleasures of SINN: A System for Programming Connectionist Models %R TR189 %D FEB 1986 %I Indiana University Computer Science Department %K FEB 1986 %A Matthias Felleisen %A Daniel P. Friedman %T Control Operators, the SECD-Machine and the $lambda$-calculus %R TR 197 %D JUN 1986 %I Indiana University Computer Science Department %K T01 %A Eugene E. Kohlbecker %T Syntactic Extensions in the Programming Language Lisp %R TR 199 %D AUG 1986 %I Indiana University Computer Science Department %K T01 %$ 12.00 (Ph. D. Dissertation) %A Matthias Felleisen %T A Final Scheme-Word on Landin's J-Operator %R TR 205 %D NOV 1986 %I Indiana University Computer Science Department %K T01 %A Bipin Indurykha %T Analogies and Metaphors: An Interdisciplinary Perspective %R BUCS Tech Report #86-012 %D DEC 1986 %I Boston University Department of Computer Science %K AI08 AI16 AI02 %A Michael Siegel %T Automatic Rule Derivation for Semantic Query Optimization %R BUCS Tech Report #86-013 %D DEC 1986 %I Boston University Computer Science Department %K AA09 AI01 %A Leonard Uhr %T Toward a Computational Information-Processing Model of Object Perception %I University of Wisconsin-Madison, Computer Sciences Department %R TR651 %D JUL 1986 %K AI08 AI06 %X describes what is known and is necessary for development of a model of visual perception in humans as well as those points of information that are lacking. %A Matthew J. Thazhuthaveetil %T A Structured Memory Access Architecture for LISP %I University of Wisconsin-Madison, Computer Sciences Department %R TR658 %D AUG 1986 %K H02 T01 %A Udi Manber %T Using Mathematical Induction to Design Computer Algorithms %I University of Wisconsin-Madison, Computer Sciences Department %R TR660 %D AUG 1986 %K AA08 AI11 %A M. A. Sridhar %T Efficient Algorithms for Multiple Pattern Matching %I University of Wisconsin-Madison, Computer Sciences Department %R TR661 %D AUG 1986 %K O06 %A Charles V. Steward %A Charles R. Dyer %T A Scheduling Algorithm for the Pipelined Image-Processing Engine %I University of Wisconsin-Madison, Computer Sciences Department %R TR664 %D SEP 1986 %K AI06 H03 %A Nian Li %A Leonard Uhr %T Comparative Timings for a Neuron Recognition Program on Serial and Pyramid Computers %I University of Wisconsin-Madison, Computer Sciences Department %R TR665 %D SEP 1986 %K AA10 AI06 H03 %X a system to recognize neurons in photomicrographs %A Gilbert Verghese %A Shekhar Mehta %A Charles R. Dyer %T Image Processing Algorithms for the Pipelined Image-Processing Engine %I University of Wisconsin-Madison, Computer Sciences Department %R TR668 %D SEP 1986 %K local peak detection median filtering thinning Hough transform photometric stereo AI06 O06 H03 %A Mitali Bhattacharyya %A David Cohrs %A Barton Miller %T Implementation of a Visual UNIX Process Connector %I University of Wisconsin-Madison, Computer Sciences Department %R TR677 %D DEC 1986 %X An environment for connecting several UNIX processes. Not specifically AI related %A Ze-Nian Li %A Leonard Uhr %T Pyramid Vision Using Key Features to Integrate Image-Driven Bottom-Up and Model-Driven Top Down Processes %I University of Wisconsin-Madison, Computer Sciences Department %D DEC 1986 %R TR678 %K H03 AI06 %A Charles R. Dyer %T Multiscale Image Understanding %I University of Wisconsin-Madison, Computer Sciences Department %R TR679 %D DEC 1986 %K texture AI06 %A G. T. Toussaint %T Computational Geometry and Morphology %I McGill University, School of Computer Science %R TR-SOCS-86.3 %D FEB 1986 %K AA10 AI06 O06 %X applications of such algorithms as hulls, medial axis, geodesic and visibility for polygons to understanding biological shape and shape change. %A R. De Mori %A L. Lam %A M. Gilloux %T Learning and Plan Refinement in a Knowledge-Based System for Automatic Speech Recognition %R TR-SOCS-86.14 %I McGill University, School of Computer Science %D MAY 1986 %K AI09 AI04 AI05 %X experimental work on recognition of connected letters by 100 speakers %A Heedong Ko %A Kunwoo Lee %T Toward a Practical Planning System for Assembly Tasks %R Department of Computer Science File 957 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AA26 %A Carl Thomas Uhrik %T A Rule Exerciser for Knowledge Base Enhancement in Expert Systems %R Department of Computer Science File 969 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AI01 O04 AA23 AA10 %X The system has been applied to soybean diagnosis and monkey behavior discrimination %A Kenneth D. Forbus %A Dedre Gentner %T Learning Physical Domains: Toward a Theoretical Framework %R Department of Computer Science File 1247 %I University of Illinois at Urbana-Champaign %D DEC 1986 %K AI08 AI04 %A Steven Greenbaum %T Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic %R Department of Computer Science File 1298 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AI11 %X the aim is opposed to solve small sized problem with little or no human guidance as opposed to other systems which are designed to solve large problems with human guidance. Uses priority-based search strategy, discrimination networks and Knuth-Bendix method %A Brian Falkenhainer %T An Examination of the Third State in the Analogy Process: Verification- Based Analogical Learning %R Department of Computer Science File 1302 %I University of Illinois at Urbana-Champaign %D OCT 1986 %K AI04 qualitative models liquid flow and heat flow %A Y-L. Steve %A Daniel D. Gajski %T LES: A Layout Expert System %R Department of Computer Science File 1308 %I University of Illinois at Urbana-Champaign %D NOV 1986 %K AA04 %X A layout system that is competitive with human designers %A Krish Purswani %A Larry Rendell %T A Probabilistic Reasoning-Based Approach to Machine Learning %R Department of Computer Science File 1311 %I University of Illinois at Urbana-Champaign %D DEC 1986 %K AI03 O04 %A Yoram Ofer Moses %T Knowledge in a Distributed Environment %D MAR 1986 %R STAN-CS-86-1120 %I Stanford University Computer Science %K H03 %X Discusses the effects of unreliable communications on coordination of an expert system, the Byzantine agreement problem and the "cheating wives" puzzle .br br 15.00 104 pages %A Glenn Douglas Rennels %T A Computational Model of Reasoning from the Clinical Literature %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1122 %K AA01 AI01 %X discusses getting information from the clinical literature into an AI system for patient care. Example problem is "breast cancer management options." .br br 244 pages 15.00 %A H. Penny Nii %T Blackboard Systems %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1123 %X general review of black board systems .br br 86 pages, 10.00 %A Daniel J. Scales %T Efficient Matching Algorithms for the SOAR/OPS5 Production System %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1124 %K T03 AI01 %X 50 pages 10.00 %A Eric Schoen %T The CAOS System %D MAR 1986 %I Stanford University Computer Science %R STAN-CS-86-1125 %K H03 O03 %X a real time Lisp distributed system for signal interpretations .br br 69 pages 10.00 %A Byron Davies %T CAREL: A Visible Distributed Lisp %D MAR 1986 %R STAN-CS-86-1126 %I Stanford University Computer Science %K H02 H03 T01 %X A system programming language that runs on the TI Explorer that includes real time display of the processor activity and data communications; useful as an educational tool .br br 15 pages 5.00 %A Yonathan Malachi %T A Timely Resolution %D MAR 1986 %R STAN-CS-86-1127 %I Stanford University Computer Science %K AI11 AI10 T01 T02 H03 TABLOG unification %X 15.00 145 pages %A Evan R. Cohn %A Ramsey W. Haddad %T Beta Operations: Efficient Implementation of a Primitive Parallel Operation %D AUG 1986 %R STAN-CS-86-1129 %I Stanford University Computer Science %K H03 %X The Beta Operation can be performed in O(log N + log **2 M) time on a hypercube where N is the size of the input and M is the size of the output. .br br 5.00, 18 pages %A Vishvjit S. Nalwa %A Thomas O. Binford %T On Detecting Edges %R STAN-CS-86-1130 %D MAR 1986 %I Stanford University Computer Science %K AI06 %X Proposed method will localize edges to within a thilrd of a pixel if step-size over noise ratio > 2.5 .br br 50 pages 10.00 %A Yehoshua Sagiv %T Optimizing Datalog Programs %R STAN-CS-86-1132 %D MAR 1986 %I Stanford University Computer Science %K AI10 %X Prolog programs without function symbols are optimized. Also defines a new form of equivalence under which such programs can be compared. .br br 30 pages, 50.00 %A Richard James Treitel %T Sequentialization of Logic Programs %R STAN-CS-86-1135 %D NOV 1986 %I Stanford University Computer Science %K AI10 %X 16 pages 15.00 %A Harold Brown %A Erich Schoen %A Bruce Delogi %T An Experiment in Knowledge-based Signal Understanding Using Parallel Architectures %R STAN-CS-86-1136 %D OCT 1986 %I Stanford University Computer Science %K H03 AA18 T01 %X System was tested on radar emissions from air craft .br br 36 pages 5.00 ------------------------------ End of AIList Digest ********************