1-Sep-87 21:11:39-PDT,12386;000000000000 Mail-From: LAWS created at 1-Sep-87 21:01:44 Date: Tue 1 Sep 1987 20:56-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #208 - Philosophy of Science, Logic Puzzles To: AIList@SRI.COM AIList Digest Wednesday, 2 Sep 1987 Volume 5 : Issue 208 Today's Topics: Queries - Hypertext & Humble Expert System Shell & Prolog on the Sun & VM Lisp, Database - AI References, Logic - Beyond Mr.P and Mr.S., Humor - The House of (Knowledge) Representatives, Philosophy - Programming as Experimental Science ---------------------------------------------------------------------- Date: Mon Aug 31 16:35:16 1987 From: omepd!littlei!foobar!sdp!sdp@seismo.CSS.GOV Subject: Hypertext Hello, Source code from _AI_Expert_ magazine used to be available in the newsgroup comp.ai. They seem to have stoppped posting them. Does anyone know what happened? [I had to drop code listings from the AIList subject matter. David Streiff%HARTFORD.BITNET took over Bitnet distribution. I don't know a good source for other networks. -- KIL] I'm looking for a program called HYPE. It's a small hypertext editor written in Turbo Pascal. Anyone know of any other interesting PD hypertext code? Is there a hypertext mailing list or discussion group anywhere on the net? Is there demand for one? Thanks, Scott Peterson OMO Software Intel, Hillsboro OR sdp.hf.intel.com!sdp omepd.intel.com!littlei!foobar!sdp!sdp ------------------------------ Date: 31 Aug 87 16:21:32 GMT From: umnd-cs!umn-cs!umdcs@ucbvax.Berkeley.EDU (The UMD Guy .. ) Subject: Humble Expert System Shell I am interested in hearing from anyone who is using Smalltalk/Humble particularly (especially) on a Mac. A few questions: Is one meg of memory enough? Are there any bugs that can't be worked around? (e.g. Tracing forward and backwards for rule explanation) Does Humble integrate with any other packages, if so, which? Thanks in advance .. -Jeff ------------------------------ Date: 1 Sep 87 21:22:37 GMT From: mtune!mtgzy!mas@RUTGERS.EDU (m.a.shariff) Subject: Prolog on the Sun Does anybody out there have a list of Prolog's available for a Sun machine, preferably with comparative performance ? Thanks Masood Shariff AT&T Middletown, NJ 07748 (201) 957-5479 ...!mtgzy!mas ------------------------------ Date: 31 AUG 87 11:04-EDT From: TEACH07%UC780.BITNET@wiscvm.wisc.edu Subject: VM Lisp I have a friend, Ron Jewell, who has devoted considerable time and energy to developing a readable user manual for VM Lisp. The manual is being used by an instructor at the University of Maryland for teaching Lisp. Ron is interested in making contact with other sites using VM Lisp in order to share information on the product and his manual. Anyone out there using VM Lisp? ------------------------------ Date: 31 Aug 87 15:17:00 GMT From: ihnp4!inuxc!iuvax!tenny@ucbvax.Berkeley.EDU Subject: AI references Many thanks to all those kind-hearted netlanders who contributed to the AI reference database. Unfortunately, some of you provided return addresses to which all reply attempts failed. In an effort to get the database to these contributors (and everyone else), the database is now available via anonymous ftp from iuvax.cs.indiana.edu. The file of interest is: pub/references/ai.bib Larry Tenny tenny@iuvax.indiana.edu ------------------------------ Date: 28 Aug 87 22:05:37 GMT From: vanhove@XN.LL.MIT.EDU (Patrick Van Hove) Subject: Beyond Mr.P & Mr.S. I had a somewhat different story of the same type. A door-to-door vacuum cleaner sales person tries his pitch to this uncompassionate mother-at-home-with-kids-screaming-behind and after two minutes, the following dialog ensues mother: Before you go any further, I just want to see if you are really as much >mister-smart< as you pretend. Let's see. My husband noticed a while ago that since the last birthday, the product of the ages of my three daughters is exactly the number on our house. If I add that the sum of their ages is 13, can you figure out how old they are? (Note: integer ages; integer house-numbers;) salesman (after thinking for a while): Well, I think I'm sorry I can't mother: OK, you're right, I made it tough on you, but I have to go now and drive my oldest daughter to her piano lesson. salesman: Your oldest daughter? Well then, I think I know the answer now: their ages are >CENSORED<, >CENSORED< and >CENSORED<. mother: Now I'm impressed! I'll get a dozen of those cleaners of yours. Well, reader, can you figure it out now? Of course you don't even know the number on the house, but who said this was going to be easy? Patrick "No wind today, so I'm hacking" ------------------------------ Date: Fri, 28 Aug 87 22:58:12 EDT From: "Keith F. Lynch" Subject: S and P Puzzle I first saw it in November 1978, in a slightly different form. ...Keith ------------------------------ Date: 1-SEP-1987 15:34:25 From: UBACW59%cu.bbk.ac.uk@Cs.Ucl.AC.UK Subject: The House of (Knowledge) Representatives. It is proposed that the legislature be replaced by expert systems. The only problem seems to be that there might be a lack of discourse, since each system would be a perfect model of human intelligence, and therefore the house could not fail be of one mind. The Joka. ------------------------------ Date: Fri, 28 Aug 87 13:00:41 bst From: Mike Wilson Subject: Empirical AI ? In V5 #201 Andrew Jenning suggested that AI is empirical research. In V5 #205 Spencer Star countered that it is not since programs do not confirm or disconfirm theories and do not yield replicable quantitative results. Programs are implementations of models. Models are instantiations of theories. Theories suggested by a large range of cognitive scientists can be empirically tested by writing programs (e.g. Newell, Anderson, Johnson-Laird, the PDP group, Norman and Rumelhart etc...). If the theory states that certain phenomina can be produced from a set of processing assumptions and a set of data, and a program embodying these assumptions and using such data cannot produce the phenomina to an level of abstraction acceptable to the theory, then the theory is disproved. The requirement that enables programs to act as tests is that the instantiating and implementational tradeoffs made are not contrary to any part of the theory. The instantiation and implementation processes may involve the recruitment of additional assumptions to those in the theory, which the theorist may wish to add to the theory, but this is optional; these additional assumptions specify a program which is one of a set of programs which could be derived from the theory. The test can be replicated using other programs derivable from the theory. The use of models (implemented in programs or toy construction sets) can act as tests of theories. Michael Wilson SERC Rutherford Appleton Laboratory U.K. ------------------------------ Date: 28 Aug 87 13:22:12 GMT From: Michael P. Smith Reply-to: mps@duke.UUCP (Michael P. Smith) Subject: Re: Should AI be scientific? If yes, how? Article-I.D.: duke.10112 In article <8708251656.AA14266@cs.utah.edu> cs.utah.edu!shebs@cs.utah.edu (Stanley Shebs) writes: > >Goedel's and Turing's ghosts are looking over our shoulders. We can't do >conventional science because, unlike the physical universe, the computational ^^^^^^^^^^^^^^^^^ >universe is wide open, and anything can compute anything. Minute examination ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ >of a particular program in execution tells one little more than what the >programmer was thinking about when writing the program. > [emphasis added] Would you please explain this tantalizing remark? Surely not every formal system can compute every function (what about the ghost of Chomsky?). Are you alluding to the mutual emulatability of Turing machines? Or maybe the moral is functionalism (as philosophers use the term): that in matters computational, it's form and not matter that matters. And how does Goedel fit in? I suspect it's his completeness theorem and not his incompleteness results you have in mind. Finally, how does the third sentence follow from the second? Thanks. "Just as a vessel is a place that can be carried around, so place is a vessel that cannot be carried around." Aristotle Michael P. Smith ARPA: mps@duke.cs.duke.edu ------------------------------ Date: Fri, 28 Aug 87 11:34 EDT From: rjz@JASPER.Palladian.COM Reply-to: rjz%JASPER@LIVE-OAK.LCS.MIT.EDU Subject: Re: Natural kinds In McCarthy's message of Jul 10, he talks of the need for AI systems to be able to learn and use "natural kinds", meaning something like "empirically determined categorizations of objects and phenomena in the experience of an individual". A response by Causey (Jul 18) describes a "natural kind" as something with "nomologically determined attributes", and specifically distinguished this from a "functional concept" such as a chair. First: what is the correct definition of a "natural kind" in philosophical usage? What precisely does it cover, and why can't a "functional definition" define a natural kind? Second: Sidestepping the terminological issue, McCarthy's original point is the more crucial: that people seem to be able to classify objects in the absence of precise information. This is important if individuals are to "make sense" of their world, meaning they are able to induce any significant generalizations about how the world works. It seems clear that such generalizations must allow "functional definitions"; how else would we learn to recognize chairs, tables, and other artifacts of civilization? Perhaps we could call this expanded notion an "empirical kind". Third: Such "kinds" are especially important for communicating with other individuals, since communication cannot proceeed without mutually-accepted points of reference, just as induction cannot proceed without "natural kinds". Being based on individual experience, no two persons' conceptions of a given concept can be assumed to correspond _exactly_. Yet communication is for the most part not deterred by this. It would be a great convenience,implementation-wise, if this meant that precise definitions of "kinds" are unnecessary in [AI] practice. Roland J. Zito-wolf Palladian Software Cambridge, Mass 02142 RJZ%JASPER@LIVE-OAK.LCS.MIT.EDU ------------------------------ Date: Fri, 28 Aug 87 13:04:19 pdt From: Eugene Miya N. Subject: Re: AIList V5 #201 - Philosophy of Science, AI Paradigms In article <556829438.star@h.gp.cs.cmu.edu> Spencer Star wrote: >In V5 #201 Andrew Jenning suggests that AI is empirical research when a >programmer writes a program because we have some definite criteria: >either the program works or it does not. Unfortunately, this view is >rather widespread. Also, it is wrong. It fact, it was a rather well known AI researcher who reinforced this view. I liked Stan Steb's posting just before this one which took a more forward looking view [I had minor disagreements, but who cares]. What AI SHOULD be: more concern with the empirical, more experimental in the traditional sense of the word, let's at least give these reviewers and Don Norman a positive nod, and try to improve the WAY we do our work, as well as try to improve our work. --eugene ------------------------------ End of AIList Digest ******************** 3-Sep-87 23:56:48-PDT,10770;000000000000 Mail-From: LAWS created at 3-Sep-87 23:40:05 Date: Thu 3 Sep 1987 23:37-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #209 - Neural Networks, Planning/Scheduling Systems To: AIList@SRI.COM AIList Digest Friday, 4 Sep 1987 Volume 5 : Issue 209 Today's Topics: Query - Researchers in Neural/Connectionist Robotics & Neural Networks Simulations in Smalltalk/LISP/(Prolog) & Neural Networks & Unaligned fields, Database - AI Expert Magazine Source Code, AI Tools - Commercial Planning/Scheduling Systems ---------------------------------------------------------------------- Date: Thu, 3 Sep 87 09:05 PDT From: nesliwa%telemail@ames.arpa (NANCY E. SLIWA) Subject: Researchers in neural/connectionist robotics? A colleague of mine is attempting to organize a session for the American Controls Conference in neural/connectionist approaches/applications to robotics (other that strictly image processing). Could anyone suggest the names/addresses/phone numbers of researchers in this area? Particularly other than Kuperstein, Jorgensen, and Pellionisz. Thanks in advance. Nancy Sliwa MS 152D NASA Langley Research Center Hampton, VA 23665-5225 (804)865-3871 nancy@grasp.cis.upenn.edu nesliwa%telemail@orion.arpa ------------------------------ Date: 2 Sep 87 20:11:21 GMT From: plx!titn!jordan@sun.com (Jordan Bortz) Subject: NEURAL NETWORKS SIMULATIONS IN Smalltalk/LISP/(prolog) Has anyone implemented any neural network simulations in any of the above languages? Huh? Jordan -- ============================================================================= Jordan Bortz Higher Level Software 1085 Warfield Ave Piedmont, CA 94611 (415) 268-8948 UUCP: (decvax|ucbvax|ihnp4)!decwrl!sun!plx!titn!jordan ============================================================================= ------------------------------ Date: 3 Sep 87 21:53:45 GMT From: hao!boulder!mikek@husc6.harvard.edu (Mike Kranzdorf) Subject: Re: NEURAL NETWORKS SIMULATIONS IN Smalltalk/LISP/(prolog) >Has anyone implemented any neural network simulations in any of the >above languages? Try P3 from UCSD Institute of Cognitive Science (LISP) Contact David Zipser You can find out more about it from the PDP books (Ch. 13 I believe) --mike ------------------------------ Date: 2 Sep 87 19:18:10 GMT From: ihnp4!inuxc!iuvax!ndmath!milo@ucbvax.Berkeley.EDU (Greg Corson) Subject: Neural Networks & Unaligned fields Ok, here's a quick question for anyone who's getting into Neural Networks. If you setup the type of network described in BYTE this month, or the type used in the program recently posted to the net, what happens if you feed it an input image that is not aligned right? For example, in the Byte article they demonstrate correct recall of an image corrupted by randomly flipping a number of bytes, simulating "noise". What would happen if they just shifted the input image one or two bits to the left? Would the network still recognize the pattern? Greg Corson ...seismo!iuvax!ndmath!milo ------------------------------ Date: Thu 3 Sep 87 10:01:52-PDT From: Ken Laws Reply-to: AIList-Request@SRI.COM Subject: Re: Neural Networks & Unaligned fields The current networks will generally fail to recognize shifted patterns. All of the recognition networks I have seen (including the optical implementations) correlate the image with a set of templates and then use a winner-take-all subnetwork or a feedback enhancement to select the best-matching template. Vision researchers were doing this kind of matching (for character recognition, with the character known to be centered in the visual field) back in the 50s and early 60s. Position independence was then added by convolving the image and template, essentially performing the match at every possible shift. This was rather expensive, so Fourier, Hough, and hierarchical matching techniques were introduced. Then came edge detection, shape description, and many other paradigms. We don't have all the answers yet, but we've come a long way from the type of matching currently implemented in neural networks. The advantage of the networks, particularly those implemented in analog hardware, is speed. IF you have a problem for which alignment is known, or IF you have time or hardware to try all possible alignments, or IF your network is complex enough to store all templates at a sufficient number of shifts, neural networks may be able to give you an off-the-shelf recognizer that bypasses the need to research all of the pattern recognition literature of the last decade. I suspect that the above conditions will actually hold in a fair number of engineering situations. Indeed, many of these applications have already been identified by the signal processing community. Neural networks offer a trainable alternative to DSP or acoustic convolution chips. Where rules and explanations are appropriate, designers will use expert systems; otherwise they will neural networks and similar systems. Only the most difficult and important applications will require development of customized reasoning systems such as numerical or object-oriented simulations. -- Ken ------------------------------ Date: 3 Sep 87 15:41:53 GMT From: hao!boulder!mikek@husc6.harvard.edu (Mike Kranzdorf) Subject: Re: Neural Networks & Unaligned fields I am not familiar with the net in Byte, but I assume it is a two layer net, like the one that was posted. If this is the case, shifted patterns will not be recognized. It takes at least three layers for a net to have an internal representation of the structure of an input pattern. A good overview paper describing these kinds of conditions can be found in the IEEE ASSP (Acoustics, Speech, and Signal Processing) Magazine April 1987, Volume 4, Number 2, "An Introduction to Computing with Neural Nets" by Richard P. Lippmann. The article focuses on catagorizers, but is informative about nets in general. --mike ------------------------------ Date: 2 Sep 87 15:04:26 GMT From: ecsvax.uucp!burgin@mcnc.org (Robert Burgin) Subject: AI Expert Magazine Source Code I believe that the source code from AI EXPERT magazine is available on a New York City BBS: 303-273-3989 1200-N-8-1 --rb ------------------------------ Date: Wed, 2 Sep 87 12:03 PDT From: nesliwa%telemail@ames.arpa (NANCY E. SLIWA) Subject: Commercial planning/scheduling systems survey I recently asked for information about any commercially available products that provided computer assistance to planning/scheduling problems. I had far more requests for a copy of the responses than actual responses, so I'm posting the responses I did receive: > Date: Wed, 12 Aug 87 11:40 EST > From: KENYON%cgi.com@relay.cs.net > Subject: Planning/Scheduling software > > This may not be what you had in mind, but Carnegie Group (in Pittsburgh) > offers Knowledge Craft, an extremely powerful tool with which several > advanced planning and scheduling systems have been built. One of the > founders of the company is Mark Fox, who has done considerable research > in the area of applying AI to planning and scheduling problems. > > If you're interested in a toolkit, rather than a canned (and probably > restrictive) program, I'd suggest that you give Jay Ferguson, the > Knowledge Craft product manager a call; he can give you more technical > information on how the product might fill your needs. > > Our address here is: > > Carnegie Group Inc > 650 Commerce Court at Station Square > Pittsburgh, PA 15219 > (412) 642 6900 > > Jeff Kenyon > Educational Services > Carnegie Group > > P.S. I know, I work for them, so I'm biased. But it really is a great > product. > > Date: Tue, 11 Aug 87 14:57:55 BST > Message-Id: <714.8708111357@soay.aiva.ed.ac.uk> > To: nesliwa <@orion:nesliwa@telemail> > Subject: Your Commercial Planning/scheduling software? survey > > > My research is in the area of AI planning systems. I like the idea of doing > a survey of commercially available systems, and would like to hear the > results of your survey. > > A company called Consilium produces a Work In Progress Tracking system > which ties in with some scheduling software. Address: > > Consilium > 1945 Charleston Rd. > Mountain View CA 94043 > (415) 940 1400 > > > -- Mark Drummond > > ARPA: med%uk.ac.ed.aiva@ucl.cs > JANET: med@uk.ac.ed.aiva > Paper Mail: > AI Applications Institute > University of Edinburgh > 80 South Bridge > Edinburgh, U.K. EH1 1HN > > > Date: Mon, 10 Aug 87 14:17 EDT > From: Scott Garren > Subject: Planning Systems > > There is a very good package called XPM from: > > Expert Management Systems > 2432 West Peoria, Suite 1050 > Phoenix, Arizona 85029 > 602-870-1001 > > Date: Mon, 10 Aug 87 13:20:32 PDT > From: Michael Shafto > > The AI Magazine, Volume VII, Number 5 (Winter, 1986) > ISSN 0738-4602 [this references the Callistro Project and OPGEN] > > Best regards, > > Mike Shafto > > Date: Friday, 21 August 1987 14:19:27 EDT > From: Perry.Zalevsky@isl1.ri.cmu.edu > Subject: Request for Planning and Scheduling Software > > Nancy, > I saw your request for commercially available planning and scheduling > software and was wondering if you could pass the information that you > received on to me. Did you get info about InterFase or Factrol? Send me mail > and I can respond about the above two packages if you want. > > Perry Zalevsky I am following up these pointers with requests to the referenced companies for more specific information (also to companies I was already aware of that provided such products). Since there seems to be some interest in this area, I will post a summary of these responses when available. If any of you that did not previously respond have some additional pointers, I'd sincerely appreciate your relaying them to me! Nancy Sliwa MS 152D NASA Langley Research Center Hampton, VA 23665-5225 (804)865-3871 nancy@grasp.cis.upenn.edu nesliwa%telemail@orion.arpa ------------------------------ End of AIList Digest ******************** 7-Sep-87 21:59:12-PDT,8571;000000000000 Mail-From: LAWS created at 7-Sep-87 21:42:24 Date: Mon 7 Sep 1987 21:41-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #210 - Seminars, Conferences To: AIList@SRI.COM AIList Digest Tuesday, 8 Sep 1987 Volume 5 : Issue 210 Today's Topics: Seminars - Proving Completeness of Inference Rules (SRI) & NIAL: A Programming Language for AI (SRI), Conferences - Site and Officers for IJCAI-91 & OOPSLA 88 ---------------------------------------------------------------------- Date: Mon, 31 Aug 87 10:08:31 PDT From: lunt@csl.sri.com (Teresa Lunt) Subject: Seminar - Proving Completeness of Inference Rules (SRI) SRI COMPUTER SCIENCE LABORATORY SEMINAR ANNOUNCEMENT: PROVING COMPLETENESS OF INFERENCE RULES JEAN-PIERRE JOUANNAUD LABORATOIRE DE RECHERCHE EN INFORMATIQUE UNIVERSITE PARIS-SUD-ORSAY Tuesday, September 8 at 4:00 pm SRI International, Computer Science Laboratory, IS109 Many problems described by means of algorithms should be described by a set of inference rules plus a search plan (strategy). Not only does this viewpoint improve our understanding, but it also makes completeness proofs easier and eventually mechanizable in the following way: 1. Give a complete algebraic specification of the underlying notion of proof. 2. Associate with the inference rules a rewrite system on proofs, considered as terms. 3. Prove termination of the rewrite system on proofs. 4. Characterize proofs in normal form. 5. Show for each particular strategy that the set of normal forms is the same. This last property has been called "fairness" in term rewriting. It is actually a very general notion in theorem proving, whose proof turns out to be a non-trivial task as soon as there are "destructive" inference rules. For that reason, very few inference systems containing such rules are proved. A number of applications of this methodology will be given, including unification. NOTE: Non-SRI visitors please arrive at least 10 minutes early to be escorted to the conference room. ------------------------------ Date: Thu, 3 Sep 87 09:38:16 PDT From: lunt@csl.sri.com (Teresa Lunt) Subject: Seminar - NIAL: A Programming Language for AI (SRI) SRI COMPUTER SCIENCE LAB SEMINAR ANNOUNCEMENT: NIAL: A Programming Language for Artificial Intelligence Janice I. Glasgow Queen's University, Kingston, Canada Friday, September 18 at 10:30 am SRI International, Computer Science Laboratory, IS109 Nial is a high-level, interactive programming language that synthesizes many semantic concepts from LISP, Prolog and APL in one notational framework. It is based on the formal theory of the nested, rectangular array as a mathematical data object. Q'Nial is a portable implementation of Nial developed at Queen's University and available on many architectures including large timesharing machines, Unix systems and personal computers. One of the principal application areas of Nial is artificial intelligence. The goal of research in this area has been to provide high level tools in the language from which tailored knowledge based systems can be constructed. These tools include logic programming primitives, inference engines, a frame language, a rule interpreter and a natural language parser. This seminar will include a description Nial with particular emphasis on the application of the language to decision support and knowledge based systems. NOTE: Non-SRI visitors please arrive at least 10 minutes early to be escorted to the conference room. ------------------------------ Date: Wed, 2 Sep 87 17:09:55 GMT From: Alan Bundy Subject: Conference - Site and Officers for IJCAI-91 At its meeting during IJCAI-87, the 1987 IJCAI Executive Committee took the following decisions about IJCAI-91. Site: Sydney, Australia. Conference Chair: Barbara Grosz, University of Harvard. Program Chairs (joint): Ray Reiter & John Mylopoulos, University of Toronto. The conference is provisionally scheduled for the 3rd week of August 1991. Alan Bundy Executive Committee Chair ------------------------------ Date: 29 Aug 87 17:05:54 GMT From: hp-pcd!uoregon!omepd!intelisc!littlei!ogcvax!maier@hplabs.hp.com (Prof. David Maier) Subject: Conference - OOPSLA 88 OOPSLA-87 invites you to attend the second annual conference devoted to applications, research and implementation of object-oriented systems, October 4 - 8, 1987, in Orlando, Florida. OOPSLA-87 includes tutorials, technical sessions, panels, and vendor exhibits. Conference Schedule ------------------- Sunday, 4 October - Tutorials 1A - Introduction to Obj. Oriented Concepts - Oct 4, 9AM 1B - Object Oriented Databases - Oct 4, 9AM 2A - Survey of Object-Oriented Systems - Oct 4, 1:30PM 2B - Object Oriented Programming in AI - Oct 4, 1:30PM Monday, 5 October - Tutorials 3A - Introduction to Obj. Oriented Concepts - Oct 5, 9AM 3B - Develelopment of Large Applications - Oct 5, 9AM 4A - Survey of Object-Oriented Systems - Oct 5, 1:30PM 4B - Obj. Oriented Application Frameworks - Oct 5, 1:30PM Tuesday,6 October 9 AM Keynote Address - Barbara Liskov, MIT 10:30 AM Sessions: (1A) Applications (1B) Tools/Environment 2 PM Sessions: (2A) Database (2B) Theory 4:30 PM Panels: (P1) Teaching OOP (P2) Forms of Inheritance 5:30 PM Reception in the Vendor Exhibit area Wednesday, 7 October 9 AM Panels: (P3) Use of OOP in Commercial Settings (P4) Adding OOP to Existing Languages 10:30 AM Sessions: (3A) Software Engineering (3B) Languages 2 PM Sessions: (4A) User Interfaces (4B) Implementation 4:30 PM Panels: (P5) Usability of OOP Systems (P6) Future of OOP 7 PM Banquet , speaker: Michael Jackson, Jackson Systems Ltd. Thursday, 8 October 9 AM Report: OOP Standardization Efforts 10:30 AM Sessions: (5A) Applications (3B) Software Engineering/Tools 2 PM Sessions: (4A) Database/Languages (4B) Theory Vendor Exhibits will be open Tuesday, Wednesday and Thursday. Conference Prices ACM Member $ 215 non-member $ 255 student $ 50 Tutorials are scheduled in two parallel tracks, the introductory (A) track, and the intermediate (B) track. You may register for only one session in any half-day time slot, or a maximum of 4 tutorial sessions. Tutorial price per half-day session: ACM Member $ 125 non-member $ 145 student $ 125 Extra Banquet tickets $ 30 Telex confirmation option $ 10 Pay by check or money order. Checks or money orders must be payable through a U.S. bank, and must have machine-readable account numbers. Confirmation will be sent by Telex, upon payment of the extra charge. Send registrations and requests for more information to: OOPSLA-87 P.O. Box 3845 Portland, OR 97208-3845 USA Telex: 159265412 FAX: 503 643 5931 UUCP mail: ..tektronix!ogcvax!servio!otisa ATTMAIL: aotis Send hotel reservations to: Hyatt Orlando 6375 West Space Coast Parkway Kissimmee, Florida 32741 Tel 305 396 1234 Telex 567436 Discounted airline fares are offered by Continental and Eastern . Call 800-468-7022 and mention account number EZ10T83. The Hyatt Orlando is adjacent to Walt Disney World, with shuttle bus service available from the hotel. --------------------------------------------------------- Please respond to Alan Otis, not me --Dave Maier -- David Maier, Oregon Graduate Center ...tektronix!ogcvax!maier ------------------------------ End of AIList Digest ******************** 7-Sep-87 22:09:45-PDT,14579;000000000001 Mail-From: LAWS created at 7-Sep-87 22:01:03 Date: Mon 7 Sep 1987 21:55-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #211 - Neural Networks & OPS5 & Philosophy To: AIList@SRI.COM AIList Digest Tuesday, 8 Sep 1987 Volume 5 : Issue 211 Today's Topics: Queries - FLEXIGRID & Quote & Mactivation, Neural Networks - Unaligned Fields, AI Tools - OPS5 for PC, Linguistics - Interrobangs, Philosophy - Wittgenstein and World Description Nets & Should AI be Scientific? & Leibniz on Philosophy ---------------------------------------------------------------------- Date: 3 Sep 87 18:34:38 GMT From: imagen!atari!portal!cup.portal.com!tony_mak_makonnen@ucbvax.Berk eley.EDU Subject: cognitive research tool I am going to meet Finn Tschudi in Norway sometime around Sept 17 I'll be looking at the newest version of his FLEXIGRID program , originally intended as computerized application of Kelly Rep Grid on psychological constructs ; also found useful by knowledge engineers in understanding the process of knowledge acquisition etc Anyone with any questions you want me to put to Finn ; or interest in purchasing the latest version etc let me know before that time Ciao . ------------------------------ Date: 5 Sep 87 01:34:38 GMT From: munnari!trlamct.oz!andrew@uunet.UU.NET (Andrew Jennings) Subject: quote : attributable to ? Recently somebody on comp.ai.digest suggested the following (or close to it) : "Give an AI researcher the task of banging in a nail. First he'll study hammers. Before you know it he'll be studying advanced metallurgy" Can anyone remember (preferably the author) : a) the exact words b) the author Thanks : I want to quote this in a talk, and obviously for all concerned its better if its correct. -- UUCP: ...!{seismo, mcvax, ucb-vision, ukc}!munnari!trlamct.trl!andrew ARPA: andrew%trlamct.trl.oz@seismo.css.gov Andrew Jennings Telecom Australia Research Labs (Postmaster:- This mail has been acknowledged.) ------------------------------ Date: 4 Sep 87 02:41:49 GMT From: hao!boulder!mikek@husc6.harvard.edu (Mike Kranzdorf) Subject: Mactivation > I have seen inquiries around here about neural net simulators. I have > written a program called Mactivation which simulates single and double > layer networks which can be viewed as matrix-vector multipliers. Would some who has recieved a copy of Mactivation please post it? My Mac doesn't talk to the net yet (no modem cord for my new SE). Preferably someone with 2.02 - it's a little faster but no big deal. I suppose comp.binaries.mac and comp.doc are the right places. You are all still welcome to write to me for it; posting will just make it more accessible. I'll be sure to post when there's an update. Thanks much. --mike mikek@boulder.colorado.edu ------------------------------ Date: 4 Sep 87 16:13:31 GMT From: boulder!mikek@boulder.colorado.edu (Mike Kranzdorf) Reply-to: boulder!mikek@boulder.colorado.edu (Mike Kranzdorf) Subject: Re: Neural Networks & Unaligned fields The second reference above is correct, but fails to mention work by Fukishima and Mozer. These multi-layer networks are able to form an internal distributed representation of a pattern on an input retina. They demonstrate very good shift and scale invariance. The new and improved neocognitron (Fukishima) can even recognize multiple patterns on the retina. --mike mikek@boulder.colorado.edu ------------------------------ Date: 7 Sep 87 05:47:19 GMT From: maiden@sdcsvax.ucsd.edu (VLSI Layout Project) Reply-to: maiden@sdcsvax.ucsd.edu (VLSI Layout Project) Subject: Re: Neural Networks & Unaligned fields In article <12331701930.42.LAWS@KL.SRI.Com> AIList-Request@SRI.COM writes: >The current networks will generally fail to recognize shifted patterns. >All of the recognition networks I have seen (including the optical >implementations) correlate the image with a set of templates and then >use a winner-take-all subnetwork or a feedback enhancement to select >the best-matching template. [some lines deleted] > -- Ken >------- There are a number of networks that will recognize shifts in position. Among them are optical implementations (see SPIE by Psaltis at CalTech) and the Neocognitron (Biol. Cybern. by Fukushima). The first neocognitron article dates to 1978, the latest article is 1987. There have been a number of improvements, including shifts in attention. Edward K. Y. Jung ------------------------------------------------------------------------ 1. If the answer to life, the universe and everything is "42"... 2. And if the question is "what is six times nine"... 3. Then God must have 13 fingers. ------------------------------------------------------------------------ UUCP: {seismo|decwrl}!sdcsvax!maiden ARPA: maiden@sdcsvax.ucsd.edu ------------------------------ Date: 31 Aug 87 17:25:38 GMT From: Walter Maner Subject: Re: OPS5 for PC - that's what I need!!! - (nf) > Approved: ailist@stripe.sri.com > > I'm looking for a full-blown version of OPS5 for the IBM-PC. Working > with the VAX-VMS version of OPS5, I'd like to experiment on my (not > so terribly loaded) private PC. > TOPSI - as far as I know - does not support the essential features > which make OPS5 unique: RETE-match and therefor no recency conflict One year ago, the full RETE algorithm existed in a beta version of TOPSI. It may have migrated to the regular release by now. -- CSNet : maner@research1.bgsu.edu | CS Dept 419/372-2337 UUCP : {cbatt,cbosgd}!osu-cis!bgsuvax!maner | BGSU Generic : maner%research1.bgsu.edu@relay.cs.net | Bowling Green, OH 43403 Opinion : "If you're married, you deserve a MARRIAGE ENCOUNTER weekend!" ------------------------------ Date: 7 Sep 87 19:20:09 GMT From: "Gregory J.E. Rawlins" Reply-to: gjerawlins@watdaisy.waterloo.edu (Gregory J.E. Rawlins) Subject: Re: Terminal Talk In article <8708240530.AA19550@ucbvax.Berkeley.EDU> gately%resbld@ti-csl.CSNET ("Michael T. Gately") writes: >Another interesting notation is the order of the >characters in a serial interrobang. I feel that there >is a definate difference between ?! and !?. The first >would be appropriate when describing (with disbelief) >a question someone asked. The second is used when >questioning a statement someone made. In chess annotations "!?" is used to indicate an interesting but dubious move and "?!" is used to indicate a dubious but interesting move. Chess also uses !,?,!!, and ??. greg. -- GJE Rawlins gjerawlins%watdaisy@waterloo.csnet gjerawlins@watdaisy.waterloo.edu ------------------------------ Date: 2 Sep 1987 00:22 EDT (Wed) From: Wayne McGuire Subject: Wittgenstein & World Description Nets > Date: 24 August 1987, 23:09:52 EDT > From: john Sowa > Subject: Wittgenstein and natural kinds > > Every schema in a cluster represents one valid use of the concept > type. The meaning is determined not by any definition, but by the > collection of all the permissible uses, which can grow and change with > time. > > Does that solve the problem? Maybe, but we still need criteria > for determining what kinds of uses can legitimately be added to a > cluster. Could I say "To add something means to eat it with garlic > and onions"? What are the criteria for accepting or rejecting a > proposed extension to a concept's meaning? Under the assumption that language (and all human semiotic systems), and the concepts they label, are in great part a social contract, a collection of arbitrary conventions momentarily accepted in a ceaseless process of interaction by a particular group of people in a particular space and time and culture, perhaps what is permissible is anything that any human group, through _actual usage_, indicates they find useful as a tool of communication. Human societies are much like Humpty Dumpty in _Alice in Wonderland_: "When _I_ use a word," Humpty Dumpty said in rather a scornful tone, "it means just what I choose it to mean--neither more nor less." "The question is," said Alice, "whether you _can_ make words mean so many different things." "The question is," said Humpty Dumpty, "which is to be master-- that's all." An ideal program with general intelligence would closely monitor the actual language usage and semiotic behavior of its target domain, and assimilate as new schemata in its world model those new words, signs, and concepts which reach a user-settable level of usage or which are assigned by social fiat roles as fixed conventions (fixed for the time being, of course, for the life of this particular cultural phase). One can easily imagine wanting one's world model to be more comprehensive, however, and to include highly idiosyncratic language uses that are not social conventions. Integrating the detailed mental models and private languages of all the world's leading imaginative writers, from Homer to Norman Mailer, could be valuable for the purposes of some people and with the object of constructing a humanist superintelligence. A speculation: how many new schemata enter the set of all human discourse in a year? Probably professional dictionary-makers and terminology-compilers have given some thought to this question. I recently came across an apt passage in Wittgenstein's _Tractatus Logico-Philosophicus_: I can place over the world a unified descriptive net through which I bring everything to a unitary form. According to the kind of net that I choose there results a kind of world description. If I take various nets then I produce various world descriptions. Wittgenstein then chooses mechanics as a sample world description net, and notes: "Mechanics determines one form or description of the world by saying that all propositions used in the description of the world must be obtained in a given way from a given set of propositions--the axioms of mechanics." But there are at least as many distinct world description nets as there are persons, living and dead, and probably many more, taking into account the changing mental model of an individual over time, and the sets of unique mental models of an individual in different roles and social domains. There is much redundancy in all these models, but there is also a subset of each net that is special and which includes schemata that are the only ones of their kind. Clearly artificial intelligence researchers need to pay much more attention to pragmatics and sociolinguistics: the notion that intelligence is reducible to a set of universal principles or context-free grammar rules is misguided. Ultimately AI might seek to model and integrate, in a Supreme World Net, as many Wittgensteinian world description nets as possible, to map their literal and metaphoric relations, and to track their evolution and devolution in real time. (And while we are at it, it would be nice to build a working perpetual motion machine.) Wayne McGuire ------------------------------ Date: Thu, 3 Sep 87 09:03:22 MDT From: shebs@cs.utah.edu (Stanley Shebs) Reply-to: cs.utah.edu!shebs@cs.utah.edu (Stanley Shebs) Subject: Re: Should AI be scientific? If yes, how? In article <8708281322.AA27689@duke.cs.duke.edu> duke!mps (Michael P. Smith) writes: >In article <8708251656.AA14266@cs.utah.edu> cs.utah.edu!shebs@cs.utah.edu >(Stanley Shebs) writes: >> >>Goedel's and Turing's ghosts are looking over our shoulders. We can't do >>conventional science because, unlike the physical universe, the computational > ^^^^^^^^^^^^^^^^^ >>universe is wide open, and anything can compute anything. Minute examination > ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ >>of a particular program in execution tells one little more than what the >>programmer was thinking about when writing the program. >> > [emphasis added] > >Would you please explain this tantalizing remark? Surely not every >formal system can compute every function (what about the ghost of >Chomsky?). Are you alluding to the mutual emulatability of Turing >machines? This is basic computer science. Any formalism sufficiently powerful to compute all the computable things we know of is equivalent to a Turing machine (Church-Turing Hypothesis), and formalisms of that power are all incomplete (Goedel's Incompleteness Theorem). Incompleteness rears its ugly head when we find that our most sophisticated programs cannot be tested completely. Simpler formal systems such as CFGs are too weak to model human intelligence, although some aspects of human behavior have been asserted to be context-free (for instance, Presidents that don't learn from their predecessors :-) ). >Finally, how does the third sentence follow from the second? This is the empirical consequence of Turing equivalence. I can write Eurisko or XCON in Lisp, Forth, or IBM 1401 assembler, and they will all behave the same. Assertions about the details about a program are worthless from a theoretical point of view, details of algorithms are somewhat better, but the algorithms appearing in AI programs are either too simple (searching for instance) or too complicated to be analyzable (the abovementioned large programs). >Michael P. Smith ARPA: mps@duke.cs.duke.edu stan shebs shebs@cs.utah.edu ------------------------------ Date: 7 Sep 87 16:59:27 GMT From: jbn@glacier.stanford.edu (John B. Nagle) Subject: Leibniz on philosophy "Philosophy is the discipline where you kick up a lot of dust and then complain you can't see." (as paraphrased by the physicist John Bahcall) ------------------------------ End of AIList Digest ******************** 10-Sep-87 21:29:02-PDT,10699;000000000001 Mail-From: LAWS created at 10-Sep-87 21:15:24 Date: Thu 10 Sep 1987 21:11-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #212 - Philosophy, Neural Networks To: AIList@SRI.COM AIList Digest Friday, 11 Sep 1987 Volume 5 : Issue 212 Today's Topics: Queries - AAAI Presidential Address Recordings & LISP/VM & PD OPS5 & LISP Chess Program & Conceptual Graphs & Neural Network Email Addresses, Philosophy - Is Computer Science Science? & Leibniz on Philosophy, Neural Networks - Unaligned Fields & Speech Analysis ---------------------------------------------------------------------- Date: Thu, 10 Sep 87 12:08:17 PDT From: AAAI Subject: HELP! During AAAI-87, we normally tape the Presidential Address by Pat Winston. This year, the tapes were scrambled. If anyone made a tape of Patrick talk, we would really appreciate if we could receive a copy? Also, Marvin Minsky has asked us if anyone still has retained a tape of his 1982 Presidential Address in Pittsburgh. He would also like a copy, if it is still available. Thank you for any help you may provide. Sincerely, Claudia Mazzetti AAAI 445 Burgess Drive Menlo Park, CA 94025 ------------------------------ Date: Tue, 08 Sep 87 12:46:31 FIN From: Heikki Pesonen Subject: LISP/VM ========================================================================= I will be pleased to here peoples opinion about IBM:s LISP/VM. We have it, but not many seems to be interested in it. I like it, so what is wrong with LISP/VM? What is good with it? We have LISP/VM to the end of this year, not longer, if it do not interest people more (I am afraid of ..). Unfortunately LISP/VM is not very compatible with Common Lisp and its usually slow in our IBM 3083 VM/CMS, but it has many usefull features. Becouse I am no Lisp Guru I would like to get the opinions of those who are. I know that LispGurus usually reside near a Lispmachine /Xerox etc.) and they do not appreciate mainframe lisps. So may be a vain effort .. Yours sincerely, Heikki Pesonen, EDP-Centre, University of Oulu, 90570 OULU, Finland ======================================================================== ------------------------------ Date: 9 Sep 87 00:28:26 GMT From: clyde!watmath!utgpu!tmsoft!mason@RUTGERS.EDU (Dave Mason) Subject: Is there a Public Domain/Shareware version of OPS5 ? A colleague of mine is interested in this for a Comparative Languages course & an Expert Systems course. Any leads appreciated. Thanks ../Dave Mason, Ryerson Polytechnical Institute best: ..!{utzoo seismo!mnetor utcsri utgpu lsuc}!tmsoft!mason FCTY7053@RYERSON.BITNET ------------------------------ Date: Thu, 10 Sep 87 14:29:09 cdt From: Glenn Manuel Reply-to: Glenn Manuel Subject: Wanted: LISP Chess Program Does anyone know of a pretty good Chess program written in LISP, either commercially available or (preferably) public domain? I'll be running it on a TI Explorer driving an external display (possibly a dumb terminal via RS-232 -- don't ask why), so I'm mostly interested in the algorithms, not fancy graphics for displaying the game pieces. Thanks in advance, -- Glenn Manuel (214) 575-5231 Texas Instruments, Inc., PO Box 869305 MS 8473, Plano, Tx. 75086 USENET: {ctvax,im4u,texsun,rice}!ti-csl!manuel CSNET: Manuel@TI-CSL ------------------------------ Date: 9 Sep 87 22:35:25 GMT From: plx!titn!jordan@sun.com (Jordan Bortz) Subject: conceptual graphs Has anyone played with Conceptual Networks, as documented in Conceptual Structures, by Sowa? In what language? What kinds of things did you try to implement? How did it work? Jordan -- ============================================================================= Jordan Bortz Higher Level Software 1085 Warfield Ave Piedmont, CA 94611 (415) 268-8948 UUCP: (decvax|ucbvax|ihnp4)!decwrl!sun!plx!titn!jordan ============================================================================= ------------------------------ Date: 10 Sep 87 23:15:30 GMT From: jr@io.att.com (j.ratsaby) Subject: Need email names I would like to get email names of persons who deal with neural-nets in CS dept of university of Toronto and/or in CS dept of John Hopkins university in Baltimore. thanks in advance, joel ------------------------------ Date: 8 Sep 87 16:53:54 GMT From: decvax!sunybcs!rapaport@ucbvax.Berkeley.EDU (William J. Rapaport) Subject: Is Computer Science Science? A colleague of mine in a philosophy department recently asked me if I could give him "some major causal laws, principles or regularities that are special to Computer Science.... (Every science has its special laws, so what are some for Computer Science?)" I vaguely recall a recent discussion on one of the nets about this. If so, is there some way I could get a copy of it (hard or soft)? If not, would anyone like to take a stab at answering this? William J. Rapaport Assistant Professor Dept. of Computer Science, SUNY Buffalo, Buffalo, NY 14260 (716) 636-3193, 3180 uucp: ..!{ames,boulder,decvax,rutgers}!sunybcs!rapaport csnet: rapaport@buffalo.csnet internet: rapaport@cs.buffalo.edu [if that fails, try: rapaport%cs.buffalo.edu@cs.relay.net] bitnet: rapaport@sunybcs.bitnet ------------------------------ Date: 10 Sep 87 05:38:05 GMT From: voder!apple!corwin@ucbvax.Berkeley.EDU (Entomology Lab) Subject: Re: Is Computer Science Science? In article <5113@sunybcs.UUCP> rapaport@sunybcs.UUCP (William J. Rapaport) writes: > >A colleague of mine in a philosophy department recently asked me if >I could give him "some major causal laws, principles or regularities >that are special to Computer Science.... (Every science has its special >laws, so what are some for Computer Science?)" > "Anything that can go wrong will go wrong." "There is always one more bug" "The differnce between a bug and a feature is that a feature is documented" -cory -- corwin@apple.[UUCP, CSNET] Disclaimer: The preceding message is not based on reality. ------------------------------ Date: 10 Sep 87 23:48:20 GMT From: shafto@ames-aurora.arpa (Michael Shafto) Subject: Re: Is Computer Science Science? I just saw a tech report by Peter J. Denning on the topic "Is computer science science?" The tech report was issued through RIACS here at Ames. It will allegedly appear as an editorial in the Oct., 1987, CACM. The title is something like "Paradigms Crossed" -- referring to the crossed paradigms of design vs. experimentation, or engineering vs. science. I would rate this "real good" on a scale of 1 to 10, and I urge interested parties to watch for and read it. Mike Shafto ------------------------------ Date: 9 Sep 87 00:37:12 GMT From: psuvax1!vu-vlsi!ge-mc3i!sterritt@husc6.harvard.edu (Chris Sterritt) Subject: Re: Leibniz on philosophy In article <17172@glacier.STANFORD.EDU> jbn@glacier.STANFORD.EDU (John B. Nagle) writes: > "Philosophy is the discipline where you kick up a lot of dust and then >complain you can't see." As long as we're slamming philosophy, why not: "Philosophy is a blind man in a dark room looking for a black cat... THAT ISN'T THERE" ------------------------------ Date: 9 Sep 87 13:54:23 GMT From: PT!cadre!geb@cs.rochester.edu (Gordon E. Banks) Subject: Re: Neural Networks & Unaligned fields In article <3523@venera.isi.edu> smoliar@vaxa.isi.edu.UUCP (Stephen Smoliar) writes: >In article <277@ndmath.UUCP> milo@ndmath.UUCP (Greg Corson) writes: >>Ok, here's a quick question for anyone who's getting into Neural Networks. >>If you setup the type of network described in BYTE this month, or the >>type used in the program recently posted to the net, what happens if you >>feed it an input image that is not aligned right? I didn't see the Byte article, but the simple neural networks that I have seen (such as the one that solves the T-C problem by Hinton & Rummelhart in the PDP book) do not generalize very well. You can train the hidden units with a given input, but then if you shift the pattern, it won't work. I asked Rummelhart about this, and he said that once the hidden units develop the patterns (such as edge detectors and center-surround, etc.) you do not need to retrain for each translation of the pattern, but you need to add more units to the network. These units have the same weights as the previously trained units, but they have a different field of view. You have to have another set of units for each region which can possibly contain the image. Alternatively, you have to have a scheme for making sure the image is "centered" in the field of view. Sounds like there is some room for interesting research here, maybe a thesis. ------------------------------ Date: 9 Sep 87 15:00:36 GMT From: caasi%sdsu.UUCP@sdcsvax.ucsd.edu (Richard Caasi) Subject: Re: neural net conference In response to those who asked and because email didn't work too well, there was a session devoted to Speech Recognition and Synthesis at the neural net conference (San Diego, June '87). The papers were: Issues and Problems in Speech Processing with Neural Networks Learning Phonetic Features Using Connectionist Networks: An Experiment in Speech Recognition A Neural Network Model for Speech Recognition Using the Generalized Delta Rule for Connection Strength Modification Neural Networks for the Auditory Processing and Recognition of Speech Multilayer Perceptrons and Automatic Speech Recognition Neural Net Classifiers Useful for Speech Recognition Isolated Word Recognition with an Artificial Neural Network Recent Developments In a Neural Model of Real-Time Speech Analysis and Synthesis Concentrating Information in Time: Analog Neural Networks with Possible Applications to Speech Recognition Guided Propagation Inside a Topographic Memory The Implementation of Neural Network Technology ------------------------------ End of AIList Digest ******************** 15-Sep-87 22:47:20-PDT,12510;000000000000 Mail-From: LAWS created at 15-Sep-87 22:38:42 Date: Tue 15 Sep 1987 22:33-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #213 - Queries To: AIList@SRI.COM AIList Digest Wednesday, 16 Sep 1987 Volume 5 : Issue 213 Today's Topics: Queries - Program for AIDA-87 & OPS5 for PC & Object-Oriented PROLOG & Neural-Net Proceedings & Qualitative Models and Discrete Simulaiton & Procedures and Data & OOPSLA-87 Roommate & Speech Databases & Lisp to C Conversion & ICAI for Literacy Training & Unix Prolog ---------------------------------------------------------------------- Date: 10 Sep 87 13:24:06 GMT From: mcvax!enea!erix!olle@seismo.css.gov (Olle Wikstrom) Subject: Program for AIDA-87 conference requested Has anyone seen the program for the AIDA-87 - "the third annual conference on Artificial Intelligence & Ada" George Mason University, October 14-15, 1987? If so would you please send a copy of it to me, preferably using e-mail. Olle Wikstrom UUCP: olle@erix.UUCP Ericsson Radio Systems AB or: ..seismo!mcvax!enea!erix!olle Box 1001 S-431 26 Molndal Sweden ------------------------------ Date: 10 Sep 87 16:47:00 GMT From: uiucdcs!pur-ee!bucc2!brian@seismo.CSS.GOV Subject: Re: OPS5 for PC - that's what I nee > > Approved: ailist@stripe.sri.com > > > > I'm looking for a full-blown version of OPS5 for the IBM-PC. Working > > with the VAX-VMS version of OPS5, I'd like to experiment on my (not > > so terribly loaded) private PC. > > TOPSI - as far as I know - does not support the essential features > > which make OPS5 unique: RETE-match and therefor no recency conflict > > One year ago, the full RETE algorithm existed in a beta version of > TOPSI. It may have migrated to the regular release by now. I'm interested in TOPSI. What company offers it? Could you send me information on how I might order it? { bucs1!brian Brian Michael Wendt {uiucdcs,cepu,ihnp4}!bradley! { brian { bucc2!brian ------------------------------ Date: Sun, 13 Sep 87 14:55:07 EDT From: lakshman@ATHENA.MIT.EDU Subject: Object oriented PROLOG Hi! Does anybody have a source code for creating objects with inheritence capabilities and other standard stuff in PROLOG that can be made available in the public domain ? Jaideep Ganguly ------------------------------ Date: 14 Sep 87 00:03:18 GMT From: munnari!latcs1.oz!suter@uunet.UU.NET (David Suter) Subject: proceedings wanted Has anyone (or any university library) obtained a copy of the proceedings of the San Diego conference on neural nets (this year). I would like to obtain a copy of the index and a few of the papers of interest. If anyone can help, could they please e-mail me. --------------------- David Suter ISD: +61 3 479-2596 Department of Computer Science, STD: (03) 479-2596 La Trobe University, ACSnet: suter@latcs1.oz Bundoora, CSnet: suter@latcs1.oz Victoria, 3083, ARPA: suter%latcs1.oz@uunet.uu.net Australia UUCP: ...!uunet!munnari!latcs1.oz!suter TELEX: AA33143 FAX: 03 4785814 ------------------------------ Date: Mon, 14 Sep 87 09:09:34 cdt From: Jane Malin Subject: Query:qualitative models and discrete simulaiton A group here have been exploring combining qualitative modeling and discrete event simulation (rather than constraint propagation) methodologies for the purpose of analyzing system effects of component faults and failures. The purpose of such analysis would be to support failure modes And effects analysis and model-based development of fault management systems (including knowledge-based systems). The application area is space subsystems, especially of the process control type, such as power management and distribution, thermal control, or air and water purification. In this area, there is a need to model multiple operating modes of system components, including multiple failure modes. In fact, the system behaviors of most interest are changes from normal to faulty behavior that are consequences of faults and failures elsewhere in the system. We have a promising working prototype, which I reported on at the AI and Simulation workshop at AAAI-87. First, generally, I would like to know of others with ideas or experience in combining the two methodologies, and of technical problems encountered in their efforts. I would also like to get some ideas on approaches to the technical issues that arise from the need to model multiple modes, including failure modes, explicitly. Thanks in advance, Jane Malin. (malin%nasa-jsc.csnet@relay.cs.net). ------------------------------ Date: 14 Sep 87 04:25:10 GMT From: mtune!codas!killer!usl!elg@RUTGERS.EDU (Eric Lee Green) Subject: procedures and data Values, data, and procedures: Can we building a consistent world view in Lisp-like languages? Overview: We know what data is. Symbols have a value cell. This value cell contains data. The process of evaluation returns this value. But how do we reconcile this with procedures? Procedures are data. They are stored in memory just like any other data. The value-cell of symbols should be able to point to procedure objects, if we are to be consistent, allowing interchangability and not having special classes of symbols. Evaluating a symbol with a procedure-value should, to be consistent with the action of eval upon data objects, return the value of the data cell of the symbol. But wait, how do we actually execute the procedure! Lisp does this with hand-waving and head-nodding, by making programs consist of lists, the first element of which is always assumed to be a procedure which needs executing. In other words, we are introducing "syntactic sugar" to work around the problem of having to explicitly indicate what we wish to be executed. Lisp and Scheme do this kind of hand-waving in many places. For example, (defun urgh (junk foo) (blah1) (blah2)) defines a procedure "urgh" in your symbol table. "urgh", (junk foo), etc., are actually literal data input to the define-a-function routine. Yet the form of the call to "defun" is virtually identical to that of (+ a b) where we feed the VALUES of "a" and "b" to the "+" function. Questions: Can this dichotomy between value and execution be mended for procedure-objects without hand-waving? Would requiring literal data to be quoted be too big an imposition upon the programmer, and would it be worth the gain in expressiveness? (just imagine macros without the mess). A possible but kludgy scheme: When procedure symbols are encountered in the eval stream, they are called with the next list in the eval stream as the parameter list. A special prefix character is necessary to explicitly access the procedure-object, to, for example, assign it to another variable. A program might look like + (2 2) print ( / (2 f)) etc. In other words, the effect would be to move the parentheses around, in comparison with traditional Lisp dialects. Why this is kludgy: We are, again, attaching special considerations to the evaluation of symbols whose value is a procedure-object. I would appreciate any discussion or references about this subject. -- Eric -- Eric Green {ihnp4,cbosgd}!killer!elg {ut-sally,killer}!usl!elg elg@usl.CSNET ------------------------------ Date: Mon, 14 Sep 87 16:38 EST From: SHAPIRO%cgi.com@RELAY.CS.NET Subject: Roommate (Female) at OOPSLA-87 I am looking for a female roommate at OOPSLA-87 in Orlando at the Hyatt. I will be there Oct. 4 - 7 and would be willing to share the room any of those nights. I do not know what the savings would be and do not have reservations yet but I would be glad to take care of those details if anyone responds. Thank you, Alison Shapiro SHAPIRO%CGI.COM@RELAY.CS.NET or, if you have trouble with the address, I can be reached at Carnegie Group Inc (412) 642-6900 ex. 248 days. ------------------------------ Date: 15 Sep 87 13:19:45 EST (Tue) From: "Steven J. Nowlan" Subject: Online Databases of Speech Data We are starting a large speech project and are interested in getting a quick survey of publically available databases of speech data. What we are interested in for each such database you know of is: 1. who to contact to get access to the database 2. what format data is available in 3. content of speech samples (digits, vowels, e-group etc) 4. multi-speaker or single speaker 5. how much data is available for each speaker 6. is the data time aligned 7. is there labelling of data, and if so how accurate is it I would appreciate any information you could forward to us. - thanks Steve Nowlan Arpanet: nowlan%ai.toronto.edu@relay.cs.net CSNet,Bitnet: nowlan@ai.toronto.edu EAN,X.400: nowlan@ai.toronto.cdn UUCP: {uunet,watmath}!ai.toronto.edu!nowlan ------------------------------ Date: Tue, 15 Sep 87 16:01:05 PDT From: BERENJI%PLU@ames-io.ARPA Subject: Lisp to C conversion!! A friend of mine at USC asked me if I know of any programs for conversion of Lisp code to C for micros. The only one I know is Sapiens Software. If anyone knows more on this subject, I would appreciate it if you can let me know. with many thanks in advance, Hamid Berenji berenji@ames-pluto.arpa (415) 694-6070 ------------------------------ Date: 15 Sep 87 21:52:12 GMT From: brillig!sanborn@mimsy.umd.edu (Jim Sanborn) Subject: ICAI for Literacy Training (request for info) I've had a request for some info on the subject of computer-based literacy training. As this is not currently one of my longer suits, perhaps someone will be able to fill me in on one or more of the following: (1) the Center for Instructional Development & Evaluation, (2) videodisc-based training, (3) an IBM product known as PALS, (4) any ICAI literature specific to ``literacy training.'' Any and all information may be helpful, particularly regarding #4 above. Please respond to me directly via e-mail. I'll sift through what I receive, post a summary to comp.ai.edu, and hopefully spurn some discussion there. -Jim Sanborn Internet: sanborn@brillig.umd.edu Computer Science Dept. Usenet: ...!uunet!mimsy!sanborn University of Maryland Phone: (301)454-1516,2002 College Park, MD 20742 -Jim Sanborn Internet: sanborn@brillig.umd.edu Usenet: ...!uunet!mimsy!sanborn CS Dept, U of Maryland Phone: (301)454-1516,2002 College Park, MD 20742 ------------------------------ Date: Mon, 14 Sep 87 09:54 CDT From: Herndon@HI-MULTICS.arpa Subject: prolog [Forwarded from Info-UNIX.] Does anyone know where in netland I can find a public domain Prolog environment. I got a copy of SBProlog from uunet but found that it is heavily dependent on having BSD UNIX as the underlying OS. I am running SysV 2.0 on a AT&T 3b1. Please send any responses to me directly. My receipt of "info-unix" is not very reliable. Thanks in advance. Sincerely, William R. Herndon ------------------------------------------------------------------ William R. Herndon Secure Computing Technology Center Honeywell ARPA: Herndon@hi-multics.arpa AT&T: (612) 782-7108 US MAIL: 2855 Anthony Ln. So. - Suite 130 St. Anthony, Mn. 55418 ------------------------------ End of AIList Digest ******************** 15-Sep-87 22:59:24-PDT,13813;000000000001 Mail-From: LAWS created at 15-Sep-87 22:56:38 Date: Tue 15 Sep 1987 22:52-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #214 - Neural Networks, P = NP?, Science, Security To: AIList@SRI.COM AIList Digest Wednesday, 16 Sep 1987 Volume 5 : Issue 214 Today's Topics: Neural Networks - Bindings & Generalization, Theory - P = NP?, Philosophy - Is Computer Science Science?, Programming - inSecurity ---------------------------------------------------------------------- Date: Fri, 11 Sep 87 22:20:38 EDT From: Peter Sandon Subject: Re: Neural Networks & Unaligned fields I did not read the Byte article either. However, assuming that the network under discussion had no way to represent the similarity relationship among different nodes that represent translated versions of the same feature, it is not surprising that it would have a difficult time generalizing from a given pattern to an 'unaligned' version of that pattern. Rumelhart pointed out to Banks that what is needed are many sets of units having similar weight patterns, that is, weights that are sensitive to translated versions of a given pattern. In addition, the relationship between these similar units must be represented. Rumelhart suggests adding units as needed but does not mention how to relate these additional units to the trained unit. Fukushima did something similar in his Neocognitron, by broadcasting a learned weight set to an entire layer of units which were then all connected to an OR unit. This OR unit then represented the fact that all the units represented the same feature, modulo translation. Of course, broadcasting weights requires more global control than many would like, and the OR is not quite the relation we want for patterns of any complexity. In 1981, Hinton suggested a means of separately representing shape and translation in a network, such that 'unaligned' patterns could be recognized. In my thesis, I implemented a modified version of that network scheme, in order to demonstrate that a network can generalize object recognition across translation. The network that I implemented is five layers deep, which proved too much for standard backpropagation (the generalized delta rule) and for my extensions to the GDR. However, generalization across translation can be demonstrated in a subnetwork of this network. I am working on further improvements to backpropagation that will allow the entire network to be trained. It is important to recognize that there are many useless generalizations that might be made, and a few useful ones. The Hamming distance between two 'T's that are offset from one another is much greater than that between a 'T' and a 'C' that is offset such that it overlaps much of the 'T'. What is the 'correct' generalization to be made when trying to classify these patterns? In order to get the desired generalization, the network must be biased toward developing representations in which the Hamming distances (of the intermediate representations) between within-class patterns is small compared to that between other patterns. Generalization based on similarity will then be appropriate. Without such biases, 'good' generalization would be quite surprising. --Pete Sandon ------------------------------ Date: 15 Sep 87 21:31:50 GMT From: jr@io.att.com (j.ratsaby) Subject: need email addresses Would you have email addresses of some graduate fellows or professors that deal with neural-nets in the university of Toronto and Cambridge (England)? I would really appreciate it since I'm engaged in research on stochastic neural-nets, I recieved some answers from a few of you but unfortunately there was a fatal shutdown here and I lost the email addresses. thanks in advance, joel ------------------------------ Date: 12 Sep 87 06:30:36 GMT From: ihnp4!alberta!mnetor!genat!maccs!leb@ucbvax.Berkeley.EDU (Anthony Hurst ) Subject: P may indeed = NP !! I normally do not keep track of mathematics papers, but I happened to notice an interesting news item that jumped right out at me. It was reported in a recent issue of the University of Guelph's "Alumnus" magazine. (Guelph is in Ontario, Canada). Included here are three excerpts from the authoress Mary Dickieson. She writes: "One of the most perplexing problems in computer science may have been solved by Professor Ted Swart, who has a joint appointment in the departments of Mathematics & Statistics and Computing & Infor- mation Science. He has written a paper offering proof that P = NP. ... "Dr. Swart cautions that the jury is still out on whether his approach will be proved or disproved by his peers, but already his pronouncement has caused a stir in the computer world." ... "Dr. Swart's problem establishes that the Hamilton circuit problem can be solved in polynomial time by converting a mathematical programming formulation of the problem into a linear programming formulation and using existing polynomial time algorithms as established by Kachiyan and Karmarkar." What I should like to know is, has Swart's paper "caused a stir in the computer world" and if not, why not? -- seismo!mnetor!{genat,lsuc}!maccs!leb Anthony Hurst McMaster Dept. of Comp. Sci. & Systems (416)-525-9140 x4030 Will there be cigarettes in heaven? ------------------------------ Date: 14 Sep 87 12:25:56 GMT From: necntc!linus!faron!bs@eddie.mit.edu (Robert D. Silverman) Subject: Re: P may indeed = NP !! In article <761@maccs.UUCP] leb@maccs.UUCP (Anthony (Tony) Hurst) writes: ] ]"One of the most perplexing problems in computer science may have ]been solved by Professor Ted Swart, who has a joint appointment in ]the departments of Mathematics & Statistics and Computing & Infor- ]mation Science. He has written a paper offering proof that P = NP. ]... No one, repeat no one who does serious research in computational complexity really belives P=NP. I have seen several such 'proofs'. All are basically the same: Some imaginative person formulates a problem in NP as a linear program. Unfortunately, most of these people fail to realize that their 'formulation' requires a number of variables that is exponential in the size of the problem. Poof goes the proof. I had already heard of Prof. Swart's purported proof and heard that it suffers from the same defect. Bob Silverman ------------------------------ Date: 15 Sep 87 00:23:49 GMT From: jaw@ames-aurora.arpa (James A. Woods) Subject: Re: P = NP (review article in The Economist, Sept. 4, 1987) # "The average mathematician should not forget that intuition is the final authority." -- J. Barkley Rosser "There's only one two." -- local TV station slogan An informative synopsis of P=NP? here is surprising for those accustomed to the usual style of general-purpose business periodicals. One would expect something like this to appear in the more outre New Scientist (hooray for British science writing!), where it might be by-lined by John Maddox. But the enormity of the question, coupled with its tight connection to operations research, makes it all the more important that a general audience is exposed to the art. The treatment comes complete with mention of revealing Cook/Karp/Levin history, the role of random oracles, circuit complexity, and the solution of the old Chomsky grammar chestnut by Neil Immerman. As they say in the Southern states, "check it out" (of your local public library). Also entertaining is Steven Johnson's plea for a halt to bogus P=NP proofs, a cease fire perhaps encouraged by a monetary pot to contain a $1000 bond for each submission posted before publication, which would then be forfeited after a bug is found, and thence to the eventual prize winner, Goedel notwithstanding. It's too bad that a team of "grunt mathematicians" (*) must still filter the fluff. Thoughts of anyone other than a Blum or a Karmarkar or a Matyasevich or an Adelman coming through with a solution may be disturbing to some workers in the field. Indeed, history has shown repeated lack of faith with similar assaults [the Bieberbach Conjecture (De Branges), the Poincare Conjecture (still unresolved), and Fermat's Last Theorem, where episodic premature announcements in AMS Notices leave no one with even the hope that a counterexample would fit on a T-shirt.] As for P=NP, again, refer to the discussion in The Economist for the week ending 4 September 1987. -- James A. Woods (ames!jaw) (*) Term first seen in the seminal paper by DeMillo, Lipton, and Perlis, CACM, May 1979 -- "Social Processes and Proofs of Theorems and Programs", well worth your attention for wry commentary and mathematics anecdotes. ------------------------------ Date: 15 Sep 87 06:51:20 GMT From: maiden@sdcsvax.ucsd.edu (VLSI Layout Project) Subject: Re: P = NP (review article in The Economist, Sept. 4, 1987) In article <1035@aurora.UUCP> jaw@aurora.UUCP (James A. Woods) writes: >Indeed, history has shown repeated lack of faith >with similar assaults [the Bieberbach Conjecture (De Branges), the Poincare >Conjecture (still unresolved), and Fermat's Last Theorem, where episodic ^^^^^^^^^^^^^^^^ Only unresolved in three dimensions. Resolved for all others. ------------------------------ Date: 15 Sep 87 12:11:07 GMT From: bloom-beacon!gatech!hubcap!steve@think.com ("Steve" Stevenson) Subject: Re: P = NP subclasses I once heard a commment that most instances of "NP-complete" problems encountered in practice do not exhibit the pathological behavior of the exponential growth function. Take your favorite characterization of the NP-complete problem. Questions: What is the largest subclass of instances (decidable or not) which does not exhibit the exponetial? What is the largest Turing-decidable subclass? -- Steve (really "D. E.") Stevenson steve@hubcap.clemson.edu Department of Computer Science, (803)656-5880.mabell Clemson University, Clemson, SC 29634-1906 ------------------------------ Date: 10 Sep 87 09:27:00 GMT From: johnson@p.cs.uiuc.edu Subject: Re: Is Computer Science Science? There is a general rule that disciplines with names like XXX Science are not a science. In spite of that, there are some general laws that arise out of CS. My favorite are all from computability and complexity theory, though I do not do that kind of research and don't plan to. Undecideability -- just because a question has an answer doesn't mean that there is a method to answer it. E.g. all programs will either terminate or not terminate, but the halting problem is undecideable. NP complete problems -- just because a proposed answer is very easy to check for correctness does not mean that the question is easy to solve. NP complete problems are those whose answer can be checked in polynomial time but where any method for finding the solution must essentially check all possible solutions, taking exponential time. In a similar manner, a proof can be easily checked for correctness, but it is undecideable (in any interesting theory) whether there exists a proof or not for a particular theorem. ------------------------------ Date: 14 Sep 87 12:06:24 GMT From: uunet!mnetor!yetti!geac!daveb@seismo.css.gov (Brown) Subject: inSecurity (was Re: Is Computer Science Science?) In article <8300004@osiris.cso.uiuc.edu> goldfain@osiris.cso.uiuc.edu writes: >IN SPITE OF RESEARCH, THE FOLLOWING ARE TENETS OF THE CURRENT WORKPLACE: >"There is no such thing as real computer security." >"There is always one more bug." These two tenets are related to each other in an interesting way: provably secure operating systems exist (so-called "A1" systems), but the proof merely demonstrates that a) An externally specified standard is met, and b) Certain insecure features have a diminishingly small bandwidth. (a) is related to the buggyness theorem by one level of indirection: there is no proof in the system that the extra-systemic security policy does not contain bugs. --dave (and I can point one out, oh orange-bookers) c-b -- David Collier-Brown. {mnetor|yetti|utgpu}!geac!daveb Geac Computers International Inc., | Computer Science loses its 350 Steelcase Road,Markham, Ontario, | memory (if not its mind) CANADA, L3R 1B3 (416) 475-0525 x3279 | every 6 months. ------------------------------ Date: 14 Sep 87 16:06:37 GMT From: kodak!elmgate!ram@cs.rochester.edu (Randy Martens) Subject: Re: Is Computer Science Science? I am of the firm opinion that there is NO such thing as computer science. To quote (and I have forgotten the attribution) "Computer Science bears the same relationship to Real Science, that plumbing bears to Hydrodynamics." There is, however, Computer Engineering. (and Software Engineering, and Systems Engineering etc.). Science is the discovery of the new. Engineering takes what the scientists have found, and finds ways to do useful things with it. The two are like Yin and Yang, closely interrelated, but not the same, and each dependant on the other. I am a computer engineer. Randy Martens "Reality - What a Concept !" - R.Williams ------------------------------ End of AIList Digest ******************** 15-Sep-87 23:07:30-PDT,22879;000000000000 Mail-From: LAWS created at 15-Sep-87 23:04:41 Date: Tue 15 Sep 1987 23:02-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #215 - Bibliography To: AIList@SRI.COM AIList Digest Wednesday, 16 Sep 1987 Volume 5 : Issue 215 Today's Topics: Bibliography - Leff File a60C ---------------------------------------------------------------------- Date: Mon, 14 Sep 1987 07:42 CST From: Leff (Southern Methodist University) Subject: definitions Definitions for A60C D MAG136 IEEE Transactions on Geoscience and Remote Sensing\ %V 25\ %N 3\ %D MAY 1987 D MAG137 Soviet Journal of Computer and Systems Sciences\ %V 24\ %N 6\ %D NOV-DEC 1986 D MAG138 Pattern Recognition Letters\ %V 5\ %N 5\ %D MAY 1987 D MAG139 Pattern Recognition Letters\ %V 6\ %N 1\ %D JUN 1987 D MAG140 International Journal of Man Machine Studies\ %V 26\ %N 1\ %D JAN 1987 D MAG141 Pattern Recognition\ %V 20\ %N 3\ %D 1987 D MAG142 Computer Vision, Graphics and Image Processing\ %V 39\ %N 2\ %D AUG 1987 D MAG147 Fuzzy Sets and Systems\ %V 23\ %N 1\ %D JUL 1987 D MAG144 IEEE Transactions on Systems, Man, and Cybernetics\ %V 17\ %N 3\ %D MAY-JUN 1987 D MAG145 International Journal of Man-Machine Studies\ %V 26\ %N 2\ %D FEB 1987 ------------------------------ Date: Mon, 14 Sep 1987 07:48 CST From: Leff (Southern Methodist University) Subject: a60C %A D. Tsichritzis %A E. Fiume %A S. Gibbs %A O. Nierstrasz %T KNOs: Knowledge Acquisition, Dissemination, and Manipulation Objects %J ACM Transactions on Office Information Systems %V 5 %N 1 %D JAN 1987 %P 96 %K AA06 %A S. Baronti %A R. Carla %A V. M. Sacco %T Digital Filtering of APT Images from NOAA Series Satellites %J Alta Frequenza %V 55 %N 6 %D NOV-DEC 1986 %P 391-394 %K AI06 AA03 %A S. W. Wharton %T A Spectral-Knowledge-Based Approach for Urban Land-Cover Discrimination %J MAG136 %P 272-282 %K AA03 AI06 %A T. Lee %A J. A. Richards %A P. H. Swain %T Probabilistic and Evidential Approaches for Multisource Data Analysis %J MAG136 %P 283-293 %K AA03 O04 AI06 %A T. D. Garvey %T Evidential Reasoning for Geographic Evaluation for Helicopter Route Planning %J MAG136 %P 294-304 %K O04 AA03 AA19 AA18 %A T. Matsuyama %T Knowledge-Based Aerial Image Understanding Systems and Expert Systems for Image Processing %J MAG136 %P 305-316 %K AI06 AI01 AA18 %A D. M. Mckeown %T The Role of Artificial Intelligence in the Integration of Remotely Sensed Data with Geographic Information Systems %J MAG136 %P 330-348 %K AI06 AA03 %A D. G. Goodenough %A M. Goldberg %A G. Plunkett %A J. Zelek %T An Expert System for Remote Sensing %J MAG136 %P 349-359 %K AI01 AA03 %A Donnie R. Ford %A Bernard Schroer %T An Expert Manufacturing Simulation System %J Simulation %V 48 %N 5 %D MAY 1987 %P 193-200 %K AA26 AA28 AI01 %A Joseph M. Mellichamp %A Ahmed F. A. Wahab %T An Expert System for FMS Design %J Simulation %V 48 %N 5 %D MAY 1987 %P 201-209 %A R. R. Yager %T Towards a General Theory of Reasoning with Uncertainty. Part II: Probability %J International Journal of Man-Machine Studies %V 25 %N 6 %D DEC 1986 %P 613-632 %K O04 %A G. S. Pospelov %A A. M. Razin %T Principle Trends in the Development of Modern Expert Systems (Review of Foreign Studies) %J Nauchno-Tekhnicheskaya Informatsiya, Seriya II - Informatsionnye Protessy I Sistemy %N 2 %D 1987 %P 1-11 %K AI01 AT08 %A Alasdair Urquhart %T Hard Examples for Resolution %J Journal of the Association for Computing Machinery %V 34 %N 1 %D JAN 1987 %P 209 %K AI11 %A Yoshihito Toyama %T On the Church-Rosser Property for the Direct Sum of Term Rewriting Systems %J Journal of the Association for Computing Machinery %V 34 %N 1 %D JAN 1987 %P 128-143 %K AI11 AI14 %A C. Asmuth %T An Application of Group Representation Theory to Picture Recognition %J Computers and Mathematics with Applications %V 13 %N 4 %D 1987 %P 363-366 %K AI06 %A S. M. Yefimova %A Ye. V. Suvorov %T A $PI$-Graph Model for Representing Knowledge and a Method for Its Hardware Realization on the Basis of the Labelled Arrays Method %J MAG137 %P 1-14 %K AI16 %A V. B. Borshchev %T Logic Programming %J MAG137 %P 15-32 %K AI10 %A V. Ye. Zhukovin %T Fuzzy Multicriterial Decision-Masking Problems %J MAG137 %P 33-37 %K AI13 O04 %A Ye. P. Balashov %A M. S. Kupriyanov %A L. G. Loginskaya %T Construction and Interpretation of Fuzzy Algorithms %J MAG137 %P 33-37 %K O04 %A Kh. I. Tani %T Interfaces for Intelligent Computing Systems %J MAG137 %P 44-57 %K O01 %A A. A. Dmitriyev %A S. L. Zenkevich %T Logic Control of an Adaptive Robotic System %J MAG137 %P 100-106 %K AI07 AI10 %A G. G. Ananiaskhvili %A N. N. Bichinashvili %A Z. I. Mundzhishvili %A T. L. Khomeriki %T A Method for Identifying Natural Language Words in Dialogue Systems %J MAG137 %P 160 %K AI02 %A P. A. Bakut %A E. F. Baburov %A A. M. Varfolomeev %A T. K. Vinstyuk %A N. S. Gritsenko %A V. V. Gritsyk %A A. A. Demin %A B. V. Kisil %A L. M. Krasnov %A V. P. Loginov %A A. Yu Lutsyk %A V. K. Marigodov %A R. M. Palenichka %A A. N. Svenson %A K. N. Sviridov %A N. D. ustinov %A N. Yu Khomich %A G. T. Cherchyk %T Parallel Methods for Pattern Recognition %I Naukova Dumka %C Kiev %D 1985 %K H03 AI06 AT15 %A P. I. Balk %T Application of Demonstration Calculations on a Computer in the Study of the Properties of Linear Mappings in Finite-Dimensional Spaces %J Kibernetika %D 1986 %N 5 %P 106-112 %K AI16 %X Russian with English Summary %A James Bezdeck %A Richard J. Hathaway %A Ralph E. Howard %T Coordinate Descent and Clustering %J Control Cybernet. %V 15 %D 1986 %N 2 %P 195-204 %K AI03 O06 %A Gildas Brossier %T Study of Rectangular Proximity Matrices with a View to Classification %J Rev. Statist. Appl %V 34 %D 1986 %N 4 %P 43-68 %A E. V. Dyukova %T Complexity of Realization of Some Pattern Recognition Procedures %J Zh. Vychisl. Mat. i. Mat. Fiz %V 27 %D 1987 %N 1 %P 114-127 %K AI06 %X Russian %A Claude Kirchner %A Helene Kirchner %T REVEUR-3: The Implementation of a General Completion Procedure Parameterized by Builtin Theories and Strategies %J Sci. Comput. Programming %V 8 %D 1987 %N 1 %P 69-86 %K AI14 %A G. D. Penev %T Method for Constructing Pairs of Identical Points of Retinas %J Vestnik Leningrad. Univ. Mat. Mekh. Astronom. %D 1986 %V 4 %P 78-82 %K AI06 %X Russian with English Summaries %A Olga Stepanokova %A Petr Stepanek %T Estimation of the Complexity of Transformed Logic Programs %J Acta Polytech. Prace CVUT Praze Ser. IV Tech. Teoret. %V 1986 %N 3 %P 51-66 %K AI10 %A T. M. V. Janssen %T Foundations and Applications of Montague Grammar. Part 2. Applications to Natural Language %S CWI Tract %V 28 %I Stichting Mathematisch Centrum. Centrum voor Wiskunde en Informatica %C Amsterdam %D 1986 %X ISBN 90-6196-3067-0 %A O. S. Agaronyan %T Image Segmentation Using the Paving of a Plane by Voronoi Polygons %J Avtomat. i. Telemekh. %V 1986 %N 10 %P 95-100 %K AI06 O06 %A Daniel Leven %A Micha Sharir %T Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams %J Discrete Computational Geometry %V 2 %D 1987 %N 1 %P 9-31 %K AI09 AI07 O06 %A Akiria Nakamura %A Kunio Aizawa %T Detection of Interlocking Components in Three-Dimensional Digital Pictures %J Inform. Sci %V 40 %D 1986 %N 2 %P 143-153 %K AI06 O06 %A E. Vi-Tong %A P. Gaillard %T An Algorithm for Non-Supervised Sequential Classification of Signals %J MAG138 %P 307-316 %K AI06 O06 %A I. D. Longstaff %A J. F. Cross %T A Pattern Recognition Approach to Understanding the Multi-Layer Perceptron %J MAG138 %P 315-320 %K AI06 AI12 %A Z. Aviad %A E. Lozinskskii %T Semantic Thresholding %J MAG138 %P 321-328 %K AI16 %A K. C. Markham %T Some Segmentation Processes for Application with a Spoke Filter %J MAG138 %P 329-336 %K AI06 %A S. Chang %A L. S. Davis %A S. M. Dunn %A J. O. Eklundh %A A. Rosenfeld %T Texture Discrimination by Projective Invariations %J MAG138 %P 337-342 %K AI06 %A P. G. Selfridge %T Using a Simple Shape Measure to Improve Automatic 3D Reconstruction %J MAG138 %P 343-346 %K AI06 %A B. Bhanu %A C. C. Ho %A T. Henderson %T 3-D Model Building for Computer Vision %J MAG138 %P 349-356 %K AI06 %A J. P. Gambotto %A T. S. Huant %T Motion Analysis of Isolated Targets in Infrared Image Sequences %J MAG138 %P 357 %K AI06 %A S. F. Rushinek %A A. Rushinek %T The Effects of Sources of Applications Programs on User Satisfaction- An empirical Study of Micro, Mini and Mainframe Computers Using an Interactive Artificial Intelligence Expert System %J Cybernetica %V 30 %N 1 %D 1987 %P 75 %K AA15 AI01 %A Curtis P. Langlotz %A Lawrence M. Fagan %A Samson W. Tu %A Branimir I. Sikic %A Edward H. Shortliffe %T A Therapy Planning Architecutre that combines Decision Tehory and Artificial Intelligence Techniques %J Computers and Biomedical Research %V 20 %N 3 %D JUN 1987 %K AA13 AA01 AI01 %A G. S. Blair %A J. A. Mariani %A J. R. Nicol %A D. Shepherd %T A Knowledge-Based Operating System %J The Computer Journal %V 30 %N 3 %D JUN 1987 %P 193-200 %K AA08 %A Donald Sannella %A Andrzej Tarlecki %T On Observational Equivalence and Algebraic Specification %J Journal of Computer and System Sciences %V 34 %N 2-3 %D APR-JUN 1987 %P 150-178 %K AA08 %A J. A. Kakowsky %T Why Horn Formulas Matterin Computer Science: Initial Structure and Generic Examples %J Journal of Computer and System Sciences %V 34 %N 2-3 %D APR-JUN 1987 %P 150-179 %K AI10 %A E. R. Davis %T A New Framework for Analyzing the Properties of the Generalized Hough Transform %J MAG139 %P 1-8 %K AI06 %A E. R. Davies %T A New Parameterisation of the Straight Line and its Application for the Optimal Detection of Objects with Straight Lines %J MAG139 %P 9-14 %K AI06 %A A. I. Watson %T A New Method of Classification for Landsat Data using 'Watershed' Algorithm %J MAG139 %P 15-20 %K AA03 AI06 %A P. D. L. Williams %T Results from a Sideways Looking Radar (SLAR) with a Very Low Pulse Repetition Frequency %J MAG139 %P 21-26 %K AI06 %A J. Kittler %A J. Eggleton %A J. Illingsworth %A K. Paler %T An Averaging Edge Detector %J MAG139 %P 27-32 %K AI06 %A K. Paler %A K. M. Crennell %A J. Kittler %A B. N. Dobbins %A B. L. Button %A C. Wykes %T Identification of Fringe Minima in Electronic Speckle Pattern Images %J MAG139 %P 33-44 %K AI06 %A D. Chetverikov %T Texture Imperfections %J MAG139 %P 45-50 %K AI06 %A A. Blake %A A. Zisserman %T Localizing Discontinuities Using Weak Continuity Constraints %J MAG139 %P 51-60 %K AI06 %A J. Skingley %A A. J. Rye %T The Hough Transform Applied to SAR Images for Thin Line Detection %J MAG139 %P 61-69 %K AI06 %A D. T. Berry %T Colour Recognition Using Spectral Signatures %J MAG139 %P 69-76 %K AI06 %A S. Tominaga %T Expansion of Color Images Using Three Perceptual Attributes %J MAG139 %P 77-86 %K AI06 %A K. Ozawa %T A Picture Synthesizing System with a Database of Semantic Picture Elements of 'Ukiyoe' Colour Woodprinted Pictures %J MAG139 %P 87 %K AA025 %A N. Heaton %T Review of Artificial Intelligence, Vol 2, Bibliographic Summaries of the Select Literature by H. R. Rylko %J Applied Ergonomics %V 18 %N 2 %D JUN 1987 %P 162 %K AT07 %A P. P. Das %A P. P. Chakrabarti %A B. N. Chatterji %T Generalized Distances in Digital Geometry %J Information Sciences %V 42 %N 1 %D JUN 1987 %P 51-68 %K AI06 %A A. Sengupta %A A. Sen %T On the Diagnosability Problem for a General Model of Diagnosable Systems %J Information Sciences %V 42 %N 1 %D JUN 1987 %P 83 %K AA21 %A Frank K. Soong %A Aaron E. Rosenberg %A Bing-Hwang Juang %A Lawrence E. Rabiner %T A Vector Quantization Approach to Speaker Recognition %J AT&T Technical Journal %V 66 %N 2 %D MAR-APR 1987 %K AI05 %A Jacques Cohen %A Timothy J. Hickey %T Parsing and Compiling Using Prolog %J TOPLAS %P 125-163 %V 9 %N 2 %K AA08 T02 %A C. Alec Chang %A Jay Goldman %A Jove M. Pan %T Part Positioning with Feature Marks for Computer Vision Systems %J IEEE Transactions %V 19 %N 2 %D JUN 1987 %P 182-189 %K AA26 AI06 %A K. Lien %A G. Suzuki %A A. M. Westerberg %T The Role of Expert Systems Technology in Design %J Chemical Engineering Science %V 42 %N 5 %D 1987 %P 1049-1072 %K AA05 AI01 %A Brian L. Schmidt %T A Natural Language System for Music %J Computer Music Journal %P 25-34 %V 11 %N 2 %D SUMMER 1987 %K AA25 AI02 %A Wojcech Busskowski %T Categorial Grammars in the Eyes of Logic %B BOOK83 %P 163-174 %K AA08 %A L. Cairmaz %T Nonstandard Logics of Programs %B BOOK83 %P 285-295 %K AA08 AI11 %A J. Dassow %T Comparison of Some Types of Regulated Rewriting %B BOOK83 %P 301-313 %K AI11 %A I. Guessarian %T Algebraic Semantics and Logics of Programs %B BOOK83 %P 423-431 %K AA08 AI11 %A K. P. Jantke %T Terminal Algebraic Semantic as a Basis for Program Synthesis %B BOOK83 %P 479-490 %K AA08 %A M. Kudlek %T Languages Defined by Semi-Thue and Regular Systems %B BOOK83 %P 537-553 %K AA08 %A G. Mirkowska %A L. Stapp %T Algorithmic Logic Can Express Progressive Behavior of Programs %B BOOK83 %P 615-622 %K AI10 AA08 %A Sara Porat %A Nissim Francez %T Full Commutation and Fair Termination in Equational (and Combined) Term Rewriting Systems %B BOOK82 %P 21-41 %K AI14 %A Donald Sannella %A Andrzej Tarlecki %T Extended ML: An Institution-Independent Framework for Formal Program Development %B BOOK84 %P 364-389 %K AA08 %A M. A. Suchenek %T Compactness in Logic of Programs %B BOOK82 %P 803-810 %K AA08 %A John R. Dixon %A Eugene C. Libardi %A Steven C. Luby %A Mohan Vaghul %A Melvin K. Simmons %T Expert Systems for Mechanical Design - Examples of Symbolic Representations of Design Geometries %J Engineering with Computers %V 2 %N 1 %D 1987 %P 1-10 %K AA05 %A David G. Ullman %A Thomas A. Dietrich %T Mechanical Design Methodology - Implications on Future Developments of Computer-Aided Design and Knowledge-Based Systems %J Engineering with Computers %V 2 %N 1 %D 1987 %P 21-29 %K AA05 AI09 %A William J. Rasdorf %A Karen J. Ulberg %A John W. Baugh %T A Structure-Based Model of Semantic Integrity Constraints for Relational Databases %J Engineering with Computers %V 2 %N 1 %D 1987 %P 31-39 %A H. Schwartzel %A L. Wiesbaum %T New Computer Structures for AI Real Time Applications %B Yearbook 1986 I: DGLR, Annual Meeting %C Munich, West Germany %D Oct 8-10 1986 %P 201-208 %K O03 %A NurErol %A Christian Freksa %T An Approach to Structuring Knowledge for a Design Support System %B Yearbook 1986 I: DGLR, Annual Meeting %C Munich, West Germany %D Oct 8-10 1986 %P 201-208 %K A05 Structural Design aircraft design STUDEL %A S. M. Alexander %T An Expert System for the Selection of Scheduling Rules in a Job Shop %J Computers and Industrial Engineering %V 12 %N 3 %D 1987 %P 167-172 %K AA05 AI01 %A M. Fitting %T Partial Models and Logic Programming %J Theoretical Computer Science %V 48 %N 2-3 %D 1986 %P 229-256 %K AI10 %A Y. Toyama %T Counterexamples to termination for the Direct Sum of Term Rewriting Systems %J Information Processing Letters %P 141-144 %V 25 %N 3 %D MAY 29, 1987 %K AI11 %A M. J. Fischer % N. Immerman %T Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse %J Information Processing Letters %P 175-182 %K AI10 %V 25 %N 3 %A N. A. Alexandridis %A P. D. Tsanakas %T An Encoding Scheme for the Efficient Representation of Hierarchical Image Structures %J Information Processing Letters %V 25 %N 3 %D MAY 29, 1987 %P 199-206 %K AI06 O06 %A J. H. Boose %A J. M. Bradshaw %T Expertise Transfer and Complex Problems: Using Aquinas as a Knowledge- Acquisition Workbench for Knowledge-Based Systems %J MAG140 %P 3-28 %K AI01 %A J. Diederich %A I. Ruhmann %A M. May %T KRITION: A Knowledge-Acquisition Tool for Expert Systems %J MAG140 %P 29-40 %K AI01 %A L. Eshelman %A D. Ehret %A J. McDermott %A M. Tan %T MOLE: A Tenacious Knowledge-Acquisition Tool %J MAG140 %P 41-54 %K AI01 %A W. A. Gale %T Knowledge-Based Knowledge Acquisition for a Statistical Consulting System %J MAG140 %P 55-64 %K AI01 %A G. Klinker %A J. Bentolila %A S. Genetet %A M. Grimes %A J. McDermott %T Knack-Report Driven Knowledge Acquisition %J MAG140 %P 65-80 %K AI01 %A D. C. Littman %T Modeling Human Expertise in Knowledge Engineering %J MAG140 %P 81-92 %K AI01 AI09 %A K. Morik %T Acquiring Domain Models %J MAG140 %P 93-104 %K AI01 %A M. A. Musen %A L. M. Fagan %A D. M. Combs %A E. H. Shortliffe %T Use of a Domain Model to Drive an Interactive Knowledge-Editing Tool %J MAG140 %P 105 %K AI01 %A Feng-Cheng Chang %T Power Series Unification and Reversion %J Applied Mathematics and Computation %V 23 %N 1 %D JULY 1987 %P 7-24 %K AI14 %A Suranjan De %A ShuhShen Pan %A Andrew Whinston %T Temporal Semantics and Natural Language Processing in a Decision Support System %J Information Systems %V 12 %N 1 %D 1987 %P 29-48 %A E. Granum %A G. A. Shippey %A R. J. H. Bayley %A G. Hamilton %A D. Rutovitz %T Real Time Digital Thresholding of Data from Continuous Scanning Linear Arrays %J Signal Processing %V 12 %N 4 %P 349-362 %K AI06 %A L. Gupta %A M. D. Srinath %T Contour Sequence Moments for the classification of Closed Planar Shapes %J MAG141 %P 273-272 %K AI06 %A Noboru Babaguchi %A Tsunehiro Aibara %T Curvedness of a Line Picture %J MAG141 %P 273-280 %K AI06 %A C. H. Hayden %A R. C. Gonzelez %A Ploysongsang %T A Tempral Edge-Based Image Segmentor %J MAG141 %P 281-290 %K AI06 %A H. Lynn Beus %A S. S. H. Tiu %T An Improved Corner Detection Algorithm Based on Chain-coded Plain Curves %J MAG141 %P 291-296 %K AI06 %A Satoshi Suzuki %A Keiichi Abe %T Binary Picture Thinning by an Iterative Parallel Two Subcycle Operation %J MAG141 %P 297-308 %K AI06 %A J. C. Fiala %A R. M. Haralick %T Comparison of a Regular and an Irregular Decomposition of Regions and Volumes %J MAG141 %P 309-320 %K AI06 %A Maylor K. Leung %A Yee-Hong Yang %T A Region Based Approach for Human Body Motion Analysis %J MAG141 %P 321-340 %K AI06 %A C. G. Leedham %A A. C. Downton %T Automatic Recognition and Transcription of Pitman's Handwritten Shorthand-- An Approach to Shortforms %J MAG141 %P 341-349 %K AI06 AA06 %A A. M. Wallace %T An Informed Strategy for Matching Models to Images of Fabricated Objects %J MAG141 %P 349-364 %K AI06 AI07 %A H. B. Bidasaria %T Least Desirable Feature Elimination in a General Pattern Recognition Problem %J MAG141 %P 365 %K AI06 %A Tery Caelli %A Shyamala Nagendran %T Fast Edge-Only Matching Techniques for Robot Pattern Recognition %J MAG142 %P 131-143 %K AI06 AI07 %A M. Pilar Martinez-perez %A Javier Jimenez %A Jose L. Navolon %T A Thinning Algorithm Based on Contours %J MAG142 %P 186-201 %K AI06 %A S. A. Lloyd %A E. R. Haddow %A J. F. Boyce %T A Parallel Binocular Stereo Algorithm Utilizing Dynamic Programming and Relaxation Labelling %J MAG142 %P 202-225 %K AI06 %A Federico Bumbaca %A Kenneth C. Smith %T Design and Implementation of a Colour Vision Model for Computer Vision Applications %J MAG142 %P 226-245 %K AI06 %A Joseph O'Rourke %A Heather Booth %A Richard Washington %T Connect-the-Dots: A New Heuristic %J MAG142 %P 258 %K AI06 %A R. Banares-Alcantara %A A. W. Westerberg %A E. I. Ko %A M. D. Rychener %T Decade - A Hybrid Expert System for Catalyst Selection - I Expert System Considerations %J Computers and Chemical Engineering %V 11 %N 3 %D 1987 %P 265-278 %K AI01 AA05 %A D. Dubois %A H. Prade %T Twofold Fuzzy Sets and Rough Sets Some Issues in Knowledge Representation %J MAG147 %P 3-18 %K O04 AI16 %A B. Bouchon %T Fuzzy-Inferences and Conditional Probability Distributions %J MAG147 %P 33-42 %K O04 AI16 %A A. O. Arigoni %T Heuristic Embodiment of Evidence - Evaluation of the Credibility of Hypothesized Causes %J MAG147 %P 43-54 %K O04 %A H. Shvaytser %T On a Consistency measure for Object Labeling Problems %J MAG147 %P 55-72 %K O04 AI06 %A D. Norris %A B. W. Pilsworth %A J. F. Baldwin %T Medical Diagnosis from Patient Records - A Method Using Fuzzy Discrimination and Connectivity Analyses %J MAG147 %P 73-88 %K AA01 AI01 O04 %A J. Anderson %A W. Bandler %A L. J. Kohout %A C. Trayner %T A Route-Choosing Medical Diagnostic Technique %J MAG147 %P 89-96 %K AA01 AI01 O04 %A T. P. Martin %A J. F. Baldwin %A B. W. Pilsworth %T The Implementation of FPROLOG - A Fuzzy Prolog Interpreter %J MAG147 %P 119-130 %K T01 O04 %A B. W. Pilsworth %T Review of the Panel Discussion on Fuzzy Reasoning in Artificial Intelligence and Operations Research %J MAG147 %P 159 %K AA05 O04 %A Edward L. Fisher %A Shimon Y. Nof %T Knowledge-Based Economic Analysis of Manufacturing Systems %J Journal of Manufacturing Systems %V 6 %N 2 %D 1987 %P 137-150 %K AA05 AA06 %A R. Milne %T Strategies for Diagnosis %J MAG144 %P 333-339 %K AA21 %A P. K. Fink %A J. C. Lusth %T Expert Systems and Diagnostics Expertise in the Mechanical and Electrical Domains %J MAG144 %P 340-349 %K AA21 AA05 %A K. D. Forbus %T Interpreting Observations of Physical Systems %J MAG144 %P 350-359 %K AI16 %A E. A. Scarl %A J. R. Jamieson %A C. I. Delaune %T Diagnosis and Sensor Validation Through Knowledge of Structure and Function %J MAG144 %P 360-368 %K AA21 AI16 %A H. Nawab %A Y. Lesser %A E. Milios %T Diagnosis Using the Formal Theory of a Signal Processing Systems %J MAG144 %P 369-379 %K AA21 AA05 %A M. J. Pazzani %T Failure Driven Learning of Fault Diagnosis Heuristics %J MAG144 %P 380-394 %K AA21 AI04 %A Y. Peng %A J. A. Reggia %T A Probabilistic Causal Model for Diagnosistic Problem Solving - Part II: Diagnostic Strategy %J MAG144 %P 395-406 %K AA21 O04 ------------------------------ End of AIList Digest ******************** 18-Sep-87 23:37:06-PDT,22937;000000000000 Mail-From: LAWS created at 18-Sep-87 23:29:10 Date: Fri 18 Sep 1987 23:27-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #216 - Seminars, Conferences To: AIList@SRI.COM AIList Digest Saturday, 19 Sep 1987 Volume 5 : Issue 216 Today's Topics: Seminars - PRIDE: Knowledge-Based Design (SRI) & Declarative Device Modeling (UPenn) & Functional Languages and Temporal Logic (SRI), Conference - AI in Minerals and Technology & Logic and Databases (Switzerland) & AIAA Computers in Aerospace VI & RIAO '88 Content-Based Text and Image Handling ---------------------------------------------------------------------- Date: Wed, 16 Sep 87 18:15:21 PDT From: Amy Lansky Subject: Seminar - PRIDE: Knowledge-Based Design (SRI) VISITORS: Please arrive 5 minutes early so that you can be escorted up from the E-building receptionist's desk. Thanks! PRIDE: A KNOWLEDGE-BASED FRAMEWORK FOR DESIGN Sanjay Mittal (MITTAL@XEROX.COM) Intelligent Systems Laboratory, Xerox PARC 11:00 AM, MONDAY, September 21 SRI International, Building E, Room EJ228 In this talk I will describe the Pride project at Xerox. The first part of the talk will be about an expert system for the design of paper transports inside copiers. A prototype version of the system has been in field test for over a year and will be in regular use by year-end. It has been successfully used on real copier projects inside Xerox - both for designing and for checking designs produced by engineers. From an applications point of view we have been motivated by the following observations: knowledge is often distributed among different experts; the process of generating designs is unnecessarily separated from their analysis, leading to long design cycles; and design is an evolutionary process, i.e., a process of exploration. The second part of the talk will describe the framework in Pride for representing design knowledge and using it to support the design process. In this framework, called Describe, the process of designing an artifact is viewed as knowledge guided search in a multi-dimensional space of possible designs. The dimensions of such a space are the design parameters of the artifact. In this view, knowledge is used not only to search the space but also to define the space. Domain knowledge is organized in terms of design plans, which are organized around goals. Conceptually, goals decompose a problem into sub-problems and are the units for structuring knowledge. Design goals have design methods associated with them, which specify alternate ways to make decisions about the design parameters of the goal. The third major element of a plan are constraints on the design parameters. The framework provides a problem solver for executing these plans. The problem solver combines dependency-directed backtracking ideas with an advice mechanism and a context mechanism for simultaneously maintaining multiple partial designs. The Describe framework has been successfully used to build a second expert system called Cossack for configuring micro-computer systems. If time permits, I will talk about some of the more recent ideas that have come out of the Pride project: Knowledge compilation, Partial choices in constraint reasoning, and constraint compilation. ------------------------------ Date: Mon, 14 Sep 87 17:38:54 EDT From: tim@linc.cis.upenn.edu (Tim Finin) Subject: Seminar - Declarative Device Modeling (UPenn) From: Christian Overton Seminar Paoli Research Center UNISYS Paoli. PA Coordinating the Use of Qualitative and Quantitative Knowledge in Declarative Device Modeling Peter Karp Knowledge Systems Laboratory Computer Science Department Stanford, CA 94305 We describe several new qualitative representations and reasoning techniques. These techniques allow us to represent both state variables and the interactions between them with varying degrees of precision. This is desirable when we have only partial knowledge about these entities or when we wish to express approximations to the knowledge we do have. New reasoning strategies have been develped to allow the propagation of the different types of values through the differnt types of interactions. Tuesday, Sept. 15, 1987 4:00 - 5:00 Cafeteria Conference Room, PRC For further information contact Chris Overton at 648-7533. ------------------------------ Date: Tue, 8 Sep 87 15:29:12 PDT From: Margaret Olender Subject: Seminar - Functional Languages and Temporal Logic (SRI) 11:00am, WEDNESDAY, September 9, 1987 SRI International, Building E, Room EJ228 CONTROLLING THE BEHAVIOUR OF FUNCTIONAL LANGUAGE SYSTEMS USING TEMPORAL LOGIC Lyndon While Imperial College London Functional programming languages, although possessing many advantages, have certain limitations when they are applied to systems where control over the program's behaviour is required. We have developed a methodology that overcomes this limitation without destroying the pure declrative nature of these languages. Temporal logic is used to specify any behavioural aspect of the problem and this is then transformed together with the (pure) functional language program to produce a program that is guaranteed to satisfy the temporal requirements however it is implemented. We will describe the Tempoaral Logic specification language used together with the transformation rules. This methodology has been implemented as a completely automatic process and we will give some examples of its use. ------------------------------ Date: Sun, 06 Sep 87 19:13:48 CDT From: "Kevin O'Kane (205) 348 6363" Subject: Conference - AI in Minerals and Technology Artificial Intelligence in Minerals and Technology Conference October 20-21, 1987 The University of Alabama Ferguson Center Tucaloosa, Alabama Sponsored by: United States Department of the Interior Bureau of Mines Co-Sponsors: The University of Alabama, College of Continuing Studies The University of Alabama, College of Engineering University of Missouri, Rolla Colorado School of Mines For information contact: Dr. Jack R. Woodyard U.S. Bureau of Mines Tuscaloosa Research Center (205) 759-9422 or Registration Services College of Continuing Studies P.O. Box 2967 Tuscaloosa, AL 35487 (205) 348-3000 Program Agenda: 1. Tutorial: Introduction to Neural Networks and Associa- tive Memory (3.5 hours) Bart Kosko, Verac Corp. 2. Neural Networks Simulation for Welding Image Under- standing. 3. Introduction to the University of Alabama Department of Mechanical Engineering's Robotics Laboratory. 4. The Use of Expert Systems for Mineral Processing Appli- cations. 5. Toward Fuzzy Expert Systems: An Example from Mineral Identification. 6. Predicting Chemical Parameters with Prolog. 7. Experiences Gained form Using an Expert Systems Approach in Process Management. 8. Knowledge Systems for Troubleshooting Production Machines. 9. Use of Fuzzy Logic for Rule Based Control of Liquid Level in Vessels. 10. The Goal of User Development and Maintenance of Expert Systems. 11. Genetic Algorithm. 12. MICA - An Expert System. 13. Expert System for Material Selection. 14. Application of Re-Writing Techniques to Inference Tech- niques. 15. Process Control with a General Purpose Fuzzy Expert System. 16. Computer Architecture and Intelligent Systems for Real Time Applications. 17. Role of AI in Analytical Instrumentation. 18. Application of Expert Systems Knowledge Refinement Techniques in Material Technology. 19. Application of Artificial Intelligence to Alloy Design. 20. Use of Expert Systems in in Cast Metals Technology. 21. Prototyping of an Expert System for Troubleshooting of Clinkers Grinding Mills. 22. CORDIAL: A PC Computer-based System for the Diagnosis of Stress Corrosion Behavior in High Strength Aluminum Alloy. 23. Artificial Intelligence in Automated Scrap Processing. 24. Applications of Expert Systems Technology at Bethlehem Steel Corporation. 25. Panel Discussion, Summation and Conclusion. For registration information, contact the Jack Woodyard or Registration Services (given above) or OKANE at UA1VM.BITNET. ------------------------------ Date: 10 Sep 87 23:59:31 GMT From: mcvax!cui!shneider@uunet.UU.NET (SCHNEIDER Daniel) Reply-to: mcvax!cui!shneider@uunet.UU.NET (SCHNEIDER Daniel) Subject: Conference - Logic and Databases (Switzerland) SGAICO (Swiss Group for Artificial Intelligence and Cognitive Science) CONFERENCE AND TUTORIAL ON LOGIC AND DATABASES HEC, University of Lausanne, Switzerland (sorry for being late, but the deadlines are not so real ....) CONFERENCE, Wednesday, October 7, 1987 Jean-Marie Nicolas (ECRC, Munich): On Deductive Databases Shamim A. Naqvi (MCC, Austin): The Problem of Recursive Queries in Knowledge Based Systems} Laurent Vieille (ECRC, Munich): DEDGIN: A Deductive Query-Answering Database System} Eric Simon (INRIA, Paris): A Production Rule Based Approach to Deductive Databases Richard Paul Braegger (ETH,Zurich): Knowledge Based Tools for the Design of Data Bases Conference Fees SI or SVI/FSI Sfr. 120.- non members Sfr. 200.- students Sfr. 50.- TUTORIAL, Tuesday, October 6, 1987 A one-day introduction to the subject will be offered both in French and in German by Pierre Bonzon (HEC, Lausanne), Robert Marti and Alfred Ultsch (ETH, Zurich). The number of participants will be limited to 30 per group. Familiarity with DBMS concepts will be assumed and emphasis will be on logic concepts. Tutorial Fees SI or SVI/FSI Sfr. 130.- non members Sfr. 210.- students Sfr. 20.- Program Committee Pierre Bonzon (University of Lausanne), Jiri Kriz (BBC,Baden) Daniel Schneider (University of Geneva), Alfred Ultsch (ETHZ) Registration: Contact the SI secretariat: (+41 1) 481 73 90 (Ms. A.-M. Nicolet) SI/SGAICO, P.O.Box 570, 8027 Zurich, Switzerland. (Late registration for the conference is possible at the registration desk) From: Daniel K.Schneider, ISSCO, University of Geneva, 54 route des Acacias, 1227 Carouge (Switzerland), Tel. (..41) (22) 20 93 33 ext. 2116 --> to EAN/X400/MHS (on Unix, (preferable :]) : EAN/X400:shneider@cui.unige.chunet | if reply does ARPA: shneider%cui.unige.chunet@csnet-relay.arpa | not work, CSnet: shneider%cui.unige.chunet@csnet-relay.csnet | keep trying: (or:....%relay.cs.net@relay.cs.net) | mailers are JANET: shneider%cui.unige.chunet@cs.ucl.ac.uk | *great* fun! uucp: mcvax!cernvax!cui!shneider | ;-( |+{ :=[ --> to BITNET (on VMS, the easy solution): BITNET: SCHNEIDE@CGEUGE51 ARPA: SCHNEIDE%CGEUGE51.BITNET@WISCVM == Warnings: (1) hitting the reply key may not work (2) CHUNET will be renamed soon into CH -- Daniel K.Schneider, ISSCO, University of Geneva, 54 route des Acacias, 1227 Carouge (Switzerland), Tel. (..41) (22) 20 93 33 ext. 2116 --> to EAN/X400/MHS (on Unix, (preferable :]) : EAN/X400:shneider@cui.unige.chunet | if reply does ARPA: shneider%cui.unige.chunet@csnet-relay.arpa | not work, CSnet: shneider%cui.unige.chunet@csnet-relay.csnet | keep trying: (or:....%relay.cs.net@relay.cs.net) | mailers are JANET: shneider%cui.unige.chunet@cs.ucl.ac.uk | *great* fun! uucp: mcvax!cernvax!cui!shneider | ;-( |+{ :=[ --> to BITNET (on VMS, the easy solution): BITNET: SCHNEIDE@CGEUGE51 ARPA: SCHNEIDE%CGEUGE51.BITNET@WISCVM ------------------------------ Date: Fri, 11 Sep 87 06:03 PDT From: nesliwa%nasamail@ames.arpa (NANCY E. SLIWA) Subject: Conference - AIAA Computers in Aerospace VI As a member of the AIAA Technical Committee on Computer Systems, I wanted to share with you the program of our up-coming bi-annual conference, Computers in Aerospace 6. The themes this year ar AI, Ada, and Advance Architectures, all slanted to aerospace applications. I would appreciate your sharing this information with anyone in your organization that you think might be interested in it. I'm hapy to answer any questions: FTS 928-3871, (804)865-3871 Nancy Sliwa [I've cut this from the original 47,000 characters. If you need the full text, contact the author. -- KIL] Subj: Computers in Aerospace VI Program American Institute of Aeronautics and Astronautics Computers in Aerospace VI Conference Hilton at Colonial Wakefield, Massachusetts October 7 - 9, 1987 Conference Committee General Chairman Malcolm Stiefel MITRE Corp. Technical Program Chairman Lt. Colonel Ralph Gajewski SDIO Technical Program Co-Chairman Wayne H. Bryant NASA Langley Research Center ------------------------------ Date: Fri, 11-SEP-1987 18:28 EST From: FOXEA%VTVAX3.BITNET@wiscvm.wisc.edu Subject: Conference - RIAO '88 Content-Based Text and Image Handling In V3 #20 the call for papers for RIAO '88 was published. I have heard that there has been a disappointing response from US universities. Since some of you may not have received #20, due to mail problems or summer trips, I am sending out the call again. Some may have noted that this conference is the same week as the Office Information Systems Conference. Special arrangements will be made to schedule people who want to attend both to speak on the 21st or 22nd if they want to then go on to the OIS conference. While it is desirable that systems being discussed be demonstrable, it is understood that university systems are typically prototypes, so people should not be scared off by that factor. - Ed CALL FOR PAPERS RIAO 88 USER-ORIENTED CONTENT-BASED TEXT AND IMAGE HANDLING Massachusetts Institute of Technology Cambridge, MA March 21-24, 1988 Conference organized by: Centre National de la Recherche Scientifique (CNRS) Centre National de Recherche des Telecommunications (CNET) Institut National de Recherche en Informatique et Automatique (INRIA) Ecole Nationale Superieure des Mines de Paris Centre de Hautes Etudes Internationales d'Informatique Documentaires (CID) US participating organizations: American Federation of Information Processing Societies (AFIPS) American Society for Information Science (ASIS) Information Industry Association (IIA) This conference is prepared under the direction of: Professor Andre Lichnerowicz de l'Academie des Sciences de Paris and Professor Jacques Arsac correspondant de l'Academie des Sciences de Paris RIAO: Recherche d'Informations Assistee par Ordinateur A GENERAL INTRODUCTION: RIAO 88 is being held to demonstrate the state of the art in information retrieval, a domain that is in rapid evolution because of developments in the technology for machine control of full-text and image databases. This evolution is stimulated by the demands of end-users generated by the recent availability of CD-ROM full text publishing and general public access to information data bases. A group of French organizations has taken the initiative of preparing this conference. Its wish in promoting this forum is not only to stimulate and challenge researchers from all nations but also to increase an awareness of European technology. This "call for papers" is beeing distributed world-wide. We want to reach individuals in the research communities throughout the university and industrial sectors. The conference will be held in Cambridge, MA. We hope that it will encourage the exchange of European and American viewpoints, and establish new links between research teams in United-states and Europe. CALL FOR PAPERS General theme Full-text and mixed media database systems are characterized by the fact that the structure of the information is not known a priori. This prevents advance knowledge of the types of questions that will be asked, unlike the situation found in hierarchical and relational database management systems. You are invited to submit a paper showing how the situation can be dealt with. Special attention will be given to: - techniques designed to reduce imprecision in full-text database searching; - data entry and control; - "friendly" end-user interfaces. - new media A large number of specific subjects can be treated within this general framework. Some suggestions are made in the following section. Specific themes A) Linguistic processing and interrogation of full text databases: - automatic indexing, - machine generated summaries, - natural language queries, - computer-aided translation, - multilingual interfaces. B) Automatic thesaurus construction, C) Expert system techniques for retrieving information in full-text and multimedia databases: - expert systems reasoning on open-ended domains - expert systems simulating librarians accessing pertinent information. D) Friendly user interfaces to classical information retrieval systems. E) Specialized machines and system architectures designed for treating full-text data, including managing and accessing widely distributed databases. F) Automatic database construction scanning techniques, optical character readers, output document preparation, etc... G) New applications and perspectives suggested by emerging new technologies: - optical storage techniques (videodisk, CD-ROM, CD-I, Digital Optical Disks); - integrated text, sound and image retrieval systems; - electronic mail and document delivery based on content; - voice processing technologies for database construction; - production of intelligent tutoring systems; - hypertext, hypermedia. Conditions for participation The program committee is looking for communications geared toward practical applications. Papers which have not been validated by a working model, a prototype or a simulation, or for which a realization of such a model seems currently unlikely, may be refused. Authors must submit a paper of about 10 pages doubled spaced, and a 100 word abstract. Four copies must be sent before October 30 to one of these two addresses: - RIAO 88, Conference Service Office, MIT, Bldg 7, Room 111 CAMBRIDGE, MA 02139 - RIAO 88, CID, 36 bis rue Ballu, 75009 PARIS FRANCE Each presentation will last 20 minutes followed by 10 minutes of discussion and questions. Arrangement have been made with the international journal "Information Processing and Management" for publishing expanded versions of some papers. High quality audiovisual techniques should be used when presenting the paper. Separate demonstration sessions can be scheduled if requested. Particular attention will be paid to : - the use of readily available equipment for demonstrations (IBM PC, APPLE, network connec- tions...); - pre-recorded video or floppy disk displays. Hardcopy printouts of results should be avoided if possible. English is the working language of the conference. For further information call: in North America : Karen Daifuku, tel: (202) 944 62 52 in other countries: Secretariat General du CID in France, tel: (1) 42 85 04 75 ------------------------------ End of AIList Digest ******************** 18-Sep-87 23:42:27-PDT,16880;000000000000 Mail-From: LAWS created at 18-Sep-87 23:39:29 Date: Fri 18 Sep 1987 23:35-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #217 - Literature Duplication, Philosophy To: AIList@SRI.COM AIList Digest Saturday, 19 Sep 1987 Volume 5 : Issue 217 Today's Topics: Comment - Duplication of AI Literature Titles, Philosophy - Boltzmann on Philosophy & Natural Kinds, Computer Science - Discipline Nature & P = NP ? ---------------------------------------------------------------------- Date: Mon, 14 Sep 87 12:53:58 pdt From: Eugene Miya N. Subject: Note on MP biblio update (WARNING!) Please excuse cross-posting to so many newgroups, but I believe the following to be important. Recently, while updating bibliographic entries, I have noticed a disturbing trend. I had to resolve in excess of 300 name conflicts in 8,000. Most were updates in status from TRs to Journals or Books. But a size percentage were papers publised in more than one location (31 titles total), and papers/texts with the same title, but different authors/contents, etc. (18, remember double each of these counts for a lower bound). Increasing interest is creating a bigger headache For example: popular titles include: %T Distributed Operating Systems (one book, one article) %T Elliptic Problem Solvers %T Supercomputers (3 books this title) %T Supercomputers in Theoretical and Experimental Science (one book, one article) %T A Framework for Distributed Problem Solving %T Estimating Speedup in Parallel Parsing %T Multi-grid solvers on parallel computers One interesting name conflict seems to come from titles of SIMD processors such as [SIMD titles] %T The Distributed Array Processor %T The Massively Parallel Processor which occur in some cases 4-5 times. Will Connection Machine papers be far behind? 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: Mon, 14 Sep 87 11:51:26 EDT From: mckee%corwin.ccs.northeastern.edu@RELAY.CS.NET Subject: Boltzmann on philosophy and as long as we're collecting anti-philosophical quotes: There is much that is appropriate and correct in the writings of these philosophers. Their remarks, when they denounce other philosophers, are appropriate and correct. But when it comes to their own contributions, they are usually not so. - Ludwig Boltzmann Quoted in the preface to John Casti's "Connectivity, Complexity, and Catastrophe in Large-Scale Systems" (1979). No citation for Boltzmann, though... ------------------------------ Date: 14 Sep 87 15:03:19 GMT From: Gilbert Cockton Reply-to: Gilbert Cockton Subject: Re: Natural kinds In article <"870828113435.1.rjz@JASPER"@UBIK.Palladian.COM> rjz%JASPER@LIVE-OAK.LCS.MIT.EDU writes: >In McCarthy's message of Jul 10, he talks of the need for AI >systems to be able to learn and use "natural kinds", I'd like to continue the sociological perspective on this debate. Rule number 1 in sociology is forget about "naturalness" - only sociobiologists are really into "nature" now, and look at the foul images of man that they've tried to pass off as science (e.g. Dworkin). > McCarthy's original point is the more crucial: that people seem to be able > to classify objects in the absence of precise information. Psychologists cram a lot under the heading of "ability". The learner is often assumed to have an active, conscious problem solving role. When dealing with formal problems and knowledge, such a characterisation seems valid. With social constructs such as informal categories, "ability" is not the result of an active learning process. Rather the ability follows automatically from cultural immersion. >This is important if individuals are to "make sense" of their world, >meaning they are able to induce any significant >generalizations about how the world works. Artifacts of civilization are only induced once. Thereafter, if they fulfil social needs, they remain unchanged. Rather than induce what a chair is, children learn what it is as part of their sociolinguistic development. They come to know what a chair is without ever actively and consciously inducing a formal definition. >Perhaps we could call this expanded notion an "empirical kind". "Empirical" is about as helpful as "natural" when it comes to reasoning about social phenomena. >Third: Such "kinds" are especially important for communicating with other >individuals. Being based on individual experience, no two persons' > conceptions of a given concept can be assumed to correspond _exactly_. At last, some social reasoning :-)! However, surface differences in statements about meaning do not imply deep differences over the real concept. The problem is one of language, not thought. Note also that where beliefs about a concept are heavily controlled within a society, public expression about a concept can be almost identical. See under ideology or theocracy. Once again, the reason why so much AI research is just one big turn-off is that much of it is a very amateur and jargon-ridden sophomore attempt at formalising phenomena which are well understood and much studied in other real disciplines. Anthropological studies of the category systems of societies abound. Levi-Strauss for one has explored the reoccurance of binary oppositions in many category systems. The difference between the humanities and AI is mainly that the former are happy to write, as elegantly as possible, in natural language, whereas in the latter there is a fetish for writing in a mixture of LISP, cut-down algebra and folk-psychology without an ounce of scholarship. There is rigour no doubt, but without scholarship it is worthless. Artificial ignorance is an apt characterisation. The debate on natual kinds appears to have emerged from a discussion of where AI needs to go next. Perhaps AI folk should drop the hill-climbing and take their valuable techniques back into the disciplines which can make use of them in a sensible and balanced way. Then perhaps only programmes worth writing will be implemented and this nonsense about tidying up poorly expressed ideas on a dumb machine can be interred once and for all. -- Gilbert Cockton, Scottish HCI Centre, Ben Line Building, Edinburgh, EH1 1TN JANET: gilbert@uk.ac.hw.hci ARPA: gilbert%hci.hw.ac.uk@cs.ucl.ac.uk UUCP: ..{backbone}!mcvax!ukc!hwcs!hci!gilbert ------------------------------ Date: 16 Sep 87 14:21:59 GMT From: styx.rutgers.edu!schaffer@RUTGERS.EDU (Schaffer) Subject: Patrick Hayes on AI & Science Section 10 of Hayes's paper "The Second Naive Physics Manifesto" is entitled "Is This Science?" The section is reproduced in full here: The earlier manifesto ended on a note of exquisite methodological nicety: whether this activity could really be considered *scientific*. This second manifesto will end on a different note. Doing this job is necessary, important, difficult and fun. Is it really scientific? Who cares? ------------------------------ Date: Wed 16 Sep 87 17:06:07-PDT From: Andy Freeman Subject: Materials Science appears to be a science. It is the exception that tests the rule "Every field with `science' in its name isn't." -andy ------------------------------ Date: 17 Sep 87 05:45:57 GMT From: pioneer!eugene@ames.arpa (Eugene Miya N.) Subject: Re: Is Computer Science Science? Not a science yet, but as Mike Shafto pointed out. Denning will have column in American Scientist on this (I am reviewing) Nov. maybe. I will have two papers on this in ACM Software Engineering Notes (positive suggestions for improvements), and I also suggest reading the paper by Knuth in 1985 Amer. Math. Monthly on the differences between Mathematical and Algorithmic thinking (Computation != math), and oh yes, Simon's "Sciences of the Artificial" especially the chapter on Empiricism (and his Turing award lecture). Summary and concesses? It aspires, it's different from other sciences, it can be improved. Need we say more? 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: 16 Sep 87 22:12:41 GMT From: ramesh@cvl.umd.edu (Ramesh Sitaraman) Subject: Re: Is Computer Science Science? In article <737@elmgate.UUCP> ram@elmgate.UUCP (Randy Martens) writes: >I am of the firm opinion that there is NO such thing as >computer science. Unfortunately you are totally wrong!!! The scientific part of CS deals with unravelling the nature of computation. This is the object of study of theoretical areas such as Complexity theory, recursive function theory, programming language semantics etc. Computation is an abstract process but unlike other abstract formalisms is immediately applicable and can be realised through physical computers. Thus there has been such an overwhelming growth in computer applications that the applicational aspects of CS are more evident to an *outsider* than the theoretical core. Note that computation existed long before computers. Neither Eratosthenes or Galois knew anything about digital computers but they certainly did know about computation. Therefore the development of computers, though extremely beneficial, is only incidental to a theoretician. >"Reality - What a Concept !" - R.Williams Ramesh -- ----------------------------------------------------------------- ARPA: ramesh@cvl.umd.edu | If I had had more time, I could SPRINT:(301) 927 6831 | have written you a shorter letter. UUCP: ramesh@cvl.uucp | -Blaise Pascal ------------------------------ Date: 17 Sep 87 13:31:08 GMT From: sunybcs!bingvaxu!leah!uwmcsd1!uwm-cs!litow@rutgers.edu (Dr. B. Litow) Subject: Re: Is Computer Science Science? In article <2474@cvl.umd.edu>, ramesh@cvl.umd.edu (Ramesh Sitaraman) writes: > In article <737@elmgate.UUCP> ram@elmgate.UUCP (Randy Martens) writes: > >I am of the firm opinion that there is NO such thing as > >computer science. > > Unfortunately you are totally wrong!!! The scientific part of CS > deals with unravelling the nature of computation. This is the > object of study of theoretical areas such as Complexity theory, > recursive function theory, programming language semantics etc. > Computation is an abstract process but unlike other abstract > formalisms is immediately applicable and can be realised through > physical computers. Thus there has been such an overwhelming > growth in computer applications that the applicational aspects of CS are > more evident to an *outsider* than the theoretical core. I agree with this poster. I fact I would go on to say that the design of programming languages,systems and such things as network protocols,etc. are also just applications. I earlier posted my belief that CS is an entirely new branch of mathematics so that in a way CS is indeed not a science in the sense that physics is a science. However, there are profound issues at the border of CS and physics,for example which I take as a sound indication of the depth of CS. The confounding of CS with its applications can only impede progress especially in the matter of new applications. The failure to consider 'TCS' as real CS is becoming a serious matter and I think that the current accreditation issue for CS in colleges must be resolved in a manner that places sufficient emphasis on computation theory. I close with an example. The emergence of NC and related parallel computing models out of alternating Turing machine studies of the late 70's is a clear indication of the power of good theory. ------------------------------ Date: Thu, 17 Sep 87 15:03:33 EDT From: dml@NADC.ARPA (D. Loewenstern) Subject: Re: Is Computer Science is Science? >From: kodak!elmgate!ram@cs.rochester.edu (Randy Martens) >I am of the firm opinion that there is NO such thing as >computer science. To quote (and I have forgotten the attribution) >"Computer Science bears the same relationship to Real Science, that >plumbing bears to Hydrodynamics." >There is, however, Computer Engineering. (and Software Engineering, >and Systems Engineering etc.). Science is the discovery of the new. >Engineering takes what the scientists have found, and finds ways >to do useful things with it. The two are like Yin and Yang, closely >interrelated, but not the same, and each dependant on the other. I think that what Mr. Martens has said is: 1. a. Science is the discovery of the new. b. There is no such thing as computer science. => There is no discovery of the new in the realm of computers. 2. a. Engineering takes what the scientists have found... => Computer Engineering takes what the Computer Scientists have found... b. There is no such thing as computer science. => There are no computer scientists. => Nothing has been found by computer scientists. => Computer Engineering takes nothing and finds ways to do useful things with it. (8v)) David Loewenstern Naval Air Development Center code 7013 Warminster, PA 18974-5000 ------------------------------ Date: 15 Sep 87 09:49:49 GMT From: mcvax!hafro!krafla!snorri@seismo.css.gov (Snorri Agnarsson) Subject: Re: P may indeed = NP !! ... > "Dr. Swart's problem establishes that the Hamilton circuit problem can > be solved in polynomial time by converting a mathematical programming > formulation of the problem into a linear programming formulation and > using existing polynomial time algorithms as established by Kachiyan > and Karmarkar." ... OK - let me take a guess as to what is wrong with this approach: My guess is that Karmarkars polynomial time algorithms are only polynomial time if calculations are performed using fixed accuracy floating point arithmetic, and if infinite precision arithmetic is used then the algorithms are no longer polynomial time. Furthermore, I would guess that to solve the Hamiltonian circuit problem you would need infinite precision arithmetic. -- Snorri Agnarsson UUCP: snorri@rhi.edu Science Istitute ...!mcvax!hafro!rhi!snorri University of Iceland ------------------------------ Date: 17 Sep 87 03:02:38 GMT From: linus!bs@husc6.harvard.edu (Robert D. Silverman) Subject: Re: P may indeed = NP !! In article <11@krafla.UUCP] snorri@krafla.UUCP (Snorri Agnarsson) writes: ] ]My guess is that Karmarkars polynomial time algorithms are only ]polynomial time if calculations are performed using fixed accuracy ]floating point arithmetic, and if infinite precision arithmetic is ]used then the algorithms are no longer polynomial time. ]Furthermore, I would guess that to solve the Hamiltonian circuit ]problem you would need infinite precision arithmetic. ]-- ]Snorri Agnarsson UUCP: snorri@rhi.edu ]Science Istitute ...!mcvax!hafro!rhi!snorri ]University of Iceland Sorry, your guess makes some sense but is incorrect. The arithmetic precision required for Khachian's algorithm (and Karmarkar's) may be built into the algorithm. Secondly, all linear programming problems with rational coefficients may be solved using finite precision. I'm getting tired of hearing about P=NP proofs. It reminds me too much of the many crackpots from previous generations who tried to 'square the circle' or 'trisect a general angle' with straightedge and compass. All of the P=NP proofs reported so far have the same flaw: They try to formulate an NP problem as a linear program but ALL wind up requiring an exponential number of variables in the size of the problem instance. Bob Silverman ------------------------------ End of AIList Digest ******************** 21-Sep-87 20:48:39-PDT,15480;000000000000 Mail-From: LAWS created at 21-Sep-87 20:27:11 Date: Mon 21 Sep 1987 20:19-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #218 - Prolog, Lisp Syntax, OPS5 for the PC To: AIList@SRI.COM AIList Digest Tuesday, 22 Sep 1987 Volume 5 : Issue 218 Today's Topics: Queries - Expert Systems on the Mac & KRL & Publication Vehicles for AI & 'how' and 'why' in Prolog, AI Tools - Object-Oriented Prolog & Procedures and Data & Lisp Syntax & OPS5 for the PC, Humor On the Kids Screaming Behind ---------------------------------------------------------------------- Date: 21 Sep 87 18:31:41 GMT From: rochester!ritcv!waw@RUTGERS.EDU (Walter Wolf) Subject: Expert Systems on the Mac In the near future, I have to implement an expert system on a Mac. I am aware of two tools: 1) Humble, a shell developed by Xerox which runs entirely within a Smalltalk environment and 2) Some combination of ExperIntelligence products, such as common OPS5, Common Lisp and the inerface builder. An extensive graphic interface is a required part of the system. I would greatly appreciate hearing from anyone who knows anything (pro or con) about these or other tools for the Mac. Please e-mail to me -- I will summerize and post anything of general interest. Thanks in advance, Walter Wolf waw@rit rochester!ritcv!waw ------------------------------ Date: 12 Sep 87 15:16:00 GMT From: mcvax!unido!uklirb!spieker@seismo.css.gov Subject: KRL-Information wanted - (nf) Hi, there in netland! I heard about the frame-oriented language KRL (Bobrow,Winograd). Looking for further information about KRL since 1980 I found nothing. So I would appreciate getting some more recent information. Already found: Bobrow, Winograd: An Overview of KRL, a Knowledge Representation Language Lehnert, Wilks: A Critical Perspective on KRL Bobrow, Winograd: KRL: Another Perspective Thanks in advance Peter Spieker Universitaet Kaiserslautern Fachbereich Informatik P.O.Box 3049 D-6750 Kaiserslautern West-Germany E-mail(UUCP): spieker@uklirb.uucp (...mcvax!unido!uklirb!spieker) ------------------------------ Date: 16 Sep 87 20:54:07 GMT From: linus!philabs!raca@husc6.harvard.edu (Rich Caruana) Subject: Query about publication vehicles for AI Quite a few months back I saw a posting here about the different forums for AI publications and their citation frequencies. The posting stated that in AI, unlike in most other fields, most publications and citations were in conference proceedings (particularly IJCAI and AAAI). Other fields cite journals much more heavily than conferences. For reasons too complex and too boring to go into, I'd be very interested in getting: a) this original posting, or b) a reference or source for this information, or c) any other information regarding this subject. E-mail or post as you see fit: Usenet: philabs!raca Arpanet: raca@philabs.philips.com You can also call me at 914-945-6450 if that is easier. Thanks ahead of time. Richard A. Caruana AI Department Philips Labs 345 Scarborough Rd. Briarcliff Manor, NY 10510 [The SIGART Newsletter had a survey of the online retrieval services a few issues back. About half of the available AI literature could be found in one of the common databases; half of the remaining citations were in another. -- KIL] ------------------------------ Date: 17 Sep 87 10:43:40 GMT From: mcvax!kddlab!icot!nttlab!gama!shako!mazda@seismo.css.gov (N.Mazda) Subject: 'how' and 'why' in prolog Does anyone know how to program 'How' and 'Why' in Dec-10 Prolog? I am novice to both Expert Systems and Prolog. Thank you in advance for your valuable info. MAZDA, N. at ISEP, U. of Tsukuba, Japan. ------------------------------ Date: Wed, 16 Sep 87 18:25 EDT From: Brad Miller Reply-to: miller@cs.rochester.edu Subject: Object oriented PROLOG Date: Sun, 13 Sep 87 14:55:07 EDT From: lakshman@ATHENA.MIT.EDU Hi! Does anybody have a source code for creating objects with inheritence capabilities and other standard stuff in PROLOG that can be made available in the public domain ? Jaideep Ganguly Our HORNE system might do what you want, though it doesn't produce PROLOG, it does produce horn clauses. HORNE is a prolog-like language, with a sublanguage: REP that is pretty much like KL-1 but does certain things more intelligently (in our opinion), like use e-unification to assign values to slots which allows you to deal with the value of a slot that has not yet been assigned better than if it were only a variable; types are supported on objects and variables; variables can be constrained with arbitrary predicates, etc. etc. REP objects have roles which are inherited in the type hierarchy. (that is, if you define a type ACTION with role ACTOR and a subtype of ACTION as, say, HIT, it will also have an ACTOR role since it's parent type does. TR is available, send $2.50 to Gail Cassell, TR Secretary @ the phys address in the header to this note if you want more info. The code for HORNE/REP is written in CL using some ZL extensions, and runs on the symbolics 7.1 or TI 2.1 systems (soon 3.0). Unfortunately, its also pretty much unsupported: about a year ago we started to rewrite it from the ground up to handle contextual reasoning, and provide other major enhancements, and the result, RHET, will probably not be publically available until the spring. (on the other hand, it may be worth waiting for: HORNE is pretty crufty being a translation from franz and showing the stretch marks of an active research tool of several years). Neither are strictly in the public domain, but the non-commercial licence (for HORNE/REP) is for a site and only $150. You are free to reuse the code as you like. I'm not familiar with other legal details, you can ask Peg for a licence agreement if you are interested or curious. Basically it's just something that says we don't care what you do with it, but we are absolved of any responsibility. At any rate, if you were to get HORNE/REP; REP sits on top of HORNE and produces horn clauses as I said; you may be able to play with the code and have it produce PROLOG forms instead, though I think it does depend on being able to create variables with types and/or constraints. (even that can be modeled in pure PROLOG, it just might be more work than you are willing to invest)... Hope this helps, Brad Miller ------ miller@cs.rochester.edu {...[allegra|seismo]!rochester!miller} Brad Miller University of Rochester Computer Science Department ------------------------------ Date: 16 Sep 87 20:15:17 GMT From: nuchat!uhnix1!sugar!peter@uunet.uu.net (Peter da Silva) Subject: Re: procedures and data > [instead of] > > (+ a b) > > A program might look like > > + (2 2) In the lisp 1.5 system on the 11/70 at Berkeley some years ago this was an alternate input parser. You could switch to it using the ($mumble) special function. I thought it ugly, but some people liked it. I think this was called nlambda form, because it also deferred evaluation of the arguments until you eval-ed them. FORTH has a valid alternative syntax and semantics that captures some of the flavor of lisp. You might want to look into it for ideas. -- -- Peter da Silva `-_-' ...!hoptoad!academ!uhnix1!sugar!peter -- 'U` ^^^^^^^^^^^^^^ Not seismo!soma (blush) ------------------------------ Date: Wed, 16 Sep 87 15:48:18 GMT From: Christopher Dollin Subject: procedures and data Hi I am afraid that Eric Lee Green has become confused, mostly (I suspect) by some of Lisp's more obscure design decisions. Eric is correct in saying that evaluating a symbol with a procedure value (ie a procedure as its value) should return the value of the data cell of the symbol; indeed, in both Scheme and Vulgar Lisp, this is exactly what happens (the difference is just in the way those values are obtained). Eric then goes on to say: But wait, how do we actually execute the procedure! Lisp does this with hand-waving and head-nodding, by making programs consist of lists, the first element of which is always assumed to be a procedure which needs executing. In other words, we are introducing "syntactic sugar" to work around the problem of having to explicitly indicate what we wish to be executed. Well ... NO. Irrespective of language (by and large), we need some way of indicating that a (procedure) value is to be APPLIED rather than just USED (eg passed as an argument, delivered as a result). The Lisp convention is to represent programs as lists (for the inconvenience of the user) and apply the value found at the head of such a list be applied to the arguments which are the values found in the rest of the list. This is NOT syntactic sugar; syntactic sugar means constructs which are nice to write but can be re-expressed within the language without the construct, and Lisp has precious few of them. It is true that (defun urgh (junk foo) (blah1) (blah2)) and (+ a b) have the same form, although in the "defun" the arguments are literal data and in the "+" they are expressions to be evaluated. That's because the "defun" is SYNTAX; it defines the shape of the language, and is interpreted at compile-time (loosely speaking) where the values being manipulated are parse-trees. The fact that they look the same is a consequence of a Lisp design decision that application (whether of a run-time procedure or a syntactic processor) is indicated in the same way, viz, by the list notation. So, to answer the questions ... Can this dichotomy between value and execution be mended for procedure-objects without hand-waving? Yes. The distinction between syntactic processing (== compile-time == pre-process time) and execution (== evaluation == run-time) is not hand-waving, and has little to do with procedure values. Would requiring literal data to be quoted be too big an imposition upon the programmer, and would it be worth the gain in expressiveness? (just imagine macros without the mess). Yes it would, and it wouldn't work; you can't express quote without drawing the distinction between compile-time and run-time. No gain in expressiveness would result. [It wouldn't make macros any less horrible, either]. The kludgy scheme doesn't help, either. For example, it requires the system to know which symbols are procedure names in advance - the very thing that the Lisp syntax avoids (although Vulgar Lisp persists in using the bizzare two-value system for symbols). In fact Scheme does NOT distinguish the evaluation of a procedure-valued symbol from that of a non-procedure-valued object. What is DOES distinguish is the use of an apparantly function-calling form, viz (f x1 x2 ... xn) where the symbol "f" is one of its built-in syntactic constructs (or a macro in those Schemes with macros in them). And this, as I implied above, is ESSENTIAL - in any language. Hope this helps, Regards, Kers PS Wow - a whole reply on this topic and I haven't said how much nicer Pop is than Lisp! (Using KMail 10-Apr-87 (Kers)) ------------------------------ Date: Thu 17 Sep 87 10:40:44-PDT From: Rich Alderson Subject: Lisp Syntax In AIList V5 #213, we find: Date: 14 Sep 87 04:25:10 GMT From: mtune!codas!killer!usl!elg@RUTGERS.EDU (Eric Lee Green) Subject: procedures and data ... When procedure symbols are encountered in the eval stream, they are called with the next list in the eval stream as the parameter list. A special prefix character is necessary to explicitly access the procedure-object, to, for example, assign it to another variable. A program might look like + (2 2) print ( / (2 f)) Without commenting on the questions raised, I'd just like to point out that the proposed syntax is "eval-quote" Lisp (as opposed to "eval" Lisp) extended to non-top-level forms. An "eval-quote" Lisp, such as Lisp 1.5, is one in which the top-level loop is defined in Lisp as (defun top-level-loop () loop-top (print (apply (read) (read))) (go loop-top)) (NB: This is typical Lisp 1.5 programming style--"let" and friends didn't yet exist.) Rich Alderson alderson@score.stanford.edu ------------------------------ Date: Thu, 17 Sep 87 10:15 EDT From: Len%AIP1%TSD%atc.bendix.com@RELAY.CS.NET Subject: OPS5 for the PC Date: Thu, 17 Sep 87 10:05 EDT From: Len Moskowitz Subject: OPS5 for the PC To: "3077::IN%\"AIList-Request@kl.sri.com\""@TSD1.ABATSD Message-ID: <870917100518.5.LEN@HEART-OF-GOLD.ABATSD> I reviewed TOPSI 2.0 (from Dynamic Master Systems of Atlanta, Georgia, 404-565-0771) in the August 1986 issue of BYTE. It was an incomplete, slow, non-standard OPS5 but was reasonably priced (under $400) and useful for some applications. A later release was supposed to include Rete but the beta version I saw was still pretty buggy. By now though, it might be solid. I reviewed OPS5+ (from Computer * Thought of Plano, Texas, 214-424-3511) on Byte's BIX computer information service in June of 1987. OPS5+ is a very fast, and complete OPS5 for the PC with useful extensions. It interfaces well with external procedures written in C. It is also very expensive (around $1700). You also have the option of running the Common Lisp version of Forgy's OPS5 under a PC Common Lisp, though it'll likely be slower than OPS5+. By the way, anyone looking for a PC-based production system language should seriously consider NASA's CLIPS, available from COSMIC (404-542-3265)for $200. It is program number M87-11021. The documentation is an additional $17. It is written in C and source is provided. I'd be happy to send out copies of the reviews. Please send a large, self-addressed, double-stamped envelope to: Len Moskowitz Bendix TSD mc 4/8 Teterboro, NJ 07608 ------------------------------ Date: Fri, 18 Sep 87 20:07:11 MDT From: t05rrs%mpx1@LANL.GOV (Dick Silbar) Subject: On the kids screaming behind About two weeks ago someone posed the problem of the vacuum cleaner salesman and the housewife; he was supposed to guess the ages of the three kids knowing the sum of ages was 13 and the product equal to the house number. Nice problem. However, Rajan Gupta points out to me that any vacuum cleaner salesman worth his salt would have had enough visual and audible clues from the kids screaming in the back- ground to have given the answer right off. People on the AIList are, I gather, not supposed to use plausible reasoning? ------------------------------ End of AIList Digest ******************** 21-Sep-87 20:50:17-PDT,13984;000000000000 Mail-From: LAWS created at 21-Sep-87 20:47:08 Date: Mon 21 Sep 1987 20:39-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #219 - Neural Networks, Philosophy To: AIList@SRI.COM AIList Digest Tuesday, 22 Sep 1987 Volume 5 : Issue 219 Today's Topics: Neural Nets - Shift Invariance & References, Philosophy - Natural Kinds & Computer Science ---------------------------------------------------------------------- Date: 19 Sep 87 18:18:56 GMT From: maiden@sdcsvax.ucsd.edu (VLSI Layout Project) Subject: Re: Neural Net Literature, shifts in attention Someone sent me mail about a citation for Fukushima's network that handled "shifts in attention". I lost the address. If that person receives this information through this channel, I'd appreciate a e-mail letter. "A Neural Network Model for Selective Attention in Visual Pattern Recognition," K. Fukushima, _Biological Cybernetics_ 55: 5-15 (1986). "A Hierarchical Neural Network Model for Associative Memory," K. Fukushima, _Biological Cybernetics_ 50: 105-113 (1984). "Neocognitron: A Self-organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position," K. Fukushima, _Biological Cybernetics_ 36: 193-202 (1980). The same person mentioned about vision-like systems, so here are some interesting physiologically grounded network papers: "A Self-Organizing Neural Network Sharing Features of the Mammalian Visual System," H. Frohn, H. Geiger, and W. Singer, _Biological Cybernetics_ 55: 333-343 (1987). "Associative Recognition and Storage in a Model Network of Physiological Neurons," J. Buhmann and K. Shulten, _Biological Cybernetics_ 54: 319-335 (1986). Concerning selection: "Neural networks that learn temporal sequences by selection," S. Dehaene, J. Changeux, and J. Nadal, _Proceeding of the National Academy of Sciences, USA_ 84: 2727-2731 (1987). I hope this of help. I apologize for the delay; my bibliography on neural networks spans an entire file cabinet and is severely disorganized after the last move. Edward K. Y. Jung ------------------------------------------------------------------------ UUCP: {seismo|decwrl}!sdcsvax!maiden ARPA: maiden@sdcsvax.ucsd.edu ------------------------------ Date: 18 Sep 87 13:49:36 GMT From: ihnp4!homxb!homxc!del@ucbvax.Berkeley.EDU (D.LEASURE) Subject: Neural Net Literature In article <598@artecon.artecon.UUCP>, donahue@artecon.artecon.UUCP (Brian D. Donahue) writes: > Does anyone know of a good introductory article/book to neural networks? We're using Rumelhart and MCClelland's 2 (I've heard a rumor that a third volume is out) volume set on the Parallel Distributed Processing Project in a seminar at Rutgers. I've only 8 chapters of it, but it covers a lot of ground in neuroscience, cognitive psychology (though some would disagree that such models are really cog-psy), and computing. I recommend it. It's only $25 for both volumes in paperback. -- David E. Leasure - AT&T Bell Laboratories - (201) 615-5307 ------------------------------ Date: Fri, 18 Sep 87 12:00:12 GMT From: Caroline Knight Subject: Is Computer Science Science? Or is it Art? Randy Martens says:- "There is, however, Computer Engineering. (and Software Engineering, and Systems Engineering etc.). Science is the discovery of the new. Engineering takes what the scientists have found, and finds ways to do useful things with it." If this is so, my first question is Who are the relevant scientists and what have they discovered? -*- As an AI researcher I'm always discovering new things - although possibly not interesting in the same way as Newton's laws of motion or Einstein's theory of general relativity - they are still potentially new knowledge. (Most people must be content to play with grains of sand not pebbles!) However I would defend an engineer's creativity and ability to experiment - they too discover new things but with a different aim in mind and a different form of reporting than the scientist. However I believe that in software there is a better analogy with art and illustration than engineering or science. I have noticed that this is not welcomed by many people in computing but this might be because they know so little of the thought processes and planning that go on behind the development of, say, a still life or an advertising poster. Like software art is frequently pliable and reworkable; like software there are many different methods and philosophies (many not employed explicitly by experts although there are procedures for producing certain types of work), rules of thumb and conventions; there are great practioners and many more humble industrious ones; there are different schools of thought and also ferverent arguments about such low level things as Acrylics or Oils, sable brushes or manmade fibre (here ethical issues also creep in), the "rightness" of working from a photograph, etc. In illustration and advertising the artist might be given a very wide but constrained brief or a very tightly specified mock-up to work from. A work of art or an ad are often the results of a carefully executed plan (although the results are not always quite was expected). I have also watched both good artists and good software makers at work and several similarities struck me: the light sketch with more work put into some of the trickier areas, experimentation with different compositions, throwing out or completely removing bits, putting finisihing touches which change the whole although are little enough in themselves. What is useful that can come of this analogy? Here are some suggetions:- Training: An artist will frequently learn their own style through meticulous study of previous greats (whose great software is there for us to emmulate?). At first working from nature is important although more freedom and greater abstraction will come later. An artist must learn to see and understand - this is something which many software workers could do with applying. Aids: An artist has sketch pads for roughs or capture of structure or examples of detail. The organisation of these is often less than perfect - in software we have a better chance of providing this although currently our best attempts such as Lisp machines and environments like POPLOG are still very much less than perfect too. Aids for producing mockups - for instance cartoonists use sheets of shading which can be cut to fit the required area - in software we need some such things to allow us to prototype with hints at detail without putting it all in. Aids for throwing stuff away! How many novices or less than expert programmers cling to the stuff they've written when it needs throwing out and redesigning from scratch! This is like the advice given in school not to use an eraser - of course eventually the artist knows when it is worth using one but at first it is better to concentrate on developing the ability to create smoothly and without fiddling. Well I guess I've gone on long enough - I'd be pleased to reply to anyone interested in this point of view - thanks for reading this far! Caroline Knight cdfk@lb.hp.co.uk cdfk@hplb.csnet Tel: (0272) 799910 x4040 Telex: (0270) 449206 Fax: (0272) 790076 HPLabs, Hewlett Packard Ltd, Filton Rd, Stoke Gifford, BRISTOL BS16 1NY Everything I write is from me personally and does not represent Hewlett Packard in any way. ------------------------------ Date: Sat 19 Sep 87 16:03:18-EDT From: Albert Boulanger Subject: Generalization & Natural Kinds To add some beef to much of this natural kinds discussion, I suggest that those interested in the issue of natural kinds and generalization take a look at a recent paper by Roger Shepard: "Toward a Universal Law of Generalization for Psychological Science" Science, 11 September 1987, 1317-1323 From the abstract: A psychological space is established for any set of stimuli by determining metric distances between the stimuli such that the probability that a response learned to any stimulus will generalize to any other is an invariant monotonic function of the distance between them. To a good approximation, this probability of generalization (i) decays exponentially with this distance, and (ii) does so in accordance with one of two metrics, depending on the relation between the dimensions along which the stimuli vary. These empirical regularities are mathematically derivable from universal principles of natural kinds and probabilistic geometry that may, through evolutionary internalization, tend to govern the behaviors of all sentient organisms. Albert Boulanger BBN Labs ------------------------------ Date: 21 Sep 87 11:31:00 EST From: cugini@icst-ecf.arpa Reply-to: Subject: Natural kinds Gilbert Cockton writes: > I'd like to continue the sociological perspective on this debate. > Rule number 1 in sociology is forget about "naturalness" - only > sociobiologists are really into "nature" now, and look at the foul > images of man that they've tried to pass off as science (e.g. Dworkin). This seems a somewhat abrupt dismissal of natural kinds, which has lately attracted some support by people such as Saul Kripke, who is neither a computer scientist, dumb, nor politically unreliable (although he IS a philosopher, and is thereby suspect, no doubt). The (philosophically) serious question is to what extent our shared concepts ("dog", "star", "electron", "chair", "penguin", "integer", "prime number") are merely arbitrary social conventions, and to what extent they reflect objective reality (the old nominalist-realist debate). A sharper re-phrasing of the question might be: To what extent would *any* recognizably rational being share our conceptual framework, given exposure to the same physical environment? (Eg, would Martians have a concept of "star"?). I believe there have been anthropological studies, for instance, showing that Indian classifications of animals and plants line up reasonably well with the conventional Western taxonomy. If there are natural kinds, their relevance to some AI work seems obvious. John Cugini ------------------------------ Date: 21 Sep 87 17:40:08 GMT From: Michael Shafto Reply-to: shafto@aurora.UUCP (Michael Shafto) Subject: Re: Materials Science I would like an explanation of why Materials Science is particularly "scientific" compared to other " Science" disciplines. In particular, Materials Science doesn't seem any more "scientific" (or less) than Computer Science. Mike Shafto ------------------------------ Date: 21 Sep 87 17:52:53 GMT From: shafto@AMES-AURORA.ARPA (Michael Shafto) Subject: Re: Is Computer Science Science? Alfred North Whitehead called mathematics the "science of abstract forms." If that's too Platonic, then call it "the science of abstract descriptions." I think if you adopt the position that Real Science is about Nature, and that mathematics is not Real Science, then you'll eventually end up (with no further help from me) saying either (a) mathematicians don't make discoveries, or (b) they make discoveries about the properties of formal systems or systems of abstract descriptions, and that THESE are not part of Nature. If you follow (a), then you confine yourself to a limited group of discussants who share your idiosyncratic notion of 'discovery'; if you follow (b), then you put the content of mathematics somewhere outside Nature. Exactly where, I don't know. Someone (perhaps Lakatos or Feyerabend) said that scientists know about as much about science as fish know about hydrology. This is well illustrated whenever scientists quit DOING science and start talking about it. Mike Shafto ------------------------------ Date: 21 Sep 87 19:00:13 GMT From: pioneer!eugene@ames.arpa (Eugene Miya N.) Subject: Re: Is Computer Science Science? A couple of more recommended readings which came to me after a short conversion with Denning: "Cargo Cult Science" by Richard Feynman last chapter (1974 Comm. Addr. at Caltech) in his Autobiography which I reread before bed last evening. "An Empirical Study of FORTRAN Programs" Software -- Practice and Experience by Don Knuth Feb. 1971, see intro and conclusions. Knuth's paper in American Math. Monthly on the differences between Algorithmic and Mathematical Thinking, around 1985. These along with Simon, etc. mentioned earlier. Unfortunately, I would say CS exhibits some cargo cult characteristics. This does not have to be, we can change it. 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: 21 Sep 87 22:49:56 GMT From: pioneer!eugene@AMES.ARPA (Eugene Miya N.) Subject: Re: Is Computer Science Science? Oh yeah, one more reference thought on the way to lunch: W. Daniel Hillis The Connection Machine, MIT Press, 1986, Last Chapter entitled something like "Why Computer Science is No Good" Says CS lacks scale, symmetry, and locality of effect. --eugene ------------------------------ End of AIList Digest ******************** 28-Sep-87 23:36:55-PDT,14591;000000000000 Mail-From: LAWS created at 28-Sep-87 23:26:05 Date: Mon 28 Sep 1987 23:24-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #220 - Seminars, Conference on Uncertainty To: AIList@SRI.COM AIList Digest Tuesday, 29 Sep 1987 Volume 5 : Issue 220 Today's Topics: Seminars - Class Hierarchies with Contradictions (AT&T) & Knowledge-Based Software Development Tools (AT&T) & The ENGINEOUS Project at GE (NASA Ames) & Heuristic Functions for Task Scheduling (SMU) & Autonomous Construction Robots (Lockheed), Conference - 1988 Workshop on Uncertainty in AI ---------------------------------------------------------------------- Date: Mon 21 Sep 1987 09:13:21 From: dlm%allegra.att.com@RELAY.CS.NET Subject: Seminar - Class Hierarchies with Contradictions (AT&T) Time: Thursday, September 10, 1987 1:00pm. Place: AT&T Bell Laboratories Murray Hill 3D-473 Speaker: Alex Borgida Affiliation: Rutgers University Title: Of Quakers and Republicans: A Syntax, Semantics, and Type Theory for Class Hierarchies with Contradictions Abstract: Disparate fields such as Artificial Intelligence, Databases and Programming Languages have discovered the joys of object-oriented programming. One of the principal features of this paradigm is the presence of classes of objects organized in subclass hierarchies, which provide a form of polymorphism and the notion of inheritance. The arguments in favour of these mechanisms are concerned with the ease of developing and modifying programs, but we show that in several circumstances the same kinds of arguments can be used to undermine the usual strict interpretation of specialization: namely that a subclass must be in every way a subtype of its superclass(es). We therefore propose a syntax that allows the definition of subclasses appearing to contradict their superclasses, albeit in an explicit and controlled way. After demonstrating the proper semantics for this construct, we examine the difficulties of writing correct programs when statements made about the objects in some class may be contradicted for elements belonging to a subclass. To solve these difficulties, we propose a type theory which admits "exceptional subclasses", and consider the problem of reasoning with these types. Sponsor: Ron Brachman ------------------------------ Date: Mon 21 Sep 1987 09:13:21 From: dlm%allegra.att.com@RELAY.CS.NET Subject: Seminar - Knowledge-Based Software Development Tools (AT&T) Time: Monday Sept 14, 1987 1:30 P.M. Place: Murray Hill 3D-473 (Lab 1125 conf. room) Speaker: Douglas Smith Affiliation: Kestrel Institute Title: Knowledge-Based Software Development Tools Abstract: Current research on knowledge-based software development tools at Kestrel Institute is briefly surveyed. We then focus on systems for automatically performing algorithm design, deductive inference, finite differencing, and data structure selection. A detailed case study shows how these systems could cooperate in supporting the transformation of a formal specification of a scheduling problem into efficient, executable code. Sponsor: Van Kelly ------------------------------ Date: Fri, 25 Sep 87 13:33:41 PDT From: JARED%PLU@ames-io.ARPA Subject: Seminar - The ENGINEOUS Project at GE (NASA Ames) NASA, Ames Research Center Intelligent Systems Forum Siu Shing Tong General Electric The ENGINEOUS Project at General Electric Abstract: The ENGINEOUS project was established in 1985 to address the problem of designing complex hardware that utilizes a massive number of parameters and analysis tools. For example, to design an aircraft engine, approximately 10,000 Fortran programs may be iteratively applied from conceptual design to final production. The number of relevant parameters defining a typical engine is estimated to be 300,000. The human intervention currently required to iterate these programs and parameters, particularly between programs and disciplines, contributes significantly to the 7 to 10 years lead time for the development of a new engine. An experimental system to aid engine designers has been developed and is being tested. ENGINEOUS makes use of artificial intelligent techniques (i.e., object oriented programming, knowledge based systems, rapid prototyping, etc.) to address problems too complex to be effectively handled by conventional programming techniques. This presentation will discuss the current status, initial user's experience, and the current development effort to map ENGINEOUS into a heterogeneous, distributed/parallel processing environment. Date: Thursday, October 1, 1987 Time: 1:30PM Location: Bldg. 258, rm. 127, the auditorium Inquires: Alison Andrews, (415) 694-6741, andrews%ear@ames-io.ARPA, or David Jared, (415) 694-6525, jared%plu@ames-io.ARPA VISITORS ARE WELCOME: Register and obtain vehicle pass at Ames Visitor Reception Building (N-253) or the Security Station near Gate 18. Do not use the Navy Main Gate. Non-citizens (except Permanent Residents) must have prior approval from the Director's Office one week in advance. Submit requests to the point of contact indicated above. Non-citizens must register at the Visitor Reception Building. Permanent Residents are required to show Alien Registration Card at the time of registration. ------------------------------ Date: Sat, 26 Sep 1987 22:55 CST From: Leff (Southern Methodist University) Subject: Seminar - Heuristic Functions for Task Scheduling (SMU) Three Practical Heuristic Functions for Task Scheduling: Descriptions and Analyses SPEAKER: Mingfang Wang (mwang%smu@csnet-relay) LOCATION: 315 SIC Southern Methodist University TIME: 1:30 pm ABSTRACT Generally, task scheduling in a multi-processing environment is an NP-hard problem. Here, three task scheduling algorithms using different heuristic functions are presented and analyzed. These algorithms fall into the category of \fIpriority list\fR methods. The algorithms are analyzed both analytically and through simulations. The trade-off is between the time complexity of the task scheduling and the optimalily of the schedule. A fast algorithm can have a time complexity of O(n * log n), but the task schedule produced by the algorithm is not as good as those with time complexity of O(n^2). ------------------------------ Date: Mon, 28 Sep 87 13:28 CDT From: SULLIVAN%lockheed.com@RELAY.CS.NET Subject: Seminar - Autonomous Construction Robots (Lockheed) FROM: JOSEPH W. SULLIVAN O/90-06 B/259 (415)354-5213 SUBJECT: AIC COLLOQUIUM The Lockheed AI Center is pleased to announce a presentation by Dr. Michael R. Genesereth of the Logic Group at Stanford University. An abstract of the presentation is provided below. Proposal for Ten Years of Research on Autonomous Construction Robots Michael R. Genesereth, Ph.D. DATE: 14 October 1987 TIME: 3:30 PLACE: Lockheed Artificial Intelligence Center Main Conference Room 2710 Sand Hill Rd. (Lockheed Bld. #259) Menlo Park One of the boldest promises of Artificial Intelligence is the creation of an autonomous robot, one that is capable of functioning appropriately in an arbitrary environment so as to achieve an arbitrary goal. The environment and goal are described in advance by the robot's client, in as much or as little detail as he desires. Given this description, the robot then acts autonomously, sensing and acting on its environment in a manner appropriate to the client's goal. Although there have been efforts in the past to build such robots, these efforts have not met with great success due to limitations on various technological fronts. In recent years, however, there has been significant progress on these fronts; and, in light of this progress, it appears likely that, with additional research and a strong effort at integration, it should be possible within ten years to achieve this goal. This talk describes one particular research project aimed at achieving this goal. The project is a collaborative venture of the Logic Group and the Robot Reasoning Group of Stanford University and is just getting underway. In order to ground our research and development, we have chosen to concentrate on autonomous robots that are experts at the construction of electromechanical artifacts. Insofar as good methodology involves verification of proper construction, our robots will also need to be experts at the testing of artifacts, the diagnosis of observed failures, and their repair. We believe this project to be a good one for several reasons. First of all, the robots produced are likely to be applicable to many military and industrial applications, e.g. small-scale manufacturing, space-station assembly, planetary exploration, engineering behind enemy lines, and operations at radioactive and toxic chemical sites. Secondly, we believe the project will be beneficial for research in both Artificial Intelligence and Robotics by forcing the integration of results from disciplines that have over the years grown apart. Finally, we believe that the project, given its university setting, will have educational benefit by once again holding up for students the exciting goal of creating autonomous robots. ------------------------------ Date: Thu, 24 Sep 87 06:58:41 PDT From: Ross Shachter Subject: Conference - 1988 Workshop on Uncertainty in AI CALL FOR PARTICIPATION Fourth Workshop on Uncertainty in Artificial Intelligence Sponsored by AAAI St. Paul, Minnesota, August 19-21, 1988 (preceding the AAAI Conference) This is the fourth annual AAAI Workshop on Uncertainty in AI. The first three workshops have been successful and productive, involving many of the top researchers in the field. The first two workshop proceedings have been published in the North-Holland Intelligence and Pattern Recognition series, and the third proceedings is in press. The general subject is automated or interactive reasoning under uncertainty. This year's emphasis is on the control of uncertain reasoning processes and the issues of knowledge engineering in uncertain domains. The most effective way to make points, compare approaches, and clarify issues in these research areas is through demonstration in applications, so these are especially encouraged, although more theoretical research papers are also welcome. Many of the ideas discussed at earlier workshops have been incorporated into prototype and production software. This year we would especially like to encourage the demonstration of some of these systems. The key to the success of past workshops has been the ability to interact with leading researchers in all aspects of the field. There will be ample opportunity for informal discussions as well as panel discussion to focus and debate the issues. In order to maintain this interaction, all accepted papers will appear in the proceedings and be presented in poster sessions. This format worked well at the 1987 workshop, and participants requested that it be done again. Papers are invited on the following topics: * Applications: results, implementation problems and experiences, analyses of the experiences of end users * Knowledge engineering under uncertainty: problem structuring, corrections for bias, consensus among experts, man-machine interface and human-in-the-loop systems * Control of uncertain reasoning processes * Different uncertainty calculi: theoretical and empirical comparisons, transformations between representations, criteria for decision making, axiomatic frameworks * Revision of beliefs in an uncertain environment * Robotics: uncertainty in perception and control * Planning: generation of feasible plans under uncertainty * Development of standard test cases * Other uncertainty in AI issues Papers will be carefully reviewed. Space is limited, so prospective attendees are urged to submit a paper with the intention of active participation in the workshop. Preference will be given to papers that have demonstrated their approach in real applications. Nonetheless, the underlying methodology should be supported by solid theory to encourage discussion on a scientific basis. Again, all accepted papers will be included in the proceedings and presented in poster sessions. Four copies of a paper should be sent to the program chairman by March 31, 1988. (No extended abstracts will be accepted.) Acceptances will be sent by May 25, 1987. Final (camera ready) papers incorporating the reviewers' comments must be received by July 15, 1988. There is an eight page limit on the camera-ready copy. (A few extra pages are available for a nominal fee.) Copies of the proceedings will be available at the workshop. General Chair: Program Chair: Tod Levitt Ross Shachter Advanced Decision Systems Center for Health Policy 201 San Antonio Circle 125 Old Chemistry Building Suite 286 Duke University Mountain View, CA 94040 Durham, NC 27706 (415) 941-3912 (919) 684-4424, 684-3023, 942-5852 levitt@ads.arpa shachter@sumex-aim.stanford.edu Program Committee: P. Bonissone, P. Cheeseman, L. Kanal, J. Lemmer, T. Levitt, R. Patil, J. Pearl, E. Ruspini, R. Shachter, G. Shafer ------------------------------ End of AIList Digest ******************** 28-Sep-87 23:39:45-PDT,12652;000000000000 Mail-From: LAWS created at 28-Sep-87 23:36:59 Date: Mon 28 Sep 1987 23:31-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #221 - Queries, Directions of AI To: AIList@SRI.COM AIList Digest Tuesday, 29 Sep 1987 Volume 5 : Issue 221 Today's Topics: Queries - Unification Benchmarks & Real-Time AI in Italy & Reading List & J.F. Allen's Work on Time & Boltzmann Machine & Vivarium Project & AAAI Speeches, Neural Networks - ASSP Reference & Hinton's Recirculation Algorithm, Comments - Goal of AI: Where Are We Going? ---------------------------------------------------------------------- Date: 22 Sep 87 14:12:12 GMT From: unc!bts@mcnc.org (Bruce Smith) Subject: Unification benchmarks? Does anyone have a good set of unification problems? I want to run simulations of unifications on an architecture being developed here at UNC, and I'd like a set of "typical" problems. (And, I guess I'd also like to be able to say I'm not the only one who claims they're typical.) A paper by Trum and Winterstein, referenced by Martelli & Montanari, might have what I'm looking for. Can anyone supply a copy of Trum P. and Winterstein,G. "Description, implementation and practical comparison of unification algorithms," Internal Rep. 6/78, Fachbereich Informatik, Univ. of Kaiserlautern, Germany. Other references on this topic are welcome, also. Thanks! __________________________________ Bruce T. Smith, bts@unc.cs.unc.edu Dept. of Computer Science Sitterson Hall/ UNC-CH Chapel Hill, NC 27514 ------------------------------ Date: Thu, 24 Sep 87 09:42:10 edt From: WRM%WPI.BITNET@wiscvm.wisc.edu Subject: Looking for researchers I have a colleague who is looking for current AI research activity in Italy. In particular he is interested in real-time AI systems. Does anyone know of such activity? Thanks in advance. Bill Michalson Bitnet wrm@wpi Arpanet wrm%wpi.BITNET@wiscvm.ARPA ------------------------------ Date: 23 Sep 87 17:42:39 GMT From: ihnp4!chinet!nucsrl!ragerj@ucbvax.Berkeley.EDU (John Rager) Subject: Paper Request I am going to teach a course called Applied AI. The student are generally upperclass and graduate students in engineering fields (but not in computer science). I am trying to gather a reading list for the course. I would like suggestions for papers about applications in engineering, manufacturing, management, etc. The papers should: 1. be well written 2. be about an attack on a (quasi-)real problem 3. be detailed enough to convey understanding of what was done and how it was done (technical reports are fine). Please send suggestions and I will summarize later. Thank-you John Rager ------------------------------ Date: 24 Sep 87 09:14:00 GMT From: mcvax!unido!uklirb!noekel@uunet.uu.net Subject: J.F.Allen's work on time - (nf) Hi there, in Communications of the ACM of November 1983 James F. Allen describes several extensions to his well-known temporal logic, such as reference intervals, a duration reasoner, and a date-line feature. I would like to know if any of these extensions have actually been implemented and tested. Are there subsequent papers on this line of research that I have missed? Ditto for papers containing critical remarks by other people? Perhaps James Allen is on the net himself?!? Happy inferring Klaus Noekel Universitaet Kaiserslautern Fachbereich Informatik P.O.Box 3049 6750 Kaiserslautern West Germany UUCP: ...!mcvax!unido!uklirb!noekel "Why should I worry about opinions? I'll stick to my prejudices!" ------------------------------ Date: Sun, 27 Sep 87 15:25:30 EDT From: Ali Minai Subject: Boltzmann Machine While reading two different references about the Boltzmann Machine, I came across something I did not quite understand. I am sure that there is a perfectly reasonable explanation, and would be glad if someone could point it out. In chapter 7 of PARALLEL DISTRIBUTED PROCESSING (Vol 1), by Hinton and Sejnowski, the authors define Pij+ as the probability of units i and j being on when ALL visible units are being clamped, and Pij- as the probability of i and j being on when NONE of the visible units are being clamped (pp 294, 296). They then proceed to present the expression for the gradient of G with respect to weights Wij as -1/T (Pij+ - Pij-). However, in the paper entitled LEARNING SYMMETRY GROUPS WITH HIDDEN UNITS: BEYOND THE PERCEPTRON, by Sejnowski, Keinker and Hinton, in Physica 22D (1986), pp 260-275, it is explicitly stated that Pij+ is the probability when ALL visible units (input and output) are being clamped, BUT Pij- is the probability of i and j being on when ONLY THE INPUT UNITS ARE CLAMPED (pp 264). So there seems to be no concept of FREE-RUNNING here. Since the expression for dG/dWij is the same in both cases, the definitions of Pij- must be equivalent. The only explanation I could think of was that "clamping" the inputs ONLY was the same thing as letting the environment have a free run of them, so the case being described is the free-running one. If that is true, obviously there is no contradiction, but the terminology sure is confusing. If that is not the case, will someone please explain. Also, can anyone point out any latest references to work on the Boltzmann Machine? Thanks, Ali. --------------------------------------------------------------------------- Ali Minai, Department of Electrical Engg. University of Virginia, Charlottesville, Va 22901. ARPANET: amres@uvaee.ee.Virginia.EDU ------------------------------ Date: Mon, 28 Sep 87 07:07:25 PDT From: erickson@lbl-csam.arpa (Marvin Erickson [ams-pnl]) Subject: Vivarium Project Does anyone know the status of Alan Kay's Vivarium Project? (Rumored or officially published?) If Apple isn't giving out any info, how about the MIT Media Lab? I've only hear a little in MacWeek articles and the like. Also, MacWeek mentioned a related program called "BrainWorks" -- any MIT-ers willing to offer a more detailed description than what the mag gave? Mark A. Whiting (c/o erickson@lbl-csam) ------------------------------ Date: Fri, 25 Sep 87 13:13:22 PDT From: AAAI Subject: help! If anyone has made a tape of Pat Winston's Presidential Address from AAAI-87, the AAAI would really appreciate a copy. Our copy got scrappled. Two other AAAI Presidents, Marvin Minsky and Ed Feigenbaum, would also like audio tapes of their Presidential Addresses if anyone has them. Thanks, Claudia Mazzetti AAAI 445 Burgess Drive Menlo Park, CA 94025 ------------------------------ Date: 24 Sep 87 17:49:54 GMT From: ur-tut!mkh1@cs.rochester.edu (Manoj Khare) Subject: Re: Neural Networks & Unaligned fields In article <1241@uccba.UUCP> finegan@uccba.UUCP (Mike Finegan) writes: >In article <759@ucdavis.UUCP>, g451252772ea@ucdavis.UUCP (g451252772ea) writes: >> > IEEE ASSP (Acoustics, Speech, and Signal Processing) April 1987, >> >> I found the 4/87 issue (and the rest of 1987) , but not this article. >> Are you certain of this reference? Thanks... >> >I am not sure if it was April (I believe it was), but the whole journal is >devoted to the subject of Neural Nets for that issue, and definitely exists. > - Mike Finegan > ...!{hal|pyramid}!uccba!finegan The article "An Introduction to Computing with Neural Nets" by Richard P. Lippmann appeared in IEEE ASSP magazine april 1987, pp 4-22. Q. Does anybody have any idea if the book "Analog VLSI and Neural Systems" by Carver A. Mead is published yet? OR Is there any way I could get his lecture notes on the related course at CalTech? Thanks in advance. ..... Manoj Khare ------------------------------ Date: 27 Sep 87 06:43:56 GMT From: deneb.ucdavis.edu!g451252772ea@ucdavis.ucdavis.edu (0040;0000009606;0;327;142;) Subject: references: IEEE ASSP and Hinton's recirculation algorithm Thanks for the help with the IEEE ASSP reference; indeed I was looking at the journal, not the 'magazine' (two shelves up, higher than me). It appears worth the second trip. Now: Geoffrey Hinton claims to have a new 'recirculation' algorith for back-propagation, which is claimed to be 'more biologically realistic' according to the Nature commentary reporting his claim (Nature, 7/9/87, p. 107) (That's July, not Sept, for all you over-sea folk). But only that commentary has appeared- I don't know where (if) Hinton has published the algorithm itself. The commentary only mentions 'a packed audience at the Society of Experimental Psychology', not even stating where the meeting was. Any ideas? Thanks - Ron Goldthwaite, Psychology & Animal Behavior, U.Cal. Davis 'Economics is a branch of ethics pretending to be a science; Ethology is a science, pretending relevance to ethics' ------------------------------ Date: 25 Sep 87 04:19:19 GMT From: cbosgd!osu-cis!tut!dlee@ucbvax.Berkeley.EDU (Dik Lee) Subject: Re: Neural Networks & Unaligned fields In article <1241@uccba.UUCP> finegan@uccba.UUCP (Mike Finegan) writes: >In article <759@ucdavis.UUCP>, g451252772ea@ucdavis.UUCP (g451252772ea) writes: >> > IEEE ASSP (Acoustics, Speech, and Signal Processing) April 1987, >> >> I found the 4/87 issue (and the rest of 1987) , but not this article. >> Are you certain of this reference? Thanks... >> >I am not sure if it was April (I believe it was), but the whole journal is >devoted to the subject of Neural Nets for that issue, and definitely exists. Yes, the paper appeared in IEEE ASSP magazine, Apr. 1987. Be sure you are looking at ASSP magazine, not Journal of ASSP; they are two different publications. - Dik Lee Dept. CIS, Ohio State Univ. ------------------------------ Date: 25 Sep 87 10:04:22 GMT From: ihnp4!homxb!mtuxo!mtune!codas!killer!usl!khl@ucbvax.Berkeley.EDU (Calvin K. H. Leung) Subject: Goal of AI: where are we going? Should the ultimate goal of AI be the perfecting of human intel- ligence, or the imitating of intelligence in human behavior? We all admit that the human mind is not flawless. Bias decisions can be made due to emotional problems, for instance. So there is no point trying to imitate the human thinking process. Some current research areas (neural networks, for example) use the brain as the basic model. Should we also spend some time on the investigation of some other models which could be more efficient and reliable? Provided that we have the necessary technology to build robots that are highly intelligent; they are efficient and reliable and they do not possess any "bad" characteristic that man has. Then what will be the roles man plays in the society where his intel- ligence can be viewed as comparatively "lower form"? AI, where are we going? ------------------------------ Date: 27 Sep 87 17:47:22 GMT From: su-russell!nakashim@labrea.stanford.edu (Hideyuki Nakashima) Subject: Re: Goal of AI: where are we going? In article <178@usl> khl@usl.usl.edu.UUCP (Calvin Kee-Hong Leung) writes: > >We all admit that the human mind is not flawless. Bias decisions >can be made due to emotional problems, for instance. So there is >no point trying to imitate the human thinking process. I believe that those "bad" characteristics of human are necessary evils to intelligence. For example, although we still don't understand the function of emotion in human mind, a psychologist Toda saids that it is a device for servival. When an urgent danger is approaching, you don't have much time to think. You must PANIC! Emotion is a meta- inference device to control your inference mode (mainly of recources). If we ever make a really intelligent machine, I bet the machine also has the "bad" characteristics. In summary, we have to study why human has those characteristics to understand the mechanism of intelligence. Hideyuki Nakashima nakashima@csli.stanford.edu (or nakashima%etl.jp@relay.cs.net) ------------------------------ End of AIList Digest ******************** 28-Sep-87 23:57:33-PDT,8564;000000000000 Mail-From: LAWS created at 28-Sep-87 23:55:31 Date: Mon 28 Sep 1987 23:49-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #222 - Bindings, Spang Robinson, Neural Networks To: AIList@SRI.COM AIList Digest Tuesday, 29 Sep 1987 Volume 5 : Issue 222 Today's Topics: Bindings - Gary Cottrell & Slava Prazdny, Review - Spang Robinson #3/9, Announcement - Second Chair in AI at Sussex University, Neural Networks - Hamming Classification Network ---------------------------------------------------------------------- Date: Wed, 23 Sep 87 21:52:35 PST From: gary@sdcsvax.ucsd.edu (Gary Cottrell) Subject: binding I am now at: Gary Cottrell Department of Computer Science and Engineering C-014 UC San Diego La Jolla, Ca. 92093 gary@sdcsvax.ucsd.edu (ARPA) {ucbvax,decvax,akgua,dcdwest}!sdcsvax!sdcsvax!gary (USENET) 619-534-6640 ------------------------------ Date: Mon 28 Sep 87 19:47:21-PDT From: Ken Laws Subject: Slava Prazdny Date: Wed, 23 Sep 87 15:38:40 PDT From: Amy Lansky Subject: sad news I thought I should let people know of a very unfortunate accident that occurred this weekend. Slava Prazdny (formally at SPAR/FLAIR, most recently at FMC) died this past Sunday in a hang-gliding accident. There will be a memorial service October 7. I will let you know of more details when I find out. -Amy ------------------------------ Date: Mon, 28 Sep 1987 10:56 CST From: Leff (Southern Methodist University) Subject: Summary of Spang Robinson #3/9, 9/87 (Leff file bm788) Summary of Spang Robinson Report, September 1987, Volume 3, No. 9 The lead article is on neural networks. TRW's Mark III offeres 500K interconnections per second for an eight board machine. Price for the Mark III is $60,000 to $90,000. Robert Hecht-Nielsen and Todd Gutschow formed HNC which produces a board level neurocomputer and software costing $9500 to $19,500. Science Applicatiosn Corporation system does 10M interconnections per second called the Delta-1 costing $15,000. Texas Instruments, Siemens, AT&T Bell Labs and Synaptics are developing true analog neural network chips. Martingale Research has a contract with Wright Aeronautical Labs to work with biological networks in culture. It also sels a network simulator software costing from $75.00 to $1275.00. Meiko Incorporated has sold 100 of the The Computing Surface which supports from 1-1024 processor nodes. Nestor Incorporated sells a data entry system for handwriting input to computers for $1595, a "Decision Learning System" and the Nestor Development system. It had ~$400,000 revenue in FY 86. Neuraltech sells Plato/Aristotle which is a system development kit costing $2000.00 for "Beta version." Neuralware sells a neural network prototyping and developing system for $495.00 They have a 200 order backlog. +_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_ Shorts Symanetec is merging with Living Video Text (inventor of Think Tank, Ready and More). Borland bought Ansa, the maker of Paradox. Borland has sold 120,000 copies of Turbo Prolog. Information Builders Inc., of Focus fame, acquired Level Research. Intellicorp reported a net loss of about four million on revenues of about twenty million for the fiscal year ending June 30, 1987. Symbolics reported losses of about twenty-five million on revenues of about 103 million. They have announced version four of their Prolog system. Integrated Inference Machines has placed one of its SM45000 symbolic processing systems at NASA-Ames. DEC has established an AI Lab at Palo Alto. Natural Language Incorporated has ported Data Talker and the NLI connector to Apollo work stations. Texas Instruments has introduced its Explorer II Color System. Advanced Decision Systems has been awarded a research contractor to monitor seismic events resulting from nuclear tests. James McGowan is now the president and CEO of Palladian Software. GENSYM of Cambridge, MA has filed a lawsuit against GigaMos systems, both of whom are offsprings of LMI. GENSYM claims that GigaMOS is "interfering with Gensym's customers and prospects." ------------------------------ Date: Wed, 23 Sep 87 09:18:12 gmt From: Aaron Sloman Subject: Second Chair in AI at Sussex University I'd be grateful if you are able to post this. Thanks. Aaron Sloman UNIVERSITY OF SUSSEX S C H O O L O F C O G N I T I V E S C I E N C E S CHAIR IN ARTIFICIAL INTELLIGENCE ================================ Sussex University, a major UK centre for research and teaching in AI, intends to appoint a second Professor of Artificial Intelligence in the newly established multidisciplinary School of Cognitive Sciences, which includes AI, Linguistics, Philosophy and Psychology. Applications will be welcomed from candidates with research interests in areas of AI relevant to cognitive processes in natural or artificial systems. The appointee will play a major role in the continued development of AI and Computer Science within the new School, which has a large network of computers and workstations for teaching and research (SUNs, HP 9000/300s, VAX, GEC-63, Orion-2 etc.) and many industrial connections. Current research interests include language, vision, learning, intelligent documentation tools, logics for AI, logic programming, development of AI languages and tools (POPLOG development), computers in Education, philosophical foundations of AI, AI and psychology, computational linguistics. The preferred start date is 1st October 1988, and applications should be received by October 30th 1987, though later applications will be considered. For further information and application forms please apply to: The Personnel Office Sussex House University of Sussex Brighton BN1 9RH, England Phone: (+44) (0)273 - 606755 Aaron Sloman Cognitive Sciences, Univ of Sussex, Brighton, BN1 9QN, England Phone: University (44)-(0)273-678294 UUCP: ...mcvax!ukc!cvaxa!aarons ARPANET : aarons%uk.ac.sussex.cvaxa@cs.ucl.ac.uk JANET aarons@cvaxa.sussex.ac.uk ------------------------------ Date: 26 Sep 87 18:57:21 GMT From: ihnp4!occrsh!erc3ba!erc3bb!cord!packard!edsel!granjon!io!mtunk!m tune!whuts!homxb!homxc!del@ucbvax.Berkeley.EDU Subject: Re: IEEE ASSP April 1987 on Neural Networks I found the article very interesting and decided to code the hamming classification neural network. I thought the comp.ai would be interested. I think I found a bug in the article's description of the routine (see code). It should be portable to any C compiler. _______________________cut here______________________ /* ham.c * c version of the hamming net * david leasure * 9/25/87 * * this routine is a hamming classification network * described in IEEE ASSP April 1987 by Richard P. Lippmann pg. 9 * correcting for a presumed bug in the presented routine * the bug is the value set for THETA by Lippmann. When THETA is * N / 2 it so overwhelms the outputs from the lower net that only 0 * activation values are passed up from the threshold function. * I have chosen to set epsilon to 1 / 2M and to not have an upper * limit on the threshold function so no saturation occurs * * the program is somewhat inefficient because of the use of * data storage for maxnet (t[k,l] in lippman's) and for output[t,M] * but they could be useful in a simulator of this network which allowed * things to be fiddled with. * the code could be improved by not encoding the size and values * of the node matrices directly, too, reading them instead from files * and/or a user interface. * * if you improve the code, please send me the diff's * david e. leasure * ihnp4!homxc!del or del@homxc.att.com */ [Contact the author if you need the code. It's about 7000 characters. -- KIL] -- David E. Leasure - AT&T Bell Laboratories - (201) 615-5307 ------------------------------ End of AIList Digest ******************** 29-Sep-87 00:02:45-PDT,13609;000000000000 Mail-From: LAWS created at 28-Sep-87 23:59:25 Date: Mon 28 Sep 1987 23:57-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #223 - Philosophy of Science To: AIList@SRI.COM AIList Digest Tuesday, 29 Sep 1987 Volume 5 : Issue 223 Today's Topics: Philosophy - Is Computer Science Science? Or is it Art? ---------------------------------------------------------------------- Date: 22 Sep 87 14:18:24 GMT From: ihnp4!homxb!houdi!marty1@ucbvax.Berkeley.EDU (M.BRILLIANT) Subject: Re: Is Computer Science Science? In article <1073@aurora.UUCP>, shafto@aurora.UUCP (Michael Shafto) writes: > .... I think if you > adopt the position that Real Science is about Nature, and > that mathematics is not Real Science, then .... either > (a) mathematicians don't make discoveries, or (b) they > make discoveries about the properties of formal systems > or systems of abstract descriptions, and that THESE are > not part of Nature. If you follow (a), then you confine > yourself to a limited group of discussants who share your > idiosyncratic notion of 'discovery'; if you follow (b), then > you put the content of mathematics somewhere outside Nature. But formal systems are a product of the human mind, and the human mind (as a feature of _Homo_sapiens_) is a part of Nature. Science, mathematics, literature, and other intellectual activities are things humans do because of our innate capacities and social norms. > Someone (perhaps Lakatos or Feyerabend) said that scientists > know about as much about science as fish know about > hydrology. This is well illustrated whenever scientists > quit DOING science and start talking about it. There are scientific disciplines (mostly less formally developed than other disciplines like physics) that deal with the study of human activities. One example is anthropology. I think the question "Is computer science a science?" belongs to one of those disciplines. Our problem when we work with computers is less abstruse. All we have to know is whether we can succesfully communicate if we use the term 'Computer Science'. Obviously we can. Nobody complained that the title question ("Is Computer Science Science") is ambiguous. We all understand that the word "science" in the phrase "computer science" is not the same as the word "science" standing alone. M. B. Brilliant Marty AT&T-BL HO 3D-520 (201)-949-1858 Holmdel, NJ 07733 ihnp4!houdi!marty1 ------------------------------ Date: 23 Sep 87 03:41:06 GMT From: jsnyder@june.cs.washington.edu (Hei Yu) Subject: Re: Is Computer Science Science? In article <2835@ames.arpa> eugene@pioneer.UUCP (Eugene Miya N.) writes: > >W. Daniel Hillis The Connection Machine, MIT Press, 1986, >Last Chapter entitled something like "Why Computer Science is No Good" >Says CS lacks scale, symmetry, and locality of effect. As I recall, Ehud Shapiro's dissertation "Automatic Debugging" (MIT Press) included some similar kind of grousing about CS having a "flat" structure with lots of incomparable elements. jsnyder@june.cs.washington.edu.arpa John R. Snyder {ihnp4,decvax,ucbvax}!uw-beaver!jsnyder Dept. of Computer Science, FR-35 University of Washington 206/543-7798 Seattle, WA 98195 ------------------------------ Date: 24 Sep 87 00:49:03 GMT From: pioneer!eugene@ames.arpa (Eugene Miya N.) Subject: A quote from fortune.dat on science This appeared on logout: Science is what happens when preconception meets verification. strings /usr/games/lib/fort* | egrep Science will get it. ------------------------------ Date: Thu, 24 Sep 87 10:50:38 PDT From: Stuart Ferguson Reply-to: shf@solar.UUCP (Stuart Ferguson) Subject: Re: Is Computer Science Science? Or is it Art? +-- cdfk@hplb.CSNET (Caroline Knight) writes: | ... I believe that in software there is a better analogy with art | and illustration than engineering or science. I have noticed that this | is not welcomed by many people in computing but this might be because | they know so little of the thought processes and planning that go on | behind the development of, say, a still life or an advertising poster. This line of thinking appeals to me alot (and I'm a "person in computing," having 10+ years programming experience). I can apreciate this article because my own thinking has led me to somewhat the same place regarding "Computer Science." My own favorite art form that parallels programming is literature (and all forms of writing or word-smithy). Like programming, writing has a tremendous number of practical uses in our society, and only a handful of writers call themselves "artists." Yet the person who writes as an artist has a power of expression that a "hack" writer lacks. | What is useful that can come of this analogy? Here are some | suggetions:- | Training: An artist will frequently learn their own style through | meticulous study of previous greats (whose great software is there for | us to emmulate?). Computer Science educators could certainly learn to "cultivate the artistic temperment." There are techniques and information to learn and study in both art and programming, but no art teacher would ever think that learning the techniques will make the student a great artist. The same is true for programmers. | At first working from nature is important although more freedom and | greater abstraction will come later. ... Excellent analogy. The first programs I wrote were simulations of physical systems (lunar lander games, spacewar games, billiard ball atom simulations and 3D graphics rendering of simulated worlds) or real-world problems (like tic-tac-toe or the traveling salesman problem). Only after mastering these did I move on to writing parsers, text editors and compilers -- the more abstract end of the scale. | Aids for producing mockups - for instance cartoonists use sheets of | shading which can be cut to fit the required area - in software we | need some such things to allow us to prototype with hints at detail | without putting it all in. Yes, and here is where programming diverges from the analogy of illustration. Projects in illustration are typically small scale (although I'm not involved in the art so I can't really say!) whereas programming projects can be enormous requiring man-years of work and huge volumes of code and are often created by teams rather than individual artists. I think the analogy of an epic novel or some other writing effort is more appropriate. | Aids for throwing stuff away! How many novices or less than expert | programmers cling to the stuff they've written when it needs throwing | out and redesigning from scratch! This is like the advice given in | school not to use an eraser - of course eventually the artist knows | when it is worth using one but at first it is better to concentrate on | developing the ability to create smoothly and without fiddling. Amen! Here again I think the writing analogy works well. Can you imagine what a novel would sound like if the author never did any re-writing? Or if the author had a few scenes that he had written and tried to work them into one large story without re-writing any of the smaller scenes? Rapid prototyping in programming is akin to a first draft in writing. It allows the programmer to get ideas out on paper (so to speak) where he can evaluate them objectivly and see what needs changing or re-thinking. My writing improved immeasurably when I discovered that I could actaully throw something that I had writen away and re-write it, and the lesson was not lost on my programming. Often people don't have the courage to throw something away that works, and it requires a certain ammount of mastery of one's art to do the same thing and do it better. | Caroline Knight cdfk@lb.hp.co.uk | cdfk@hplb.csnet ------------------------------ Date: 24 Sep 87 12:53:54 GMT From: uwslh!lishka@speedy.wisc.edu (Christopher Lishka) Subject: Re: Is Computer Science Science? In article <1318@houdi.UUCP> marty1@houdi.UUCP (M.BRILLIANT) writes: >In article <1073@aurora.UUCP>, shafto@aurora.UUCP (Michael Shafto) writes: > >> Someone (perhaps Lakatos or Feyerabend) said that scientists >> know about as much about science as fish know about >> hydrology. This is well illustrated whenever scientists >> quit DOING science and start talking about it. > >Our problem when we work with computers is less abstruse. All we have >to know is whether we can succesfully communicate if we use the term >'Computer Science'. Obviously we can. Nobody complained that the >title question ("Is Computer Science Science") is ambiguous. We all >understand that the word "science" in the phrase "computer science" >is not the same as the word "science" standing alone. > I've only caught the tail-end of this discussion, but I'd like to insert a few comments of my own here. This discussion about whether or not Computer Science is *Science* or *Real*Science* reminds quite a bit of a local (and not so local) phenomena in politics here in Madison. A lot of liberals (hey, I like them better than conservatives, generally) go around toting themselves as *Politically*Correct*, and label those who do agree with their views as not begin *Politically*Correct*. It seems to me that this is where this kind of discussion leads. Someone will go up to a Comp. Sci. person and say I'm a *Real*Scientist*, but your not!" My comment is "why bother?" Why put labels on another person like that? I like to think that research which I will do in the future will be in the realms of science and scientific inquiry, and that my friends and other C.S. people are also doing useful scientific work. Granted, what I am doing now is not really scientific 'cause I'm just programming for a living (to get through school), but you can find that kind of work in any of the traditional *Sciences*. A final note: I heartily agree with the two comments I've included above. As long as the label "Computer Science" works and serves its purpose, why not leave it alone. It would seem that time spent bickering about this sort of thing was much better spent doing research, or programmning, or whatever. I would suspect that the people *really* doing scientific research (whatever that means) don't care what you call them, but would rather work at the answers they are trying to find to the unanswered questions around them. Disclaimer: my thoughts are my own and noone else's, except maybe my Cockatiels'. -Chris -- Chris Lishka /lishka@uwslh.uucp Wisconsin State Lab of Hygiene <-lishka%uwslh.uucp@rsch.wisc.edu \{seismo, harvard,topaz,...}!uwvax!uwslh!lishka ------------------------------ Date: 24 Sep 87 17:52:02 GMT From: pioneer!eugene@ames.arpa (Eugene Miya N.) Subject: Re: Is Computer Science Science? (Funding) Status Quo? Hopefully a short note: The reason why you have to make some clear distinctions care partially be read in the latest CPSR [Computer Professionals for Social Responsibility] Newsletter. It appears in the halls of places like Ames, JPL, DOE Labs, the NAS (Natl. Acad. Sci), NSF, etc. Basically if you are not a science, you don't get funding from those Science Agencies. This is a difference in Geography (seen as an art) and Geology. I studied remote sensing for several years. The fact that it was in a geography --->cartography -->graph --> "art" department was a big minus. RS is pretty respectable in some circles, and like AI, disreputable in other circles. (arrows for Mike Shafto ;-) The level of funding CS in non-military work is dropping. This is okay if you don't mind working on ALVs, Pilots Associates, etc. I believe AI should be funded, but for it's improvement, not rediscoveries and rehashes hashes of things done 20 years ago. You are more than welcome to do AI-research/CS-research, so long as you have money. P.S. I mentioned JPL because I took one noted scientist to a CS lab (graphics) and he came away saying, "Nice pictures, but what's the use?" 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: 24 Sep 87 15:53:25 GMT From: shafto@ames-aurora.arpa (Michael Shafto) Subject: Re: A quote from fortune.dat on science In article <2858@ames.arpa> eugene@nike.UUCP (Eugene Miya N.) writes: >This appeared on logout: >Science is what happens when preconception meets verification. > >strings /usr/games/lib/fort* | egrep Science >will get it. And always remember Dr. Science's line (Duck's Breath Mystery Theater): "There is a thin line between ignorance and arrogance. I have managed to erase that line." ------------------------------ End of AIList Digest ******************** 29-Sep-87 00:11:06-PDT,20633;000000000000 Mail-From: LAWS created at 29-Sep-87 00:06:55 Date: Tue 29 Sep 1987 00:02-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI.COM US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList V5 #224 - Bibliography To: AIList@SRI.COM AIList Digest Tuesday, 29 Sep 1987 Volume 5 : Issue 224 Today's Topics: Bibliography - Leff File a59AB ---------------------------------------------------------------------- Date: Mon, 21 Sep 1987 18:25 CST From: Leff (Southern Methodist University) Subject: Bibliography - Leff File a59AB %T Expressiveness and tractability in knowledge representation and reasoning %A Hector J. Levesque %A Ronald J. Brachmand %J Computational Intelligence %V 3 %N 2 %D MAY 1987 %X A fundamental computational limit on automated reasoning and its effect on knowledge representation is examined. Basically, the problem is that it can be more difficult to reason correctly with one representational language than with another and, moreover, that this difficulty increases dramatically as the expressive power of the language increases. This leads to a tradeoff between the expressiveness of a representational language and its computational tractability. Here we show that this tradeoff can be seen to underlie the differences among a number of existing representational formalisms, in addition to motivating many of the current research issues in knowledge representation. %T Go\*:del, Lucas, and mechanical models of the mind %A Robert F. Hadley %J Computational Intelligence %V 3 %N 2 %D MAY 1987 %X In \fIMinds, Machines, and Go\*:del\fP, J.R. Lucas offers an argument, based on Go\*:del's incompleteness theorems, that the mind cannot be modeled by a machine. This argument has generated a variety of alleged refutations, some of which are incompatible with others. It is argued here that the incompatibility of these `refutations' points to a central paradox which has not yet been resolved. A solution to this paradox is presented, and a related paradox, concerning the existence of consistent models for inconsistent humans, is described and solved. An argument is presented to demonstrate that although humans commonly produce inconsistent output, they can, in an important sense, be modeled by \fIconsistent\fP formal systems, if their behavior is deterministic. It is also shown that Go\*:del's results present no obstacle to humans' proving the consistency of their own formal models. %T Domain circumscription: A re-evaluation %A David W. Etherington %A Robert Mercer %J Computational Intelligence %V 3 %N 2 %D MAY 1987 %X Some time ago, McCarthy developed the domain circumscription formalism for closed-world reasoning. Recently, attention has been directed towards other circumscriptive formalisms. The best-known of these, predicate and formula circumscription, cannot be used to produce domain-closure axioms; nor does it appear likely that the other forms can. Since these axioms are important in deductive database theory (and elsewhere), and since domain circumscription often can conjecture these axioms, there is reason to resurrect domain circumscription. .sp Davis presents an intuitively appealing semantics for domain circumscription, based on minimal models. However, under certain conditions McCarthy's syntactic realization of domain circumscription can induce inconsistencies in consistent theories with minimal models. We present a simple, easily motivated change that corrects this problem but retains the appealing semantics outlined by Davis. We also explore some of the repercussions of this semantics, including soundness and limited completeness results. %T Defeat among arguments: A system of defeasible inference %A R.P. Loui %J Computational Intelligence %V 3 %N 2 %D MAY 1987 %X This paper presents a system of non-monotonic reasoning with defeasible rules. The advantage of such a system is that many multiple extension problems can be solved without additional explicit knowledge; ordering competing extensions can be done in a natural and defensible way, via syntactic considerations. The objectives closely resemble Poole's objectives, but the logic is different from Poole's. The most important difference is that this system allows the kind of chaining that many other non-monotonic systems allow. Also, the form in which the inference system is presented is quite unusual. It mimics an established system of inductive logic, and it treats defeat in the way of the epistemologist-philosophers. The contributions are both of content and of form: the kinds of defeat that are considered, and the way in which defeat is treated in the rules of inference. %T A hybrid, decidable, logic-based knowledge representation system %A Peter F. Patel-Schneider %J Computational Intelligence %V 3 %N 2 %D MAY 1987 %X The major problem with using standard first-order logic as a basis for knowledge representation systems is its undecidability. A variant of first-order tautological entailment, a simple version of relevance logic, has been developed that has decidable inference and thus overcomes this problem. However, this logic is too weak for knowledge representation and must be strengthened. One way to strengthen the logic is create a hybrid logic by adding a terminological reasoner. This must be done with care to retain the decidability of the logic as well as its reasonable semantics. The result, a stronger decidable logic, is used in the design of a hybrid, decidable, logic-based knowledge representation system. %T Patterns of interaction in rule-based expert system programming %A Stan Raatz %A George Drastal %J Computational Intelligence %V 3 %N 2 %D MAY 1987 %X We study the effect of adding a rule to a rule-based heuristic classification expert system, in particular, a rule which causes an unforeseen interaction with rules already in the rule set. We show that it is possible for such an interaction to occur between \fIsets\fP of rules, even when no interaction is present between any \fIpair\fP of rules contained in these sets. A method is presented that identifies interactions between sets of rules, and an analysis is given which relates these interactions to rule-based programming practices which help to maintain the integrity of the knowledge base. We argue that the method is practical given some reasonable assumptions on the knowledge base. %A Charles Babcock %T IBM Expert Program Afforded Product Status %J ComputerWorld %P 118 %D JUL 13, 1987 %K AT02 %X IBM upgraded its expert system product from "introductory program to "full-fledged" product. It also has the capability of accessing it's "relational data base management systems." The complete system sells for $42,500. %T CAE software %J Electronic News %D July 6, 1987 %P 30 %V 33 %N 1662 %K AT02 AA05 %X Trimeter technologies has introduced a "knowledge-base" system to optimize ASIC designs costing $30,000. %T Kurzweil's Entry in Lowe-End Scanners %J Electronics %D JUN 11, 1987 %P 105 %V 60 %N 12 %K AT02 AI06 %X This $10,000 unit can read 60 characters/second, handle multiple type styles on the same page. It has a learning mechanism and a 10 to 40 thousand word lexicon. %T Fingerprint Reader Restricts Access to Terminals and PC's %J Electronics %D JUN 11, 1987 %P 104 %V 60 %N 12 %K H01 AT02 AI06 %X ThumbScan costs %995.00. .br ThumbScan Inc. Two Mid America Plaza, Suite 800, Oake Brook Terrace, Ill. 60181, 312-954-2336 %T This System Integrates DSP and Image Processor %J Electronics %D JUN 11, 1987 %P 106 %V 60 %N 12 %K AT02 AI06 %X Dataube integrates a Digital Signal Processor based on Analog Devices ADSP 2100 chip. It also contains video signal to bit conversion software. It also contains various hardware assists such as convolution. %T A new Way to Speed Up Artificial-Vision Systems %J Electronics %D JUN 11, 1987 %P 89-90 %V 60 %N 12 %K AI06 AT02 %X International Robotmotion's new image processing box contains multiple boards, each optimized for specific vision processes such as correlation, pixel statistical processor. It also has two on board array processors. The system costs $150,000. %A G. J. Holzmann %T Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching %J IEEE Transactions on Software Engineering %D JUN 1987 %V SE-13 %N 6 %P 683-696 %K AA08 %A H. Gallaire %A J. Minker %A J. Nicolas %T Logic and Databases: A Response %J SIGPLAN Notices %V 22 %N 6 %D JUN 1987 %P 20-24 %A R. A. Sosnowski %T Prolog Dialects: A Deja Vu of BASICS %J SIGPLAN Notices %V 22 %N 6 %D JUN 1987 %P 39-48 %K T02 %X divides two Prolog styles into Edinburgh Prolog and micro-Prolog. Shows examples for various differences between these Prologs. Also discusses Turbo Prolog which he claims is still another dialect of Prolog. %A A. Cheese %T Multi-Moded Relations in Parlog %J SIGPLAN Notices %V 22 %N 6 %D JUN 1987 %P 49-51 %K T02 H03 %T New Entries Mark AI Shift From Lab to Market %J Electronic News %D JUL 20, 1987 %V 33 %N 1664 %K AT02 Data General Neuron Data DEC Digital Equipment Corporation T03 T01 Gensym O03 %X Discusses the following new products that appeared at the AAAI show: .br DEC new version of VAX VMS Lisp .br Package to support interchange of applications between personal computers and Data General MV models .br 386 board for Symbolics machines %T Ansa Brings Out Multi-User Version of Paradox DBMS %J Electronic News %V 33 %N 1661 %D JUN 29, 1987 %P 19 %K AA09 H01 AT02 %X Paradox 2.0 runs on various networks and supports complete record locking. %J ComputerWorld %D JUN 29, 1987 %V 21 %N 26 %P 20 %K AT12 AI01 %X response to Henry Eric Firdman's letter on how not to build an expert system. This letter states that the Dipmeter Advisor cost two million to build including costs associated with transferring to field use. %A Louis Fried %T The Dangers of Dabbling in Expert Systems %J ComputerWorld %D JUN 29, 1987 %V 21 %N 26 %K AI01 %X The SRI survey indicates the cost of application development for expert systems is $700 dollars per rule and this excludes hardware, software tools and the time of domain experts. The average cost is $260,000 per application. Goes on to discuss the importance of feasibility studies prior to building an expert system. Also discusses various characteristics of appropriate projects. %A David A. Ludlum %T Consortium set to Create Expert System Shell %J ComputerWorld %D JUN 29, 1987 %V 21 %N 26 %P 73 %K T02 AI02 Intellect AA09 AA06 AI01 AT16 %X Liberty Mutual Insurance Co., Southern California Edison, Transamerican Insurance and one other will be joining together to develop an expert system that can interface with mainframe DBMS and CICS. The system will use Intellect to formulate English queries to either DBMS or the rules themselves. %J ComputerWorld %V 21 %N 24 %P 25 %D JUN 15, 1987 %K AT04 %X France, Italy, UK and West Germany spent eighty million on AI software in 1986 and are expected to spend 825 million by 1991. %J InfoWorld %D JULY 6, 1987 %V 9 %N 27 %P 18 %K AT02 H01 T01 %X Star Saphire converts LISP to C. The resulting C code can be translated, compiled, optimized or link with other USER applications. It costs $495.00. %A Robert X. Cringeley %T Do They Really Want to Be as Smart as AT&T %J InfoWorld %D JULY 6, 1987 %V 9 %N 27 %P 78 %K AA08 %X AT&T plans to add AI tool to its network manager sometime in 1988. %T Canada Firm Set to Buy Lisp for $3.2M %J Electronic News %V 33 %N 1657 %D JUN 1, 1987 %P 12+ %K AT16 %X GigaMos Holdings has bought the assets of Lisp Machine Inc. (which earlier went into bankruptcy). GigaMos is affiliated with Lisp Canada. %A Karen Fitzgerald %A Paul Wallich %T Next Generation Race Bogs Down %J IEEE Spectrum %V 24 %N 6 %P 34-39 %K GA01 GA02 GA03 %X An NSF Team to assess the Japanese Fifth Generation came bakc with mixed conclusions: Japan is already ahead in certain area while others said that the Fifth Generation Project is a national embarassment. Marc Snir of the Hebrew University in Jerusalem said that there were many there because they were sent by their companies and that there was little questioning of efforts. An assessment of the ICOT Personel Sequential Inference Machine said that the system is inferior to US Lisp Workstations but has enormous physical memory (80 megabytes). .sp The article has a table of the various projects, Fifth Generation Computers, Alvey, Esprit, MCC and Strategic Computing, their goals, accomplishments and funding. %A Douglas Barney %T Microsoft in Link Pact %J ComputerWorld %V 21 %N 22 %D JUN 1, 1987 %P 8 %K AI02 H01 AT16 %X Microsoft licensed a natural language interface but no products are planned immediately. %T New Products %J ComputerWorld %V 21 %N 22 %D JUN 1, 1987 %P 34 %K Pyramid T01 AT02 %X Pyramid Announced a Pyrlisp system for $6000.00 %T New Products %J ComputerWorld %V 21 %N 22 %D JUN 1, 1987 %P 48 %K AI06 AT02 %X IBASE system reads documents and includes automatic form processing. %T Nickels and Dimes %J ComputerWorld %V 21 %N 22 %D JUN 1, 1987 %P 108 %K H02 %X Symbolics third quarter revenues ending March 29 was 24.6 million. %A E. Sacks %T Qualitative Sketching of Parameterized Functions %B Knowledge Based Expert Systems for Engineering: Classification, Education and Control %E D. Sriram %E R. A. Edey %I Computational Mechanics Institute %C Boston, USA %D 1987 %P 1-13 %K AA11 AA12 AA13 AI01 AI14 AA01 AA05 %X ISBN 0-931215-81-1 (Boston) ISBN 0-905451-92-9 (Southampton) %X This system uses Macsyma and "Bounder," a system that computes bounds from inequalities to do qualitative sketching of univariate expressions. It finds interesting points such as inflections, maxima, minima and discontinuities. QS has been tested on the following sets of equations in the literature: the four important probability distributions: uniform, exponential, gamma and normal, 17 out of 18 cases from the examples and exercises in Keeney and Raiffa's text on utility theory. Additional work will be done to deal with phase diagrams. %A J. Geller %A M. R. Taie %A S. C. Shapiro %A S. N. Srihari %T Device Representation and Graphics Interfaces of VMES %B Knowledge Based Expert Systems for Engineering: Classification, Education and Control %E D. Sriram %E R. A. Edey %I Computational Mechanics Institute %C Boston, USA %D 1987 %P 15-28 %K AI01 AA21 AI16 AA04 AI02 %X ISBN 0-931215-81-1 (Boston) ISBN 0-905451-92-9 (Southampton) %X Discusses representations of electronic systems to be maintained. Issues are the representation between the logical structure of the device and the physical entity of what is on a circuit board or other module to be replaced, graphical representation and natural language interface. %A D. J. Cooper %T An Expert Systems Approach to Process Identification and Adaptive Control %B Knowledge Based Expert Systems for Engineering: Classification, Education and Control %E D. Sriram %E R. A. Edey %I Computational Mechanics Institute %C Boston, USA %D 1987 %P 29-41 %K H01 AA20 AI01 T01 %X ISBN 0-931215-81-1 (Boston) ISBN 0-905451-92-9 (Southampton) %X Discusses a rule based system for adaptive control. The implementation has not been completed. They intend to write a Lisp-Fortran based system. %A R. H. Allen %A S. Haran %A V. Sharma %A J. Sorab %T Engineering and Artificial Intelligence Applications for the Evaluation and Management of Shoulder Dystocia %B Knowledge Based Expert Systems for Engineering: Classification, Education and Control %E D. Sriram %E R. A. Edey %I Computational Mechanics Institute %C Boston, USA %D 1987 %P 44-53 %K AA01 obstetrics delivery %X ISBN 0-931215-81-1 (Boston) ISBN 0-905451-92-9 (Southampton) %X This is a system to assist in the delivery of infants where the shoulder jams against the pelvic bone. A physical model, as well as a finite element model have been developed to assist in learning about the physical forces involved. In addition, a tactile sensing system to be worn underneath the physician's surgical glove was built for the purpose of measuring important parameters. The expert systems built as part of this effort include one to predict the possibility of this condition and another to manage it when it occurs. It is hoped that the other work on finite elements, tactile sensing and other modeling will be integrated within the system. This is an example of an expert system being build contemporaneously with the research to acquire the data on which it will be based. %T TAKING ISSUE: %T A critique of pure reason %J Computational Intelligence %V 3 %N 3 %D AUG 1987 %A Drew McDermott %X with peer commentary edited by Hector Levesque .sp The relevance of logic to AI has been hotly debated from the very beginnings of the field. Just when the issue seemed to be finally cooling down, Drew McDermott, a noted researcher and hitherto loyal advocate of logic, wrote a paper explaining why, after a decade of research, he has changed his mind about the use of logic. The special section of /Computational Intelligence/ will examine this issue in detail. After a short introduction, the section will contain McDermott's paper, together with commentaries on it by a number of prominent AI researchers: James Allen and Henry Kautz, Danny Bobrow and Mark Stefik, Ken Bowen, Ron Brachman, Eugene Charniak, Johan de Kleer, Jon Doyle, Ken Forbus, Pat Hayes, Carl Hewitt, Robert Kowalski, Robert Moore, Geoff Hinton, Jerry Hobbs, David Israel, John McCarthy and Vladimir Lifschitz, Nils Nilsson, Sandy Pentland, David Poole, Ray Reiter, Stan Rosenschein, Len Schubert, Brian Smith, Mark Stickel and Mabry Tyson, Richard Waldinger, Terry Winograd, and Bill Woods. Finally, McDermott replies to his critics. %T Equivalent logic programs and symmetric homogeneous forms of logic programs with equality %A Kwok-Hung Chan %J Computational Intelligence %V 3 %N 3 %D AUG 1987 %X This article introduces the notion of CAS-equivalent logic programs: logic programs with identical Correct Answer Substitution. It is shown that the notions CAS-equivalence, refutational equivalence, and logical equivalence do not coincide in the case of definite clause logic programs. Least-model criteria for refutational and CAS-equivalence are suggested and their correctness is proved. The least-model approach is illustrated by two proofs of CAS-equivalence. It is shown that the symmetric extension of a logic program subsumes the symmetry axiom, and the symmetric homogeneous form of a logic program with equality subsumes the symmetry, transitivity, and predicate substitutivity axioms of equality. These results contribute towards the goal of building equality into Standard Prolog without introducing additional inference rules. %T Pragmatic modeling: Toward a robust natural language interface %A M. Sandra Carberry %J Computational Intelligence %V 3 %N 3 %D AUG 1987 %X One of the most important ways in which an information-provider assimilates a n information-seeking dialogue is by inferring the underlying task-related plan motivating the information-seeker's queries. This paper presents a strategy for hypothesizing and tracking the changing task-level goals of an information-seeker, and building a model of his task-related plan as the dialogue progresses. .sp Naturally occurring utterances are often imperfect. The information-provider often appears to use inferred knowledge about the information-seeker's underlying task-related plan to remedy any of his faulty utterances and enable the dialogue to continue without interruption. This paper presents a strategy for understanding one kind of defective utterance. Our approach relies on the information-seeker's inferred task-related plan as the primary mechanism for suggesting how an utterance should be understood, thereby considering only interpretations that are relevant to what the information-seeker is trying to accomplish. ------------------------------ End of AIList Digest ********************