rove important in massively parallel machines. By way of illustration, we have thus far limited the scope of our experimental work to very fine grain SIMD machines supporting only a single physical PE interconnection scheme. This is not because we believe that the future of computation lies in the construction of such machines. On the contrary, I am personally convinced that, if massively parallel machines ever do find extensive use in practical applications (and, in my view, it is too early to predict whether they will), they are almost certain to exhibit heterogeneity in all three dimensions (granularity, synchrony and topology). Ultimately, we hope to broaden the scope of the NON-VON project to consider the opportunities and problems associated with more than one class of processing element, multiple-SIMD, as opposed to strictly SIMD, execution schemes, and the inclusion of additional communication links. In the context of a research (as opposed to a development) effort, however, it often seems to be more productive to explore a few mechanisms in some detail than incorporate within the first architectural experiment all features that seem like they might ultimately come in handy. The NON-VON 1 prototype, along with our proposed NON-VON 3 machine, exemplify this approach to experimental research in computer architecture. Until we lose interest in the problems of massively parallel computation, or run out of either unresolved questions or the funding to answer them, we are likely to stick to our current research strategy, which is based in part on the implementation of experimental hardware in multiple, partially overlapped stages. Although I know this will upset Harold, there may thus someday be a NON-VON 4, a NON-VON 5, and possibly even a NON-VON 6. Some of these later successors may never get past the stage of educated doodles, while others may yield only concrete evidence of the shortcomings of some of our favorite architectural ideas. I believe it to be characteristic of the paradigm shift to which I referred in my last message that the very strategy to which we attribute much of our success is casually dismissed by Stone as evidence of indecison and failure. As decreasing IC device dimensions and the availability of rapid-turnaround VLSI facilities combine to significantly expand the possibilities for experimental research on computer architectures, it may be useful to take a fresh look our criteria for evaluating research methods and research results in this area. David P.S. For those who may be interested, a more detailed explanation of the rationale behind our plan for the phased development of NON-VON prototypes is outlined in a paper presented at COMPCON '84. This paper was not, however, available to Stone at the time his remarks were quoted in Mosaic; in general, our failure to promptly publish papers describing our work is probably the source of much legitimate criticism of the NON-VON project. ------------------------------ Date: 29 May 1984 16:59-EDT From: DISRAEL at BBNG.ARPA Subject: Seminar - Expert System for Maintenance [Forwarded from the MIT bboard by SASW@MIT-MC.] There will be a seminar on Thursday, June 7th at 10:30 in the 2nd floor large conference room. The speaker will be Gregg Vesonder of Bell Labs. ACE: An Expert System for Telephone Cable Maintenance Gregg T. Vesonder Bell Laboratories Whippany, NJ As more of the record keeping and monitoring functions of the local telephone network are automated, there is an increasing burden on the network staff to analyze the information generated by these systems. An expert system called ACE (Automated Cable Expertise) was developed to help the staff manage this information. ACE analyzes the information by using the same rules and procedures that a human analyst uses. Standard knowledge engineering techniques were used to acquire the expert knowledge and to incorportae that knowledge into ACE's knowledge base. The most significant departure from "standard" expert system architecture was ACE's use of a conventional data base management system as its primary source of information. Our experience with building and deploying ACE has shown that the technology of expert systems can be useful in a variety of business data processing environments. ------------------------------ End of AIList Digest ******************** 6-Jun-84 21:52:12-PDT,12132;000000000000 Mail-From: LAWS created at 6-Jun-84 21:49:01 Date: Wed 6 Jun 1984 21:35-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V2 #71 To: AIList@SRI-AI AIList Digest Thursday, 7 Jun 1984 Volume 2 : Issue 71 Today's Topics: Games & Expert Systems - Source Information, AI Programming - Definitions, Expert Systems - MYCIN Demo, Humor - Turing Machine, AI Contracts - Automated Classification and Retrieval, Seminar - Programming by Example, Conferences - Approximately Solved Problems ---------------------------------------------------------------------- Date: 6 Jun 1984 13:12:28 EDT From: Perry W. Thorndyke Subject: computer war games Reply to Chuck McManis's request for information on war games: There are literally hundreds of programs, written in a variety of languagues for a variety of machines, that support battle simulation or war gaming. A catalog of these is published annually and is available under the title "Catalog of Wargaming and Military Simulation Models" from Studies, Analysis, and Gaming Agency; Organization of the Joint Chiefs of Staff; The Pentagon; Washington, D.C. Few, if any, of the systems described in the catalog provide "intelligent" simulation of opponent behavior. One reason for this is that there exists no articulated model for expertise in tactical planning and decision making. We at Perceptronics are developing a Navy tactical battle game with an automated opponent based on a cognitive model of tactics. The project is a vehicle to explore (1) development of an expert model of time-stressed tactical decision making, (2) development of an instructional system to teach these skills to a novice, (3) automating an adaptive, intelligent opponent using the expert model, and (4) making the opponent behavior modifiable under program control of the instructional system to achieve pedagogical objectives. A technical report is due out soon; if you are interested, send your address and I'll add you to the mailing list. Perry Thorndyke Perceptronics, Inc. 545 Middlefield Road Menlo Park, CA 94025 (415) 321-4901 thorndyke@usc-isi ------------------------------ Date: 6 Jun 84 16:34:24 EDT (Wednesday) From: Chris Heiny Subject: Re: Computer Wargames Sounds like you've got your work cut out. It'll probably be considerably more complex than a chess player, because chess is the simplest of wargames (I choose to ignore checkers): 2 players with 32 counters (of 6 types) on a 64 space board, with relatively limited connections (4) per space. More complex wargames have more players, with hundreds of counters (of many more than 6 types) on a board with thousands of spaces, each space usually connnecting to 6 others. The rules are vastly more complex as well. The project sounds pretty interesting though, and I'll be glad to lend what aid I can from this distance. Chris ------------------------------ Date: Sun, 3 Jun 84 15:07 PDT From: Brian Reid Subject: AI programs: a definition [Forwarded from the Stanford bboard by Laws@SRI-AI.] An AI program is a program written by a person who fervently believes that he is doing AI as he writes the program. Mere belief is not sufficient; it must be zealous belief. ------------------------------ Date: Sun, 3 Jun 84 16:18 PDT From: Mark Kent Subject: AI programs: addition to a definition [Forwarded from the Stanford bboard by Laws@SRI-AI.] In addition to the definition given by reid@Glacier: An AI program is a program in which at least one of the important subproblems that needs solving is solved by a brute force method. ------------------------------ Date: Sun 3 Jun 84 20:23:27-PDT From: Bruce Buchanan Subject: AI Program Demo [Forwarded from the Stanford bboard by Laws@SRI-AI.] [The following is part of an exchange of messages about the percentage of graduating AI students who have been exposed to actual AI program demos. I have edited it slightly. -- KIL] MYCIN is available on SUMEX from the guest account -- remember that large jobs are slow during the day. Once on Sumex, type MYCIN to the Exec and read the help options. If you don't know much medicine it might be a good idea to run a library case first. You should not need someone else to demo it for you, but there are still people around who worked on MYCIN when it was an active project if you need help. The password for the Sumex guest acct is available from RYALLS @ SUMEX. A caveat: the medical knowledge base has not been updated in the past several years to reflect knowledge of new drugs or improved therapies. bgb ------------------------------ Date: Mon 4 Jun 84 08:46:07-PDT From: Bud Spurgeon Subject: Re: Have you seen? [Forwarded from the Stanford bboard by Laws@SRI-AI.] How may MTC students have seen a Turing machine? -- Moshe Vardi Our DEC 2060 nicknamed "TURING" is on view daily in the Pine Hall machine room. -Bud :-) (P.S. We're still looking for a tape cabinet capable of storing infinitely long tape.) (P.P.S. Backups on this thing take FOREVER.) ------------------------------ Date: Fri, 1 Jun 84 09:26:42 edt From: aronson@nlm-mcs (Jules P. Aronson) Subject: Research Contract Please distribute the following announcement to Research people in the fields of AI and Information Science: -------------------------------------------------------------- AUTOMATED CLASSIFICATION AND RETRIEVAL PROJECT -- The Lister Hill National Center for Biomedical Communications, National Library of Medicine, is developing a research project to investigate, develop, and evaluated Information Science, Computational Linguistics and Artificial Intelligence techniques which support the automated classification and retrieval of biomedical literature. The project shall include investigations in natural language understanding, knowledge representation, and information retrieval, to explore the development of automated systems for identifying, representing, and retrieving relevant concepts and main ideas from printed documents. Written requests for RFP NLM-84-115/PSP, should be addressed to the National Library of Medicine, Office of Contracts Management, Building 38A, Room B1N17, 8600 Rockville Pike, Bethesda, Maryland 20209, Attention: Patricia Page. The RFP will be available in approximately 30 days and will close 30 days after it is issued. ------------------------------ Date: Tue 5 Jun 84 23:15:02-EDT From: JMILLER%MIT-OZ@MIT-MC.ARPA Subject: Seminar - Programming by Example [Forwarded from the MIT bboard by SASW@MIT-MC.] Title: Programming by Example Speaker: Dan Halbert, University of California, Berkeley, and Xerox Corporation, Office Systems Division Wednesday, June 6, 2pm, AI playroom (8th floor, Tech Square) Most computer-based applications systems cannot be programmed by their users. We do not expect the average user of a software system to be able to program it, because conventional programming is not an easy task. But ordinary users can program their systems, using a technique called "programming by example". At its simplest, programming by example is just recording a sequence of commands to a system, so that the sequence can be played back at a later time, to do the same or a similar task. The sequence forms a program. The user writes the program -in the user interface- of the system, which he already has to know in order to operate the system. Programming by example is "Do what I did." A simple program written by example may not be very interesting. I will show methods for letting the user -generalize- the program so it will operate on data other than that used in the example, and for adding control structure to the program. In this talk, I will describe programming by example, discuss current and past research in this area, and also describe a particular implementation of programming by example in a prototype of the Xerox 8010 Star office information system. ------------------------------ Date: Thu 24 May 84 16:29:48-EDT From: Joseph Traub Subject: Call for papers CALL FOR PAPERS Symposium on Complexity of Approximately Solved Problems April 17-19, 1985 Computer Science Department Columbia University New York, NY 10027 SUPPORT: This symposium is supported by a grant from the System Development Foundation. SCOPE: This multidisciplinary symposium focuses on problems which are approximately solved and for which optimal algorithms or complexity results are available. Of particular interest are distributed systems, where limitations on information flow can cause uncertainty in the approximate solution of problems. The following is a partial list of topics: distributed computation, approximate solution of hard problems, applied mathematics, signal processing, numerical analysis, computer vision, remote sensing, fusion of information, prediction, estimation, control, decision theory, mathematical economics, optimal recovery, seismology, information theory, design of experiments, stochastic scheduling. INVITED SPEAKERS: The following is a list of invited speakers. L. Blum, Mills College J. Halpern, IBM L. Hurwicz, University of Minnesota D. Johnson, AT&T - Bell Laboratories J. Kadane, Carnegie-Mellon University R. Karp, Berkeley H.T. Kung, Carnegie-Mellon University D. Lee, Columbia University M. Milanese, Politecnico di Torino C.H. Papadimitriou, Stanford University J. Pearl, UCLA M. Rabin, Harvard University and Hebrew University S. Reiter, Northwestern University A. Schonhage, University of Tubingen K. Sikorski, Columbia University S. Smale, Berkeley J.F. Traub, Columbia University G. Wasilkowski, Columbia University and University of Warsaw A.G. Werschulz, Fordham University H. Wozniakowski, Columbia University and University of Warsaw CONTRIBUTED PAPERS: All appropriate papers for which abstracts are contributed will be scheduled. To contribute a paper send title, author, affiliation, and abstract on one side of a single 8 1/2 by 11 sheet of paper. TITLES AND ABSTRACTS MUST BE RECEIVED BY JANUARY 15, 1985 PUBLICATION: Invited papers will be published. REGISTRATION: The symposium will be held in the Kellogg Conference Center on the Fifteenth Floor of the International Affairs Building, 118th Street and Amsterdam Avenue. The conference schedule and paper abstracts will be available at the registration desk. Registration will start at 9:00 a.m. There is no registration charge. FOR FURTHER INFORMATION: The program schedule for invited and contributed papers will be mailed by about March 15 only to those responding to this Call for Papers. If you have any questions, contact TRAUB@Columbia-20.ARPA. To help us plan for the symposium please send the following information to NG@Columbia-20.ARPA. Name: ________________________ Affiliation: _______________________________ Address: __________________________________________________________________ City: ___________________ State: _____________________ Zip: _______________ ( ) I will attend the Complexity Symposium. ( ) I may contribute a paper. ( ) I may not attend, but please send program. ------------------------------ End of AIList Digest ******************** 10-Jun-84 15:19:25-PDT,15364;000000000000 Mail-From: LAWS created at 10-Jun-84 15:16:36 Date: Sun 10 Jun 1984 14:55-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V2 #72 To: AIList@SRI-AI AIList Digest Sunday, 10 Jun 1984 Volume 2 : Issue 72 Today's Topics: Linguistics - Name Grammar Request, Planning - Multi-Agents and Complex World Models, Courses - Expert Systems, Perception & Philosophy - Cross-Time Identity, Scientific Method - Mathematics, Logic - Logic and AI at U. Maryland, AI Societies & Periodicals - Canadian AI Newsletter ---------------------------------------------------------------------- Date: Wed 6 Jun 84 08:10:26-PDT From: TEX82@SRI-AI.ARPA Subject: Names BibTeX, LaTeX's bibliography lookup program, needs: * a grammar of author names--that is, a BNF specification of the components of a name, and * a specification of how to print a name, in various styles, given its parse tree. Possible style choices for names include last name first or last and, perhaps, complete first/middle names or initials. The rules should handle almost all cases encountered in technical literature, including 'Brinch Hansen, Per' and 'Jean-Pierre van der Waerden, Jr.' but need not cover cases like 'John Thompson, Earl of Rumford'. The grammar need not be logically complete; for example, it would be all right to consider 'Colonel' to be the first name of 'Colonel John Blimp', if that produces the correct printed version. Please contact me if you know of anything like this. Leslie Lamport [Please forward this to anyone who might have an answer. Leslie has been doing a great job building the LaTeX friendly user interface to TeX, and a great many of us can benefit from any increased functionality he can develop for the bibliography preprocessor. -- KIL] ------------------------------ Date: Sat, 9 Jun 84 20:41 EDT From: THE DESK (terminal)OF Subject: multi-agents and complex world models There are many planning systems using multi-agents and temporal constraints. But the domains for most of these systems are limited to only a very simplistic world model. The system we are working on involves a complex graphic display of the inside of NASA's space lab (within the space shuttle). There are many complex objects and multi-agents to contend with to provide a true simulation of even a simple command. Hendrix's model shows an interesting world model for a simple scenario, but without a sophisticated planner. There must be further research in such "robot-like" worlds and if so, I would greatly appreciate any pointers toward articles/papers/books dealing with such complex world models and planning systems. Thank you, Jeffrey S. Gangel [ Gangel%upenn.csnet@csnet-relay.arpa ] Dept. of Computer and Information Science Moore School University of Pennsylvania Philadelphia, PA 19104 ------------------------------ Date: 7 Jun 84 10:32:19 PDT (Thursday) From: Isdale.es@XEROX.ARPA Subject: Course using *Building Expert Systems* (Hayes-Roth,Waterman,Lenat) In response to a request for information on courses using the text *Building Expert Systems* by R. Hayes-Roth, D. Waterman, and D. Lenat (Addison Wesley, 1983): UCLA Extension Offered such a class this past spring: Developing Expert Systems. Instructor: Dr. Douglas R. Partridge (works for one of the defense/aerospace contractors in the LA area.) The course was taught as a lecture-seminar w/demonstrations & code walkthroughs. Both LISP and PROLOG methods were discussed. A major portion of the grading depended on a term project. The class was expanded from a seminar given by Dr. Partridge for the Technology Transfer Society. The prospectus I have is 3pg and too long for the digest. I will forward it on request but suggest calling the extension at (213) 825-3985 for more up-to-date information. J.B. Isdale (Isdale.es@XEROX.ARPA) ------------------------------ Date: 6 Jun 84 6:00:08-PDT (Wed) From: hplabs!hao!seismo!rochester!rocksvax!sunybcs!gloria!colonel @ Ucb-Vax.arpa Subject: Watch out for that tree Article-I.D.: gloria.220 It's the computer's own fault for using human-range vision. Infra-red would have revealed the cardboard tree. "Take these broken wings ... " Col. G. L. Sicherman ...seismo!rochester!rocksvax!sunybcs!gloria!colonel ------------------------------ Date: 6 Jun 84 6:07:27-PDT (Wed) From: hplabs!hao!seismo!rochester!rocksvax!sunybcs!gloria!colonel @ Ucb-Vax.arpa Subject: Re: cross-time identity. Article-I.D.: gloria.221 This problem also arises in databases. How do you find out whether the Joe Szmoe in your tax database is the same as the Joe Szmoe in your welfare database? SSNs don't count - he may have several. The problem is even worse when you pass from Artificial Intelligence to Military Intelligence. You may know nothing for certain about enemy spies, and can only suspect that two spies are identical. Col. G. L. Sicherman ...seismo!rochester!rocksvax!sunybcs!gloria!colonel ------------------------------ Date: Sun, 10 Jun 84 9:47:53 EDT From: Stephen Wolff Subject: Mathematical Methods Not at all deep; maybe others will find our gropings briefly amusing ..... Date: Fri, 8 Jun 84 11:19:30 EDT From: Brint "The usual attitude of mathematicians is reflected in their published research papers and in mathematics textbooks. Proofs are revamped and polished until all trace of how they were discovered is completely hidden. The reader is left to assume that the proof came to the originator in a blinding flash, since it contains steps which no one could possibly have guessed would succeed. The painstaking process of trial and error, revision and adjustment are all invisible." Alan Bundy From: Stephen Wolff I have the greatest respect for Alan Bundy, and I agree with his words. I shall however adamantly disagree with his (or anyone's) implication that "The painstaking process of trial and error, revision and adjustment....." should NOT be invisible -- in a MATHEMATICS paper. The purpose of such a paper MUST be FIRST to advance knowledge; proofs MUST be as spare, concise and lucid as it is within the author's talent to make them -- for sloppy or wordy proofs are just that much harder to verify. And, indeed, the paper is diminished to PRECISELY the extent that the author's trials and fumbles are displayed -- for they may prejudice the world-view of a reader and lead him to the same (POSSIBLY erroneous) result. If you say that there are too few (maybe no) places to publish mathematicians' thought processes, methods of hypothesis, &c., then I shall agree. And, further, state my belief that UNTIL we are able to read how both successful and unsuccessful mathematicians derive the objects of their study, then all successful efforts at automated reasoning will be just blind beginners' luck. From: Paul Broome Bundy was not implying that the dead end paths in the search for a proof should be in the paper that publishes the proof. Just before the portion that Brint quoted, he discussed Polya's books, "How to Solve It" and "Mathematical Discovery" and introduced the paragraph containing the aforementioned quote with, "Polya's attitude in trying to understand the 'mysterious' aspects of problem solving is all too rare." His next paragraph begins with "The only attempt, of which I am aware, to explain the process by which a proof was constructed, is B.L. van der Waerden's paper, 'How the proof of Baudet's conjecture was found', .." He's giving motivation for a book on the modeling of mathematical reasoning. From: Brint Perhaps, as in so many endeavors, several bright people actually agree: 1. Mathematics papers are not the place for discussing trial_and_error, inspirational flashes, false starts, and other means for "discovering" truth and error. 2. Forums are needed for the discussion of such ideas in order to advance our understanding of the process at least toward the end of improving mathematical reasoning by computer. 3. In some limited way, such forums exist. We need to encourage and motivate our mathematicians to contribute to them. Brint ------------------------------ Date: 8 Jun 84 16:57:32 EDT (Fri) From: JACK MINKER Subject: LOGIC and its ROLE in AI SPECIAL YEAR IN MATHEMATICAL LOGIC AND THEORETICAL COMPUTER SCIENCE Each year the Mathematics Department of the University of Maryland devotes its attention to a special topic. In conjunction with the Department of Computer Science, the 1984-1985 academic year will be devoted to the topic of mathematical logic and theoretical computer science. The year will consist of eight sessions devoted to particular areas. The time-table that has evolved is given below. As will be noted, the week of October 22-26, 1984, will be devoted to issues in LOGIC and its ROLE in ARTIFICIAL INTELLIGENCE with emphasis on knowledge representation, com- mon sense reasoning, non-monotonic reasoning and logic pro- gramming. The lectures will be open to the public. The precise times and dates of the lectures for the AI week will be announced in the next few months. We anticipate that there will be modest financial sup- port presumably for graduate students and junior faculty. Applications for support for the week of October 22-26 to be devoted to LOGIC and its ROLE in ARTIFICIAL INTELLIGENCE should be sent to: Dr. Jack Minker Department of Computer Science University of Maryland College Park, Maryland 20742 minker@umcp-cs (301) 454-6119 Kindly send a letter including a vitae, a statement as to the importance of these issues to your research, the number of days you might like to attend, and the amount of support that you might require. We emphasize that we do not know if we will have funds and even assuming they are available, they will be modest at best. You should also notify the above by sending a message over the net expressing your interest in attending the open sessions. Those who plan to come, but require no financial sup- port should also inform us of your intentions so that we may arrange for an appropriate size lecture hall. Those individuals interested in other topics associated with this Math Year should contact: Dr. E.G.K. Lopez - Escobar Department of Mathematics University of Maryland College Park, Maryland 20742 egkle@umcp-cs (301) 454-3759 and provide the same information as above. TIME SCHEDULE AND LECTURERS October 1-5, 1984. Semantics and Logics of Programs. Participants: S. Brookes, D. Kozen, A. Meyer, M. O'Donnell, R. Statman October 8-12, 1984. Recursion Theory. Participants: R. Book, J. Case, R. Daley, D. Leivant, J. Myhill, A. Selman, P. Young **October 22-26, 1984. LOGIC and its ROLE in ARTIFICIAL INTELLIGENCE Participants: J. Barwise, M. van Emden, L. Henschen, J. McCarthy, R. Reiter December 3-7, 1984. Model Theory and Algebra. Participants: A. Macintyre, A. Mekler, C. Wood March 4-8, 1985. Automath and Automating Natural Deduction. Participants: N.G. DeBruijn, J. Zucker March 11-15, 1985. Stability theory. Participants: J. Baldwin, S. Buechler, A. Pillay, C. Steinhorn April 22-26, 1985. Toposes and Model Theory. Participants: A. Joyal, F. Lawvere, I. Moerdijk, G. Reyes, A. Scendrov April 29-May 3,1985. Toposes and Proof Theory. Participants: M. Bunge, P. Freyd, M. Makkai, D. Scott, P. Scott ------------------------------ Date: 5 Jun 84 9:00:08-PDT (Tue) From: ihnp4!alberta!sask!utcsrgv!utai!gh @ Ucb-Vax.arpa Subject: Canadian A.I. Newsletter -- Call for submissions Article-I.D.: utai.187 ==================== Call for submissions ==================== CANADIAN A R T I F I C I A L I N T E L L I G E N C E NEWSLETTER (Published by CSCSI/SCEIO) The Canadian A.I. Newsletter invites submissions from Canada, the U.S., and the rest of the world of any item relevant to artificial intelligence: -- Articles of general interest. -- Abstracts of recent publications, theses, and technical reports. -- Descriptions of current research and courses at a given institution. -- Reports of recent conferences, workshops and the like. -- Announcements of forthcoming conferences and other activities. -- Calls for papers. -- Book reviews (and books for review). -- Announcements of new A.I. companies and products. -- Opinions, counterpoints, polemic, and controversy. -- Humour, cartoons, artwork. -- Advertisements (rates upon request). -- Anything else concerned with A.I. Please send submissions, either physical or electronic, to the editor: Graeme Hirst Department of Computer Science University of Toronto Toronto, CANADA M5S 1A4 Phone: 416-978-6277/6025 CSNET: cscsi@toronto ARPANET: cscsi.toronto@csnet-relay UUCP: utcsrgv!cscsi (connections to allegra, cornell, decvax, decwrl, deepthot, drea, floyd, garfield, hcr, ihnp4, linus, mbcsd, mcgill-vision, musocs, qucis, sask, ubc-vision, utzoo, uw-beaver, watmath, and many other sites) ------------------------ The Canadian A.I. Newsletter is sent to all members of CSCSI/SCEIO, the Canadian artificial intelligence society. To join, write to CIPS (which administers membership matters for the society) with the appropriate fee and a covering note. You need not be Canadian to be a member. CIPS 243 College Street, 5th floor Toronto, CANADA M5T 2Y1 Membership: $10 regular, $5 students (Canadian funds); there is a discount of $2 for CIPS members. Payment may be made in U.S. dollars at the current rate of exchange. ------------------------------ End of AIList Digest ******************** 15-Jun-84 11:25:09-PDT,18334;000000000001 Mail-From: LAWS created at 15-Jun-84 11:23:45 Date: Fri 15 Jun 1984 11:08-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V2 #73 To: AIList@SRI-AI AIList Digest Friday, 15 Jun 1984 Volume 2 : Issue 73 Today's Topics: AI Programming - Definition, Scientific Method - Mathematics, AI Reports - Recent Titles, Forum - Minsky and Asimov at Rensselaerville, Seminars - Motion of Objects in Contact & AI and APL & Learning Equation Solving Methods, Workshops - Expert Systems & Reasoning ---------------------------------------------------------------------- Date: 9 Jun 84 14:06:55-PDT (Sat) From: hplabs!hao!seismo!cmcl2!floyd!clyde!burl!ulysses!gamma!exodus!dhc @ Ucb-Vax.arpa Subject: Re: Definition of an AI program Article-I.D.: exodus.169 In-Reply-To: Article <581@sri-arpa.UUCP> How about this: A program is an AI program if and only if it is written in LISP. David H. Copp [Or Prolog? The "if ..." is commonly assumed, but the "only if ..." seems much too strong. I currently do list processing in C; while I don't claim much AI content, I see little difference between the C code and equivalent algorithms written in LISP. Bob Amsler has pointed out to me that spelling correctors are knowledge-based programs capable of outperforming even intelligent humans; few such programs are written in AI languages. -- KIL] ------------------------------ Date: Wednesday, 13-Jun-84 16:33:08-BST From: BUNDY HPS (on ERCC DEC-10) Subject: Mathematical Methods I support Broome's and Brint's interpretations of what I was trying to say in my book. I was not trying to criticise mathematics papers per se, but to point out that they do not contain some of the information that AI researchers need for computational modelling and to make a plea for a forum for such information. But let me add a caveat to that. The proofs in a paper are at least as important a contribution to mathematics as the theorems they prove. Future mathematicians may want to use these proofs as models for proofs in analogous areas of mathematics (think of diagonalization arguments, for instance). So it will improve the MATHEMATICAL content of the papers if the author points out the structure of the proof and draws attention to what s/he regards as the key ideas behind the proof. Alan Bundy ------------------------------ Date: 12 Jun 84 20:27:32-PDT (Tue) From: hplabs!hao!seismo!rochester!sher @ Ucb-Vax.arpa Subject: Re: Mathematical Methods Article-I.D.: rocheste.7379 Personally, I have done mathematics up to the beginning graduate level for various courses. When I do any difficult piece of mathematics I find that after the fact I can never remember how I came upon the proof. I can reconstruct my steps but the reconstruction has no real relationship to what I really did. The sensation of finishing a proof is highly analogous to waking up from a dream. This is possibly the most important reason why I am doing artificial intelligence rather than mathematics today. If other real mathematicians also operate in this manner then it is not surprising that they are reluctant to write up their reasoning processes. They literally cannot remember them. -David ------------------------------ Date: Sun 10 Jun 84 13:26:20-PDT From: Chuck Restivo Subject: LP - Library Update [Forwarded from the Prolog digest by Laws@SRI-AI.] Isaac Balbin and Koenraad Lecot sent a copy of their useful publication; "Prolog and Logic Programming Bibliography" The cost for obtaining your own copy is $5.00 Australian, and includes the cost of Air Mail. Contact: Isaac Balbin Department of Computer Science Parkville 3052 Melbourne, Australia Send information regarding new references and errata to UUCP: {decvax}, vax135} !mulga!Isaac or ARPA: CS.Koen@UCLA-Locus so the bibliography can be updated regularly, please. [...] ------------------------------ Date: Wed 13 Jun 84 19:27:42-PDT From: Dikran Karagueuzian Subject: AI Reports [Forwarded from the CSLI Newsletter by Laws@SRI-AI.] Partial New Reports List MATH & COMPUTER SCIENCE LIBRARY (From Vol. 6, No. 6, 05/28/84) The reports listed below are now available for circulation at Stanford. 019257 Haridi, S. Sahlin, D.*Evaluation of logic programs based on natural deduction.* Royal Inst. of Tech., Stockholm. Telecomm. & Comp. Systems Dept.*TRITA-CS-8305 B.*1983. 019261 Gendrix, G.G. Lewis, W.H.* Transportable natural language interfaces to databases.* SRI International. A.I. Center.* Tech.Note 228.*1981. 019263 Walker, D.E. Hobbs, J.R.* Natural language access to medical text.* SRI International. A.I. Center.*Tech.Note 240.*1981. 019264 Pereira, F.* Logic for natural language analysis.* SRI International. A.I. Center.*Tech.Note 275, Ph.D. Thesis. Pereira, F.*1983. (Slightly revised version of a thesis submitted to the Department of Artificial Intelligence, University of Edinburgh for the degree of Doctor of Philosophy). 019271 Moore, R.C.* Semantical considerations on nonmonotonic logic.* SRI International. A.I. Center.*Tech.Note 284.* 1983. 019272 Uszkoreit, H.*A framework for processing partially free word order.* SRI International. A.I. Center.*Tech.Note 285.*1983. 019277 Warren, D.H.D.* Applied logic - its use and implementation as a programming tool.* SRI International. A.I. Center.* Tech.Note 290, Ph.D. Thesis. Warren, D.H.D.*1983. (Verbatim copy of a thesis submitted to the Department of Artificial Intelligence, University of Edinburgh in 1977 for the degree of Doctor of Philosophy). 019278 Shieber, S.M.* Direct parsing of ID/LP grammars.* SRI International. A.I. Center.*Tech.Note 291R.*1983 (revised). 019279 Grosz, B.J. Joshi, A.K. Weinstein, S.*Providing a unified account of definite noun phrases in discourses.* SRI International. A.I. Center.*Tech.Note 292.*1983. 019280 Martin, P. Appelt, D. Pereira, F.* Transportability and generality in a natural language interface system.* SRI International. A.I. Center.*Tech.Note 293.*1983. 019292 Pereira, F.C.N. Warren, D.H.D.* Parsing as deduction.* SRI International. A.I. Center.*Tech.Note 295.*1983. 019284 Appelt, D.E.* Telegram: a grammar formalism for language planning.* SRI International. A.I. Center.*Tech.Note 297.* 1983. 019290 Appelt, D.* Planning English referring expressions.* SRI International. A.I. Center.*Tech.Note 312.*1983. 019294 Nilsson, N.J.* Probabilistic logic.* SRI International. A.I. Center.*Tech.Note 321.*1984. 019308 Meandzija, B.*Automated generation of communication systems.* Southern Methodist U. Comp.Sci. & Eng.Dept.* 83-CSE-16.*1983. 019319 Griswold, R.E.*The implementation of an experimental language for manipulating sequences.* Arizona U. Comp.Sci.Dept.*TR 83-20.*1983. 019336 Janssens, D. Rozenberg, G.* Graph grammars with node label controlled rewriting and embedding.* Colorado U. Comp.Sci.Dept.*CU-CS-251-83.*1983. 019368 Koskimies, K.*Extensions of one-pass attribute grammars.* Helsinki U. Comp.Sci.Dept.*Rpt. A-1983-04.*1983. 019373 Shilcrat, E. Panangaden, P. Henderson, T.*Implementing multi sensor systems in a functional language.* Utah U. Comp.Sci.Dept.*UUCS-84-001.*1984. ------------------------------ Date: 13-Jun-84 02:36 PDT From: William Daul Augmentation Systems Division / MDC Subject: AI Forum Set For Aug. 4-8 RENSSELAERVILLE, N.Y. -- Marvin Minsky, a co-founder and member of the MIT Artificial Intelligence Laboratory, and science fiction writer/scientist Isaac Asimov will address "Artificial Intelligence: Are We Being Outsmarted?" in an Aug. 4-8 program at the Rensselaerville Institute located here. The program will be conducted in the manner of a hearing, and Asimov and Minsky will be questioned by participants in the AI program. The cost for the program is $250. More information can be obtained from Mary-Ann Ronconi, Public Programs Coordinator, The Rensselaerville Institute, Rensselartville, N.Y. 12147. ------------------------------ Date: 06/11/84 12:23:47 From: AH Subject: Seminar - Motion of Objects in Contact [Forwarded from the MIT bboard by SASW@MIT-MC.] DATE: Thursday, June 14, 1984 TIME: Refreshments 3:45PM Lecture 4:00PM PLACE: NE43-512A "THE MOTION OF OBJECTS IN CONTACT" Professor John Hopcroft Cornell University There is an increasing use of computers in the design, manufacture and manipulation of physical objects. An important aspect of reasoning about such actions concerns the motion of objects in contact. The study of problems of this nature requires not only the ability to represent physical objects but the development of a framework or theory in which to reason about them. In this talk such a development is investigated and a fundamental theorem concerning the motion of objects in contact is proved. The simplest form of this theorem states that if two objects in contact can be moved to another configuration in which they are in contact, then there is a way to move them from the first configuration to the second configuration such that the objects remain in contact throughout the motion. The obvious applications of this result in compliant motion and also applications in motion planning are discussed. HOST: Professor Silvio Micali ------------------------------ Date: Mon, 11 Jun 84 14:08:17 PDT From: Philip Westlake Subject: Seminar - AI and APL APL Users Group Meeting The Aerospace Corporation APL Users Group is honored to present: Dr. Zdenek V. Jizbz and Ms. Phuong T. Nguyen of Chevron Oil Field Research Co., La Habra, California Speaking on: "Artificial Intelligence and APL with Nested Arrays" Wednesday, June 13, 1984 1:00 pm A1/1062 The Aerospace Corporation The Chevron Oil Field The Chevron Oil Field Research Company of La Habra, California has been doing some research on Expert Systems implemented in nested array APL and they are pleased with the rapid progress that they have achieved in a relatively short time due to the power of nested array APL. A vector of nested vectors can be matched to a tree structure. The utility of this relationship, however, is relatively limited because nodes and branches are implicit (not explicit). By adding a convention similar to that of polish notation, modes can be made explicit. A special type of nested vector called a scalar tree will be defined. The following powerful properties of scalar trees will be illustrated: 1. The possibility to separate syntactic constructs from semantics 2. The ability to form AND/OR trees of arbitrary complexity, and application of DeMorgan's law to such trees with a single one-character APL primitive function. 3. The simplicity of building (primitive) inference engines in just a few lines of APL code. There will be three lectures lasting about 50 minutes each. Dr. Jizba will be giving the first two lectures and Ms. Nguyen will be giving the third lecture. Lecture 1 Define Artificial Intelligence. Describe basic idea of Expert Systems. Compare LISP to APL with nested arrays. Define tree structures, and describe the specific concept of an APL scalar tree. Show how recursuve functions are used to operate on nested arrays. Lecture 2 Introduce Predicate Calculus, and illustrate how it can be implemented using APL nested structures. Describe Production rules, and Inference Engine in APL implementation. Describe DRIVER function that allows English-like communication with user. Lecture 3 (PTN) Understanding a sentence. Kinds of sentences. Global and local dictionaries. Meaning. Syntactic sentences. History trace. Handling of misspelled words and phrases. U.S. Citizenship required in order to attend the presentation. ------------------------------ Date: 12 Jun 84 17:04:39 EDT From: Michael Sims Subject: Seminar - Learning Equation Solving Methods [Forwarded from the Rutgers bboard by Laws@SRI-AI.] machine learning brown bag seminar Title: Learning Equations Solving Methods from Worked Examples Speaker: Bernard Silver Dept. of Artificial Intelligence University of Edinburgh Date: Wednesday, June 27, 1984, 12:00-1:30 Location: Hill Center, 7th floor lounge This talk will describe LP, a program that learns new techniques for solving equations by examining worked examples. Unlike most of the work in this field, where the equations have been very simple, LP uses equations of A level standard (A levels are exams taken at 18, and are used for university selection.) In order to be able to successfully use a new technique, LP learns many different types of information. At the lowest level, LP compares consecutive lines in the worked example, finding differences between them. This allows the program to learn new rewrite rules. LP also tries to discover the strategic purpose of each step, expressed in terms of satisfying preconditions of following steps. From this viewpoint, the worked example can also be considered as a type of plan for solving the equation. LP extracts the necessary information, and builds a plan which is stored for future use. LP executes the plan in a flexible way to solve new equations. ------------------------------ Date: Mon 11 Jun 84 00:17:24-PDT From: Mabry Tyson Subject: Workshop on Expert Systems This is a repeat of an earlier announcement that went out on AILIST but not that the date of acceptance for submissions has been moved back to July 1. [The original announcement appeared in AIList Vol. 2 #58, May 15, 1984. I will send a full copy of this second announcement to anyone who requests it. -- KIL] --------------- Date: Sun, 10 Jun 84 15:39 EST From: John Roach Subject: workshop on expert systems CALL FOR PAPERS IEEE Workshop on Principles of Knowledge-Based Systems Sheraton Denver Tex, Denver, Colorado, 3, 4 December 1984 Please send eight copies of a 1000-2000 word double-space, typed, summary of the proposed paper to: Mark S. Fox Robotics Institute Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 July 1, 1984 is the deadline for the submission of summaries. Authors will be notifed of acceptance or rejection by July 23, 1984. The accepted papers must be typed on special forms and received by the program chairman at the above address by September 3, 1984. General Chairman John Roach Dept. of Computer Science Virginia Polytechnic Institute Blacksburg, VA 24061 (703)-961-5368 [...] ------------------------------ Date: Thu 14 Jun 84 18:11:15-PDT From: Dikran Karagueuzian Subject: Workshop on Reasoning [Forwarded from the Stanford bboard by Laws@SRI-AI.] Stanford Workshop On PRACTICAL REASONONING AND PLANNING Sponsored by CSLI and the Philosophy Department June 19-21 The workshop will involve researchers in philosophy and artificial intelligence. Workshop organizers anticipate a productive interaction centering on issues of belief, desire, intention, and action in humans and machines. All sessions will be held in Building 380 (Mathematics), Room 380Y, unless otherwise specified. SCHEDULE: Tuesday, June 19 10:00 to 11:45 John Searle 1:30 to 3:15 Drew McDermott 3:30 to 5:30 Allan Gibbard Wednesday, June 20 10:00 to 11:45 Gilbert Harman 1:30 to 3:15 Thomas Hill 3:30 to 5:30 Patrick Hayes, David Israel 8:30 to 10:30 Richard Jeffery Thursday, June 21 9:00 to 10:30 Jon Doyle 10:30 to 12:15 Hector-Neri Castaneda 2:00 to 3:45 James Allen ------------------------------ End of AIList Digest ******************** 17-Jun-84 14:49:07-PDT,13761;000000000000 Mail-From: LAWS created at 17-Jun-84 14:46:10 Date: Sun 17 Jun 1984 14:38-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V2 #74 To: AIList@SRI-AI AIList Digest Sunday, 17 Jun 1984 Volume 2 : Issue 74 Today's Topics: AI Tools - Q'NIAL Request, Knowledge-Based Systems - Spelling Correctors, Metaphysics - Relevance of "Souls" to AI, Scientific Method - Mathematics, Linguistics - Commonsense Reasoning, Brain Theory - Processing Power, Conference - Hardware Design Verification ---------------------------------------------------------------------- Date: 15 Jun 1984 23:33-EST From: Todd.Kueny@CMU-CS-G.ARPA Subject: Q'NIAL I have recently heard of a language developed in Canada (Queens University?) called Q'Nial or Nial. These folks have been at some shows (USENIX) and have a demo system which looks alot like a lisp with algol syntax. Does anyone know about these guys? Are there any technical papers? (I think NIAL stands for Nested Inter???? Array Language.) -Todd K. ------------------------------ Date: Fri, 15 Jun 84 11:58:54 PDT From: Michael Pazzani Subject: Spelling Correctors I disagree with the statement that spelling correctors are knowledge-based programs capable of outperforming even intelligent humans. There are two basic parts to spelling correction: detection and correction. In the case where there is more than one possible correction for a misspelled word, people can of course use the context to find the correct spelling. Selecting the proper choice is in many ways like selecting the intended sense of a word. Computers, of course, can be much better at detection of spelling errors except when the misspelling is another word in the vocabulary. I would not call checking a word against a prestored vocabulary knowledge based even with a complex root stripping capability. ------------------------------ Date: 13 Jun 84 19:51:25-PDT (Wed) From: hplabs!hao!seismo!cmcl2!floyd!clyde!burl!ulysses!allegra!princet on!eosp1!robison @ Ucb-Vax.arpa Subject: Re: elevance of "souls" to AI Article-I.D.: eosp1.927 Philip Kahn, in his discussion of souls and essences, writes: >> A "soul," like the concept of "essence," is undefinable. >> The problem of "cognition" is far more relevent to the study of AI because >> it can be defined within some domain... Whether "cognition" >> constitutes a "soul" is again not relevent..." I submit that the concept of "soul" is irrelevant only if AI is doomed to utter failure. Use your imagination and consider a computer program that exhibits many of the characteristics of a human being in its ability to reason, to converse, and to be creative and unexpected in its actions. How will you AI-ers defend yourself if a distinguished theologian asserts that G-d has granted to your computer program a soul? If he might be right, the program, and its hardware must not be destroyed. Perhaps it should not be altered either, lest its soul be lost. The casual destruction, recreation and development of computer programs containing souls will horrify many people. You will face demonstrations, destruction of laboratories, and government interference of the worst kind. Start saving up now, for a defense fund for the first AI-er accused by a district attorney of soul-murder. On second thought, you have nothing to fear; no one in AI is really trying to make computers act like humans, right? - Toby Robison (not Robinson!) allegra!eosp1!robison decvax!ittvax!eosp1!robison princeton!eosp1!robison ------------------------------ Date: Fri, 15 Jun 84 14:36:00 pdt From: Harlan Sexton Subject: Mathematical Methods It is true that most mathematics papers contain little of the sort of informal, sloppy, and confused thinking that always accompanies any of the mathematical discovery that I have been a party to, but these papers are written for and by professional mathematicians in journals that are quite backlogged. Also, although I have always been intrigued by the differences beween modes of discovery among various mathematicians of my acquaintance, I never found knowing how others thought about problems of much use to me, and I think that most practicing mathematicians are even less inclined to wonder about such things than I was when I was a "real" mathematician. However, in response to the comment by David ???, I can only say that I, and most of my fellow graduate students to whom I talked about such things, had no trouble recalling the processes whereby we arrived at the ideas behind proofs (and the process of proving something given an "idea" was just tedious provided the idea was solid). The process used to arrive at the idea, however, was as idiosyncratic as the process one uses to choose a spouse, and it was generally as portable. I found it very useful to know WHAT people thought about various things, and I learned a great deal from my advisor about valuable attitudes toward PDE's, for example (sort of expert knowledge about what to expect from a PDE), but HOW he thought about them was not useful. (With the exception of the infamous Paul J. Cohen, I felt that I appreciated HOW these other people thought; it was just that it felt like wearing someone else's shoes to think that way. In Cohen's case we just figured that Paul was so smart that he didn't have to think, at least like normal people.) In the last year or so of my graduate career, someone came to the mathematics department and interviewed a number of graduate students, including me, about something which had to do with how we thought about mathematical constructs (of very simple types which they specified). Presumably this information, and related things, would be of some interest to Bundy. I'm sorry that I can't be more specific, but if he would contact the School of Education at Stanford (or maybe the Psychology Dept., but I think this had to do with some project on mathematics education), they might be able to help him. There is also a short book by J. Hadamard, published by Dover, and some writings by H. Poincare', but as I recall these weren't very detailed (and he probably knows of them already anyway). Finally, I know that for a while Paul Cohen was interested in mathematical theorem proving, and so he might have some useful information and ideas, as well. (I believe that he is still in the Math. Dept. at Stanford. The AMS MAA SIAM Combined Membership List should have his address.) --Harlan Sexton ------------------------------ Date: Fri 15 Jun 84 13:25:05-PDT From: Ken Laws Subject: Commonsense Reasoning? I'm not sure whether the following probes our commonsense reasoning ability or simply demonstrates a quirk of natural language: "The Monday class will meet on Tuesday next week. The Wednesday class will thus be the day after the Monday class. (We may decide to hold the Friday class on Wednesday and the Wednesday class on Friday if everyone can make it then.)" Another example along the same line is: If 3 were half of 5, what would a third of 10 be? Although it's easy enough to finesse the problem by claiming that this is nonsense, most people would find the answer 4 to be quite reasonable. The answer is derived by following the chain 3:5/2 as 6:5 as 12:10 as 4:10/3, where ":" represents some unspecified transformation that is assumed to be linear. I consider this similar to the nonlinear Monday:Tuesday reasoning above. -- Ken Laws ------------------------------ Date: 14 Jun 84 7:29:14-PDT (Thu) From: ihnp4!cbosgd!rbg @ Ucb-Vax.arpa Subject: Re: A Quick Question - Mind and Brain Article-I.D.: cbosgd.20 > I believe there are aprroximately 10 to the 9th neurons in a human > brain, if that's of any help. Add in the glial cells (there is some > debate about their function) and it comes to 10 to the 10th. > Bob Binstock Those numbers are both wrong, but so was the number in my original posting. Let me correct the numbers, and add the discussion to some other groups which may or may not be interested. Recent estimates of the number of neurons in the human brain have been increasing, for a current estimated total of between 30x10^9 and 50x10^9. Glial cells outnumber neurons by at least 10 to one, and occupy about half the volume of the brain, but the ratio varies widely between brain regions, and between species within a brain region. To get an estimate of the computational equivalent of the brain: Assume 5x10^10 neurons with 2x10^4 synapses each = 10^15 synapses/brain. Each synapse, on average, adds in a quantity about 20 times/sec (it can go much faster, but not many do at the same time). So that's 2x10^16 very simple approximate adds per second. Even when everything is just right, a Cray can't do better than about 10^9 simple integer adds per sec. So, IF THE SYNAPSES ARE BEING USED WITH TOTAL EFFICIENCY FOR PERFORMING THE TASK, a brain is worth about 10^7 Crays. [Credit for this calculation to Terry Sejnowski (Biophysics, Johns Hopkins) and Geoff Hinton (Computer Science, Carnegie-Mellon)]. It is not surprising that most tasks use only a small fraction of this capacity. However, I think the computation of the amount of information used to store sensory perceptions by hound!rfg may be misleading: >>if I assume a visual field as 10**3 bits high by 10**4 bits wide >>by 10 bits for color and shading of each element, we have 10**8 bits >>per visual field. Suppose a life time of 72 years and 16 hours a day of >>observing (neglecting "visual dreams" which may also be remembered), >>with a new observation every 10 seconds. I multiply it all out to >>about 1.5 x 10**16 bits. (187,500 billion bytes?) >>Adding audio, tactile, olfactory, taste to that ought to easily run the >>total over 200 gigabytes. That's just for remembering observations >>(eidetically, which is a faculty some do have). Most people do not remember every detail of every scene they ever see. How much of your early childhood (0-4) do you even remember at all? Emotional content of a situation can have a large impact on what and how much you recall. Dangerous or joyful experiences stand out in memory more than most neutral events. The role of language is also an important issue in considering the storage and information processing capacity of the brain. Using a word to stand for the many features which make up an object or a concept is an incredible data compression. This may be why the gradual increase in computational ability across primate evolution is not a very satisfying explanation for the quantum leap in human intellectual ability. Many of the explanations of the origin of consciousness rely on the advantages of language for improving analytic ability. The one I like best is Julian Jaynes idea (The Origin of Consciousness in the Breakdown of the Bicameral Mind): that consciousness is not just a simple consequence of language, but that the exponential growth in knowledge fostered by language generates self-consciousness only after certain kinds of concepts are introduced into language. This allows him to trace the evolution of consciousness by literary analysis! Rich Goldschmidt -- a former brain hacker (now reformed?) cbosgd!rbg ------------------------------ Date: Wednesday, 13 June 1984 11:41:32 EDT From: Mario.Barbacci@cmu-cs-spice.arpa Subject: call for papers CALL FOR PAPERS WORKSHOP ON HARDWARE DESIGN VERIFICATION November 26-27, 1984 Technical University of Darmstadt, F.R. Germany This workshop is organized by IFIP Working Groups 10.2 and 10.5. Program will cover all aspects of verification methods for hardware systems, including: Correctness of hardware design, Tools and methodologies for verification, Verification of multilevel descriptions, Timing verification, Temporal logic, Correctness by construction, Circuit extractors, Design rule checkers, Language issues, Application of AI techniques. PARTICIPATION IS BY INVITATION ONLY. If you would like to propose a contribution to the workshop send a short summary of the intended presentation to the Workshop Chairman before July 31, 1984. Notices of acceptance will be sent by September 15, 1984. Workshop Committee: Hans Eveking (Chairman) Stephen Crocker Institut fuer Datentechnik Aerospace Corporation Technical University of Darmstadt P.O. Box 92957 D-6100 Darmstadt Los Angeles Fed. Rep. Germany California 90009 (49) (6151) 162075 George J. Milne Robert Piloty Computer Science Department Institut fuer Datentechnik University of Edinburgh Technical University of Darmstadt Edinburgh, Scotland D-6100 Darmstadt United Kingdom Fed. Rep. Germany ------------------------------ End of AIList Digest ******************** 20-Jun-84 10:51:29-PDT,16097;000000000001 Mail-From: LAWS created at 20-Jun-84 10:50:33 Date: Wed 20 Jun 1984 10:44-PDT From: AIList Moderator Kenneth Laws Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V2 #75 To: AIList@SRI-AI AIList Digest Wednesday, 20 Jun 1984 Volume 2 : Issue 75 Today's Topics: Expert Systems - Regression Analysis, AI Tools - Q'NIAL & Pandora Project, Conference - AAAI-84 Program