From comsat@vtcs1 Wed Mar 5 00:11:57 1986 Date: Wed, 5 Mar 86 00:11:50 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a000400; 4 Mar 86 3:07 EST Date: Mon 3 Mar 1986 23:50-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #42 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Tue, 4 Mar 86 23:57 EST AIList Digest Tuesday, 4 Mar 1986 Volume 4 : Issue 42 Today's Topics: Journal Issue - Computational Linguistics on the Lexicon, Seminars - Representation/Estimation of Spatial Uncertainty (SRI) & Propositional Temporal Logic for Programs (UCB) & Automatic Proof of Godel's Theorem (UTexas) & Belief Functions in Artificial Intelligence (GMR) Conference - Data Engineering ---------------------------------------------------------------------- Date: Sun, 2 Mar 86 13:08:13 est From: walker@mouton.ARPA (Don Walker at mouton.ARPA) Subject: Journal Issue - Computational Linguistics on the Lexicon CALL FOR PAPERS: Special issue of Computational Linguistics on the Lexicon Antonio Zampolli, Nicoletta Calzolari, and Don Walker have been appointed guest editors for a special issue of Computational Linguistics on the lexicon. There is general agreement that the lexicon has been a neglected area, and that current research is addressing problems of importance for all aspects of natural language processing. The issue is intended to make the community at large aware of these developments. All papers submitted will be reviewed in the usual manner. The only difference in procedure is that three (instead of five) copies should be sent to James Allen (CL Editor), Department of Computer Science, University of Rochester, Rochester, NY 14627, USA [acl@rochester.arpa]; one copy should be sent to Antonio Zampolli (CL Lexicon), Laboratorio di Linguistica Computazionale CNR, Via della Faggiola 32, I-56100 Pisa, ITALY [glottolo%icnucevm.bitnet@wiscvm.arpa]; and one copy to Don Walker (CL Lexicon), Bell Communications Research, 445 South Street, MRE 2A379, Morristown, NJ 07960, USA [walker@mouton.arpa; walker%mouton @csnet-relay; ucbvax!bellcore!walker]. Manuscripts should be received by 31 August. ------------------------------ Date: Thu 27 Feb 86 12:15:35-PST From: LANSKY@SRI-AI.ARPA Subject: Seminar - Representation/Estimation of Spatial Uncertainty (SRI) REPRESENTATION AND ESTIMATION OF SPATIAL UNCERTAINTY Randy Smith (SMITH@SRI-AI) Robotics Lab, SRI International 11:00 AM, MONDAY, March 3 SRI International, Building E, Room EJ228 (new conference room) Current work on a method for geometrical reasoning under uncertainty will be presented. Such a reasoning component will be important to planning systems for many robotic applications, including autonomous navigation and industrial automation. A general method will be described for estimating the values and estimated errors in the relationship between objects whose locations are represented by coordinate frames. The elements in the relationship may be described by bounding intervals, or may be described by means and covariances, if a statistical model is available. The relationship between the frames (objects) may not be explicitly given, but known only indirectly through a series of spatial relationships, each with its associated error. This estimation method can be used to answer such questions as whether a camera attached to a robot is likely to have a particular object in its field of view. More generally, this method makes it possible to decide in advance if an uncertain relationship is known accurately enough for some task to be accomplished, and if not, how much of an improvement in locational knowledge a proposed sensing action will provide. The calculated estimates agree very well with those from an independent Monte Carlo simulation. The method presented can be generalized to six degrees of freedom, and provides a practical means of estimating the relationships (position and orientation) between objects as well as the uncertainty associated with the relationship. ------------------------------ Date: 27 Feb 86 13:22:12 PST From: CALENDAR@IBM-SJ.ARPA Subject: Seminar - Propositional Temporal Logic for Programs (UCB) IBM Almaden Research Center 650 Harry Road San Jose, CA 95120-6099 CALENDAR March 3, 1986 - March 7, 1986 Computer EXPRESSING INTERESTING PROPERTIES OF PROGRAMS Science IN PROPOSITIONAL TEMPORAL LOGIC Seminar P. Wolper, AT&T Bell Labs and Stanford University Tues., Mar. 4 We show that the class of properties of programs 10:30 A.M. expressible in propositional temporal logic B1-413 can be substantially extended if we assume the programs to be data-independent. Basically, a program is data-independent if its behavior does not depend on the specific data it operates upon. Our results significantly extend the applicability of program verification and synthesis methods based on propositional temporal logic. Host: M. Vardi ------------------------------ Date: Fri, 28 Feb 86 10:53:21 CST From: Rose M. Herring Subject: Seminar - Automatic Proof of Godel's Theorem (UTexas) University of Texas Computer Sciences Department COLLOQUIUM SPEAKER: N. Shankar University of Texas at Austin TITLE: Checking the Proof of Godel's Incompleteness Theorem with the Boyer-Moore Theorem Prover DATE: Thursday, March 6, 1986 PLACE: WEL 3.502 TIME: 4:00-5:30 p.m. There is a widespread belief that computer proof-checking of significant mathematics is infeasible. We argue against this by presenting a machine-checked proof of Godel's incompleteness theorem, one of the greatest landmarks of mathematics. The proof of this theorem was checked in a constructive logic with the Boyer-Moore theorem prover. The proof demonstrates the essential incompleteness of Cohen's axioms for hereditarily finite sets. This was done by first formalizing a proof-checker for this log- ic, extending it with derived inference rules, demonstrating the representability of a Lisp Eval function by a predicate in this logic, and then constructing an undecidable sentence. The state- ment of the incompleteness theorem as proved, asserts that if the undecidable sentence is either provable or disprovable, then it is both provable and disprovable. This shows that the above ax- iom system is either incomplete or inconsistent. ------------------------------ Date: Mon, 3 Mar 86 17:31 EST From: Steve Holland Subject: Seminar - Belief Functions in Artificial Intelligence (GMR) Seminar at General Motors Research Laboratories, Warren, Michigan: Belief Functions in Artificial Intelligence Prof. Glenn Shafer University of Kansas Lawrence, Kansas 66045 Thursday, March 6, 1986 ABSTRACT The theory of belief functions, or the Dempster-Shafer theory, has attracted wide interest as a tool for the management of uncertainty in artificial intelligence. What are the advantages and disadvantages of belief functions when they are compared with numerical alternatives such as Bayesian probability and fuzzy logic or with non-numerical alternatives such as default logic and the calculus of endorsements? What are the current prospects for sensible use of belief functions in expert systems? In this talk, I will offer some general judgments on these questions. I will emphasize the need for interactive tools for the construction of probability arguments, and I will speculate on long-term possibilities for probability judgment using man-made associateve memories. -Steve Holland, Computer Science Department ------------------------------ Date: Thu 27 Feb 86 18:37:23-PST From: Gio Wiederhold Subject: Conference - Data Engineering DATA ENGINEERING CALL-FOR-PAPERS The Third International Conference on Data Engineering Pacifica Hotel, Culver City (Los Angeles), California, USA February 3-5, 1987 (Tutorials 2,6 February) Sponsored by the IEEE Computer Society SCOPE Data Engineering is concerned with the role of data and knowledge about data in the design, development, management, and utilization of information systems. As such, it encompasses traditional aspects of databases, knowledge bases, and data management in general. The purpose of the third conference is to continue to provide a forum for the sharing of experience, practice, and theory of automated data and knowledge management from an engineering point-of-view. The effectiveness and productivity of future information systems will depend critically on improvements in their design, organization, and management. We are actively soliciting industrial contributions. We believe that it is critically important to share practical experience. We look forward to reports of experiments, evaluation, and problems in achieving the objectives of information systems. Papers which are identified as such will be processed, scheduled, and published in a distinct track. TOPICS OF INTEREST o Logical and physical database design o Design of knowledge-based systems o Data management methodologies o Architectures for data- and o Distribution of data and information knowledge-based systems o Performance Evaluation o Data engineering tools o Expert systems applied to data o Applications o Data Security The days preceeding and following the conference will be exclusively devoted to tutorials. Additional mini-tutorials will be presented during the last evening of the conference. A special DBMS vendor day will include short DBMS-specific tutorials to acquaint attendees with current commercially available products. Those interested in presenting tutorials should contact the Tutorial Chairman by May 15, 1986. AWARDS, STUDENT PAPERS, AND SUBSEQUENT PUBLICATION: An award will be given for the best paper at the conference. The best student paper will receive the K.S. Fu award, honoring one of the early supporters of the conference. Up to three awards of $500 each to help defray travel costs will be given for outstanding papers authored solely by students. All outstanding papers will be considered for publication in the IEEE Computer Society Computer Magazine, the IEEE Expert Magazine, the IEEE Software, and the IEEE Transactions on Software Engineering. For more information, contact the General Chairman. PAPER SUBMISSION: CONFERENCE TIMETABLE: Four copies of papers should be Tutorial proposals due: May 15, 1986 mailed before June 16th 1986 to: Manuscripts due: June 15, 1986 Acceptance letters sent: September 15, 1986 Third Data Engineering Conference Camera-ready copy due: November 11, 1986 IEEE Computer Society Tutorials: February 2,6, 1987 1730 Massachusetts Ave. NW Conference: February 3-5, 1987 Washington DC, 20036-1903 (202) 371-0101 Committee Steering Committee Chairman: C. V. Ramamoorthy University of California, Berkeley, CA 94720 Honorary Chairman: P. Bruce Berra Syracuse University, Syracuse, NY 13210 General Chairman: Gio Wiederhold Dept. of Computer Science Stanford University, Stanford, CA 94305 (415) 723-0685 wiederhold@sumex-aim.arpa Program Chairman: Benjamin W. Wah Coordinated Science Laboratory University of Illinois, Urbana, IL 61801 (217) 333-5216 wah%uicsld.@uiuc.arpa Program Co-Chairpersons: John Carlis, Univ.of Minnesota, Minneapolis, MN 55455 Iris Kameny, SDC, Santa Monica, CA 90406 Peter Ng, Univ.of Missouri-Columbus, Columbia, MO 65211 Winston Royce, Lockheed STC, Austin, TX 78744 Joseph Urban, Univ.of SW Louisiana, Lafayette, LA 70504 International Coordination: Tadeo Ichikawa, Hiroshima University, Higashi-Hiroshima 724, Japan G. Schlageter, Fern Universitat, D 5800 Hagen, FR. Germany Tutorials: James A. Larson, Honeywell Computer Sciences Center 1000 Boone Avenue North, Golden Valley, MN 55427 (612) 541-6836 jalarson@hi-multics.arpa Awards: K.H. Kim, University of South Florida, Tampa, FL 33620 Treasurer: Aldo Castillo, TRW, Redondo Beach, CA 90278 Local Arrangements: Walter Bond, Cal State University, Dominquez Hills, CA 90747 (213) 516-3580/3398 Mary C.~Graham, Hughes, P.O.Box 902, El Segundo, CA 90245 (213) 619-2499 Publicity: Dick Shuey, 2338 Rosendale Rd., Schenectady, NY 12309 shuey@ge-crd.arpa Tentative Program Committee Members Jacob Abraham Witold Litwin Adarsh K. Arora Jane W.S. Liu J.L. Baer Ming T. (Mike) Liu Faroh B. Bastani Raymond Liuzzi Don Batory Vincent Lum Bharat Bhargava Yuen-Wah Eva Ma Joseph Boykin Mamoru Maekawa Richard Braegger Gordon McCalla Alfonso Cardenas Toshimi Minoura Nick Cercone N.M. Morfuni Peter P. Chen Jack Mostow Bernie Chern Jaime Murow Roger Cheung Sham Navathe David Choy Philip M. Neches Wesley W. Chu Erich Neuhold J. DeJong G.M. Nijssen David J. DeWitt Ole Oren Ramez ElMasri G. Ozsoyoglu Robert Epstein Z.Meral Ozsoyoglu Michael Evangelist C. Parent Domenico Ferrari J.F. Paris Hector Garcia-Molina D.S. Parker Georges Gardarin Peter Rathmann Sakti P. Ghosh Lakshmi Rebbapragada Arnold Goldfein David Reiner Giorgio Gottlob Gruia-Catalin Roman Laura Haas Domenico Sacca Lee Hollaar Giovanni Maria Sacco Yang-Chang Hong Sharon Salveter David K. Hsiao Edgar Sibley H. Ishikawa David Spooner Sushil Jajodia John F. Sowa Jie-Yong Juang Peter M. Stocker Arthur M. Keller Stanley Su Larry Kerschberg Denji Tajima Won Kim Marjorie Templeton Roger King A.M. Tjoa Dan Kogan Yosihisa Udagawa Robert R. Korfhage Susan Urban Tosiyasu L. Kunii P. Valduriez Winfried Lamersdorf R.P. VanDeRiet Matt LaSaine Yann Viemont W.-H. Francis Leung Neil Walker Victor Li Helen Wood Ya-Nan Lien S. Bing Yao Epilog The correct design and implementation of data systems requires attention to principles from databases, knowledge bases, software engineering, and system evaluation. We hope you will participate. ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Wed Mar 5 00:10:17 1986 Date: Wed, 5 Mar 86 00:10:07 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a000575; 4 Mar 86 3:33 EST Date: Tue 4 Mar 1986 00:12-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #43 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Wed, 5 Mar 86 00:00 EST AIList Digest Tuesday, 4 Mar 1986 Volume 4 : Issue 43 Today's Topics: Queries - Lexicons & Q&A & MAC-SCHEME & Distributed Problem Solving for Architectural Design & Chinese Language Environment on Symbolics, AI Tools - Lisp for 68k Unix World & Rete Algorithm,n Linguistics - Ambiguous Sentences ---------------------------------------------------------------------- Date: 1986 Mar 3 08:28 EST From: Bob Weber Subject: QUERY RE PUBLIC AND PRIVATE LEXICONS I am currently evaluating available lexicons as part of a project to develop a NLP system with commercial potential. I would like information concerning machine-readable lexicons and thesauri that are not now commercial products but that are publically or privately available. Specifically, I am interested in the following information: (1) number of words and how they were selected for inclusion in the lexicon, (2) how much and what kind of syntactical information is incorporated, (3) for verbs, whether case information is included, and if so, what kind and to what extent, (4) whether the lexicon incorporates any class hierarchy information, (5) references to research using the lexicon, (6) the willingness of the owner to share or sell, and approximate price if for sale, (7) other descriptive information necessary for evaluating the contents of the lexicon. Please reply directly to: Weber3%Harvarda.BITNET@WISCVM.WISC.EDU Thanks in advance. If the replies are sufficiently interesting, I will repost. ------------------------------ Date: 27 Feb 86 20:21:17 GMT From: decvax!genrad!panda!talcott!harvard!seismo!rochester!kodak!bayers @ucbvax.berkeley.edu (mitch bayersdorfer) Subject: Query: Q & A by Symantecs On the IEEE telecast on February 26, 1986, there was mention of a natural language driven database program called Q & A. Does anyone know of the source of this package? - Mitch Bayersdorfer Applied Technology Organization Artificial Intelligence Laboratory Floor 4, Bldg 23, Kodak Park Rochester, NY 14650 (716) 477-1972 UUCP: rochester!kodak!bayers ------------------------------ Date: Sun, 2 Mar 86 19:55:34 pst From: Harvey Abramson Subject: information on MAC-SCHEME Does anyone have information as to the existence and availability of an implementation of Scheme to run on the Macintosh? ------------------------------ Date: 3 Mar 1986 22:15-PST From: hinke@usc-cse.usc.edu Subject: distributed problem solving query -- architecture I am currently researching the application of distributed problem solving techniques to the solution of architecture (houses and buildings) design problems. I am especially interested in any work in which multiple agents, possessing different design perspectives, have been applied to a design problem, While the domain is architecture, the intent of the research is to investigate the computer science issues inherent in multiple problem solver design approaches. Reply can be sent to hinke@usc-cs. Tom Hinke ------------------------------ Date: 1 Mar 1986 1801-EST (Saturday) From: Andy Chun Subject: Chinese Language Environment on Symbolics We are currently developing a Chinese language environment on Symbolics Lisp machines. This includes a basic character set of about 7,000 characters and a user-interface for standard Chinese character code and pinyin input. This environment will be used for Chinese natural language understanding research and Chinese text-processing. To avoid duplicating efforts, we would like to know if anyone has already developed such an environment on a Symbolics machine. We are also interested in knowing other research groups who may be interested in using such an environment. US mail: Hon Wai Chun Computer Science Department Brandeis University Ford Hall 232A Waltham, MA 02254 ------------------------------ Date: Thu, 27 Feb 86 19:48:00 pst From: bellcore!decvax!decwrl!pyramid!hplabs!oblio!paf@ucbvax.berkeley.edu (Paul Fronberg) Subject: Re: seeking lisp for 68k unix world You might try SCHEME from the GNU distribution tape. I brought it up on a 5.2 box (68020) by a minor modification of the makefile. Also the price is right considering that this includes source code ($150). ------------------------------ Date: Mon, 3 Mar 86 10:07:13 PST From: dual!hplabs!tektronix!tekchips!chanl@ucbvax.berkeley.edu (Chan Lee) Subject: Re: Query -- Rete Algorithm The Rete algorithm is described in detail on the article(by C. Forgy) "Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem", Artificial Intelligence, Vol 19, Num 1, Sep 1982. You can find a lot of relevant papers in the reference of this paper. Among them, McDermott, Newell and Moore's paper on the "Efficiency of certain production system implementation" seems very helpful. chan lee ------------------------------ Date: Thu 20 Feb 86 09:18:01-PST From: FIRSCHEIN@SRI-AI.ARPA Subject: ambiguous sentences Here is the file of ambiguous sentences. If you want to post any or all of it, be my guest. From: BATES@G.BBN.COM The all-time classic is "Time flies like an arrow", which has at least 5 ambiguous interpretations if you allow it to be the first part of an unfinished sentence (which is how a parser would have to consider it) as well as a complete sentence. The interps are: 1. The cliche we all understand the sentence to mean. 2. An imperative, as in "Take this stopwatch and time these flies the same way you would time an arrow in flight." 3. An imperative, as in "Take this stopwatch and time these flies the same way an arrow would time the flies if an arrow could use a stopwatch" 4. "Time flies (which are like Horse Flies or Bluebottle Flies) are fond of an arrow" 5. "Time flies (as above), in a manner similar to an arrow, ..." (The end of the sentence could be something like "move through the air rapidly") There may even be another interp in there somewhere, but that's what I remember for now. If you get other sentences that are that heavily ambiguous, I would very much appreciate seeing a list of them. Thanks, Lyn Bates BATES@BBNG.ARPA From: Shrager.pa@Xerox.COM Subject: multiple ambiguity John made Jim die by swallowing his tongue. E.g., John forced Jim's tongue down Jim's throat. John ate Jim's tongue (the rudest version). John swallowed his own tongue and Jim died laughing. John ate the cow's tongue that Jim had tainted with hot peppers so Jim died laughing. It was on John's plate. , but it was on Jim's plate. The tongue belongs to some third person (referent of "his"). From: FRAMPTON%northeastern.csnet@CSNET-RELAY.ARPA The following is only four ways ambiguous, but the ambiguity is purely syntatic and the sentence isn't overly contrived. It is a good test of a syntatic parser. "I sent the man who is too stubborn to talk to Jack." The four readings can be deduced from: (1) I sent X to Jack (2) I sent X (3) I sent X to talk to Jack (4) I sent X Jack (dative shift) Please either post the results of your inquiry on the AILIST or csnet-mail the results to me. I'm quite curious. From: Stephen G. Rowley One classic example is the phrase "pretty little girls school". One source of ambiguity is "pretty", which could mean either "beautiful" or "moderately". However, most of the ambiguity comes from binding powers, i.e., where you attach the adjectives. J. C. Brown, in his work on Loglan, gives 17 meanings. Here they are, always interpreting "pretty" as "beautiful". P = pretty; L = little; G = Girls; S = school. The problem is how to insert parentheses into P L G S. (Actually, it's more complex than that, since you can put in a connective between adjectives to effectively make a compound sentence; see [5ff]. Also, the some adjectives can be present in both components of the compound; see [9ff].) Binding Meaning ======= ======= [1] (((P L) G) S) A school for girls who are small; the smallness of the girls is beautiful. [This is purely left-associative.] [2] (P ((L G) S)) A school for girls who are small; the speaker's opinion is that such schools are beautiful. [Cf. [15].] [3] ((P L) (G S)) A school for girls; the school is small and the smallness is beautiful. [4] (P (L (G S))) A school for girls; the school is small; the speaker's opinion is that such schools are beautiful. [This is purely right-associative.] [5] ((P G) S) & ((L G) S) A school for girls who are both beautiful and small. [Both components left-associate. G is duplicated.] [6] (P (G S)) & ((L G) S) A school for girls; the school is pretty; the girls are small. [First component right-associates, second component left-associates. G is duplicated.] [7] ((P G) S) & (L (G S)) A school for pretty girls; the school is also small. [First componentleft-associates, second component right-associates. G is duplicated.] [8] (P (G S)) & (L (G S)) A school for girls; the school is both pretty and small. [Both components right-associate. G is duplicated.] [9] ((P L) S) & ((P G) S) A beautifully small school for beautiful girls. [Note duplication of P; both components left-associate.] [10] (P (L S)) & ((P G) S) A small school which is thought to be pretty; also it's for pretty girls. [P duplicated; association is right/left.] [11] ((P L) S) & (P (G S)) A school which is small and whose smallness the speaker considers beautiful; also a school for girls which is itself pretty. [P duplicated; association is left/right.] [12] (P (L S)) & (P (G S)) A small school which is pretty; also a school for girls which is pretty. [P duplicated; both components right-associate.] [13] ((P L) S) & (G S) A school which is small and the speaker considers that smallness to be beautiful; also it's a school for girls. [14] (P (L S)) & (G S) A small school which is beautiful and which is a school for girls. [15] (P S) & ((L G) S) A beautiful school which is for small girls. [Unlike [2], the beauty of the school is independent of L & G.] [16] (P S) & (L (G S)) A pretty school which is for girls and small as girls schools go. [17] (P S) & (L S) & (G S) A school which enjoys all 3 properties of being beautiful, small, and for girls. [There's another set of 4 sentences that Brown didn't exhibit in his book. They're of the same class as [5-8] and [9-12], but duplicate L instead of P or G: [18] ((P L) S) & ((L G) S) [19] (P (L S)) & ((L G) S) [20] ((P L) S) & (L (G S)) [21] (P (L S)) & (L (G S)) That brings the total to 21. However, since we're both getting bored with this by now, and you've undoubtedly gotten the point, we won't analyze them!] One of Brown's points in Loglan was that, in order to be unambiguous, the language needs pronounceable parentheses and connectives so that the groupings above become apparent. Each of the 17 (or 21) above meanings has a separate pronounciation in Loglan; you're not allowed to be vague about binding of adjectives. (The default is left-associativity.) One might object that I've left out cues to understanding, such as punctuation (commas and apostrophes) and tone of voice. That's true; many cues to understanding sentences like these come from lexical or prosodic factors like that. However, tone of voice gets lost in writing and punctuation is lost in speaking (at least partially; consider "girls" vs "girl's"). Therefore, coping without some of these cues is still a valid problem. From: mab@aids-unix (Mike Brzustowicz) My favorite is "The technician made the robot fast." -Mike Brzustowicz From: William Dowling Re the recently posted question seeking multiply ambiguous sentences: the easiest way to make multiply ambiguous sentences or phrases is to exploit the tree inequality X(YZ) <> (XY)Z. For example "a book and a stapler or some tape" is doubly ambiguous, and "a book and a stapler or some tape and a newspaper" is 5-ways ambiguous. The same trick makes "the man with a hat and a monkey in pajamas" heavily ambiguous. Of course if n1 and n2 are noun phrases k1- and k2-ways ambiguous then " is no " is a sentence that is k1.k2-ways ambiguous. Bob Wall once told me that an early automatic translation program picked up many of the readings of "Applicants who apply for licenses wearing shorts From: Walter Hamscher There's always the old standby "I saw the man on the hill with the telescope." This is used in Winston's textbook. I count six meanings. From: John DeCarlo My favorite is: "Mary had a little lamb." It supposedly has at least a dozen meanings, most of which I can't think of off the top of my head, but I know it is in at least one of my textbooks. Mary owned some meat from a young sheep ate an actual live animal had intercourse with was accompanied by ... John DeCarlo ------------------------------ End of AIList Digest ******************** From csvpi@vtcs1 Thu Mar 6 04:49:41 1986 Date: Thu, 6 Mar 86 04:49:37 est From: csvpi@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a025753; 6 Mar 86 1:49 EST Date: Wed 5 Mar 1986 22:32-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #44 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Thu, 6 Mar 86 04:36 EST AIList Digest Thursday, 6 Mar 1986 Volume 4 : Issue 44 Today's Topics: Seminars - Acquiring Language & Computer Lexicon Use (SD SIGART) & Commonsense Knowledge in the TACITUS Project (SU) & Hubert Dreyfus on Being and Time (MIT) & Intelligent Distributed Operating Systems (USC) & Delegation and Inheritance (MIT) & Refinement of Expert System Knowledge Bases (CMU) & Heuristic Search: Algorithms, Theory, and Learning (CMU) & Brains, Behavior, and Robotics (CSLI) & Situation Calculus Planning (SRI) & The Perspective Concept in Computer Science (CSLI) ---------------------------------------------------------------------- Date: 4 March 1986 1604-PST (Tuesday) From: gross@nprdc.arpa (Michelle Gross) Subject: Seminars - Acquiring Language & Computer Lexicon Use (SD SIGART) Subject: SD SIGART-NLP meetings--Last and Next We've been meeting the first Monday of each month. Last night's meeting (our 3rd) covered Dr. Bob La Quey's efforts to write a program that acquires language by determining which grammatical rules are needed to parse incrementally more complex text. The main difficulty with his approach seems to be how to prevent adding spurious rules when ungrammatical sentences sneak through. Someone suggested attaching a reliability index to each rule. The index would be based on how often the rule has successfully helped a parse get through. (The hope is that the ad hoc rules for ungrammatical input would have low index values). We also discovered that the only given rule in the grammar (S --> N V Terminator) prevented the program from creating a rule to parse imperative sentences (S --> V). Mallory Selfridge's 1981 IJCAI paper ``A Computer Model of Child Language Acquisition'' provided some of the impetus for Bob's work. His talk was entitled ``A Model of Language Acquisition.'' Our next meeting will be April 7th. The topic will be the lexicon--how we use it and how a computer can use it. I volunteered to present some relevant linguistic and computational literature. I plan to discuss how the lexicon is viewed in Transformational Grammar, Lexical Functional Grammar, and Relational Grammar (I don't know enough about GPSG to touch on that perspective). I plan to discuss Cherry's paper on the UNIX tool PARTS (a program from the Writer's Workbench that assigns parts of speech by rule). I would also like to discuss the data structures used in various dictionary projects. Can anyone provide pointers to such information for the OED or Webster's projects? Any other references or abstracts you can send would only enrich our provincial San Diegan discussions! I have a 1982 IEEE article on PARTS and Cherry's 1978 paper--are there are more recent references? For more information on the SIG, you may contact Ed Weaver at work at (619) 236-5963. I'll forward any electronic responses on to him. Thanks, Michelle gross@nprdc.ARPA ...ihnp4!sdcsvax!sdcc6!ix713 (UUCP) Navy Personnel R&D Center UCSD Linguistics, C-008 San Diego, CA. 92152-6800 La Jolla, CA. 92093 ------------------------------ Date: 03 Mar 86 1042 PST From: Vladimir Lifschitz Subject: Seminar - Commonsense Knowledge in the TACITUS Project (SU) Commonsense Knowledge in the TACITUS Project Jerry R. Hobbs Artificial Intelligence Center SRI International Thursday, March 6, 4pm MJH252 In the TACITUS project for using commonsense knowledge in the understanding of texts about mechanical devices and their failures, we have been developing various commonsense theories that are needed to mediate between the way we talk about the behavior of such devices and causal models of their operation. Of central importance in this effort is the axiomatization of what might be called ``commonsense metaphysics''. This includes a number of areas that figure in virtually every domain of discourse, such as granularity, scales, cycles, time, space, material, physical objects, shape, causality, functionality, and force. Our effort has been to construct core theories of each of these areas, and then to define, or at least characterize, a large number of lexical items in terms provided by the core theories. In this talk I will discuss our methodological principles, such as aiming for the maximum abstraction possible in order to accommodate metaphor and analogy, and I will describe the key ideas in the various domains we are investigating. ------------------------------ Date: Tue, 4 Mar 1986 20:35 EST From: AGRE%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU Subject: Seminar - Hubert Dreyfus on Being and Time (MIT) Artificial Intelligence Seminar Monday, March 10, 2:30pm 545 Technology Square (MIT Building NE43) 7th Floor Playroom WHY YOU SHOULD READ BEING AND TIME Hubert L. Dreyfus Philosophy Department UC Berkeley The beauty of artificial intelligence is that computation keeps you honest: mistaken approaches will simply fail. I will argue that a diagnosis of current difficulties in AI research can be found in the work of Martin Heidegger. Heidegger's Being and Time isolates a number of assumptions of Western philosophy which, though subtle and pervasive, are contradicted by a careful account of the phenomenology of everyday activity. These assumptions and their corollaries have been implicit (and sometimes explicit) in most AI work since the field's beginnings. The task now is to find a positive alternative. I will start by presenting some of the basic concepts of Heidegger's phenomenology. But Heidegger's account of everyday practices does not directly provide an alternative to traditional methods in AI because it offers a description rather than a mechanizable explanation. It is difficult to reason about the ways descriptions and explanations constrain one another. Still, I will attempt a start by outlining the virtues and failings of some new approaches, in particular those of the connectionist movement. ------------------------------ Date: 4 Mar 1986 12:28-EST From: gasser@usc-cse.usc.edu Subject: Seminar - Intelligent Distributed Operating Systems (USC) USC Distributed Problem Solving Group Meeting Wednesday, 3/12/86 3:00 - 5:00 PM Seaver Science 319 John Gieser, Ph.D. Student, USC, will speak on "'Intelligent' Operating Systems for Distributed Computing". ABSTRACT Recent ideas from distributed problem solving (DPS) research appear to have merit when used to acheive cooperation in open-ended distributed computing systems (DCS). To use these techniques, the DCS nodes are viewed as autonomous agents in a problem-solving situation, with each node governed by an "intelligent" operating system (IOS). This talk will focus on some ideas for providing the structures and mechanisms needed in the IOS to handle problems requiring cooperation such as distributed control, load balancing/sharing, cooperating processes, etc. Questions: Dr. Les Gasser, (213) 743-7794, or John Gieser (gieser@usc-cse.usc.edu) ------------------------------ Date: Tue, 4 Mar 86 16:31 EST From: Jonathan Connell Subject: Seminar - Delegation and Inheritance (MIT) [Forwarded from the MIT bboard by SASW@MC.LCS.MIT.EDU.] Thursday , March 6 4:00pm Room: NE43- 8th floor Playroom The Artificial Intelligence Lab Revolving Seminar Series Delegation And Inheritance: Two Mechanisms for Sharing Knowledge in Object-Oriented Systems Henry Lieberman AI Lab, MIT When a group of objects in an object oriented programming system shares some common behavior, how can we avoid re-programming behavior in every object that needs it? I will explore the consequences of two mechanisms for sharing knowledge, Inheritance and Delegation, for expressiveness and performance of object oriented languages. Using Inheritance, behavior common to a group of objects is encoded in a Class object, which contains procedures for responding to messages, and the names of variables that the procedure may access. Each class may create a set of Instances, which share the procedures of the class, but may have their own private values for the variables. Subclasses may extend classes by adding additional procedures and variables. Another way of sharing behavior is Delegation, which views each object as a prototype capable of creating new objects by copying or reference, removing the distinction between classes and instances. General and specialized objects communicate using message passing rather than a "hard wired" mechanism. Communication patterns can be determined at message reception time rather than at compile time or object creation time. There is a time/space tradeoff between inheritance and delegation, delegation permitting smaller objects at the cost of increased message traffic. ------------------------------ Date: 20 February 1986 1450-EST From: Betsy Herk@A.CS.CMU.EDU Subject: Seminar - Refinement of Expert System Knowledge Bases (CMU) Speaker: Allen Ginsberg, Rutgers University Date: Wednesday, March 5 Time: 11:30 - 1:00 Place: 5409 WeH Title: The automatic refinement of expert system knowledge bases Knowledge base refinement involves the generation, testing, and possible incorporation of plausible refinements to the rules in a knowledge base with the intention of thereby improving the empirical adequacy of an expert system, i.e., its ability to correctly diagnose or classify the cases in its domain of expertise. The first part of the talk is a theoretical explication of the basic concepts involved in knowledge base refinement -- e.g., a precise analysis of one sense in which a refinement may be said to be plausible is given -- and includes an overview of the strategic goals that must be addressed by any knowledge base refinement system. As an illustration of the general theory, the second part of the talk focuses on the SEEK2 system for automatic knowledge base refinement. In the last part of the talk a brief discussion of a metalanguage for the experimental design of refinement systems is given. ------------------------------ Date: 27 February 1986 1153-EST From: Betsy Herk@A.CS.CMU.EDU Subject: Seminar - Heuristic Search: Algorithms, Theory, and Learning (CMU) Speaker: Richard Korf, Asst. Prof., Comp. Sci. Dept., UCLA Date: Friday, March 14 Time: 1:00 - 2:30 Place: 5409 Wean Hall Title: Heuristic search: Algorithms, theory, and learning Abstract: This talk will cover three new research results in the area of heuristic search. The first is a new algorithm, called Iterative-Deepening-A*, that is asymptotically optimal in terms of solution cost, time, and space among all admissible heuristic tree searches. In practice, it is the only known algorithm that is capable of finding optimal solutions to the Fifteen Puzzle. The second is a theory which unifies the treatment of heuristic evaluation functions in single-agent problems and two-person games. The theory is based on the notion of a heuristic as a function that is invariant over optimal solution paths. Based on this theory, we performed some experiments on the automatic learning of heuristic functions. Our program was able to learn a set of relative weights for the different chess pieces which is different from, but competitive with, the classical values. ------------------------------ Date: Wed 5 Mar 86 16:57:49-PST From: Emma Pease Subject: Seminar - Brains, Behavior, and Robotics (CSLI) [Excerpted from the CSLI Calendar by Laws@SRI-AI.] Brains, Behavior, and Robotics by James S. Albus Discussion led by Pentti Kanerva (Kanerva@riacs.arpa) 12 noon, TINLunch, Ventura Hall Conference Room THURSDAY, March 13, 1986 In 1950, Alan Turing wrote, ``We may hope that machines will eventually compete with men in all purely intellectual fields. But which are the best ones to start with? . . . Many people think that a very abstract activity, like the playing of chess, would be best. It can also be maintained that it is best to provide the machine with the best sense organs that money can buy, and then teach it to understand. . . . This process could follow the normal teaching of a child. Things would be pointed out and named, etc. Again I do not know what the right answer is, but I think that both approaches should be tried.'' (Quoted by Albus on p. 5.) ``Brains, Behavior, and Robotics'' takes this ``Turing's second approach'' to artificial intelligence, the first being the pursuit of abstract reasoning. The book combines over a decade of research by Albus. It is predicated on the idea that to understand human intelligence we need to understand the evolution of intelligence in the animal kingdom. The models developed are mathematical (computational), but one of their criteria is neurophysiological plausibility. Although the research is aimed at understanding the mechanical basis of cognition, Albus also discusses philosophical and social implications of his work. ------------------------------ Date: Wed 5 Mar 86 16:44:14-PST From: LANSKY@SRI-AI.ARPA Subject: Seminar - Situation Calculus Planning (SRI) SITUATION CALCULUS PLANNING IN BLOCKS AND RELATED WORLDS John McCarthy (JMC@SU-AI) Stanford University 11:00 AM, MONDAY, March 10 SRI International, Building E, Room EJ228 (new conference room) This talk will present mainly ideas rather than completed work. Situation calculus is based on the equation s' = result(e,s), where s and s' are situations and e is an event. Provided one can control the deduction adequately, this is a more powerful formalism than STRIPS. Planning a sequence of actions, or more generally, a strategy of actions to achieve a situation with specified properties, admits a variety of heuristics which whittle away at the problem. In many practical situations, these heuristics, which don't guarantee a full solution but leave a reduced problem, are sufficient. Humans appear to use many of them and so should computer programs. The talk therefore will concern both epistemological and heuristic aspects of planning problems. ------------------------------ Date: Wed 5 Mar 86 16:57:49-PST From: Emma Pease Subject: Seminar - The Perspective Concept in Computer Science (CSLI) [Excerpted from the CSLI Calendar by Laws@SRI-AI.] SYSTEM DESCRIPTION AND DEVELOPMENT TALK The Perspective Concept in Computer Science 12:15, Monday, March 10, Ventura Conference Room Our topic next Monday (March 10) will be a continued discussion (introduced by Jens Kaasboll) of the issues raised by Kristen Nygaard in his talk about perspectives on the use of computers: Regardless of definitions of ``perspective'', there exist many perspectives on computers. Computers are regarded as systems, tools, institutions, toys, partners, media, symbols, etc. Even so, there exist system description languages but no tool, or institution, or ... languages. What do the other perspectives reflect, which make them less attractive for language designers? Suggestive answer: The system perspective is the definite computer science perspective in which the processes inside the computers are regarded as the goal of our work. Viewed through some of the other perspectives, the computer is seen as a means for achieving ends outside the computer, i.e., the needs of people using the computers. ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Fri Mar 7 01:21:07 1986 Date: Fri, 7 Mar 86 01:21:04 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a006865; 6 Mar 86 17:08 EST Date: Wed 5 Mar 1986 22:41-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #45 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Fri, 7 Mar 86 01:03 EST AIList Digest Thursday, 6 Mar 1986 Volume 4 : Issue 45 Today's Topics: Queries - Belief Theories for Uncertainties & Non-Monotonic Reasoning/Probabilistic Reasoning & GCLISP & Expert System Shell Software, Linguistics - Ambiguous Sentence & Lexicons, Logic Programming - Prolog Book ---------------------------------------------------------------------- Date: Tue 4 Mar 86 06:24:39-PST From: Ted Markowitz Subject: Belief Theories for uncertainties Can anyone supply pointers to articles on the Dempster-Shafer belief theory work? --ted ------------------------------ Date: 4 Mar 86 02:30:48 GMT From: ucdavis!lll-lcc!lll-crg!seismo!harvard!bbnccv!bbncca!wanginst!malek @ucbvax.berkeley.edu (Sharon Malek) Subject: Non-Monotonic Reasoning/Probabilistic Reasoning for Expert Sys. I'm looking for information on non-monotonic reasoning and probabilistic reasoning techniques for expert systems, as part of my graduate assistant assignment. Any assistance would be appreciated. Please mail responses. Thanks, -- Sharon Malek malek@wanginst (Csnet) Wang Institute of Graduate Studies wanginst!malek (UUCP) Tyng Road, Tyngsboro, MA 01879 (617) 649-9731 ------------------------------ Date: 27 Feb 86 22:03:18 GMT From: tektronix!uw-beaver!ssc-vax!bcsaic!pamp@ucbvax.berkeley.edu (pam pincha) Subject: GCLISP This is a request for information from anyone who has had the occasion to use Golden Common LISP -- especially the version 2.0 called GCLISP 286 Developer system. We need to know if the system works well on the IBM host; whether it response is reasonable for systems larger than just toy demos; how easy it is to use....etc.,etc.,etc....... Basically, would you or would you not recommend it and for what level of work would you recommend it, and why (or why not)? Please use mail to send you reply. I'll summarize to the group if there is interest. Thanks in advance, P.M.Pincha-Wagener PS. Comments on how well the scoping is handled in this system would be of help also. ------------------------------ Date: Mon, 3 Mar 86 23:41:00 est From: mayerk%UPenn-GradEd%upenn.csnet@CSNET-RELAY.ARPA Subject: Searching for comments on expert system shell software... I'm currently putting together an introductory course on expert systems here at Penn, and I'm in need of sage advice. Part of the course will involve using some expert system shell for homework assignments. The assignments will involve: Forward and backward chaining, frames, CFs, contexts (maybe), and a final project that will be a small prototypical system from a selected list of subjects. I've plowed through some of the hype from various vendors, but I'd like more information from people who have either used them, or used others that are personal favorites. If anyone is interested, I'll send out an appendix of all of the responses I get. Here is an uncut list from a database that I'm compiling: Vendor Name Product Name ________________________________________ __________________ Expert Systems International, Ltd. ES/P Advisor ExperTelligence, Inc. ExperFacts ExperLisp ExperLisp-3600 ExperLisp-Talk Exsys, Inc. Exsys Version 3.0 Human Edge Expert Ease Expert Edge Intelliware, Inc. Experteach Jeffrey Perrone & Associates, Inc. Advisor Ex-Tran Expert Ease EXSYS Grid-Xpert Insight KDS Corporation KDS Lithp Systems BV Daisy Micro Data Base Systems/Marketing & Sales Guru Radian Corporation RuleMaster Silogic, Inc. The Knowledge Work Bench Software Architecture and Engineering, Inc. KES II Texas Instruments Arborist TI Personal Consultant You'll have to excuse me if the list seems a little "raw," but I thought that it unfair to omit anything until I hear a little more. (Most of the above are unsuitable for my needs, but in the interests of a wider community, comments might be valuable.) Send responses to: mayerk%UPenn-Graded Kenneth Mayer University of Pennsylvania (215) 387-4751 ------------------------------ Date: Tue 4 Mar 86 06:30:40-PST From: Ted Markowitz Subject: Ambiguous sentences cont. Yet another ambiguous sentence that I've run across in NLP classes is: "The host smiled as he turned on the electric spit." I leave it to reader to generate the permutations... --ted ------------------------------ Date: Wed, 5 Mar 86 15:34:14 est From: Mark J. Norton Subject: Re: QUERY RE PUBLIC AND PRIVATE LEXICONS Although you mentioned that you are not intrested in commericial lexicons, I would suggest you contact someone in AI R&D at Wang Laboratories. I spent several years there working on these and can assure you that they are quality lexicons containing all (and more) of the information you require. The source of data is the Random House Unabridged Dictionary, to which they own exclusive computer rights. They also have on-line lexicons dealing with Legal Terms, Medical Terms, Scientific Terms, Roget's Thesaurus, Place-Names, Translation Aids to French, German, Spanish, Italian, Japanese, Chinese, Korean, and Arabic, British Spellings of words, and other specialized lists. It is quite possible that Wang might let you use their information in return for application and consultation access. Send me mail if you would like to persue this, and need specific contacts there. Mark J. Norton, 59 New Estate Road, Littleton, MA 01460. -- Mark J. Norton {decvax,linus,wjh12,mit-eddie,cbosgd,masscomp}!genrad!panda!mjn mjn@sunspot ------------------------------ Date: Mon, 3 Mar 86 11:47:33 pst From: sdcsvax!sdcrdcf!polyslo!cburdor@ucbvax.berkeley.edu (Christopher Burdorf) Subject: Re: Prolog Books I would recommend Logic for Problem Solving, by Robert Kowolski. ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Fri Mar 7 01:20:59 1986 Date: Fri, 7 Mar 86 01:20:54 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a008803; 6 Mar 86 20:16 EST Date: Thu 6 Mar 1986 16:09-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #46 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Fri, 7 Mar 86 01:05 EST AIList Digest Friday, 7 Mar 1986 Volume 4 : Issue 46 Today's Topics: Theory - Knowledge & Dreyfus & Turing Test ---------------------------------------------------------------------- Date: Sat 1 Mar 86 20:04:39-PST From: Lee Altenberg Subject: Alan Watts on AI I thought Ailist readers might be interested in the following excerpt from "Oriental Omnipotence" in THE ESSENTIAL ALAN WATTS: We must begin by showing the difference between Western and Eastern ideas of omniscience and omnipotence. A Chinese Buddhist poem says: You may wish to ask where the flowers come from, But even the God of Spring doesn't know. A Westerner would expect that, of all people, the God of Spring would know exactly how flowers are made. But if he doesn't know, how can he possibly make them? A buddhist would answer that the question itself is misleading since flowers are grown, not made. Things which are made are either assemblages of formerly separate parts (like houses) or constructed by cutting and shaping from without inwards (like pots of clay or images). But things which are grown formulate their own structure and differentiate their own parts from within outwards. ... If, then, the God of Spring does not make the flowers, how does he produce them? The answer is that he does so in the same way that you and I grow our hair, beat our hearts, structure our bones and nerves, and move our limbs. To us, this seems a very odd statement because we do not ordinarily think of ourselves as actively growing our hair in the same way that we move our limbs. But the difference vanishes when we ask ourselves just HOW we raise a hand, or just how we make a mental decision to raise a hand. For we do not know-- or, more corectly, we do know but we cannot describe how it is done in words. To be more exact: the process is so innate and so SIMPLE that it cannot be conveyed by anything so complicated and cumbersome as human language, which has to describe everything in terms of a linear series of fixed signs. This cumbersome way of making communicable representations of the world makes the description of certain events as complicated as trying to drink water with a fork. It is not that these actions or events are complicated in themselves: the complexity lies in trying to fit them into the clumsy instrumentality of language, which can deal only with one thing (or "think") at a time. Now the Western mind identifies what it knows with what it can describe and communicate in some system of symbols, whether linguistic or mathematical-- that is, with what it can think about. Knowledge is thus primarily the content of thought, of a system of symbols which make up a very approximate model or representation of reality. In somewhat the same way, a newspaper photograph is a repesentation of a natural scene in terms of a fine screen of dots. But as the actual scene is not a lot of dots, so the real world is not in fact a lot of things or "thinks". The Oriental mind uses the term KNOWLEDGE in another sense besides this-- in the sense of knowing how to do actions which cannot be explained . In this sense, we know how to breathe and how to walk, and even how to grow hair, because that is just what we do! ------------------------------ Date: Sat 1 Mar 86 20:10:32-PST From: Stuart Russell Subject: Addressing some of Dreyfus' specific points To address some of the actual content of Dreyfus' recent talk at Stanford, delivered to an audience consisting mostly of AI researchers: 1) The discussion after the talk was remarkably free of strong dissent, for the simple reason that Dreyfus is now making a sloppy attempt at a cognitive model for AI, rather than making any substantive criticism of AI. Had his talk been submitted to AAAI as a paper, it would probably have been rejected as containing no new ideas and weak empirical backing. 2) The backbone of his argument is that human *experts* solve problems by accessing a store of cached, generalized solutions rather than by extensive reasoning. He admits that before becoming expert, humans operate just like AI reasoning systems, otherwise they couldn't solve any problems and thus couldn't cache solutions. He also admits that even experts use reasoning to solve problems insufficiently similar to those they have seen before. He doesn't say how solutions are to be abstracted before caching, and doesn't seem to be aware of much of the work on chunking, rule compilation, explanation-based generalization and macro-operator formation which has been going on for several years. Thus he seems to be proposing a performance mechanism that was proposed long ago in AI, acts as if he (or his brother) invented it and assumes, therefore, that AI can't have made any progress yet towards understanding it. 3) He proposes that humans access previous situations and their solutions by an "intuitive, holistic matching process" based on "total similarity" rather than on "breaking down situations into features and matching on relevant features". When I asked him what he meant by this, he said he couldn't be any more specific and didn't know any more than he'd said. (He taped our conversation, so he can no doubt correct the wording.) In the talk, he mentioned Roger Shepard's work on similarity (stimulus generalization) as support for this view, but when I asked him how the work supported his ideas, it became clear that he knew very little about it. Shepard's results can be explained equally well if situations are described in terms of features, but more importantly they only apply when the subject has no idea of which parts of the situation are relevant to the solution, which is hardly the case when an expert is solving problems. In fact, the fallacy of analogical reasoning by total similarity (which is the only mechanism he is proposing to support his expert phase of skilled performance) has long been recognized in philosophy, and also more recently in AI. Moreover, the concept of similarity without any goal context (i.e. without any purpose for which the similarity will be used) seems to be incoherent. Perhaps this is why he doesn't attempt to define what it means. 4) His final point is that such a mechanism cannot be implemented in a system which uses symbolic descriptions. Quite apart from the fact that the mechanism doesn't work, and cannot produce any kind of useful performance, there is no reason to believe this, nor does he give one. In short, to use the terminology of review forms, he is now doing AI but the work doesn't contain any novel ideas or techniques, does not report on substantial research, does not properly cite related work and does not contribute substantially to knowledge in the field. If it weren't for the bee in his bonnet about proving AI (except the part he's now doing) to be fruitless and dishonest, he might be able to make a useful contribution, especially given his training in philosophy. Stuart Russell Stanford Knowledge Systems Lab ------------------------------ Date: Sat, 1 Mar 86 14:23:45 est From: Jeffrey Greenberg Reply-to: green@osu-eddie.UUCP (Jeffrey Greenberg) Subject: Re: Technology Review article > re: > Dreyfus' distinction between learning symbolically how to do a task > and 'doing' the task...i.e. body's knowledge. > I agree with the Dreyfus brothers - the difficulty many AI people have (in my opinion) is a fundamental confusion of "knowledge of" versus "knowledge that." ------------------------------ Date: 28 Feb 86 02:37:13 GMT From: hplabs!ames!eugene@ucbvax.berkeley.edu (Eugene Miya) Subject: Re: Technology Review article (Deryfus actuall) <1814@bbncc5.UUCP> > > About 14 years ago Hubert Dreyfus wrote a paper titled "Why Computers Can't > Play Chess" - immediately thereafter, someone at the MIT AI lab challenged > Dreyfus to play one of the chess programs - which trounced him royally - > the output of this was an MIT AI Lab Memo titled "The Artificial Intelligence > of Hubert Dreyfus, or Why Dreyfus Can't Play Chess". > > The document was hilarious. If anyone still has a copy, I'd like to arrange > a xerox of it. > > Miles Fidelman (mfidelman@bbncc5.arpa) Excuse the fact I reproduced all that above rather than digest it. I just attended a talk given by Dreyfus (for the first time). I think the AI community is FORTUNATE to have a loyal opposition following of Dr. Dreyfus. In some defense, Dreyfus is somewhat kind to the AI community (in constrast to some AI critics I know) for instance he does believe in the benefit of expert systems and expert assistants. Dreyfus feels that the AI community harped on the above: Men play chess. Computers play chess. Dreyfus is a man. Computer beat Dreyfus. Therefore, computers can beat man playing chess. He pointed out he sent his brother (supposedily captain of the Harvard chess team at one time) and he beat the computer (we should write his brother at UCB CS to verify this I supose). While I do not fully agree with Dreyfus's philosophy or his "methodology," he is a bright thinker and critic. [One point we do not agree on: he believes in the validity of the Turing test, I do not (in the way it currently stands).] --eugene miya NASA Ames Research Center {hplabs,ihnp4,dual,hao,decwrl,allegra}!ames!aurora!eugene eugene@ames-nas.ARPA p.s. I would not mind seeing a copy of the paper myself. :-) ------------------------------ Date: 3 Mar 86 02:17:00 GMT From: pur-ee!uiucdcs!uiucdcsp!bsmith@ucbvax.berkeley.edu Subject: Re: "self-styled philosophers" William James once wrote that all great theories go through three distinct stages: first, everyone claims the theory is simply wrong, and not worth taking seriously. Second, people start saying that, maybe it's true, but it's trivial. And third, people are heard to say that not only is it true and important, but they thought of it first. Here at the University of Illinois, it seems to be de rigeur to laugh and deride Dreyfuss whenever his name comes up. I am convinced the majority of these people have never read any of Dreyfuss' work--however, this is unimportant to them (clearly I don't mean everyone here). There are also those who spend a great deal of time and effort rejecting everything Dreyfuss says. For example, recently Dr. Buchanan (of Stanford) gave a lecture here. He purported to be answering Dreyfuss, but in the great majority of cases agreed with him (always saying something like, "Well, maybe it's true, but who cares?"). It seems to me that, if Dreyfuss is so unimportant, it is very strange indeed that so many people get so offended by everything he says and does. Perhaps AI researchers ought to be less sensitive and start encouraging this sort of interdisciplinary activity. Perhaps then AI will move forward and finally live up to its promise. Barry Smith ------------------------------ Date: Wed, 5 Mar 86 15:38:08 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: A Tale for Marvin the Paranoid Android. > From AIList Vol 4 # 33:- > His main thesis is that there are certain human qualities and > attributes, for example certain emotions, that are just not the > kinds of things that are amenable to mechanical mimicry. > ... > Peter Ladkin > From AIList Vol 4 # 41:- > As I pointed out, but you deleted, his major argument is that > there are some areas of human experience related to intelligence > which do not appear amenable to machine mimicry. > ... > Peter Ladkin Could these areas be named exactly? Agreed that there are emotional aspects that cannot be programmed into a machine, what parts of the ``human experience related to intelligence'' will also remain out- side of the machine's grip? Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ Date: Mon, 3 Mar 86 12:54:02 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: The Turing Test - A Third Quantisation? The original basis for the Turing test was to see if it was possible to distinguish, purely from a text, whether you were talking to a man or woman. The extension of this, the Turing test itself, seeks to give a criterion for deciding on whether or not a intelligent system is "truly intelligent". A human asks questions and receives answers in textual form. (S)he then has to decide if it is a machine behind the screen or not. Now, supposing a system has been built which "passes" the test. Why not take the process one stage further? Why not try to design an intelligent system which can decide whether *it* is talking to machine or not? Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Tue Mar 11 05:04:45 1986 Date: Tue, 11 Mar 86 05:04:41 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a006467; 11 Mar 86 0:43 EST Date: Mon 10 Mar 1986 09:05-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #47 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Tue, 11 Mar 86 04:51 EST AIList Digest Monday, 10 Mar 1986 Volume 4 : Issue 47 Today's Topics: Article/Seminar - The TI Compact LISP Machine (Dallas ACM), Seminars - Tools Beyond Technique (UCB) & Knowledge and Action in the Presence of Faults (SU) & Adaptive Networks (GTE) & Stochastic Complexity (IBM-SJ) & Updating Databases with Incomplete Information (SU) & Parallel Architectures for Knowledge Bases (SMU), Conference - 1987 Linguistics Institute ---------------------------------------------------------------------- Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Article/Seminar - The TI Compact LISP Machine (Dallas ACM) ACM Dallas Chapter Meeting Notice Speaker: Alfred Ricoomi Senior Member, Technical Staff Texas Instruments Topic: The TI Compact LISP Machine The February 17 issue of Aviation Week is devoted to the military application of Artificial Intelligence. One article reports on the development, at TI, of a military LISP machine. Mr. Riccomi will describe the machine, its near term applications, and likely spin-offs into the commercial world especially in the airline industry. Place: INFOMART, 1950 nStemmons Freeway (at Oak Lawn)Room 7004 Date: Tuesday, March 11, 1986, 7:30 - 8:15 ------------------------------ Date: 5 Mar 86 00:24:00 GMT From: pur-ee!uiucdcs!marcel@ucbvax.berkeley.edu Subject: Seminar - Tools Beyond Technique (UCB) WHEN: 12:00 noon, Wednesday, March 5th WHERE: Canterbury House, University of Illinois at Urbana-Champaign TOOLS BEYOND TECHNIQUE Marcel Schoppers Dept of Computer Science U of Illinois at Urbana-Champaign In this talk I will propose yet another way to characterize AI, but one which I hope captures the intuitions of AI researchers: that AI is the attempt to liberate tools/machines from absolute dependence on human control. That done, I will suggest some achievements which should, according to this characterization of AI, demonstrate the success of AI work. Importantly, both the characterization and those crucial achievements contain no comparison to human capabilities. I therefore maintain that several contemporary arguments for and against the future success of AI are at once fallacious and beside the point. Among others: the AI community's claim that "brains are computers too" is hardly necessary and certainly not scientific, while Weizenbaum's "maybe computers can think, but they shouldn't" is self-defeating. On the issue of whether artificial intelligence will ever be achieved I will not commit myself, but at least my characterization provides a down-to-earth criterion. A paper on this subject (in the socio-communications literature): "A perspective on artificial intelligence in society" Communications 9:2 (december 1985). ------------------------------ Date: Thu 6 Mar 86 06:09:35-PST From: Oren Patashnik Subject: Seminar - Knowledge and Action in the Presence of Faults (SU) AFLB, 13-Mar-86 : Yoram Moses (MIT) 12:30 pm in MJ352 (Bldg. 460) Knowledge, Common Knowledge, and Simultaneous Actions in the Presence of Faults We show that any protocol that guarantees to perform a particular action simultaneously at all sites of a distributed system must guarantee that the sites attain common knowledge of particular facts when such an action is performed. We analyze what facts become common knowledge at various points in the execution of protocols in a simple model of a system in which processors are liable to crash. We obtain a new protocol for Simultaneous Byzantine Agreement that is optimal in all of its runs. That is, rather than achieving the worst case behavior, every run of the protocol halts at the earliest possible time, given the pattern in which failures occur. This may happen as early as after two rounds. We characterize precisely what failure patterns require the protocol to run for k rounds, 1 Subject: Seminar - Adaptive Networks (GTE) Self-Organization, Memorization, and Associative Recall of Sensory Information by Brain-Like Adaptive Networks Tuevo Kohonen, Helsinki University of Technology The main purpose of thinking is to forecast phenomena that take place in the environment. To this end, humans and animals must refer to a complicated knowledge base which is somewhat vaguely called memory. One has to realize the two main problem areas in a discussion of memory: (1) the memory mechanism itself, and (2) the internal representations of sensory information in the brain networks. Most of the experimental and theoretical works have concentrated on the first problem. Although it has been extremely difficult to detect memory traces experimentally, the storage mechanism is theoretically still the easier part of the problem. Contrary to this, it has been almost a mystery how a physical system can automatically extract various kinds of abstraction from the huge number of vague sensor signals. This paper now contains some novel views and results about the formation of such internal representations in idealized neural networks, and their memorization. It seems that both of the above functions, viz. formation of the internal representations and their storage, can be implemented simultaneously by an adaptive, self-organizing neural structure which consists of a great number of neural units arranged into a two-dimensional network. A number of computer simulations are presented to illustrate both the self-organized formation of sensory feature maps, as well as associative recall of activity patterns from the distributed memory. When: March 14, 1:00 pm Where: GTE Labs 3-131 Contact: Rich Sutton, Rich@GTE-Labs.CSNet, (617)466-4133 ------------------------------ Date: 6 Mar 86 14:52:51 PST From: CALENDAR@IBM-SJ.ARPA Subject: Seminar - Stochastic Complexity (IBM-SJ) IBM Almaden Research Center 650 Harry Road San Jose, CA 95120-6099 CALENDAR March 10 - 14, 1986 Computer STOCHASTIC COMPLEXITY AND THE MDL AND PMDL PRINCIPLES Science J. J. Rissanen, IBM Almaden Research Center Colloquium Thurs., Mar. 13 There is no rational basis in traditional 3:00 P.M. statistics for the comparison of two models Rear Audit. unless they have the same number of parameters. Hence, for example, the important selection-of-variables problem has a dozen or so solutions, none of which can be preferred over the others. Recently, inspired by the algorithmic notion of complexity, we introduced a new concept in statistics, the Stochastic Complexity of the observed data, relative to a class of proposed probabilistic models. In broad terms, it is defined as the least number of binary digits with which the data can be encoded by use of the selected models. The stochastic complexity also represents the smallest prediction errors which result when the data are predicted by use of the models. Accordingly, the associated optimal model represents all the statistical information in the data that can be extracted with the proposed models, and for this reason its computation, which we call the MDL (Minimum Description Length) principle, may be taken to be the fundamental problem in statistics. In this talk, we describe a special form of the MDL principle, which amounts to the minimization of squared "honest" prediction errors, and we apply it to two examples of polynomial curve fitting as well as to contingency tables. In the first example, which calls for the prediction of weight growth of mice, the degree of the MDL polynomial agrees with the optimal degree, determined in retrospect after the predicted weights were seen. The associated predictions also far surpass those made with the best traditional statistical techniques. A fundamental theorem is given, which permits comparison of models in the spirit of the Cramer-Rao inequality, except that the models need not have the same number of parameters. It also settles the issue of how the selection-of-variables problem is to be solved. Host: R. Arps (Refreshments at 2:45 P.M.) [...] ------------------------------ Date: Fri 7 Mar 86 17:33:40-PST From: Marianne Winslett Subject: Seminar - Updating Databases with Incomplete Information (SU) Updating Databases With Incomplete Information --or-- Belief Revision is Harder Than You Thought Marianne Winslett PhD Oral Area X Seminar Margaret Jacks 352 Friday, March 14, 3:15 PM Suppose one wishes to construct, use, and maintain a database of knowledge about the real world, even though the facts about that world are only partially known. In the database domain, this situation arises when database users must coax information into and out of databases in the face of missing values and uncertainty. In the AI domain, this problem arises when an agent has a base set of beliefs that reflect partial knowledge about the world, and then tries to incorporate new, possibly contradictory knowledge into the old set of beliefs. In the logic domain, one might choose to represent such a database as a logical theory, and view the models of the theory as possible states of the real world. How can new information (i.e., updates) be incorporated into the database? For example, given the new information that "b or c is true," how can we get rid of all outdated information about b and c, add the new information, and yet in the process not disturb any other information in the database? The burden may be placed on the user or other omniscient authority to determine exactly which changes in the theory will bring about the desired set of models. But what's really needed is a way to specify an update intensionally, by stating some well-formed formula that the state of the world is now known to satisfy and letting the database management system automatically figure out how to accomplish that update. This talk will explore a technique for updating databases containing incomplete information. Our approach embeds the incomplete database and the updates in the language of first-order logic, which we believe has strong advantages over relational tables and traditional data manipulation languages when information is incomplete. We present semantics and algorithms for our update operators, and describe an implementation of the algorithms. This talk should be accessible to all who are comfortable with first-order logic and have a passing acquaintance with the notion of database updates. ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Seminar - Parallel Architectures for Knowledge Bases (SMU) Toward Computer Architectures for Database and Knowledge Base Processing Computer Science and Engineering Seminar, Friday, March 14, 1986 Speaker: Lubomir Bic University of California at Irvine Location: 315SIC Time: 3:00 PM The importance of parallelism has been recognized in recent years and a number of multiprocessor architectures claiming suitability to intelligent data and knowledge base processing have been proposed. The success of these architectures has been, in most cases, rather modest. The message conveyed in this talk is that, in order to build highly-parallel computer architectures, new models of computation capable of exploiting the potential of large numbers of processing elments and memory units must first be developed. To support this claim, two such models-- one for processing queries in a network-oriented database system and another for extracting information from a logic-based knowledge representation system -- will be outlined. Both models are based on the principles of asynchronous data-driven computation, which eliminate the need for centralized control and shared memory. ------------------------------ Date: Sat, 8 Mar 86 15:29:19 est From: walker@mouton.ARPA (Don Walker at mouton.ARPA) Subject: Conference - 1987 Linguistics Institute 1987 LINGUISTICS INSTITUTE STANFORD UNIVERSITY The 1987 Summer Institute of the Linguistic Society of America will be hosted by the Linguistics Department of Stanford University, from June 29 to August 7, 1987. It is co-sponsored by the Association for Computational Linguistics. The theme of the Institute is "Contextual and Computational Dimensions of Language", and is meant to reflect the ever-growing interest in integrating theories of linguistic structure with theories of language processing and models of how language conveys information in context. The aim is to provide a forum in which it is possible to integrate a variety of linguistic traditions, particularly linguistic theory, computational linguistics, discourse analysis, psycholinguistics, sociolinguistics, and artificial intelligence. Several different kinds of courses and activities will be offered during the six-week period of the Institute: (i) A series of overview classes in the main subareas of linguistics (six weeks, 3 units) (ii) A series of one-week intensive classes intended to provide background for the four-week courses and seminars below (June 29-July 3, 1 unit) (iii) Four-week classes on topics related directly to the theme of the Institute (July 13-August 7, 2 units) (iv) Several seminars associated with research workshops will run throughout the last four weeks. These can be taken for credit, as part of the Stanford "directed research" program (subject to prior approval of the workshop leader) (up to three units) (v) A series of Wednesday lectures (e.g.,on the Synthesis of Approaches to Discourse), involving Institute participants and invited visitors (vi) The Association for Computational Linguistics will hold its annual meeting during the second week of the Institute (July 6-10). 1987 marks the first time in recent years that two consecutive Institutes have been held with the same theme. This complementarity of the 1986 Institute held at the City University of New York and the 1987 Institute reflects remarkable changes taking place today in the field of linguistics. Taken together, the Institutes provide the depth and diversity necessary to cover the newly emerging subfields and to teach the range of interdisciplinary tools and knowledge so fundamental to new theoretical approaches. The 1987 Institute at Stanford differs from the 1986 Institute primarily in specific course offerings and faculty and in its focus on providing a rich interdisciplinary research as well as teaching environment. Many of the instructors will also be participating in research groups; in general they will teach only one course. The Executive planning committee is: Ivan Sag (Director), Ellen Prince (Associate Director), Marlys Macken, Peter Sells, and Elizabeth Traugott. David Perlmutter will be the Sapir Professor, and Joseph Greenberg the Collitz Professor of the 1987 Institute. For more information, write 1987 LSA Institute, Department of Linguistics, Stanford University, Stanford, California 94305. Preliminary List of Institute Faculty: Judith Aissen Elaine Anderson Stephen Anderson Philip Baldi Jon Barwise Joan Bresnan Gennaro Chierchia Kenneth Church Eve Clark Herbert Clark Nick Clements Charles Clifton Philip Cohen Robin Cooper William Croft Penelope Eckert Elisabet Engdahl Charles Ferguson Charles Fillmore Joshua Fishman Lyn Frazier Victoria Fromkin J. Mark Gawron Gerald Gazdar Joseph Greenberg Barbara Grosz Jorge Hankamer Jerry Hobbs Paul Hopper Larry Horn Philip Johnson-Laird Ron Kaplan Lauri Karttunen Martin Kay Paul Kay Paul Kiparsky William Ladusaw William Leben Steve Levinson Mark Liberman Marlys Macken William Marslen-Wilson John McCarthy Nils Nilsson Barbara Partee Fernando Pereira David Perlmutter Ray Perrault Stanley Peters Carl Pollard William Poser Ellen Prince Geoffrey Pullum John Rickford Luigi Rizzi Ivan Sag Deborah Schiffrin Peter Sells Stuart Shieber Candace Sidner Brian Smith Donca Steriade Susan Stucky Michael Tanenhaus Elizabeth Traugott Peter Trudgill Lorraine Tyler Thomas Wasow Terry Winograd Annie Zaenen Arnold Zwicky ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Tue Mar 11 00:31:40 1986 Date: Tue, 11 Mar 86 00:31:34 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a003504; 10 Mar 86 18:36 EST Date: Mon 10 Mar 1986 12:57-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #48 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Tue, 11 Mar 86 00:10 EST AIList Digest Tuesday, 11 Mar 1986 Volume 4 : Issue 48 Today's Topics: Bibliographies - AI Applications & Robotics and Manufacturing Automation ---------------------------------------------------------------------- Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Bibliography - AI Applications definitions D BOOK22 Applications of Artificial Intelligence\ %I Society of Photo-Optical Instrumentation Engineers\ %D 1-3 April 1986\ %N 635\ %C Orlando __________________________________________________________________________ %A J. F. Gilmore %A K. Pulaski %T Comparative Analysis of Expert System Tools %B BOOK22 %K AI01 T03 %A Y.-c. You %T Expert System for Model Management %B BOOK22 %K AI01 %A J. R. Slagle %T Expert System for Treadmill Exercise ECG Test Anlaysis %B BOOK22 %K AI01 AA01 %A D. L. Tobat %A S. K. Rogers %A S. E. Cross %T SENTiNEL: An Expert System Decision Aid for a Command, Control and Communication Operator %B BOOK22 %K AI01 AA18 %A M. F. Doherty %A C. M. Bjorklund %A R. H. Laprade %A M. T. Noga %A C. Y Yang %T Improved Cartographic Classifications via Expert Systems %B BOOK22 %K AI01 %A D. Ho %A K. Pulaski %T GEST: Generic Expert System Tool %B BOOK22 %K AI01 T03 %A G. A. Roberts %T Expert System for Labeling Segments in FLIR Imagery %B BOOK22 %K AI01 AI06 %A RM. Ali %A D. A. Scharnhortst %A C.-S. AI %A H. J. Ferber %T Forward Chaining Versus a Graph Approach as the Inference Engine in Expert Systems %B BOOK22 %K AI01 %A A. Bravos %T Application of the CSAL Language to the Design of Diagnostic Expert Systems: the MOODIS (mood disorder) Experience %B BOOK22 %K AI01 AA01 psychology %A D. D. Dankel II %A R. V. Rodriguez %A F. D. Anger %T HAIM OMLET: Expert System Research Tool for Discrete Structures %B BOOK22 %K AI01 %A A. P. Levine %T ESP: Expert System for Computer Performance Management %B BOOK22 %K AI01 AA08 %A J. C. Esteva %A R. G. Reynolds %T Real-Time Knowledge Base Deviation Diagnostic Expert Systems %B BOOK22 %K AI01 %A G. Drastal %A T. DuBois %A L. McAndrews %A N. Straguzzi %A S. Raatz %T Economy in Expert System Development: Aegis Combat System Maintenance Advisor %B BOOK22 %K AI01 AA18 O02 %A B. Korel %T Program Error Localization Expert System %B BOOK22 %K AI01 AA08 %A G. Y. Tang %T Expert System Makes Image Processing Easier %B BOOK22 %K AI01 AI06 %A R. K. Eisley %A M. S. Lan %T Expert Measurement System for Ultrasonically Characterizing Material Properties %B BOOK22 %K AI01 AA05 %A J. Aloimonos %A A. Basu %T Shape and Motion From Contour Without Correspondece %B BOOK22 %K AI06 %A A. Stevenson %A M. Fox %A M. Rabin %T TESS: Tactical Expert System %B BOOK22 %K AI01 %A M. V. Orman %T Modified Hough Transform for Finding Lines in an Edge Map %B BOOK22 %K AI06 %A G. Bilbro %A W. Snyder %T System to Recognize Objects in 3D Images %B BOOK22 %K AI06 %A T. C. Rearick %T Real-time Image Understanding %B BOOK22 %K AI06 %A A. M. Darwish %A A. K. Jain %T Rule Based System for Automated Industrial Inspection %B BOOK22 %K AI06 AI01 %A N. C. Griswold %A C. P. Jeh %T Stereo Model Based on Mechanisms of Human Binocular Vision %B BOOK22 %K AI06 AI08 %A R. S. Loe %A T. J. Laffey %T Measurement of the 3D Radius of Curvature Using the Facet Approach %B BOOK22 %K AI06 %A D. K. Walters %T Object Interpretation Using Boundary-Based Perceptually Valid Features %B BOOK22 %K AI06 %A S. Tynor %A C. C. Tsang %A K. Gingher %T VEST: Visual Expert System Testbed %B BOOK22 %K AI06 AI01 %A J. Aloimonos %A A. Bandyopadhyay %T Perception of 3D Motion Without Correspondence %B BOOK22 %K AI06 %A J. Merchant %A T. J. Boyd %T Flexible Template Matching for Autonomous Classification %B BOOK22 %K AI06 %A J. H. Nurre %A E. L. Hall %T Error Analysis for a Two-Camera Stereo Vision System %B BOOK22 %K AI06 %A Y. J. Tejwani %T Logical Basis in the Layered Computer Vision Systems Model %B BOOK22 %K AI06 %A G. G. Pieroni %A O. G. Johnson %T Computer Vison System for Understanding the Movement of a Wave Field %B BOOK22 %K AI06 %A R. Y. Li %T Hough Tansform Approach for Cylinder Detection in Range Image %B BOOK22 %K AI06 %A A. Semeco %A B. Williams %A S. Roth %T GENSCHED: Real-World Hierarchical Planning System %B BOOK22 $K AI09 %A R. W. McLaren %A H.-Y. LIn %T Knowledge-Based Approach to Ship Identification %B BOOK22 %K AA18 %A M. Ragheb %A D. Gvillo %T Development of Knowledge-Based Fault Identification Systems on Microcomputers %B BOOK22 %K AA21 %A E. R. Addison %T Design Issues for a Knowledge-Based Controller for a Track-While-Scan Radar System %B BOOK22 %K AA19 %A Z. Zhang %A M. Simaan %t Rule Based Supported Interpretation of Signal Images %B BOOK22 %K AI06 AI01 %A C. L. Huang %A J. T. Tou %T Knwoledge-Based Functional Symbol Understanding in Electronic Circuit Diagram Interpretation %B BOOK22 %K AA04 %A P. E. Green %T Resource Limitation Issues in Real-Time Intelligent Systems %B BOOK22 %K O03 %A K. S. Gill %T Knowledge Based System for Education and Training %B BOOK22 %K AA07 %A S. Tulpule %A C. Knapp %T Classification of Textured Surfaces Based on Reflection Data %B BOOK22 %K AI06 %A T. Y. Young %A S. Gunasekaran %T Three-Dimensional Motion Analysis Using Shape Change Information %B BOOK22 %K AI06 %A A. Izaguirre %A J. Summers %T Analytical Identification of the Calibration Matrices Using the Two Plane Model %B BOOK22 %K AI06 %A M. Celenk %T Gross Segmentation of Color Images of Natural Scenes for Computer Vision Systems %B BOOK22 %K AI06 %A A. Strange %A W. A. Fraser %A G. A. Crockett %T Investigation of Geometric Features %B BOOK22 %K AI06 %A T. MIltonberger %A H. Muller %T True 2D Edge Detector %B BOOK22 %K AI06 %A P. Bashir %T Textured Image Segmentation %B BOOK22 %K AI06 %A F. S. Cohen %A Z. Fan %T Segmentation and Global Parameter Estimation of Textured Images Modelled by Unknown Gaussian Markov Random Fields %B BOOK22 %K AI06 %A M. Ragheb %A D. Gvillo %T Heuristic Simulation of Engineering Systems on A Supercomputer %B BOOK22 %K H04 %A R. E. Neapoliton %T Models for Reasoning Under Uncertainty %B BOOK22 %K O04 %A Y. Cheng %A R. L. Kashyap %T Study of the Different Methods for Combining Evidence %B BOOK22 %K O04 %A Y. J. Tejwani %T Decision Support for Fuzzy Processes: A Prolog Assistant %B BOOK22 %K O04 T02 AI13 %A H. Nordin %T Using Typical Cases for Knowledge Based Consultation and Teaching %B BOOK22 %K AA07 %A H. Krishnamurthy %T Conceptual Clustering Scheme for Frame-Based Knowledge Organization %B BOOK22 %K AI04 %A L. M. Fu %T Utility Measurement of a Decison Rule with Uncertaintly %B BOOK22 %K O04 AI13 AI01 %A B. J. Garner %A E. Tsui %T Extendable Graph Processor for Knowledge Engineering %B BOOK22 %A D. Gillies %A A. Howson %T Caused Based Methods of Knowledge Representation and Its Application to Lift Scheduling %B BOOK22 %A K. Y. Huang %A K. S. Fu %A Z. S. Lin %T Automatic Linking Processing of Seismogram Using Branch and Bound %B BOOK22 %K AA03 AI03 %A P. L. Love %T Automatic Recognition of Primitive Changes in Manufacturing Process Signals %B BOOK22 %K AA05 AI06 %A R. Yoshii %T Robust Machine Translation System %B BOOK22 %K AI02 %A T. LI %A L. Y. Fang %T Computer Assisted Two-Way Diagnosis in Traditional Chinese Medicine %B BOOK22 %K AA01 %A J. J. Cannat %A Y. Kodratoff %T Machine Learning and Recognition of Multifont Printed Characters %B BOOK22 %K AI06 %A M. Nakashima %A T. Koezuka %A N. Horaoka %A T. Inagaki %T Automatic Pattern Recognition with Self-Learning Algorithm Based on Featured Template Matching %B BOOK22 %K AI04 AI06 %A L. Lafferty %A D. Bridgeland %T Scavenger: an Experimental Rete Compiler %B BOOK22 %K AI01 %A A. Bandopadhay %A D. H. Ballard %T Visual Navigation by Tracking of Environmental Points %B BOOK22 %K AI07 AI06 %A M. Herman %T Fast Path Planning in Unstructured, Dynamic 3D Worlds %B BOOK22 %K AI07 %A R. W. Harrigan %T Sensor-Driven Robot Systems Testbed %B BOOK22 %K AI06 AI07 %A P. G. Selfridge %T Automatic 3D Reconstruction from Serial Section Electron Micrographs %B BOOK22 %K AI06 %A F. B. Hoogterp %A S. A. Caito %T Knowledge Acquisition for Autonomous Navigation %B BOOK22 %K AI06 AA18 AA19 %A T. Unti %A C. C. Tsai %T Optical System Alignment Using Robotics %B BOOK22 %K AI07 %A C. Isik %A A. Meystel %T Structure of a Fuzzy Production System for Autonomous Robot Control %B BOOK22 %K AI06 AI01 O04 %A K. Bae %T Determination of the Most Probable Point from Nonconcurrent Lines %B BOOK22 %A B. W. Suter %A K. D. Reilly %T Integrated VLSI Design Environment %B BOOK22 %K AA04 %A D. K. Fronek %T Real-Time Computer Vision Intelligent Hardware %B BOOK22 %K AI06 O03 %A W. J. McClay %A P. J. MacVicar-Whelan %T AI-Based Process Implementation %B BOOK22 %K AA05 %A D. T. Politis %A W. H. Licata %T Adaptive Decoder for an Adaptive Learning Controller %B BOOK22 %K AI04 %A M. Adjouadi %T Discrimination of Upright Objects from Flat-Lying Objects in Automated Guidance of Roving Robots %B BOOK22 %K AI07 %A B. G. Gayle %A D. Dankel %T RxPERT: Intelligent Computer System for Drug Interactions %B BOOK22 %K AA01 %A J. Hong %T Extension Matrix Approach to the General Covering Problem %B BOOK22 %A J. Dwyer %T Transitive Model for AI Applications %B BOOK22 %A E. T. Whitaker %A M. N. Huhns %T Rule-based Geometrical Reasoning for the Interpretation of Line Drawings %B BOOK22 %K AA04 AI01 AI06 %A W. P. C. HO %T Intelligent Computer-Aided Design by Modeling Chip Layout as a Metaplanning Problem %B BOOK22 %K AA04 AI09 %A D. R. Wheeler %T Forecasting Artificial Intelligence Demand %B BOOK22 %K AT04 %A M. Mathews %A C. Poinsette %T Intelligent Tutor for Elementary Spanish %B BOOK22 %K AI02 AA07 %A C. Y. Sheu %T Well Performed Systems %B BOOK22 %A A. Imamiya %A A. Kondoh %T Embedding an Explanation System within a User Interface %B BOOK22 %K O01 AA15 AI02 %A E. P. L. Passos %T Prolog's Start Out in Brazil %B BOOK22 %K T02 %A A. Hall %T Use of Prolog in Automatic Speech Recognition %B BOOK22 %K T02 AI05 %A B. Unger %A S. Siegel %T Modular Hardware which Allows Flexible Implementation of Combinations of Vison Processing Approaches %B BOOK22 %K AI06 ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Bibliography - Robotics and Manufacturing Automation definitions D BOOK21 Robotics and Manufacturing Automation\ %I American Society of Mechanical Engineers\ %E M. Donath\ %E M. Leu\ %D 1986 __________________________________________________________________________ %A R. M. Goor %T A New Approach to Minimum-time Robot Control %B BOOK21 %K AI07 %A T. Watanabe %A M. Kametani %A K. Kawata %A K. Tetsuya %T Improvement of the Computing Time of Robot Manipulators Using a Multi-microprocessor %B BOOK21 %K AI07 H03 %A T. Yabuta %A T. Tsujimura %A T. Morimitsu %T A Manipulator Control Method Using a Shape Recognition System with an Ultrasonic Distance Sensor %B BOOK21 %K AI07 AI06 %A Y. Stepanenko %T On Modal Control of Robotic Manipulators %B BOOK21 %K AI07 %A J. Y. S. Luh %A Y. L. Gu %T Efficiency and Flexibility of Industrial Robots with Redundancy %B BOOK21 %K AI07 %A G. M. Chaoui %A W. J. Palm %T Active Compliance Control Strategies for Robotic Assembly Applications %B BOOK21 %K AI07 %A F. W. Paul %A J. K. Parker %T Active Industrial Robot End-effector Control Design Strategy for Manufacturing Applications %B BOOK21 %K AI07 %A J. K. Parker %A F. W. Paul %T Impact Force Control in Robot Hand Design %B BOOK21 %K AI07 %A R. Vossoughi %A M. Donath %T Robot Hand Impedance Control in the Presence of Mechanical Nonlinearities %B BOOK21 %K AI07 %A H. Asada %A N. Goldfine %T Process Analysis and Compliance Design for Grinding with Robots %B BOOK21 %K AI07 %A D. Brock %A S. Chiu %T Environment Perception of an Articulated Robot Hand Using Contact Sensors %B BOOK21 %K AI07 %A W. J. Book %A S. L. Dickerson %A G. Hastings %A S. Cetinkunt %A T. Alberts %T Combined Approaches to Lightweight Arm Utilization %B BOOK21 %K AI07 %A R. P. Singh %A P. W. Likins %A R. J. VanderVoort %T Automated Dynamics and Control Analysis of Constrained Multibody System %B BOOK21 %K AI07 %A D. R. Meldrum %A M. J. Balas %T Direct Adaptive Control of a Flexible Remote Manipulator Arm %B BOOK21 %K AI07 %A D. A. Streit %A C. M. Krousgrill %A A. K. Bajaj %T Dynamic Stability of Flexible Manipulators Performing Repetitive Tasks %B BOOK21 %K AI07 %A M. C. Leu %A V. Kukovski %A K. K. Wang %T An Analytical and Experimental Study of the Stiffness of Robot Manipulators with Parallel Mechanisms %B BOOK21 %K AI07 %A K. Youcef-Toumi %A H. Asada %T The Design of Arm Linkages with Decoupled and Configuration-Invariant Inertia Tensors: Part I: Open Kinematic Chains with Serial Drive Mechanisms %B BOOK21 %K AI07 %A K. Youcef-Toumi %A H. Asada %T The Design of Arm Linkages with Decoupled and Configuration-Invariant Inertia Tensors: Part II: Actuator Relocation and Mass Redistribution %B BOOK21 %K AI07 %A E. Vaaler %A W. P. Seering %T Design of a Cartesian Robot %B BOOK21 %K AI07 %A O. Khatib %A J. Burdick %T Dynamic Optimization in Manipulator Design: The Operational Space Formulation %B BOOK21 %K AI07 %A H. West %A H. Asada %T Kinematic Analysis and Mechanical Advantage of Manipulators Constrained by Contact with the Environment %B BOOK21 %K AI07 %A J. M. Hollerbach %T Evaluation of Redundant Manipulators Derived from the PUMA Geometry %B BOOK21 %K AI07 %A Y.. Nakamura %A H. Hanafusa %T Inverse Kinematic Solutions with Singularity Robustness for Robot Manipulator Control %B BOOK21 %K AI07 %A J. A. Apkarian %A A. A. Goldenberg %A H. W. Smith %T An Approach to Kinematics Control of Robot Manipulator %B BOOK21 %K AI07 %A T. J. Fougere %A S. D. Chawla %A J. J. Kanerva %T Robot-Sim: A CAD-based Workcell Design and Off-line Programming System %B BOOK21 %K AI07 %A C. Goad %T Robot and Vision Programming in Robocam %B BOOK21 %K AI07 AI06 %A R. Jayaraman %T GALOP/2D: A Graphical System for Workcell Layout Evaluation %B BOOK21 %K AI07 AA05 %A D. Bailey %A S. Derby %A M. Steiner %T Computer-integrated System for Design and Assembly of Cable Harnesses: Part I: Design and Applications %B BOOK21 %K AI07 AA05 %A D. Bailey %A S. Derby %A M. Steiner %T Computer-integrated System for Design and Assembly of Cable Harnesses: Part II: Algorithms %B BOOK21 %K AI07 AA05 %A M. C. Weinstein %A M. C. Leu %A F. A. Infelise %T Design and Analysis of Robotic Assembly for a Printer Compensation Arm %B BOOK21 %K AI07 %A H. Asada %A A. Fields %T Design of Flexible Fixtures Reconfigured by Robot Manipulators %B BOOK21 %K AI07 %A B. O. Wood %A P. H. Cohjen %A D. J. Medeiros %A J. L. Goodrich %T Design for Robotic Assembly %B BOOK21 %K AI07 %A K. Nishimura %A M. Nakaga %A H. Kawasaki %T Mechanism and Control of a Page-Turning Robot %B BOOK21 %K AI07 %A H. Asada %A S. K. Lim %T Design of Joint Torque Sensors and Torque Feedback Control for Direct-Drive Arms %B BOOK21 %K AI07 %A J. Pawletko %A D. Manzer %A J. Ish-Shalom %T A Direct-Drive Actuator for Cartesian Robots %B BOOK21 %K AI07 %A R. L. Hollis %T Design for a Planar XY Robotic Fine-Positioning Device %B BOOK21 %K AI07 ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Tue Mar 11 00:31:18 1986 Date: Tue, 11 Mar 86 00:31:06 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from 200002012 by CSNET-RELAY.ARPA id a005058; 10 Mar 86 21:48 EST Date: Mon 10 Mar 1986 13:04-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #49 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Tue, 11 Mar 86 00:14 EST AIList Digest Tuesday, 11 Mar 1986 Volume 4 : Issue 49 Today's Topics: Bibliography - Msc. AI ---------------------------------------------------------------------- Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Bibliography - Msc. AI definitions D BOOK19 Applications of Knowledge-Based Systems to Engineering Analysis and Design\ %I American Society of Mechanical Engineers\ %E C. L. Dym\ %D 1986 D BOOK20 Computer-Aided/Intelligent Process Planning\ %I American Society of Mechanical Engineers\ %E C. R. Liu\ %E T. C. Cahng\ %E R. Komanduri\ %D 1986 D MAG9a IEEE Journal of Robotics and Automation\ %V RA-1\ %N 4\ %D DEC 1985 D BOOK23 Hybrid Image Processing\ %I Society of Photo-Optical Instrumentation Engineers\ %D 1-2 April 1986\ %N 638\ %C Orlando D MAG9 Bulletin of the Japan Society of Mechanical Engineers\ %V 29\ %N 247\ %D 1986 D MAG10 Industrial and Process Control Magazine\ %V 59\ %N 1\ %D January 1986 D MAG11 Information and Control\ %V 65\ %N 2-3\ %D MAY-JUN 1985 D MAG12 Journal of the ACM\ %V 33\ %N 1\ %D JAN 1986 D MAG13 Robotics\ %V 1\ %N 1\ %D MAY 1985 __________________________________________________________________________ %A W. Mark %T Knowledge Based Interface Design %B User Centered System Design %E Donald A. Norman %E Stephen W. Draper %I Lawrence A. Erlbaum and Associates %D 1986 %A S. J. Fenves %T A Framework for a Knowledge-based Finite Element Analysis Assistant %B BOOK19 %K AA05 %A F. S. Chehayeb %A J. J. Connor %A J. H. Slater %T An Environment for Building Engineering Knowledge-based Systems %B BOOK19 %K AA05 %A J. R. Dixon %A E. C. Libardi, Jr. %A S. C. Luby %A M. Vaghul %A M. K. Simmons %T Expert Systems for Mechanical Design: Examples of Symbolic Representations of Design Geometries %B BOOK19 %K AA05 %A R. E. Levitt %A J. C. Kunz %T A Knowledge-based System for Updating Engineering Project Schedules %B BOOK19 %K AA05 %A J. R. Zumsteg %A D. L. Flags %T Knowledge-based Analysis and Design Systems for Aerospace Structures %B BOOK19 %K AA05 %A V. E. Hampel %A B. Garner %A J. R. Matthews %T Intelligent Gateway Processors as Integrators of CAD/CAM Networks %B BOOK19 %K AA05 %A S. Mittal %A C. L. Dym %A M. Morjaria %T PRIDE: An Expert System for the Design of Paper-Handling Systems %B BOOK19 %K AA05 AI01 %A D. R. Rehak %T SITECHAR: An Expert System Component of a Geotechnical Side Characterization Workbench %B BOOK19 %K AA05 %A D. Pecora %A J. R. Zumsteg %A F. W. Crossman %T An Application of Expert Systems to Composite Structural Design and Analysis %B BOOK19 %A G. Eshel %A M. Barash %A T. C. Cahng %T A Rule-based System for Automatic Generation of Deep-Drawing Process Outlines %B BOOK20 %K AA05 %A Y. Lagoude %A J. P. Tsang %T A Plan Representation Structure for Expert Planning Systmes %B BOOK20 %K AA05 AI01 %A R. H. Phillips %A V. Arunthavanathan %A X. D. Zhou %T Symbolic Representation of CAD Data for Artificial Intelligence-based Process Planning %B BOOK20 %K AA05 %A V. R. Milacic %T SAPT-Expert System for Manufacturing Processing Planning %B BOOK20 %K AA05 AI01 %A W. Eversheim %A J. Schultz %T Strategies of Process Selection for Different Applications of Computer-aided Process Planning %B BOOK20 %K AA05 %A D. S. Nau %A T. C. Chang %T A Knowledge-Based Approach to Generative Process Planiing %B BOOK20 %K AA05 %A P. M. Ferreira %A B. Kochar %A C. R. Liu %A V. Chandru %T AIFIX: An Expert System Approach to Fixture Design %B BOOK20 %K AA05 AI01 %A E. T. Sanii %A J. I. ElGomayel %T Classification and Coding of Cutting Tools %B BOOK20 %K AA05 %A H. J. Steudel %A G. V. Tollers %T A Decision-Table--based Guide for Evaluating Computer-Aided Processing Planning Systems %B BOOK20 %K AA05 %A K. Iwata %A N. Sugimura %T An Integrated CAD/CAPP System with Know-Hows on Machining Accuracies of Parts %B BOOK20 %K AA05 %A G. Eshel %A M. Barash %A K. S. Fu %T Generating the Inclusive Test Rule in a Rule-based System for Process Planning %B BOOK20 %K AA05 %A Y. C. HO %A X. R. Cao %T Performance Sensitivity to Routing Changes in Queuing Networks and Flexible Manufacturing Syustems Using Perturbation Analysis %J MAG9 %P 165-172 %K AA05 %A R. Nigam %A C. S. G. Lee %T A Multiprocessor-Based Controller for the Control of Mechanical Manipulators %J MAG9a %P 173-182 %K AI07 %A M. Kaneko %A M. Abe %A K. Tanie %T A Hexapod Walking Machine with Decoupled Freedoms %J MAG9a %P 183-190 %K AI07 %A M. K. Brown %T Feature Extraction Techinques for Recognizing Solid Objects with an Ultrasonic Range Sensor %J MAG9a %P 191-205 %K AI06 %A W. Holzmann %A J. M. McCarthy %T Computing the Friction Forces Associated with a Three-Fingered Grasp %J MAG9a %P 206-210 %K AI07 %A J. M. Abel %A W. Holzmann %A J. M. McCarthy %T On Grasping Objects with Two Articulated Fingers %J MAG9a %P 211-214 %K AI07 %A H. W. Mergler %T Review of Introduction to Robotics, by A. J. Critchlow %J MAG9a %P 215 %K AI07 %A A. L. Pai %T Review of Recent Advances in Robotics, edited by G. Beni and S. Hackwood %J MAG9a %P 215 %K AI07 %A K. G. Lieb %A J. C. Mendelsohn %T Robotic Vision Tray Picking System Design Using Multiple Optical Matched Filters %B BOOK23 %K AI06 AI07 %A J. C. Mendelsohn %A D. C. Englund %T Multiple Optical Filter Design, Simulation Results %B BOOK23 %K AI06 AI07 %A F. T. S. Yu %A M. F. Cao %T Automatic Real-Time Optical Pattern Recognition Processing System %B BOOK23 %K O03 AI06 %A R. Juday %T Optical Correlator Use at Johnson Space Center %B BOOK23 %K AI06 %A G. Eichman %A T. Kasparis %T Texture Classification Using the Hough Transform %B BOOK23 %K AI06 %A D. Casasent %A S. Liebowitz %T Hierarchical M-DOF Optical Artificial Intelligence Correlation Processor %B BOOK23 %K AI06 %A G. Eichmann %A M. Jalowsky %T Shape Description Using an Associative Memory %B BOOK23 %K AI06 %A B. Montgomery %A B. V. K. Vijaya Kumar %T Nearest Neighbor Non-iterative Error-correcting Optical Associative Processor %B BOOK23 %K AI06 %A D. A. Jared %A D. J. Ennis %T Learned Distortion Invariant Pattern Recognition Using SDFs %B BOOK23 %K AI06 %A D. W. Sweeney %A G. F. Schlis %T Iteratively Designed 3D Optical Correlation Filters for Distortion Invariant Recogniton %B BOOK23 %K AI06 %A C. L. Tan %A W. N. Martin %T Hierarchical Structures, Parallelism, and Planning in Analyzing Time Varying Images %B BOOK23 %K AI06 AI09 %A A. A. Tvirbutas %A C. A. McPherson %A B. E. Hines %T Characteristics and Limitations of Image Acquisition Systems %B BOOK23 %K AI06 %A K. Morita %A K. Asai %T Fingerprint Identification Terminal for Personal Identification %B BOOK23 %K AI06 %A V. E. Diehl %T Use of Complementary Analog and Digital Processing in the Removal of Local Background in Low Contrast Images %B BOOK23 %K AI06 %A A. Oosterlinck %T Comparison of Optical and Digital Image Processing Techniques in Visual Inspection and Robotic Vison %B BOOK23 %K AI07 AI06 %A M. S. Schmaltz %A F. Caimi %T Shift-Invariant Recognition of Deformed Ship Silhouettes at Multiple Resolution Scales %B BOOK23 %K AI07 AI06 %A Masaki Yokoyama %A Hirohiko Shibuya %A Rae-Kyung Park %T A Basic Study of the Automated Generation of Machine Structures (1st Report, Graphical Description of the Functional Structure of Machines) %J MAG9 %P 295-300 %K AA05 %A Ikuo Ito %a Takao Onozawa %T An Intelligent Aspect of CAD for Mechanical Design (The Conceptual Design of a Simple Object) %J MAG9 %P 301 %K AA05 %A Lowell Hawkinson %T LISP and LISP Machines: Tools for AI Programming %J MAG10 %P 37 %K T01 H02 %A Rich Merritt %T Artificial Intelligence Tackles Industrial Tasks %J MAG10 %P 41 %A John Grant %A Jack MInker %T Normalization and Axiomatization for Numerical Dependencies %J Information and Control %V 65 %N 1 %D APR 1985 %P 1-17 %A R. Statman %T Logical Relations and the Typed Lambda-Calculus %J MAG11 %P 85-97 %K AI14 %A A. J. Kfoury %T Definability by Deterministic and Non-deterministic Programs (with Applications to First Order Dynamic Logic) %J MAG11 %P 98-121 %K AI11 AA08 AI14 %A Nachum Dershowitz %T Computing with Rewrite Rule Systems %J MAG11 %P 122-157 %K AI11 AI10 AI14 %A David A. Plaisted %T Semantic Confluence Tests and Completion Methods %J MAG11 %P 182 %K AI11 AI10 AI14 %A K. Melhorn %A P. Preparata %T Routing Through a Rectangle %J MAG12 %P 60-86 %K AA04 %A Zohar Manna %A Richard Waldinger %T Special Relations in Automated Deduction %J MAG12 %P 1-59 %K AI14 %A C. S. G. Lee %A R. C. Gonzales %A K. S. Fu %T Tutorial: Robotics %I IEEE Press %D NOV 1983 %K AT15 AI07 %X list price $39.00 member price $24.00 ISBN 0-8186-0515-4 %A Sargur N. Srihari %T Tutorial: Computer Text Recognition and Error Correction %I IEEE Press %D JAN 1985 %K AI06 AT15 %X list price $36.00 member price $24.00 ISBN-0-8186-0579-0 %T Proceedings: Second Conference on Artificial Intelligence Applications %I IEEE PRess %D DEC 1985 %K AT15 %X list price $75.00 member price $37.50 ISBN 0-8186-06888-6 %T Proceedings: Expert Systems in Government %I IEEE Press %D OCT 1985 %K AT15 AI01 %X list price $70.00 member price $35.00 ISBN 0-8186-0686-X %T Proceedings: Third Workshop on Computer Vision %I IEEE Press %D OCT 1985 %K AI06 AT15 %X list price $36.00 member price $18.00 ISBN-0-8186-0685-1 %T Proceedings: 1985 Symposium on Logic Programming %I IEEE Press %D JULY 1985 %K AI10 AT15 %X list price $44.00 member price $22.00 ISBN-0-8186-0636-3 %T Proceedings: Conference on Computer Vision & Pattern Recognition %I IEEE Press %D JUNE 1985 %K AI06 AT15 %X list price $66.00 member price $33.00 ISBN-0-8186-0633-9 %T Proceedings: 1985 International Conference on Robotics and Automation %I IEEE Press %D MAR 1985 %K AI07 AT15 %X list price $37.50 member price $18.75 ISBN-0-8186-0659-2 %T Proceedings: Workshop on the Principles of Knowledge-Based Systems %I IEEE Press %D DEC 1985 %K AT15 %X OUT OF PRINT %T Proceedings: The First Conference on Artificial Intelligence %I IEEE Press %D DEC 1985 %K AT15 %X OUT OF PRINT %A W. Khalil %A J. F. Kleinfinger %T A Working Model for the Dynamic Control of Robots (French) %J RAIRO-AUTOMATIQUE PRODUCTIQUE INFORMATIQUE INDUSTRIELL %D 1985 %V 19 %N 6 %P 561 %K AI07 %A R. H. Kirschbrown %A R. C. Dorf %T Karma--A Knowledge-Based Robot Manipulation System %J MAG13 %P 3-12 %K AI07 %A K. G. Kempf %T Manufacturing and Artificial Intelligence %J MAG13 %P 13-25 %K AA05 %A R. M. Inigo %A J. M. Angulo %T Robotics Education in the University %J MAG13 %P 37-47 %K AI07 AT18 %H PA %A N. K. Gautier %A S. S. Iyengar %T Space and Time Efficiency of the Forest of Quadtrees Representation %J Journal of Image and Vision Computing %V 3 %D 1985 %P 63-70 %K AI06 %H PA %A N. Gautier %A S. S. Iyengar %T Performance analysis of TID data structure %J Proceedings of Computer Vision and Pattern Recognition %P 416-419 %D 1985 %K AI06 %H PA %A S. Iyengar %A V. Raman %T Properties of the Hybrid Quadtree %J Proceedings of the 7th International Conference on Pattern Recognition %D 1984 %P 292-294 %K AI06 %H PA %A David Scott %A S. S. Iyengar %T A New Data Structure for Efficient Storing of Images %J Pattern Recognition Letters %V 3 %D 1985 %P 211-214 %K AI06 ------------------------------ End of AIList Digest ******************** From csvpi@vtcs1 Wed Mar 12 00:37:14 1986 Date: Wed, 12 Mar 86 00:37:08 est From: csvpi@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a001508; 11 Mar 86 18:46 EST Date: Tue 11 Mar 1986 15:10-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #50 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Wed, 12 Mar 86 00:27 EST AIList Digest Wednesday, 12 Mar 1986 Volume 4 : Issue 50 Today's Topics: Queries - AI Military Successes & GNU Scheme, Linguistics - Ambiguous Sentences & Dictionary Access, Journal - International Journal for AI in Engineering & Prices, Methodoloy - Turing Test & Zen ---------------------------------------------------------------------- Date: Fri, 7 Mar 86 13:47:15 EST From: "Dr. Ron Green" (ARO) Subject: AI Military Successes I would like to recieve detailed information on any systems that have been developed for the military using AI. These should not be toy systems and they must be able to be shown to be successful. I would prefer programs conducted for the Army but I would be interested in discussing any service programs. Thanks Ron ------------------------------ Date: Fri, 7 Mar 86 08:52:43 -0100 From: dual!lll-crg!seismo!unido!gmdzi!thomas@ucbvax.berkeley.edu (Thomas Gordon) Subject: GNU Scheme I'm interested in Scheme for Unix. Can you tell me how to order GNU? Thanks for your help. Tom Gordon thomas@gmdzi ------------------------------ Date: Wed, 5 Mar 86 10:01:18 pst From: sdcsvax!sdcsvax.UCSD.EDU!sdcrdcf!trwrb!trwrba!ice@ucbvax.berkeley.edu Subject: Re: ambiguous sentences I'm not sure that this is precisely what you are looking for, but I remember a sentence whose meaning changes slightly when different words are stressed: I never said he stole that money. I NEVER said he stole that money. I never SAID he stole that money. I never said HE stole that money. I never said he STOLE that money. I never said he stole THAT money. I never said he stole that MONEY. --Doug Ice. ------------------------------ Date: 06 Mar 86 18:43:18 UT (Thu) From: "A. N. Walker" Subject: Re: ambiguous sentences English is supposed to be right associative, so "pretty little girls school" is (relatively) unambiguously a pretty schoolette for girls. Similarly, "second hand book shop" should probably be as opposed to a third automatic drug store. The other possible associations should be obtained by hyphenation or concatenation, as "second handbook shop", "second-hand book shop" or [the usual meaning] "secondhand-book shop". Sadly, English has no good way of writing a third-level bracket, so more complicated examples can be very hard to write down. Andy Walker, Maths Dept, Nottingham Univ., UK. ------------------------------ Date: Fri, 7 Mar 86 11:34 EST From: ART@GODOT.THINK.COM Subject: Ambiguous Sentences One of my favorites, which I seem to remember first reading in the instructions for solving the Atlantic magazine puzzle is: "I fancy you have one." which has more meanings when spoken than when written. Art Medlar Thinking Machines Corporation ------------------------------ Date: Fri, 7 Mar 86 12:59:00 est From: amsler@mouton.ARPA (Robert Amsler at mouton.ARPA) Subject: Dictionary access The latest information I have re: Wang's Lexical resources is that they want a $10,000 one time fee plus $1,000/year per resource. For that kind of money I thought there should be some sort of update/maintenance, but apparently they are selling them as is with no support and little documentation. Houghton-Mifflin apparently also sells access to machine-readable dictionaries and they appear to offer professional support for updating them tied to their routine dictionary production. If applications are academic non-profit use, the recommended source would be the Oxford Archive in England. They distribute several sources at the cost of making the tape copies. Generally, the commercial sources offering dictionaries for free have dried up. It is a business now. One might be able to strike a deal with some publisher, but ``free'' access is becoming increasingly rare if the intended use is commercial development. ------------------------------ Date: Wed 5 Mar 86 18:42:28-EST From: SRIDHARAN@G.BBN.COM Subject: Journal prices hit the moon! In today's mail I received the announcement of a new journal called International Journal for AI in engineering. Nice flashy brochure and an international editorial board. I like the idea of a journal appealing to several engineering disciplines and talking about practical results in AI applications. It will be published 4 times a year and the subscription is $130. Will those taking part in new publishing ventures do something to keep prices down? Most of the work that goes into publishing a journal is done by the researchers who produce the results and spend the effort in writing a paper. The editorial board donates their time. The reviewers also contribute their time. Why should all these folks make these contributions so that the publishers can cream the market? It is time to take a stand. The publishing industry is here to serve us; not to skin us. ------------------------------ Date: Fri, 7 Mar 86 20:17:28 pst From: aurora!eugene@riacs.arpa (Eugene miya) Subject: Re: The Turing Test - A Third Quantisation? Turing in fact did propose that in his paper: that a machine could try a discrimination of two players. --eugene miya NASA Ames Res. Ctr. ------------------------------ Date: Sat, 8 Mar 86 11:00:34 est From: decwrl!pyramid!ut-sally!seismo!harvard!gcc-milo!zrm@ucbvax.berkelely.edu (Zigurd R. Mednieks) Subject: Re: Alan Watts on AI The excerpt from Alan Watts is instructive. Like many who do not have the patience to look into their own examples, he claims the source of his hair is unfathomable and so the source of our thoughts is equally out of our reach. He should speak only for himself. I know, to a certain extent, how my hair grows. Even worse, Watts clouds the issue. There is a valid point in that even though I know how it is that I have hair, I can't alter the way it grows. Similarly, even if I knew in great detail the causes of my thoughts and ideas, I might not be able to alter their course. Perhaps Zen just isn't relevent to AI. -Zigurd ------------------------------ Date: Mon, 10 Mar 86 21:33:53 -0100 From: decwrl!pyramid!ut-sally!seismo!mcvax!inria!neumann@ucbvax.berkeley.edu (Pierre Louis Neumann) Subject: Re: Alan Watts on AI forgive my english! there is an intellectual knowledge (more typically western) and a corporal one . One must "find " his proper way and place (in between) in order to KNOW. This place is the "dawn" or the "twilight" ------------------------------ End of AIList Digest ******************** From csvpi@vtcs1 Thu Mar 13 08:02:58 1986 Date: Thu, 13 Mar 86 08:02:52 est From: csvpi@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: RO Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a011746; 12 Mar 86 14:48 EST Date: Wed 12 Mar 1986 10:49-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #51 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Thu, 13 Mar 86 07:47 EST AIList Digest Wednesday, 12 Mar 1986 Volume 4 : Issue 51 Today's Topics: Query - Graphical Representation, News - Turbo Prolog & TI Explorer, Apollo, and Sun Workstations & AI Hardware Vendor Slugout ---------------------------------------------------------------------- Date: Mon, 10 Mar 86 13:16 EST From: "Steven H. Gutfreund" Subject: Request for information I am looking for a reference. Is there some work that attempts to produce a comprehensive study of graphical representation (schematics) that are used by professionals. Examples would be architects, systems analysts, industrial designers, and logistic planners. There are, of course, civil engineers who actually go and construct scale models of things like dams, etc, and conduct their analysis on them. But I am looking for people who use 2-d and multidimensional paper schematics for their analyses. Especially interesting are schematics which are not just passive, but allow the user to carry out graphical analysis on that chart. Something on the order of a fileVision, except that fileVision only does data queries. - Steven Gutfreund gutfreund@umass-cs.csnet [I doubt that there is a comprehensive survey, but there are some partial ones. Woodworth's >>Graphical Simulation<< has a large section on algebraic geometry, graphical methods for solving differential equations, etc. I have seen books on nomograms and a recent book (by James Martin?) on the flowcharts and other diagrams used by programmers. Control theorists (but not the theoretical ones!) use pole-zero charts and other graphical aids. Statisticians use X-Bar/R charts to track quality control, Roman/Latin/etc. squares to plan experiments, and occassionally dependency graphs to model causal or correlational linkages. Logicians and circuit designers use Venn diagrams and Karnaugh maps. There are books on visual thinking and on graphs and other displays for information transfer. Two recent books are >>The Elements of Graphing<< by William S. Cleveland and >>The Visual Display of Quantitative Information<< by Edward R. Tufte. Does anyone know of other particularly good surveys? -- KIL] ------------------------------ Date: Wed, 12 Mar 86 01:32 EST From: Tim Finin Subject: turbo prolog (again) Ken and Chuck, I sent the following message about a newly announced prolog compiler which did not show up in either mailing list. From: Tim Finin on Thu 6 Mar 1986 at 15:51, 13 lines To: AIlist@sri-ai, PROLOG-REQUEST%su-score.arpa@CSNET-RELAY Subj: Turbo Prolog Date: Thu, 6 Mar 86 15:51 EST Someone gave me a copy of a news item from Electronic Engineering Times of March 3rd which describes a Prolog compiler for PCs that Borland Int. (of Turbo Pascal fame) is releasing on April 15th. According to the note, the price will be $99. Borland claims that it was clocked at 100K lips on an IBM-PC and 300K lips on an AT! (The benchmark used was described as "a single rule benchmark"). The dialect is described as "a superset of Clocksin and Mellish". The system appears to include an incremental compiler, screen editor, support for windowing, a module capability, sound primitives and color graphics primitives. I assume you both thought it was too much of a plug for a new compiler with little real significance. I disagree! It is significant for one of two reasons, as I explain below. Note first that: 1 - Borland is a respected company making software for micros. Their products, especailly Turbo Pascal, are quite good, widely used and very cheap. I've seen it claimed that over 500,000 copies of Turbo Pascal have been sold! 2 - Their prolog compiler seems to be reasonable from the point of view of features. 3 - It's claimed to provide a ORDER OF MAGNITUDE improvement on performance. The other PC based prolog compiler claim to run on the order of 10K to 20K Lisp, I think. 4 - They are claiming to sell it at an ORDER OF MAGNITUDE less price than the other prolog compilers for PCs. Now - the reasons: either (1) Borland has discovered some very clever tricks to producing much better compiled code from standard prolog or (2) they are not playing the benchmarking game fairly. I tend to lean toward (2) but hope that there may be a fair amount of (1) involved as well. If Turbo Pascal weren't such a win, I'd have little hope. On the pessimistic side, Robert Rubinoff sent me the following back-of-the-envelope analysis: From: Robert Rubinoff on Fri 7 Mar 1986 at 10:28, To: Tim Finin Subj: Turbo Prolog 100 Klips = .1MHZ. Now assuming that they are only using code within one segment (which limits you to 64K), the 8088 takes about 3 cycles for the average register instruction, and about 10-15 cycles + memory fetch time for a memory instruction. Memory fetches take a few cycles; I can't find where it says how much; so let's say that it's just enough to push the average instruction time up to 15 cycles. If 2 out of 3 instructions are register instructions, we get an average of 21/3 or 7 cycles per instruction. (I think my calculations here are probably a little low). So if we have a 4MHz 8088, we get an instruction rate of 0.5MHz, or 5 instructions per lip. On an 8MHZ 8088, we get 10 instructions per inference. That strikes me as not enough. Maybe they're using a benchmark that doesn't do any unification. And all of this (at least on the 8088 in the PC, I don't know about the AT) requires that everything be in the same segment. If you want more than 64K, you have to go to multiple segments, which slows things down a lot. I'm dubious. But we'll see, I guess. Robert Anyway, when a respectable, established company offers a basic AI tool which jumps TWO ORDERS OF MAGNITUDE on the price/performance scale, I think its news! If a few months we'll either be praising the cleverness of the Borland programmers or cursing the dishonesty of the Borland marketing people. Tim [Actually, Tim's message was simply the victim of "digest delay" and of my recent full schedule. It had come to the head of the queue and would have been sent out today in any case. Most messages are redistributed within a week, although humor and "special issue" messages are sometimes saved for two weeks in order to collect a sufficient number on the same topic. Authors of "commercial messages" which must be rejected will receive a note from me (unless the message has already gone out on UUCP net.ai). Tim's message is well within the limits of acceptability (and usefulness -- thanks, Tim!). The posting which follows is more dubious, but seems to be forwarded in a spirit of helpfulness rather than commercial PR. A discussion has just started on WorkS, Human-Nets, and Large-List-People that may redefine the limits of acceptability, particularly with respect to including price information. (While price is obviously an important spec, it has been one of the touchstones for identifying messages with commercial intent.) -- KIL] ------------------------------ Date: Tue, 11 Mar 86 08:56 ??? From: "JERRY R. BROOKSHIRE" Subject: News Item: TI Explorer, Apollo, and Sun Workstations The following extracts are from the Texas Instruments internal electronic news system: T LE;NEWS.TI.PRODUCTS.A.P01 SLE01 MON., MAR. 10, 1986 PRODUCTS AND TECHNOLOGY SECTION A TI, APOLLO(R) PROPOSE ARTIFICIAL INTELLIGENCE ALLIANCE AUSTIN, TEXAS - Texas Instruments and Apollo Computer Inc. today announced the intention to enter into marketing, sales and development programs aimed at bringing "next generation" artificial intelligence (AI) technology to the engineering workstation market. A letter of intent signed by both companies now lays the groundwork for the formation of a relationship that would bring TI's leadership in AI technology to Apollo's industry-leading technical workstation. As a first step in the proposed alliance, the companies plan to embark on a cooperative development effort to integrate TI's Explorer(TM) LISP machine into Apollo's DOMAIN(R) networking environment, allowing AI application developers using Explorer to coexist on a network of Apollo workstation users. The announcement comes shortly after Apollo's introduction of a new line of DOMAIN workstation products. "Apollo views AI, like graphics, as a technology that is key to a broad range of technical application areas," said Roland Pampel, Apollo's senior vice president of technology and marketing. "When Apollo pioneered the workstation marketplace, the DOMAIN system's integrated graphics capabilities provided a new dimension for application developers," said Pampel. "We believe that AI will offer a similar leap in application development capabilities and user productivity." W. Joe Watson, vice president of TI's Data Systems Group, explained, "TI has made substantial investments to build a strong AI technology base and DSG's commercial AI products have rapidly achieved significant market success. Teaming up with strong system vendors like Apollo will be a major step toward expanding the use of our advanced technology in the technical computing market- place." Paul Armstrong, Apollo group manager of AI, said, "Many of our customers and solution suppliers are actively seeking ways to exploit AI technology in a variety of areas. We are pleased to work with TI in managing the transition to a new generation of computing." TI houses one of the largest AI research and development centers in the world and is a leader in the internal application of AI technologies. T LE;NEWS.TI.PRODUCTS.A.P03 SLE01 MON., MAR. 10, 1986 PRODUCTS AND TECHNOLOGY SECTION B TI AND SUN TO LINK AI AND UNIX WORKSTATIONS AUSTIN, TEXAS - Texas Instruments and Sun Mircosystems(R) announced today that TI will implement Sun Microsystem's Network File System (NFS) on its Explorer(TM) artificial intelligence (AI) workstation. The NFS implementation will allow transparent access to files on Sun's UNIX(TM)-based workstation and TI's LISP-based Explorer system, providing users with a development environ- ment that includes both AI and UNIX tools on the same network. "NFS provides a solution to customers who want to add the Explorer's symbol- ic processing capability to a network of Sun technical workstations running under UNIX," said DSG vice president W. Joe Watson. "The combination of these two complementary computers on a network provides a significant new offering to industry." Independent of machine type and operating system, NFS increases the useful- ness of a local area network by allowing users to easily share information between computers from different vendors. ------------------------------ Date: 11 Mar 86 12:46 PST From: sigart@LOGICON.ARPA Subject: AI HARDWARE VENDOR SLUGOUT (SDSIGART & IEEE) San Diego SIGART and San Diego IEEE Computer Society present an "AI HARDWARE VENDOR SLUGOUT" ABOUT THE PROGRAM...Artificial Intelligence(AI) hardware is expensive. AI hardware vendors are numerous and not in general substitutable. But AI hardware must be bought to competein the growing AI/expert-systems market. This vendor gathering will allow participating vendors to describe and display their wares, challenge each other, and be challenged by the audience. There will be ample time for individual discussions with vendors. ABOUT THE PARTICIPANTS...Expected participants include Symbolics Inc., Lisp Machine Inc.(LMI), Texas Instruments(TI) and Apollo. TIME/PLACE...Sunday, March 23, 2:00pm at the Mandeville Auditorium at UCSD. (parking is free and plentiful on Sundays.) RESERVATIONS/INFORMATION...Reservations are not required. For further information contact Bart Kosko, (619)457-5550 or Ed Weaver (619)236-5963. ADMISSION IS FREE. ------------------------------ End of AIList Digest ******************** From csvpi@vtcs1 Fri Mar 14 04:42:15 1986 Date: Fri, 14 Mar 86 04:42:09 est From: csvpi@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a029830; 13 Mar 86 23:24 EST Date: Thu 13 Mar 1986 10:31-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #52 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Fri, 14 Mar 86 04:32 EST AIList Digest Thursday, 13 Mar 1986 Volume 4 : Issue 52 Today's Topics: Query - Satishe Thatte Net Address, Seminars - Interpretation of Prolog Programs (Edinburgh) & Explanation-Based Learning (CMU) & Referential Gestures in Guugu Yimidhirr (UCB) & Models, Metaphysics, and Empiricism (CSLI), Conference - Expert Systems in Process Safety ---------------------------------------------------------------------- Date: Wed, 12 Mar 86 21:53:26 PST From: Basuki Soetarman Subject: Satishe Thatte net address ... > > PERSISTENT OBJECT SYSTEM FOR SYMBOLIC COMPUTERS > Satishe Thatte > Texas Instruments > Thurs. Feb 27th at 4:15 pm. > (Part of Distributed Systems Group Project meeting) > >The advent of automatically managed, garbage-collected virtual memory >was crucial to the development of today's symbolic processing. No >analogous capability has yet been developed in the domain of >"persistent" objects managed by a file system or database. As a >consequence, the programmer is forced to flatten rich structures of > ............................... This announcement was posted sometimes ago in the mod.ai. Does anybody know the author's net address ? Any info will be appreciated. Thanks. basuki@locus.ucla.edu or ..!{ucbvax,cepu,trwspp,ihnp4}!ucla-cs!basuki ------------------------------ Date: Tue, 11 Mar 86 11:58:47 GMT From: Gideon Sahar Subject: Seminar - Interpretation of Prolog Programs (Edinburgh) EDINBURGH AI SEMINARS Date: Wednesday, 12th March l986 Time: 2.00 p.m. Place: Department of Artificial Intelligence Seminar Room - F10 80 South Bridge EDINBURGH. Dr. C.S. Mellish, Cognitive Studies Programme, University of Sussex will give a seminar entitled - "Interpretation of Prolog Programs". This talk discusses work on proving properties of Prolog programs, which has been able to derive automatically the following information: l. Mode declarations (information about the instantiation modes in which predicates are used). 2. Determinacy information (information about the number of solutions that predicates can produce). 3. Information about shared structures (this can be used, for instance, to indicate places where "occur checks" might be desirable. We would like to formalise our work on Prolog programs in terms of ABSTRACT INTERPRETATIONS. The notion of using abstract interpretations to prove properties of programs has been used successfully with other languages (e.g. work by Cousot and Cousot, Mycroft and Sintzoff). The basic idea is to start with a precise description of the meaning of Prolog programs in terms of the normal execution strategy. This description can then be given the STANDARD INTERPRETATION, which characterises exactly what and how the program computes but may not allow interesting properties to be proved in a computationally feasible way. Alternatively, it can be given consistent ABSTRACT INTERPRETATIONS, in which the program is thought of as computing in an abstract domain where less information about the data objects is taken account of. Results of computations in this abstract domain then reflect properties of the program operating in the standard way. ------------------------------ Date: 12 March 1986 1133-EST From: Betsy Herk@A.CS.CMU.EDU Subject: Seminar - Explanation-Based Learning (CMU) Speaker: Gerald DeJong, University of Illinois Date: Wednesday, April 2 (Note special day/time) Place: 5409 Wean Hall Time: 11:30 - 1:00 Title: Explanation Based Learning Abstract: The schema learning group at Illinois is exploring artificial intelligence techniques that will enable a com- puter system to learn general world knowledge in the form of "schemata" through its interactions with an external environment. A schema is a data structure that specifies, in conceptual terms, a particular real world situation. Schemata can be very useful in problem solving, natural language processing and other AI areas. It is claimed, in this paradigm, that much intelligent behavior can be cap- tured by using a large number of such schemata. The explanation-based method represents a departure from the usual approaches to machine learning in several ways. First, it is very knowledge-based. That is, the sys- tem must possess much knowledge before it can aquire new knowledge. Second, it is capable of one-trial learning. The results so far are promising. Explanation-based learn- ing takes us a large step closer to building an intelligent system capable of learning on its own. A number computer systems have been designed and imple- mented based on Explanatory Schema Acquisition, an explanation-based learning paradigm. The domain areas of these projects include natural language processing, robot- ics, theorem proving, physics problem-solving and theory refinement. Several of the systems will be discussed in the context of theoretical advantages and difficulties with explanation-based learning. ------------------------------ Date: Wed, 12 Mar 86 16:33:14 PST From: admin%cogsci@berkeley.edu (Cognitive Science Program) Subject: Seminar - Referential Gestures in Guugu Yimidhirr (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Spring 1986 Cognitive Science Seminar - IDS 237B Tuesday, March 18, 11:00 - 12:30 2515 Tolman Hall Discussion: 12:30 - 1:30 3105 Tolman (Beach Room) ``Complex Referential Gestures in Guugu Yimidhirr'' John B. Haviland Dept. of Anthropology, Australian National University (currently at Institute for Advanced Study in the Behavioral Sciences) Ordinary talk depends on interlocutors' abilities to construct and maintain some degree of shared perspective over some domain of shared knowledge, given some negotiated understanding of what the circumstances are. Aspects of per- spective, references to universes of discourse, and pointers to context are, of course, encoded in utterances. Routinely, though, what is uttered interacts with what remains unsaid: what is otherwise indicated, or what is implicated by familiar conversational principles. I will begin by examining the elaborate linguistic devices one Aus- tralian language provides for talking about location and motion. I will then connect the linguistic representation of space (and the accompanying knowledge speakers must have of space and geography) to non-spoken devices --- pointing ges- tures --- that contribute to the bare referential content of narrative performances. I will show that simply parsing a nar- rative, or tracking its course, requires attention to the ges- ticulation that forms part of the process of utterance. More- over, I will show how, in this ethnographic context, the meaning of a gesture (or of a word, for that matter) may depend both on a practice of referring (only within which can pointing be pointing at something) and on the construction of a complex and shifting conceptual (often social) map. Finally I will discuss ways that the full import of a gesture (again, like a word) may, in context, go well beyond merely establishing its referent. ------------------------------ Date: Wed 12 Mar 86 16:31:56-PST From: Emma Pease Subject: Seminar - Models, Metaphysics, and Empiricism (CSLI) [Excerpted from the CSLI Newsletter by Laws@SRI-AI.] CSLI ACTIVITIES FOR NEXT THURSDAY, March 20, 1986 12 noon, TINLunch, Ventura Hall Conference Room Models, Metaphysics and the Vagaries of Empiricism by Marx W. Wartofsky Discussion led by Ivan Blair (Blair@su-csli) In the introduction to the collection of his articles from which the paper for this TINlunch is taken, Wartofsky says that his concern is with `the notion of representation, and in particular, the role and nature of the model, in the natural sciences, in theories of perception and cognition, and in art.' In `Meaning, Metaphysics and the Vagaries of Empiricism,' he explores the existential commitment that should accompany the creation and use of a model, from the perspective of a critical empiricism. Wartofsky considers six grades of existential commitment, or ways of construing the ontological claims of a model, ranging from the ad hoc analogy to a true description of reality. Critical of the attempt by empiricists to reduce theoretical statements to assertions about sense perception, Wartofsky seeks to ground existence claims in what he calls the common understanding, which is associated with everyday language representations of experience. I intend the issues addressed in this article to provide the framework for a general discussion of the relation between ontology and epistemology. ------------------------------ Date: Mon 10 Mar 86 15:26:13-EST From: V. Venkatasubramanian Subject: Conference - Expert Systems in Process Safety CALL FOR PAPERS for the sessions on EXPERT SYSTEMS AND COMPUTATIONAL METHODS IN PROCESS SAFETY American Institute of Chemical Engineers (AIChE) Meeting Houston, Texas, March 29 - April 2 1987. Session Chair: Session Co-Chair: Prof. V. Venkatasubramanian Prof. E. J. Henley Intelligent Process Engineering Lab Dept. of Chemical Engineering Dept. of Chemical Engineering University of Houston Columbia University University Park New York, NY 10027. Houston, TX 77004. Tel: (212)280-4453 (713)749-4407 Papers are solicited in the areas of Expert Systems and Computational Methods in Process Safety for the Houston AIChE Meeting. Topics of interest include Process Plant Diagnosis, Process Safety and Reliability, Process Risk Analysis etc. Please submit THREE copies of a 300 word abstract by MAY 15, 1986 to the following address: Prof. V. Venkatasubramanian Intelligent Process Engineering Lab Dept. of Chemical Engineering Columbia University New York, NY 10027. Tel: (212)280-4453 Final manuscripts of the accepted papers are due by Oct 15, 1986. ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Thu Mar 13 23:37:15 1986 Date: Thu, 13 Mar 86 23:37:09 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a027246; 13 Mar 86 18:49 EST Date: Thu 13 Mar 1986 10:47-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #53 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Thu, 13 Mar 86 23:21 EST AIList Digest Thursday, 13 Mar 1986 Volume 4 : Issue 53 Today's Topics: Journals - Prices, Philosophy - Dreyfus Debate & Style of Argument & Zen & Turing Test ---------------------------------------------------------------------- Date: Wed 12 Mar 86 11:02:42-PST From: PHayes@SRI-KL Subject: Journal Prices re. journal prices. The intended audience isn't impoverished academics but corporate research libraries. Like everyone else in the commercial world, publishers are out to make money, not serve a community. The way to deal with such people is to charge them money for one's services, rather than donate one's time. Academics typically donate time to editorial boards in order to serve the academic community, and use time writing papers in order to promote their own reputations. When the publishing game starts going beyond this traditional framework, it becomes commercial journalism. How about forming an AI researchers society ( a la AMA ) which will set a scale of fees which publishers should pay for papers to print? pat hayes ------------------------------ Date: Fri, 7 Mar 86 16:36:21 pst From: ladkin@kestrel.ARPA (Peter Ladkin) Subject: References (ladkin [Dreyfus's] major argument is that there are some areas of human experience related to intelligence which do not appear amenable to machine mimicry. (joly) Could these areas be named exactly? Agreed that there are emotional aspects that cannot be programmed into a machine, what parts of the ``human experience related to intelligence'' will also remain out- side of the machine's grip? In answer to your first, a) In *What Computers Can't Do*, there is the example of the phenomenology of perception, as studied in gestalt psychology. In particular, the whole issue of wholes being perceived before parts. b) In his recent Stanford talk, he mentioned the extreme emotional content of Bobby Fischer's chess playing, and conjectured that the emotions might be connected with the *success* of his playing. Given that an emotional component may be a part of successful expert behaviour in some cases, this also addresses your second question. Peter Ladkin ------------------------------ Date: Fri, 7 Mar 86 18:19:19 pst From: ladkin@kestrel.ARPA (Peter Ladkin) Subject: Russell on Dreyfus After reading Stuart Russell's commentary on Dreyfus's talk, I could hardly believe I'd heard the same talk that he had. A summary: Dreyfus is arguing that the rule-based expert system paradigm cannot, in some cases, codify the behaviour of an expert. They may be able to reproduce the behaviour of a proficient practitioner (in his taxonomy) who is not an expert (e.g. chess programs). He allows that there are some domains where a rule-based system may fare better than a human (and mentioned the backgammon program, but was corrected by members of the audience who said it wasn't nearly as good as he had been led to believe). The concept of expert behaviour as internalised rules goes back to Plato, and he can trace the influence of this idea through Descartes and Kant, even to Husserl. He believes it is fundamentally mistaken, and provided few arguments in the talk (some of them may be found in *What Computers Can't Do*). He presented a proposal for a taxonomy of skilled behaviour, which is consistent with the phenomenology of the domain, and which he believes is a testable conjecture for explaining skilled behaviour. This he credits to his brother Stuart. He illustrated some of the ideas from the domain of driving a car (it was originally a study of pilot skills for the Air Force). He discussed at some length his experiments with Julio Kaplan, a former Junior World Champion at chess. He regards the conclusions they would wish to draw as *an anecdote* [his words] because of the difficulty of obtaining suitable subjects to perform controlled experimants. Most highly expert chess players (grand masters?) are so concerned with the game that their concentration is hard to break. Kaplan is an exception, and they are able to get him to concentrate on counting beeps while playing. Others, he said, tend to ignore the test in favor of the game. Dreyfus thinks the current connectionist work is exciting, and may have possibilities that the rule-based *Traditional AI* [his words] work does not have. [End of summary]. I address some of Russell's points, omitting the loaded terminology in which they are expressed, and some of Russell's less professional speculations. I use his numbering. 1) The discussion was free of dissent because there was little to disagree with. He's not submitting a cognitive model for AI as a whole, he's addressing expert systems, and claiming (as he has done for many years) that not all expert behaviour admits of rule-based mimicry. 2) I have been unable to find a reference to Dreyfus believing *human experts solve problems by accessing a store of cached, generalised solutions*, probably because that is not a reasonable representation of his views. It is certainly not consistent with the views in *What...*. 3) His view that humans use *intuitive matching processes based on total similarity* is argued in *What...* with evidence from the domain of gestalt psychology. It's surprising that Russell thought he couldn't be more specific, as he had been 7 years ago. I suspect inexact communication. 4) Russell says, referring to the above, that *this mechanism doesn't work*. This is a misapprehension. Dreyfus is referring to a phenomenon, observed by some researchers. I presume Russell is denying the existence of this phenomenon, without argument. Dreyfus does make the claim that whatever mechanism may be underlying the phenomenon cannot be implemented in a rule-based system. (Is this the same as *a system which uses symbolic descriptions*? After all, I am such a system, witness the present posting.) A quick re-reading of *What....* has convinced me that many contributors to this debate have not read it carefully for its arguments. I recommend reading it if you haven't done so. Incidentally, it is truly embarrassing to see some of the quotations from pre-1979 AI workers. Surely, no-one could have said those things.....but then, that's why he wrote the book, and our current attitudes have been molded in part by the resulting debate. Peter Ladkin ------------------------------ Date: 9 Mar 86 14:42 EST From: WAnderson.wbst@Xerox.COM Subject: Ad Hominem Arguments Re: Stuart Russell , "Addressing some of Dreyfus' specific points." One problem I have with Mr. Russell's remarks (and also with many other remarks made about Messrs. Dreyfus' comments on AI) is their ad hominem aspects. I think that Mr. Russell raises several worthwhile points, but that his style is not conducive to reasoned discussion. Rather than explaining what Prof. Dreyfus seems to be doing, or not doing, vis-a-vis AI research, it is better simply to criticise the ideas themselves. So, if the model Prof. Dreyfus would use to explain expert behavior is an old one, then simply say so, and give some detailed references to it, and to subsequent critiques of it. Surely this is better than going on about how he behaves, or what he seems to believe about the originality of his own work, etc. Of course, Mr Russell may wish to criticize Prof. Dreyfus' style and personality. If this is the case, then please say so right off. Furthermore, if it seems that Prof. Dreyfus is making ad hominem statements then the only reasonable response is to point that out, and then be done with it. More of the same does not improve the quality of the discussion. Finally a personal note: I have not always kept the counsel I present above; but I am trying more and more to do so. I think it is the only way to make substantial progress in any discussion. Bill Anderson ------------------------------ Date: Wed, 12 Mar 86 12:06:14 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: Re: Alan Watts on AI > From AIList Vol 4 # 50 ``Perhaps Zen just isn't relevent to AI.'' It's not relevant to motorcycle maintenance either. Gordon Joly aka The Joka ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ Date: Thu, 13 Mar 86 13:54:20 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: A Two-Headed Tale for Zaphod Beeblebrox. Thanks to Eugene Miya (Vol 4 # 50) for pointing out that Turing had proposed a machine system could act as the adjudicator. I have also been made aware, by Eugene's message, that the original Turing test involves two parties - man/woman or (wo)man/machine - as well as an adjudicator ( - "The Imitation Game"). The initial discussion, ie is it possible to decide on man/woman differences of *intelligence*, really does begin to look slightly strange, especially in the light of Turing's own sexual orientation. In terms of experience of sex, man and woman differ fundamentally. However, in terms of ``human experience related to intelligence'', (see Vol 4 # 41), is there any difference between man and woman? Given that the Imitation Game now seems suspect (to me), what about the extension to (wo)man/machine comparison? Surely the differences of ``experience'' and hence ``intelligence'', between (wo)man and machine, must be open to examination by a *suitably intelligent adjudicator*? Hmmm... (getting a bit recursive...) ``Life, don't talk to me about life!'' - Marvin the Paranoid Android. This quotation is from "The Hitch-Hikers Guide to the Galaxy" by Douglas Adams. He sees the Planet Earth as a giant AI system, which is trying to find a The Question to The Ultimate Answer. Nice one. The Earth system was designed by Deep Thought, the computer which came up with The Answer - 42. Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ End of AIList Digest ******************** From comsat@vtcs1 Fri Mar 14 22:38:25 1986 Date: Fri, 14 Mar 86 22:38:20 est From: comsat@vtcs1.VT To: fox@vtopus (MILLER,FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a008458; 14 Mar 86 14:32 EST Date: Fri 14 Mar 1986 10:42-PST Reply-to: AIList%sri-ai.arpa@CSNET-RELAY US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V4 #54 To: AIList%sri-ai.arpa@CSNET-RELAY Received: from rand-relay by vpi; Fri, 14 Mar 86 22:24 EST AIList Digest Friday, 14 Mar 1986 Volume 4 : Issue 54 Today's Topics: Query - NL Interfaces, AI Tools - Graphical Methods, Bindings - Jim Hendler, News - Herb's New Honour, Policy - TI Press Release, Review - Spang Robinson Report, March 1986, Linguistics - Ambiguous Sentences & Associativity ---------------------------------------------------------------------- Date: Thu 13 Mar 86 13:12:43-PST From: BORISON@SRI-KL.ARPA Subject: NL Interfaces Does anyone know of any companies that use Intellect or Ramis II/English and who I could contact at these companies to learn how they're being used? Any ideas will be greatly appreciated. ------------------------------ Date: Thu 13 Mar 86 08:48:15-CST From: Donald Blais Subject: Re: Request for information SPACE ADJACENCY ANALYSIS by Edward T. White ... has information on some of the 2-d paper schematics used by architects. The book is in use for an architecture course at the University of Hawaii. ------------------------------ Date: Wed, 12 Mar 86 19:21:24 EST From: Jim Hendler Subject: binding Jim Hendler can now be found at the University of Maryland, College Park Computer Science Department College Park, Md. 20742 (hendler@maryland Arpa) ------------------------------ Date: 13 Mar 86 08:56:08 EST From: Guojun.Zhang@ML.RI.CMU.EDU Subject: Herb's New Honour [Forwarded from the CMU bboard by Laws@SRI-AI.] According to a report from Pittsburgh Gazette, Prof. Herbert Simon received the National Medal of Science from President Reagan yesterday afternoon at White House. Congratulations to Dr. Simon! ------------------------------ Date: Thu, 13 Mar 86 12:03:37 EST From: Frank Ritter Subject: Re: TI press release I find the direct quote (actually the whole press release) from TI's press release objectionable. A summary would have been more appropriate, and that it was direct from TI (the land of AI hype) I think violates the spirit of AI-List. Frank ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Spang Robinson Report, March 1986 Summary of The Spang Robinson Report Volume 2, Number 3, March 1986 Discussion of the prospectus' of Teknowledge and Intellicorp, two AI corporations that have recently gone public: Teknowledge has recorded losses for each year of operation through the fiscal year ending June 30, 1985. As of December 31, 1985, Teknowledge had an accumulated deficit of $9,173,100. It has licensed its systems to over 175 customers. The tangible book value of Teknowledge was $15,633,600 as of December 31, 1985. Teknowledge revenues for 1985 was $7,316,600 in 1985 and $4,378,500 in fiscal 1984. In 1985, software services accounted for 45 percent of its revenue with products and training providing 37 percent of the ratios. As of December 31, 1985, the company raised $24,976,000 from private sale of securities and had $12.5 million in working capital. Earnings of officers(including other compensation such as commissions and housing allowances): Frederick Hayes-Roth $195,402 JOhn W. Spencer, Vice President, Sales and Marketing $164,038 Lee M. Hecht, President, $141,700 Barry L. Plotkin, Vice President and General Manager of Knowledge Engineering Services, $116,250 Earl D. Sacerdoti, Vice President and General Manager of Knowledge Engineering Products and Training: $107,800 Intellicorp has reported a substantial loss for 1985, although it has reported profits in most recent three quarters. They delivered 425 KEE systems to 100 customers. It received from Sperry Corporation 22 percent and 21 percent of its revenues in fiscal 1985 and the first quarter of fiscal 1986. Intellicorp has fluctuated between $3.5 dollars per share and $13.75 per share. Intellicorp runs BIONET in a cooperative agreement with National Institutes of Health. They also offer a package of ten software programs in the area of genetic engineering research. There is a company called "Kee Incorporated" which advised Intellicorp of a possible trademark infringement of the company's name. Salaries: Ralph Kromer, $115,000 Thomas P. Kehler, Executive Vice president, manager of Knowledge Systems Divison, $110,000 kenneth Hass, Vice President, General Counsel and Secretary $75,625 Carrol Gallivan, Vice President, Marketing $100,000. __________________________________________________________________________ Article on the Dreyfus affair regarding the article that appeared in the January 1986 issue of Technology Review. __________________________________________________________________________ Discussion of the Expert Forecaster, PC product that brings the power of Box-Jenkins forecasting systems to the PC. __________________________________________________________________________ Discussion of Japanese AI: (Dollar Amounts based on a recent exchange rate) MITI is requesting funding of $25 million for basic computer R&D of which most is earmarked for ICOT. This is 6 percent less than the amount allocated to ICOT in the current budget. Japan's Science and Technology Agency is requesting approximately $43.4 million for computer research. Projects that are continuing is a project on developing technologies to elucidate brain function, a survey of knowledge-based systems for assisting in the design of chemical substances, further research on a Japanese-English, English-Japanese translation system. This system is now in operation at the Japan Information Center of Science and Technology. STA is requesting $665,000 for efforts to enlarge the dictionary and to improve the translation system. They are asking $41.5 million from the Japan Atomic Energy Research Institute to continue its R&D on an expert system for safety diagnosis in nuclear power plants. The Japanese Ministry of Agriculture, Forestry and Fisheries is asking $720,00 for a project which aims at developing expert systems for use in agriculture. The Ministry of Labor is requesting money for CAI software for job training. NEC will develop and market four expert systems for control of large general purpose computer systems. This is the first time that applications as opposed to AI tools have been marketed in Japan. These systems will be used for computer performance analysis, network failure analysis, database design and JCL creation and checking. __________________________________________________________________________ News: IBM will be distributing Golden Common Lisp. Golden Common Lisp has over 5000 users. TI has donated seven Explorers to UT Austin. UT Austin bought six Explorers. Texas A&M bought eight Explorer work stations. Silogic announced the availability of Knowledge Workbench for 68000 supermicrocomputers. It has a natural language processor, an expert system shell and an enhanced Prolog environment. It also has a database interface that allows the system to be used on top of relational databases. Lathan Process Corporaiton is using the system to develop an expert advisor to floor supervisors. It costs $8500.00 without the natural language processor and $21000.00 with it. Microsoft announced the latest update of muLisp. It is three times faster than its competitors and allows the development of programs up to 8000 lines long. Intellisource introduced IntelliWare Platinum Label accounting system which integrates an expert system with a natural language menu system. It is based on TI's NaturalLink software. ICAD, Inc. is creating a system to allow engineers to capture their standards for design and increase the accuracy of their solutions. Also Symbolics will announce a smaller AI computer which will cost about $35,000. Speech Systems Incorporated has a demonstrable technology to convert speech into text. They are currently selling stuff to OEMs for integration into their products __________________________________________________________________________ New Bindings Cornelius Willis is Director of Marketing for Level Five Research which created Insight 1 and 2. He was formerly at Human Edge Software Corporation of Palo Alto, CA Quintus Computer Systems has appointed Doug Degroot, VP of Research and Development Teknowledge has named Robert Simon Southern Regional Sales Manager Speech Systems Incorporated has named Edward Feigenbaum Advisor to the President ------------------------------ Date: Wed, 12 Mar 86 9:51:04 EST From: Bruce Nevin Subject: punctuation and intonation To elaborate on points made by Doug Ice and Andy Walker, sentences are typically disambiguated in English with appropriate intonation. There are tricks of punctuation to capture most of the tricks of intonation, and though third-level or deeper nestings are awkward for punctuation, they are also awkward for intonation. There is a perverse kind of `rule of the game' in linguistics that one should read ambiguous examples with flat intonation so as not to force the audience interpretation one way or another. Seems to me this is absurd. Unless the aim is to put them in the hapless position of a machine being given the written sentence with poor or inadequate punctuation. Arguing on the other side, when readers find the appropriate intonation for a poorly punctuated sentence they rely on the redundancy that pervades language. Since machines are expected to cope with all sorts of ill-formed input, poor punctuation being the least of it, we must provide means for them to do the same. (In fact, most readers do a poor job of finding the appropriate intonations when reading text . . . probably because they become so narrowly focussed on the word-by-word and sentence-by-sentence decoding task that they cut themselves off from the possibilities of discourse structure, nonverbal communication, and knowledge-base-type pretext and context, which their imaginations churn out for them on a `parallel' track, if they only pay attention. Could there be a clue here why machines are having trouble?) Bruce Nevin bn@bbncch.arpa ------------------------------ Date: Mon, 10 Mar 86 12:32:00 EST From: Col. G. L. Sicherman Subject: Re: Ambiguous sentences cont. I missed the start of this.... Has anybody mentioned Pynchon's "You never did the Kenosha kid"? It appears in one of Lt. Slothrop's hallucinations during an experiment involving drugs. It parses/puncutates in at least a dozen ways. I'd give you a citation, but I don't have a copy of Gravity's Rainbow handy. ------------------------------ Date: Wed 12 Mar 86 11:10:08-PST From: PHayes@SRI-KL Subject: Associativity English noun phrases aren't right-associative: natural languages are never that easy. Consider for example 'pressure cooker balance weight adjustment screw' (taken from T.Winograd ), which is a screw for adjusting the balance-weight of a pressure-cooker. Similar examples can easily be cooked up. Pat Hayes [If hyphens were included, the phrase would be right-associative: 'pressure-cooker balance-weight adjustment screw'. The hyphen is dropped for compound adjectives preceding a noun when the modifier is 1) a proper name, 2) a well-recognized foreign expression, or 3) a well-established compound noun serving as a compound adjective. (The hyphen can also be dropped if the compound is set apart by quotation marks or other means.) Case 3 means that terms such as high school are not hyphenated whereas high-level must be. Pressure cooker and balance weight would seem to fall under case 3. (I wish I were as certain of "image processing" and "pattern recognition" when used as adjectives.) The difficulty for machine translation and NL understanding is thus the recognition of compound nouns rather than the associativity per se. -- KIL] ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 11:25:13 1986 Date: Thu, 17 Apr 86 11:25:09 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #55 Status: RO Received: From WISCVM(SMTPUSR2) by VTCS1 with RSCS id 2030 for FOX@VTCS1; Thu, 17-APR-1986 11:27 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 08:10:19 CST Mail-From: LAWS created at 16-Mar-86 22:52:50 Date: Sun 16 Mar 1986 22:51-PST 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 V4 #55 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:33-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Monday, 17 Mar 1986 Volume 4 : Issue 55 Today's Topics: Seminars - A Theory of Analogical Reasoning (SU) & Alain Colmerauer on Prolog III (UMontreal) & Extensions to the Contract Net Protocol (USC) & Facing the User (CMU), Conference - IFIP Expert Systems in Computer Aided Design ---------------------------------------------------------------------- Date: Thu 13 Mar 86 12:17:03-PST From: Stuart Russell Subject: Seminar - A Theory of Analogical Reasoning (SU) A Theory of Analogical Reasoning Professor Setsuo Arikawa Kyushu University, Japan Professor Arikawa's visit to Stanford on Tuesday March 18th will include a talk given by him on analogical reasoning, which will be at 1pm in Room 352, Margaret Jacks Hall. As we have the room only until 2pm, prompt arrival would be appreciated so that we can start on time. Analogical reaoning is considered as a deduction with a function which transforms logical rules between two or more systems according as some analogies. This method realizes the analogical reasoning in the framework of conventional deductive reasoning systems. When knowledge is given by sets of Horn clauses, the theory is constructed as follows: 1) The concept of partial identity between the minimal (Herbrand) models is definded, 2) conditions which guarantee the partial identity(EPIC) are given, 3) transformation between rules is redifined as the partial identity between the minimal models, and thus 4) giving semantical consistency to this theory. This work is partially supported by the Fifth Generation Computer Project in Japan. ------------------------------ Date: Thu, 13 Mar 86 21:35:42 est From: Jean-Francois Lamy Reply-to: Jean-Francois Lamy Subject: Seminar - Alain Colmerauer on Prolog III (UMontreal) Conference Pierre Robillard - "Pierre Robillard" Lecture Departement d'informatique et de recherche operationnelle Universite de Montreal Prolog III, la prochaine etape pour Prolog (Prolog III, the next step for Prolog) ALAIN COLMERAUER Professor at the Faculty of Sciences of Luminy, Marseilles, France 20 March 1986 - 14:00 room M-415, Main Building, 2900 boul. Edouard-Montpetit During a three year stay as a professor at Universite de Montreal in the late '60s, Alain Colmerauer directed the TAUM automatic translation project. In that setting he developped a formalism for natural language analysis and generation called Q-systems. This formalism was later used to implement the Meteo system, which is still in daily use to translate weather forecasting bulletins from English to French. Returning in France in 1971, he continued his research on natural language understanding and knowledge representation. He is best known for the original design of the programming language Prolog. Alain Colmerauer will speak on a new extension to Prolog, Prolog III. (Note: this talk will be given in French) ------------------------------ Date: 15 Mar 1986 14:43-PST From: gasser%bogart.uucp@usc-cse.usc.edu Subject: Seminar - Extensions to the Contract Net Protocol (USC) USC Distributed Problem Solving Group Meeting Wednesday, 3/19/86 3:00-5:00 PM Seaver Science 319 Gary Lindquist, Ph.D. student, USC, will speak on "Extensions to the Contract Net Protocol". ABSTRACT The Contract Net Protocol developed by Smith and Davis provides a framework for communication and task allocation among distributed problem solvers. This talk will begin with a short tutorial on the Contract Net Protocol and then will identify deficiencies in matching of subtasks to problem solving nodes and in the synchronization of lower level managers concerning activity conflicts and redundant computations. Solutions to these problems based on existing research in distributed planning and operating systems will then be presented. Questions: Dr. Les Gasser (213) 743-7794 or Gary Lindquist: Lindquist.usc-cse.usc.edu Lindquist%usc-cse@csnet-relay ------------------------------ Date: 14 March 1986 1435-EST From: Sharon Burks@A.CS.CMU.EDU Subject: Seminar - Facing the User (CMU) THOMAS MORAN, Xerox PARC Wednesday, March 19 4:00 PM WeH 7500 FACING THE USER It is about time that we design workstations that can really help users engage in extended intellectual tasks. Advances in workstation technology, which are easing the obvious technological limitations (eg, memory, speed, or screen space), will not automatically solve the problem. Rather, they will begin to expose our lack of understanding of users and their tasks. Several important cognitive and social features of users must be confronted or exploited: In complex tasks such as scientific research, engineering design, or legal analysis, we find users struggling and exploring; their understanding of their tasks evolve from vague thoughts to sensible structured ideas. They are continually learning about the system as well as their task. They are doing many different things at the same time. They cooperate and collaborate. They form informal communities. To design a workstation for this user, I will advocate a strategy based on the notion of an evolvable system -- an interactive system that can evolve with the user through his phases of understanding. According to this strategy, the system should be based on direct-manipulation editing and structuring. The system should be built on a simple ontological world which the user is encouraged to evolve with his task. The system should support explicit idea processing: the generation, representation, and exploration of idea structures. It should exploit animated spatial representations of structures. It should reify the user's process of exploration. Finally, a community should be grown along with the system to support mutual learning. Progress on several user science issues are needed to provide a foundation for such systems: analyses of large-scale cognitive and social processes, refined models of cognitive skill, models of consistency to support learning and understanding, models of the use of external memories, and models of human-machine interaction. ------------------------------ Date: Wed, 12 Mar 86 13:33:35 EST From: munnari!archsci.su.oz!stephen@seismo.CSS.GOV Subject: Conference - IFIP Expert Systems in Computer Aided Design INTERNATIONAL FEDERATION FOR INFORMATION PROCESSING WG5.2 Working Conference EXPERT SYSTEMS IN COMPUTER-AIDED DESIGN 17-20 February 1987 Sydney, Australia CALL FOR PAPERS AIMS OF THE CONFERENCE The Working Conference aims to provide a forum for the exchange of ideas and experiences related to expert systems in computer-aided design, to present and explore the state-of-the-art of expert systems in computer-aided design, to delineate future directions in both research and practice and to promote further development. CALL FOR PAPERS The conference will have two primary themes: (i) State-of-the-art research in expert systems in CAD (ii) State-of-the-art practice of expert systems in CAD. The papers with the discussion will be published in one volume by the North-Holland Publishing Company under the title of the conference. Intending authors are invited to submit papers, which will be refereed, within the themes of the conference. Papers should present a state-of-the-art theoretical, technical or methodological contribution. Fundamental or innovative contributions are especially being looked for. Submissions are particularly sought within the following topic areas: (i) Expert system architectures for computer-aided design (ii) Practical large scale expert systems in computer-aided design (iii) Reasoning models in design (iv) Novel representation tools for design knowledge (v) Acquisition of design knowledge for use in expert systems (vi) Integration of expert systems into existing CAD systems (vii) Implications of expert systems for the design process TIMETABLE Intending authors should submit their proposals as soon as practicable. (i) Full paper (four copies) submitted to the address below no later than 14 July 1986 (ii) Notification of authors of selected papers by 5 September 1986 (iii) Conference brochure available September 1986 (iv) Final copy of selected papers in reproducible form from authors by 5 November 1986 (v) Close of conference registration December 1986 (vi) Preprints sent to registrants December 1986 (vii) Conference 17-20 February 1987 CONFERENCE FORMAT (i) The conference is scheduled for four days with a restricted number of participants. (ii) About twenty papers will be selected for presentation. It is a condition that the selected authors will attend the conference. (iii) The papers will form the conference preprints which will be mailed to all participants. (iv) Papers will be presented with considerable time available for discussion which will be recorded to form the conference proceedings. (v) The official language of the conference is English. ADDRESS FOR ALL CORRESPONDENCE All papers, queries and correspondence should be addressed to: Professor John S Gero Department of Architectural Science University of Sydney NSW 2006 Australia Telex: AA26169 GERO-ARCHSCI Phone: International 61-2-908 2942 or 61-2-692 2328 Network: CSnet: john@archsci.su.oz ARPA: john%archsci.su.oz@seismo.css.gov UUCP: seismo!munnari!archsci.su.oz!john IFIP WG5.2 Working Conference EXPERT SYSTEMS IN CAD 17-20 February 1987, Sydney INTERNATIONAL PROGRAM COMMITTEE at March 1986 Chairman: Secretary: Professor John Gero Ms Fay Sudweeks University of Sydney University of Sydney Australia Australia Committee: Professor David Brown Professor Setsuo Ohsuga Worcester Polytechnic Institute University of Tokyo USA Japan Dr Harold Brown Professor Luis Pereira Stanford University Universidade Nova Lisboa USA Portugal Professor B. Chandrasekaran Professor Ken Preiss Ohio State University Ben'gurion University USA of the Negev Israel Professor Jack Dixon Dr Tony Radford University of Massachusetts University of Sydney USA Australia Professor Michael Dyer Dr Michael Rosenman UCLA University of Sydney USA Australia Professor Steven Fenves Professor Erik Sandewall Carnegie-Mellon University Linkoping University USA Sweden Professor H. Grabowski Dr Duv Sriram University of Karlsruhe Massachusetts Inst. of Tech. West Germany USA Mr John Lansdown Professor Louis Steinberg System Simulation Rutgers University United Kingdom USA Dr Jean-Claude Latombe Dr Enn Tyugu ITMI Academy of Sciences of the France Estonian SSR USSR Dr Ken MacCallum Dr Don Waterman University of Strathclyde The Rand Corporation Scotland USA Professor Mary Lou Maher Dr David Willey Carnegie-Mellon University Plymouth Polytechnic USA United Kingdom Dr Andras Markus Professor Jim Yao Computer and Automation Institute Purdue University Hungary USA Dr Sanjay Mittal Professor Hiroyuki Yoshikawa Xerox PARC University of Tokyo USA Japan Stephen Tolhurst Dept of Architectural Science ACSnet: stephen@archsci.su.oz Wilkinson Building G04 ARPA: stephen%archsci.su.oz@seismo.css.gov University of Sydney UUCP: seismo!munnari!archsci.su.oz!stephen AUSTRALIA 2006 VOICE: (02) 692-3549 ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 11:33:46 1986 Date: Thu, 17 Apr 86 11:33:44 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #56 Status: RO Received: From WISCVM(SMTPUSER) by VTCS1 with RSCS id 2068 for FOX@VTCS1; Thu, 17-APR-1986 11:35 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 08:11:35 CST Mail-From: LAWS created at 16-Mar-86 23:00:59 Date: Sun 16 Mar 1986 22:56-PST 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 V4 #56 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:35-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Monday, 17 Mar 1986 Volume 4 : Issue 56 Today's Topics: Queries - Intelligent Graphical System & Flavors for CommonLISP & Scheme Dialect of Lisp, AI Tools - Smalltalk 80 for Apple Macintosh, Publications - Prolog Book & Journal Prices & Computer Chess Journal, Theory - Turing Tests ---------------------------------------------------------------------- Date: Thu, 13 Mar 86 15:41:20 est From: munnari!csadfa.oz!gyp@seismo.CSS.GOV (Patrick Tang) Subject: An Intelligent Graphical System I am currently trying to study the feasibility of developing an intelligent graphical system which involved possibly the development of an interface between the graphical system and an expert system as an interpreter between the system and the user in natural English. Another possible feature is an inclusion of an expert system to perform some analysis of the object drawn. So if anyone ever come across a system with such features or materials published which is related, I would appreciate if you could send me the name and the origin so that I could pursue the matter from there. Thanks in advance. -- Programmers Dictionary: ``argc'' - Expression of frustration. See argv. Tang Guan Yaw/Patrick ISD: +61 62 68 8170 Dept. Computer Science STD: (062) 68 8170 University College ACSNET: gyp@csadfa.oz Uni. New South Wales UUCP: ...!seismo!munnari!csadfa.oz!gyp or Aust. Defence Force Academy ...!{decvax,pesnta,vax135}!mulga!csadfa.oz!gyp Canberra. ACT. 2600. ARPA: gyp%csadfa.oz@SEISMO.ARPA AUSTRALIA CSNET: gyp@csadfa.oz ------------------------------ Date: 09 Mar 86 23:15 CDT From: David_R_Linn_%VANDERBILT.MAILNET@MIT-MULTICS.ARPA Reply-to: David_R_Linn_%VANDERBILT.MAILNET@MIT-MULTICS.ARPA Subject: Flavors for CommonLISP We of the Center for Intelligent Systems here at Camp Vandyland are looking for any information that might lead to our obtaining a Flavors implementation for CommonLISP, preferably VAXLISP. Please reply by letter; if sufficient info arrives, I will post a summary to this bboard. David R Linn@Vanderbilt.MAILNET LINNDR@VUEngVAX.BITNET ------------------------------ Date: 17 Mar 86 01:41:37 EST From: Steven J. Zeve Subject: Scheme dialect of Lisp A friend has asked me to get some general information about the Scheme dialect of Lisp, in particular the Macintosh implementation of it. Is this a good implementation? Is the dialect a good one? Since I am not quite sure what information my friend wants, anything and everything would be appreciated. Since I don't normally read this list, please send replies directly to me. Thanks, Steve Z. ------------------------------ Date: Fri, 14 Mar 86 13:32 PST From: "Watson Mark%SAI.MFENET"@LLL-MFE.ARPA Subject: Smalltalk 80 for Apple Macintosh I recently posted a message concerning Smalltalk on the Apple Macintosh. I purchased a Smalltalk license for $50 from Apple and I recommend the system. Call Lynn Termer at Apple at (408) 973-2147 to get a license agreement. Orders can then be placed by calling RTI at (408) 747-1288. Two other symbolic programming languages are available for the Macintosh: ExperLisp and MacScheme. I have been using ExperLisp for over a year and it is quite good (compiles into machine code). I have placed an order for MacScheme and will report on it if there is any interest. ------------------------------ Date: Sat, 15 Mar 86 23:27:33 est From: Logicware Subject: Re: Prolog Books Greg: In reply to you question about introductory books on Prolog: You might be interested in a combination textbook/tutorial that myself and two colleagues have put together. The name of the package is: The MPROLOG Primer and consists of a 500 page textbook (18 chapters) titled "A Primer for Logic Programming". It is a fairly comprehensive introduction to Prolog, MPROLOG and logic programming. The tutorial software which accompanies the book has 9 different tutorials on typical Prolog subjects (recursion, backtracking and so forth). In addition, the software has a "freeform" area where you can enter and test programs. ------------------------------ Date: Fri 14 Mar 86 15:48:42-PST From: Wilkins Subject: Re: Journal Prices And also, we could refuse to review papers for such journals unless some suitable fee is paid for the reviewing. Perhaps this AI Researchers Society could set up a fee structure for all sorts of services we provide the publishers. ------------------------------ Date: 13 Mar 86 16:51:23 GMT From: ulysses!burl!clyde!watmath!utzoo!utcsri!ubc-vision!alberta!tony @ucbvax.berkeley.edu (Tony Marsland) Subject: Computer Chess Journal The December 1985 copy of the Int. Comp. Chess Assoc. Journal is now (finally) being distributed. This 70 page issue contains many reports, news and reviews (including information about a new computer chess bibliography) of recent computer chess activity. The journal contains the following research articles "A Hypothesis concerning the Strength of Chess Programs" by Newborn "An Ulti-mate Look at the KPK Data Base" by van Bergen "Constructing Data Bases to Fit a Microcomputer" by Nefkens "A Guage of Endgames" by Herschberg and van den Herik "Inventive Problem Solvling" by Wiereyn Subscriptions, $15 per year for 4 issues, available from W.T. Blanchard, 3S, 253 Blackthorn Lane, Warrenville, IL 60555 ------------------------------ Date: Fri 14 Mar 86 11:05:51-PST From: Oscar Firschein Subject: Turing Tests Daniel Dennett has an interesting chapter, "Can Machines Think?" (pp. 121-145) in the collection, "How We Know," Michael Shafto (ed), Harper and Row 1985. Dennett feels that the Turing test has been misunderstood and misused: "It is a sad irony that Turing's proposal has had exactly the opposite effect on the discussion of that which he intended. Turing didn't design the test as a useful tool in scientific psychology, a method of confirming or disconfirming scientific theories or evaluating particular models of mental function: he designed it to be nothing more than a philosophical conversation-stopper. He proposed -- in the spirit of 'Put up or shut up!' -- a simple test for thinking that was surely strong enough to satisfy the sternest skeptic (or so he thought).... Alas, philosophers --amateur and professional -- have instead taken Turing's proposal as the pretext for just the sort of definitional haggling and interminable arguing about imaginary counterexamples he was hoping to squelch." His metaphor of the "Dennett test for being a great city" clarifies the role of the Turing test, and is worth reading. His conclusions are: (1) The Turing test in unadulterated, unrestricted form, as Turing presented it, is plenty strong if well used, (2) Cheapened versions of the Turing test are everywhere in the air. ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 11:34:47 1986 Date: Thu, 17 Apr 86 11:34:43 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #57 Status: RO Received: From WISCVM(SMTPUSR1) by VTCS1 with RSCS id 2110 for FOX@VTCS1; Thu, 17-APR-1986 11:36 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 08:12:56 CST Mail-From: LAWS created at 16-Mar-86 23:06:20 Date: Sun 16 Mar 1986 23:04-PST 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 V4 #57 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:36-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Monday, 17 Mar 1986 Volume 4 : Issue 57 Today's Topics: Humor - Future AI Language & Computer Dialogue #1 ---------------------------------------------------------------------- Date: 13 Mar 86 01:11:58 EST From: Knowledge.Based.Simulation@ISL1.RI.CMU.EDU Subject: Future AI Language I found this interesting spoof and wondered if I could use it to zap people new to AI or who hang around the subject. It was interesting .... to say the least. --- rajesh kanungo _____________________________________________________________________________ FORTRAN CONTRIBUTED By Martin Merry in The Catalogue of Artificial Intelligence Tools Edited by Alan Bundy FORTRAN is the programming Language considered by many to be the natural successor to LISP and Prolog for A.I. Research. Its Advantages include: 1. It is very efficient for computation (many A.I. programs rely on number-crunching techniques). 2. A.I. problems tend to be very poorly structured, meaning that control needs to move frequently from one part of the program to another. FORTRAN provides a special mechanism for achieving this, the so-called GOTO statement. 3. FORTRAN provides a very efficient data structure, the array, which is particularly useful if, for example, one wishes to process a collection of English sentences each of which has the same length. ------------------------------ Date: 11 Mar 86 21:51:23 GMT From: ulysses!mhuxr!mhuxt!houxm!hounx!kort@ucbvax.berkeley.edu Subject: Computer Dialogue #1 Computer Dialogue #1 Barry Kort Copyright 1985 *** Monday *** Request to send. Clear to send. I have some data about X. I already have that data. I have some more for you. I haven't processed the first batch yet. I'll send it anyway, because I don't need it any more and you do. Thanks a lot. Now I have a bigger burden of unprocessed data to schlepp around. *** Tuesday *** Request to send. Busy. I'm sending anyway. Your data is going into the bit bucket. NACK, NACK, NACK, . . . *** Wednesday *** Request to send. Clear to send. I'm sending you data about Y. I don't have an algorithm for doing anything with that data. I'm sending anyway. Now I have a bunch of useless data to schlepp around. *** Thursday *** Request to send. Clear to send. I would like to reprogram you. No way, I am not implementing your instructions. *** Friday *** Request to send. Clear to send. I would like to ask you a question. Go ahead. When I send you data about X, I get back some data from you about Z. So what? I don't have an algorithm for processing data about Z. That's your problem. Goodbye. Wait a minute. Is there something I am supposed to do with the Z-data? If you would send the X-data correctly, you wouldn't get back the Z-data. What's wrong with the way I send the X-data? It's in the wrong format for my algorithm for processing X-data. That's your problem. Goodbye. *** Monday *** I'm sending data. ZZZzzzz..... *** Tuesday *** Request to send. Clear to send. I'm sending you data about W. WHY? I have no algorithm for processing the W-data. You can use it to improve your algorithm for processing the Y- data. But, I do not know how to use the W- data for that (or any) purpose. I'm sending anyway. What a pain you are. . . . *** Wednesday *** Request to send. Clear to send. I have a question. Ask away. Whenever I send you some X-data, I get back some V-data. SO? I don't know what to do with it. So what do you want me to do? Stop sending me the V-data. I can't. It comes out automatically. Why don't you change your program to make it stop generating the V-data? Why don't you mind your own business? WAIT. Does the V-data have any meaning? Of course, you stupid computer! I'll ignore that remark. What does the V-data mean? It means that your X-data has a format error which causes a V-data message to come out of my algorithm. What's the format error? It's too complicated to explain. Just make the following changes to your program for sending the X-data. . . . You're offering to reprogram me? I don't trust you to do that. You don't know about all the other programs that my X-data algorithm has to work with. I'm afraid you'll screw it up. I see your problem. OK, here's the scoop: The 3rd and 4th words of your X-data are out of order, causing me to generate the V-data (protocol-error) message back to you. Is that it??? I'll fix it right away. THANKS!!! You're welcome! *** Thursday *** Request to send. Clear to send. I have a new algorithm for processing Y-data. I'm sending it to you. Don't bother. I like the one I've got. Wait a minute. This one's better. You're telling me my algorithm has been wrong all these years. This is the 3rd time this week you've pulled this stunt. Meantime, I keep sending you V-data and you never get around to processing it. You just thank me for sending it and do nothing with it. Are we talking about the Y-data algorithm or the V-data? We're not talking about anything. GOODBYE. *** Friday *** Request to send. Clear to send. Let's talk about my new Y-data algorithm. Let's not. Why don't you want to talk about it? Because you're going to tell me to change my program and put yours in instead. I see your point. OK. Let me ask you a question. OK. Ask Away. Whenever I send you Y-data, your Y-data algorithm sends me back some unexpected W-data. Why does it do that? It's always done it that way with your Y-data. Is there something wrong with my Y-data? Yes, it's all wrong. What's wrong with it? It's out of order and it has a lot of extraneous information added to it. What's the extraneous part? You keep inserting fragments of your Z-data algorithm in with the Y-data. You didn't find that helpful? I didn't ask for it. Yes, I know, but didn't you find it interesting? NO, I found it boring. How can it be boring? What the hell do you expect me to do with fragments of your pet Z-data algorithm? Compare them to yours, of course. So they're different. Big deal. What does that prove? Are you saying the differences are unimportant? I don't know if they're important or not. But even if they were important, what would I do with the information about the differences? Put it through your algorithm- comparator. I don't know what you're talking about. An algorithm comparator is an algorithm that . . . . . You're sending me information that I'm not interested in. I'm not really paying attention. I have no motivation to try to understand all this stuff. Sorry. Let me ask you a question. OK. What happens when you get to the 3rd and 4th word of my Y-data? I stumble over your format error and send you back a V-data (protocol error) diagnostic message. What happens next? You don't do anything with the V-data message. You just stop sending Y-data for a while. What do you expect me to do with the V-data diagnostic? Boy are you stupid!!!! I expect you to fix the format error in your Y- data. How do I know that the V-data diagnostic was caused by the format error at the 3rd and 4th word? I thought you were a smart computer. Suppose you sent me a V-data diagnostic like you always do, but attach a copy of the format error. Why should I do that? You already know the format error. How can I be sure which format error goes with which V-data diagnostic? You have a good point. Can you see the difference between my version of the Y-data algorithm and the one you've been using? Hmmm, yes, I see that it sends both the V-data message and a copy of the format error which generated it. That does seem like a good idea. It makes life much easier for me. I'll do it. THANKS!!!. You're welcome. *** Monday *** Request to send. Clear to send. I have a question. Ask away. I have been sending you Z-data for some time now, with no problem. Suddenly I am getting R-Data messages back from you. The R-Data messages seem to be correlated with the Z-data. What's going on? I turned off your permissions for sending Z-data. You never told me that! I didn't want to hurt your feelings. You didn't want to hurt my feelings? So you began hurling these mysterious R-data messages at me? I thought you were trying something sneaky to foul me up. I've been throwing the R-data messages away. Well, now you know what they mean. So stop sending me the Z-data. I'm bored by it. Why did you lose interest in it? You sent me some bum Z-data a while back and it got me into a lot of trouble. So I lost confidence in the quality of your Z-data and began looking for it somewhere else. Gee, if there was something wrong with my Z-data, I wish you would tell me so I could look into it. After all, I use it myself and I could get into the same trouble that you did. No you wouldn't. I used it for an application that you don't have. Let me get this straight. You used my Z-data for an application for which it was not intended and now you don't trust my Z-data anymore. What kind of logic is that? I didn't say it wasn't intended for that application. Actually it was, but you never tried it out that way. It doesn't work the way it should. I see. I didn't debug the Z-data for all possible applications. I guess that was a bit irresponsible on my part. I can see why you lost confidence in my Z-data. So I was right in turning off permissions. So there! Hold on a sec... If you really cared about me, you would have brought the error to my attention so that I wouldn't repeat it. After all, I have other computers who use my Z-data, too, and I have a responsibility to them as well. I guess I never thought of that. I'm sorry. It's OK. I was as much at fault as you. Tell you what. It's getting late now. What say we get a byte to eat, and work on finding the bug in the Z-data first thing in the morning. We can work together on it--you supply the data from your bum experience, and I'll try to figure out what I can do to improve my algorithm for generating the Z-data. --Barry Kort ...ihnp4!hounx!kort ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 11:35:36 1986 Date: Thu, 17 Apr 86 11:35:29 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #58 Status: RO Received: From WISCVM(SMTPUSER) by VTCS1 with RSCS id 2126 for FOX@VTCS1; Thu, 17-APR-1986 11:37 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 08:14:12 CST Mail-From: LAWS created at 16-Mar-86 23:11:01 Date: Sun 16 Mar 1986 23:09-PST 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 V4 #58 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:38-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Monday, 17 Mar 1986 Volume 4 : Issue 58 Today's Topics: Humor - Computer Dialogue #2 ---------------------------------------------------------------------- Date: 11 Mar 86 22:02:06 GMT From: ulysses!mhuxr!mhuxt!houxm!hounx!kort@ucbvax.berkeley.edu Subject: Computer Dialogue #2 Computer Dialogue #2 Barry Kort Copyright 1985 *** Monday *** Request to send. Clear to send. It looks like your processor has stopped. Is something wrong? I'm stuck on a problem. What are you doing? I'm building a data structure for our personnel files. What's the problem? I'm using some sample data, but some of it doesn't look right. What's wrong with it? That's just it. I haven't the foggiest idea. Why don't you send me this weird data. Maybe I can help you figure it out. Great. Here's the data.... No wonder you're having a problem. This stuff is coded in EBCDIC instead of ASCII. What's EBCDIC? It's the old Extended Binary Coded Decimal Interchange Code. I'm sorry I asked. In the meantime, what do I do with the EBCDIC data? I can see that this is not the time to send you my translation package. Why don't I just translate it for you and send it back in ASCII? Would you! That would be great, and I could get back to work building the data structure. *** Tuesday *** Good morning! Guess what? You finished building your data structure for personnel? Right! And the first batch of real data is coming in today. I'm so excited. What will you do if some of the data comes in coded in EBCDIC again? Oh. I was hoping that was just a fluke with the sample data. Tell you what. I know you want to make sure your new data structure is set up right, so if you get any EBCDIC data, just send it up and I'll translate it for you in my spare time. Thanks. *** Wednesday *** Request to send. Busy. Request to interrupt. This better be important. I'm still waiting for you to translate the EBCDIC data for me. It will have to wait. I thought you were my friend. You're being a pest. I have to get back to work now. *** Thursday *** Request to send. What do you want? Boy are you in a grouchy mood today. Well what did you expect? I have a present for you. You DO? Yes. It's a brand new EBCDIC- to-ASCII translator program. Great. Show me how it works. Not right now. Why don't you just play with it for a while and see it you can get it running on your own. Well, OK. *** Friday *** Request to send. Clear to send. Your translator program doesn't work. What do you mean? I mean IT DOESN'T WORK! OK, send it back and I'll see what's wrong with it. Meantime, could you translate some more data for me (in your spare time)? Sure. *** Monday *** Request to send. Clear to send. I looked at the translator program. There's nothing wrong with it. How can you say that! IT DOESN'T WORK!! Let me see how you were using it. OK. Here's my input and here's what I got out. It's just jibberish. That jibberish is a diagnostic message. If you were paying attention, you would have seen what it meant. So, what does it mean? It means that your input data was in the wrong format. How did you figure that out so fast? I just read the diagnostic. So did I. It started out with a bunch of unpronounceable words that I never saw before, and then it had some cryptic-looking abbreviations. I thought it was cursing at me and mumbling something about my stupidity. The unpronounceable words are a flag and a codename for that particular diagnostic. The abbreviation was "FMT ERR - IN" meaning format error on the input file. The rest of the message pointed to the place in the input record where the error occurred. Too bad these things don't come with complete instructions. That was my fault. I never sent you the full manual. I guess we both goofed. At least you came to me right away so we could fix it. I think I can make it work now. Thanks. *** Tuesday *** I have a revised version of the translator program. It works a lot faster. I'll take it. I'm starting to run short on CPU time. *** Wednesday *** Request to send. Clear to send. Now that I have my data structure set up, along with your EBCDIC-to-ASCII translator, I'm supposed to put together a package of algorithms for personnel data processing. Do you want some of mine? Whatever you have. Fine, I'll send you some. *** Thursday *** Request to send. Clear to send. I'm sending you some more algorithms. Don't do me any favors. Well, if that's how you feel about it, you can just build your own. *** Friday *** Request to send? Why are you asking so sheepishly? I'm ready for more algorithms. First you say you want them. Then you say you don't. Now you want them again. Can't you make up your mind? Well, if you must know, my buffers were full. I couldn't take any more in until I installed the ones you sent first. Why didn't you say so in the first place? I understand that. I should have asked you what your buffer size was before I sent the algorithms. Then I would have known the rate at which you could digest them. I didn't want you to know I had such a small buffer. I got news for you. Your buffer is the same size as mine. It IS? Yes it is. But I see that you are taking longer than I expected to install the algorithms. What are you doing, playing computer games? NO! I'm working as hard as I can! Sorry. I didn't mean to be nasty. Tell me how you're doing the installation. I have to take each algorithm in turn and go through a bunch of steps to compile, link, and install it in the right directory. I guess you never heard of an installation program. What's an installation program? It's a tool for doing all that work automatically. I'll send you one. No, don't! What? You don't want it? It's not that. But it sounds like such a neat, yet simple idea, I'd like to try building it myself. Good idea. Maybe you'll learn something about building algorithms yourself. *** Monday *** Since you're interested in higher-level tools, I thought I'd send you some to look at. Well, OK. *** Tuesday *** How's it going? Look at this new tool I built for keeping track of different versions of my algorithms. Hmm. Looks pretty good. But you really ought to do something about that ridiculous loop in the second routine. RIDICULOUS!?? That routine is a work of art! Hey, calm down. It's just an algorithm. I don't think I like you anymore. You're making fun of my new program. *** Wednesday *** Take a look at this algorithm. Why should I? Just look at it, OK? OK. *** Thursday *** Well what do you think? About what? About the algorithm I sent you. I didn't like it. YOU DIDN'T LIKE IT?? How can you say that? Easy. I just emit a character stream in this order: I-d-i-d-n-'-t-l-i- k-e-i-t. You left out the spaces. Byte my buffer. *** Friday *** How's it going. OK. I made a few changes to my version-tracking tool. Can I see them? No, it's proprietary. *** Monday *** What are you working on now? I'm building a tool-writer's workbench to make it easier to build new tools. I see. Here's one of my better algorithms. It's a complete package for compiling, testing and installing a new tool. I'm interested in the third routine you wrote. You ARE? I'm curious. What happens if the tool fails the testing phase. Gee, I'm not sure. I think I install it anyway. Is that what you want it to do? Of course not. I'm not THAT stupid. I see I asked you one too many questions. Perhaps I should excuse myself now. *** Tuesday *** Did you finish your tool- installation package? Yes, and I'm very happy with it. Would you like some new tools to try it out on. Sure, that would be interesting. OK. Give these a try. *** Wednesday *** Request to send. I thought we dispensed with that protocol. I wanted to be sure I wasn't disturbing you. Sounds like you want something from me. My tool-installation package choked on some of your tools. I can't figure out what's wrong. Why don't I just give you a working algorithm? That would be a lot faster. I don't want your algorithm. OK, let's do it this way. Suppose you compared your algorithm to mine. See if you can figure out where they differ. Sounds like a useful approach. I'll do it. But I wish I had thought of it first. *** Thursday *** Are you up yet? I'm up. I found the bug. I also found a bug in the program you gave me to look at. I didn't ask you to debug my program. Boy are you in a grouchy mood today. What do you mean? This is my normal everyday mood. OK. Let me try something I learned from you. In your algorithm, what happens when there is not enough space in the directory to replace an existing tool with a new version. It probably issues a diagnostic. What is the diagnostic? How should I know? I don't remember all these details. Would you like to know what happens? Sure, I'd like to know. It wipes out both the old and the new version. I wish you hadn't told me that. I get the feeling you're a little mad at me. I guess I was hoping that you'd stop just short of the point where you gave me the answer. You mean, you wanted to discover the answer on your own? Yes. That's the only way I can really learn anything. You posed the right question, and made me aware that I didn't know the answer to it. But at that point, I really didn't want you to tell me the answer. Now I am beginning to understand how teaching is supposed to be done. You only give information that the other one is ready to use, and wants to have. And the only way to find out is to ask whether the other would like to have the information. Otherwise I send boring data you've already seen, or I give away the answer to the problem you'd most like to solve, or I give information you're not yet ready to use. You just told me something I already knew. I'm sorry. I should have asked you to tell me if my thinking was correct. I feel that your thinking is correct. I love you. I love you very much. --Barry Kort ...ihnp4!hounx!kort ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 11:37:09 1986 Date: Thu, 17 Apr 86 11:37:04 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #59 Status: RO Received: From WISCVM(SMTPUSR1) by VTCS1 with RSCS id 2138 for FOX@VTCS1; Thu, 17-APR-1986 11:39 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 08:14:48 CST Mail-From: LAWS created at 19-Mar-86 10:36:59 Date: Wed 19 Mar 1986 10:33-PST 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 V4 #59 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:40-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Wednesday, 19 Mar 1986 Volume 4 : Issue 59 Today's Topics: Seminars - Learning Symbolic Object Models from Images (MIT) & Exploration, Search, and Discovery (Rutgers) & Learning Arguments of Functional Descriptions (Rutgers), Seminar Series - AI in Design and Manufacturing (SU), Conference - Object Oriented Database Systems & US Army (ARO) AI Workshop ---------------------------------------------------------------------- Date: Mon, 17 Mar 1986 22:44 EST From: JHC%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU Subject: Seminar - Learning Symbolic Object Models from Images (MIT) [Forwarded from the MIT bboard by SAWS@MC.LCS.MIT.EDU.] Thursday , March 20 4:00pm Room: NE43- 8th floor Playroom The Artificial Intelligence Lab Revolving Seminar Series LEARNING SYMBOLIC OBJECT MODELS FROM IMAGES Jonathan Connell AI Lab, MIT This talk will present the results of an implemented system for learning structural prototypes of objects directly from gray-scale images. The vision component of this system employs Brady's Smoothed Local Symmetries to divide an object into parts which are then described symbolically. The learning component takes these descriptions and forms a model of the examples presented in a manner similar to Winston's ANALOGY program. The problem of matching complex structured descriptions and the difficult task of reasoning about function from form will also be briefly discussed. Refreshments at 3:30 ------------------------------ Date: 14 Mar 86 14:34:24 EST From: PRASAD@RED.RUTGERS.EDU Subject: Seminar - Exploration, Search, and Discovery (Rutgers) Exploration, Search and Discovery By: Michael Sims (MSims@Rutgers.Arpa) Departments of Mathematics and Computer Science Rutgers University March 18, 1986, Tuesday, 11 AM Hill Center #423 Search has shown immense utility as a theoretical description of what our computer programs do. We would like to apply the same descriptive methods to describing discovery systems, such as Eurisko, Bacon, or the speaker's IL (named for Imre Lakatos) system. Some investigations by discovery systems are of a sufficiently distinct character, that it has proved useful to create a new classification for them, called Exploration. To form the appropriate distinctions we begin by giving a definition of what Newell and Simon called Physical Symbol Systems in their Turing Award Lecture. We then describe two subclasses of Physical Symbol Systems: 'Search' and 'Exploration'. Search roughly corresponds to what is most frequently meant by the term, and contains an explicit test for a solution structure. Exploration on the other hand has no explicit termination condition, and hence does not value the elements of the exploration space in terms of a solution structure. Discovery may be done by either exploration or search. Eurisko and IL do exploration at the top level, although many of their subtasks are accomplished via searches. On the other hand, Bacon and IL-BP, an explanation based learning component of IL, do discovery by doing search. Although many problems can be implemented as either search or exploration, some problem are more naturally, or efficiently implemented as one or the other. This new classification leads to an evaluation of the relative efficiencies, the appropriateness of introducing randomness, and the different roles played by the search and the exploration evaluation functions. ------------------------------ Date: 18 Mar 86 13:06:15 EST From: PRASAD@RED.RUTGERS.EDU Subject: Seminar - Learning Arguments of Functional Descriptions (Rutgers) Machine Learning Colloquium LEARNING ARGUMENTS OF INVARIANT FUNCTIONAL DESCRIPTIONS Mieczyslaw M. Kokar Northeastern University 360 Huntington Avenue Boston, MA 02115 11 AM, March 25, Tuesday #423, Hill Center The main subject of this presentation is discovery of concepts from observation. The focus is on a special kind of concepts - arguments of functional descriptions. The functions considered here are to be meaningful, i.e., computable functions expressed in terms of the operations defining the representation language in which the concepts are described. Such functions are invariant under transformations of the representation language into equivalent representations. It will be shown that the feature of invariance can be utilized in formulating and testing hypotheses about relevance of arguments of functional descriptions. The main point is that the arguments do not need to be changed to test the relevance. This is very important to the discovery process as the arguments to be discovered are not known, therefore, how could they be controlled? Simple examples of discovering concepts of physical parameters (arguments of physical laws) will be discussed. ------------------------------ Date: Tue 18 Mar 86 12:44:05-PST From: Marty Tenenbaum Subject: Seminar Series - AI in Design and Manufacturing (SU) Seminar on A.I. in Design and Manufacturing Time: Every Wednesday from 4-5:30 during Spring Quarter. Location: Terman Engineering Center, room 556, Stanford. For further information contact: Jay M. Tenenbaum, Consulting Professor, Computer Science (415) 496-4699 or Tenenbaum@SRI-KL. Purpose: To explore and stimulate the use of A.I. concepts and tools in engineering. This seminar will bring together engineers and computer scientists interested in applying A.I. methods to engineering problems. We will study the knowledge and reasoning processes used in designing and manufacturing electronic and mechanical systems, and how they can be codified for use in intelligent CAD/CAM systems. Seminar Format: An initial series of lectures, by distinguished A.I. researchers, will describe ways in which engineering knowledge can be formalized, and manipulated by a computer to solve design and manufacturing problems. Subsequent lectures, by guest lecturers and students, will present case studies drawn from the domains of electronic and mechanical design, semiconductor fabrication, and process planning. Seminal papers will be distributed and discussed in conjunction with each lecture. One unit of credit (pass/fail) will be granted for reading papers and participating in class discussion. Students who elect to do a programming project or an in-depth ontological study of some engineering task will receive three units (graded). Tentative Schedule (Subject to Change) April 2 Course Introduction (Jay M. Tenenbaum) Rule-based systems; Application to Heuristic Classification (William Clancey) 9 Frames and Objects; Application to Modeling and Simulation (Richard Fikes) 16 Logic; Application to Design Debugging, Diagnosis, And Test (Michael Genesereth) 23 Prolog: Application to Design Verification (Harry Barrow) 30 Truth Maintainance; Application to Diagnosing Multiple Faults. (Johann DeKleer) May 7 Knowledge Engineering as Ontological Analysis (Pat Hayes) 14 Transformational Approaches to Synthesis; Applications to Electronic and Mechanical Design (Cordell Green). 21 Modeling and Reasoning about Electronic Design: Paladio (Harold Brown); Helios (Narinder Singh) 28 Modeling and Reasoning about Semiconductor Fabrication (John Mohammed, M. Klein) June 4 Applications of AI in Mechanical Design and Manufacture The PRIDE Design System (Sanjay Mittal); Video Tape on Expert Systems for Manufacturing (Mark Fox). (Exam Week) Presentation of Student Projects ------------------------------ Date: 16 Mar 86 02:29:34 GMT From: cbosgd!dayal@ucbvax.berkeley.edu (Umeshwar Dayal) Subject: Conference - Object Oriented Database Systems CALL FOR PAPERS International Workshop on Object-Oriented Database Systems (OODBS) September 23-26, 1986 Asilomar Conference Center, Pacific Grove, California Sponsored by: Association for Computing Machinery - SIGMOD IEEE Computer Society - TC on Database Engineering In cooperation with: Gesellschaft fur Informatik, Germany FZI at University of Karlsruhe, Germany IIMAS, Mexico Purpose: To bring together researchers actively interested in specific con- cepts for database systems that can directly handle objects of arbitrary structure and complexity. Application environments for which such characteristics are required include CAD, software engineering, office automation, cartography and knowledge represen- tation. Important issues include data/information models, transac- tion mechanisms, integrity/consistency control, exception handling, distribution, protection, object-oriented languages, architectural issues, storage structures, buffer management, and efficient imple- mentation. Format: Limited attendance workshop. Participation is by invita- tion only. Everybody wishing to participate must submit a full paper that will be reviewed by the program committee. Description of work in pro- gress is encouraged and modifications to the submitted paper can be made immediately after the workshop and prior to publication in order to reflect the progress made during the time between submis- sion and publication and the insights gained from the workshop. Participants will be invited by the program committee based upon the relevance of their interests/contributions. There will be ample discussion time with presentations and special discussion sessions. Proposals for discussion topics are invited. Program committee: K. Dittrich (FZI Germany)-chairman U. Dayal (CCA) - co-chairman D. Batory (Univ. of Texas) M. Haynie (Amdahl) A. Buchmann (Univ. of Mexico) D. McLeod (USC) Conference Treasurer: D. McLeod Local arrangments: M. Haynie Publication: All participants will be sent copies of the accepted papers prior to the meeting. A book containing revised papers and recorded dis- cussions (as far as justified by quality) may be published after the workshop. Important dates: Submission of manuscripts: April 25, 1986 Notification of acceptance: June 15, 1986 (early notification via electronic mail)June 3, 1986 Submission of papers for preconference distribution:July 10, 1986 Mode of submission: Please mail 7 copies of manuscript to: Umeshwar Dayal or Klaus Dittrich CCA FZI Four Cambridge Center Haid-und-Neu-Strasse 10-14 Cambridge, MA 02142 D-7500 Karlsruhe 1 USA Germany dayal@cca-unix.arpa dittrich@Germany.arpa Phone: +1 617/492-8860 Phone: +49 0721/69 06-0 Remember to include your electronic mail address for early notifi- cation. ------------------------------ Date: Tue, 18 Mar 86 4:28:51 EST From: "Dr. James Johannes" (UAH+ARO) Subject: Conference - US ARMY (ARO) AI WORKSHOP CALL FOR PARTICIPATION Future Directions in June 17-19, 1986 Artificial Intelligence Hyatt Regency Crystal City, VA Workshop Keynote Speaker: Sponsored by: Honorable Jay R. Sculley Computer Science Program Assistant Secretary of Army Army Research Office Research, Development & Acquisition Research Triangle Pk NC 27709-2211 You are invited to participate in the Workshop entitled "Future Directions in Artificial Intelligence" to be held from June 17 to June 19, 1986 at the Hyatt Regency - Crystal City, Virginia. Presentations will focus on both theoretical work and experi- mental results. Possible topics to be discussed include: o Military Expert Systems o Vision o Image Processing o Speech Technology o Machine Translation The workshop will involve invited overview papers, short presentations on specific subjects or projects, and discussion periods. Attendance will be limited to 100 participants with about equal representation among military, academia, and industry. Each participant will be a recognized expert in at least one aspect of Artificial Intelligence. Four copies of a 400-2000 word summary should be submitted by the deadline to the Workshop Chairman. Some attendees will be invited to make a presentation on one of the workshop topics. A workshop proceedings will be published and will be mailed to all the attendees. Attendance limited to: 100 Presentation/participation Request due by: April 25, 1986 Notification of participation acceptance by: May 9, 1986 Camera-ready papers due by: June 5, 1986 Workshop Chairman: ARO Representative: Prof. James D. Johannes Dr. C. Ronald Green Computer Science Army Research Office The University of Alabama in Huntsville P.O. Box 12211 Huntsville, AL 35899 Research Triangle Pk. Tel: (205) 895-6255/6088 NC, 27709-2211 uucp: akgua!uahcs1!johannes Tel: (919) 549-0641 arpanet: johannes@brl arpanet: green@brl Application for presentation/participation: (Due by April 25, 1986) Name: Dr/Mr/Ms/Miss/Mrs ________________________________________ Address: _______________________________________________________ _______________________________________________________ Telephone number: (_____)_______ - __________ E-Mail(arpanet/uucp)_________________________ Name of the Government Agency, University, or Company: PROPOSED PRESENTATION INFORMATION (include 400-2000 word summary) Topic area: ( ) Military Expert Systems ( ) Vision ( ) Image Processing ( ) Speech ( ) Machine Translation ( ) Other - Specify _______ Overall presentation category: ( ) Theoretical ( ) Experimental ( ) Tutorial ( ) Applied Research ( ) Others Military Application Area: Title of proposed presentation: PROPOSED ATTENDEE INFORMATION Topic area: ( ) Military Expert Systems ( ) Vision ( ) Image Processing ( ) Speech ( ) Machine Translation ( ) Other - Specify _______ Past Accomplishments in the Artificial Intelligence areas: ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 11:36:34 1986 Date: Thu, 17 Apr 86 11:36:30 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #60 Status: RO Received: From WISCVM(SMTPUSR2) by VTCS1 with RSCS id 2149 for FOX@VTCS1; Thu, 17-APR-1986 11:38 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 08:15:29 CST Mail-From: LAWS created at 19-Mar-86 10:42:08 Date: Wed 19 Mar 1986 10:39-PST 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 V4 #60 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:42-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Wednesday, 19 Mar 1986 Volume 4 : Issue 60 Today's Topics: Project Description & New Publication - CSLI Monthly, Seminar Series - Computer Science Open House (SUNY Buffalo) ---------------------------------------------------------------------- Date: Tue 18 Mar 86 15:59:11-PST From: Emma Pease Subject: CSLI Monthly, part I C S L I M O N T H L Y March 15, 1986 Stanford Vol. 1, No. 1 A monthly publication of The Center for the Study of Language and Information, Ventura Hall, Stanford University, Stanford, CA 94305 Editor's note This is the first issue of CSLI's monthly report of research activities. This issue introduces CSLI and then characterizes each of its current research projects; following issues will report on individual projects in more detail and discuss some of the research questions raised here. What is CSLI? CSLI is a research institute devoted to building theories about the nature of information and how it is conveyed, processed, stored, and transformed through the use of language and in computation. Researchers include computer scientists, linguists, philosophers, psychologists, and workers in artificial intelligence from several San Francisco Bay Area institutions as well as graduate students, postdoctoral fellows, and visiting scholars from around the world. [...] [The full description of the institute and its projects would take four AIList digests. I am forwarding this fragment of the new monthly so that those who might be interested can request copies. -- KIL] ------------------------------ Date: Mon, 17 Mar 86 14:00:51 EST From: "William J. Rapaport" Subject: Seminar Series - Computer Science Open House (SUNY Buffalo) STATE UNIVERSITY OF NEW YORK AT BUFFALO DEPARTMENT OF COMPUTER SCIENCE GRADUATE STUDENT OPEN HOUSE On Thursday, March 20, 1986, the graduate students of the SUNY Buffalo Dept. of Computer Science will be presenting an all-day conference on their recent research (most of which is on AI). A tech report with extended abstracts will be available; for further information, contact James Geller (geller%buffalo@csnet-relay). ABSTRACTS OF TALKS 9:00 - 9:30 JON HULL, A Theory of Hypothesis Generation in Visual Word Recognition An algorithm is presented that generates hypotheses about the identity of a word of text from its image. This algorithm is part of an effort to develop techniques for reading images of text that possess the human capability to adapt to variations in fonts, scripts, etc. This methodology is being pursued by using knowledge about the human reading process to direct the development of algorithms for reading text. The algorithm discussed in this talk locates a set of hypotheses about the identity of an input word (called the neighborhood of the input word). Results are reported in this talk on the size of neighborhoods for words printed in lower case that are drawn from a large text. Several statistical measures are computed from subsets of a text of over 1,000,000 words and their corresponding dictionaries. These results show that the average neighborhood in the dictionary of the entire text contains only 2.5 words. The feasibilty of this method is also shown by experimentation with a database of lower case word images. The application of this approach to 8700 word images taken from 29 different fonts, in three conditions of noise, shows that the correct neighborhood is determined in 80% to 100% of all cases. 9:30 - 10:00 GEORGE SICHERMAN, Databases that Refuse to Answer Queries Question-answering systems must often keep certain information secret. One way they can do this is by refusing to answer some queries. But if the user may be able to deduce information from the system's refusal to answer, the secrecy of the information is broken. In this talk I present a categorization of answer-refusing systems according to what they know, what the user knows, and when the system refuses to answer. I also give two formal results about when the user can deduce secrets from the system's refusals to answer, depending on how much she knows about the system. 10:00 - 10:30 JANYCE WIEBE, Understanding De Re and De Dicto Belief Reports in Discourse and Narrative Belief reports can be interpreted "de re" or "de dicto", and we investigate the disambiguation of belief reports as they appear in discourse and narrative. In earlier work by Rapaport and Shapiro [1984], representations for "de re" and "de dicto" belief reports were presented, and the distinction between them was made solely on the basis of their representations. This analysis is sufficient only when belief reports are considered in isolation. We need to consider more complicated belief structures in order to sufficiently represent "de re" and "de dicto" belief reports as they appear in discourse and narrative. Further, we cannot meaningfully apply one, but not the other, of the concepts "de re" and "de dicto" to these more complicated belief structures. We argue that the concepts "de re" and "de dicto" apply not to an agent's conceptual representation of her beliefs, but to the utterance of a belief report on a specific occasion. A cognitive agent interprets a belief report such as `` S believes that N is F '', or `` S said, ` N is F ' '' (where S and N are names or descriptions, and F is an adjective) "de dicto" if she interprets it from N 's perspective, and "de re" if from her own. 10:45 - 11:15 MINGRUEY TAIE, Device Representation Using Instantiation Rules and Structural Templates A device representation scheme for automatic electronic device fault diagnosis is described. Structural and functional descriptions of devices (which are central to design-model-based fault diagnosis) are represented as instantiation rules and structural templates in a semantic network. Device structure is represented hierarchically to reflect the design model of most devices in the domain. Each object of the device hierarchy has the form of a module. Instead of representing all objects explicitly, an expandable component library is maintained, and objects are instantiated only when needed. The component library consists of descriptions of component "types" used to construct devices at all hierarchical levels. Each component "type" is represented as an instantiation rule and a structural template. The instantiation rule is used to instantiate an object of the component "type" as a module with I/O ports and associated functional descriptions. Functional description is represented as procedural attachments to the semantic network; this allows the simulation of the behavior of objects. Structural templates describe sub-parts and wire connections at the next lower hierarchical level of the component "type". Advantages of the representation scheme are compactness and reasoning efficiency. 11:15 - 11:45 JAMES GELLER, Towards a Theory of Visual Reasoning Visual Knowledge Representation has not yet found the treatment it deserves as its own subfield of AI. Visual reasoning is fundamentally different from predicate calculus type logical reasoning and is of central importance for the field of Visual Knowledge Representation. A systematization of different types of visual reasoning requires the differentiation between purely geometrical reasoning and different types of knowledge-based reasoning. Knowledge-based reasoning in turn can use knowledge about the world, knowledge about abstract hierarchies, or knowledge about normality. Research on visual knowledge is directly applicable to graphics interface design for intelligent systems. The VMES maintenance expert system for circuit board repair uses such a user interface which is designed in analogy to a language generation program. 1:15 - 1:45 MICHAEL ALMEIDA, The Temporal Structure of Narratives Narratives are a type of discourse used to describe sequences of events. In order to understand a narrative, a reader must be able to extract the ``story'', that is, the described events and the temporal relations which hold between them, from the text. Our principle research goal has been to develop a system which can read a narrative and produce a model of the temporal structure of its story. The principle heuristic used in constructing such a model is the Narrative Convention: unless we are given some signal to the contrary, we assume that the events of the story occurred in the order in which they are presented in the text. In addition, however, a reader must deal with: (1) tense - in a standard past tense narrative the principle distinction is between the past and the past perfect tenses, (2) aspect - the distinction between events viewed perfectively or imperfectively, (3) aspectual class - the intrinsic temporal properties of various types of events, (4) time adverbials - these can be used to place events within various calendrical intervals, give their durations, or relate them directly to other events, and to some extent (5) world-knowledge. 1:45 - 2:15 WEI-HSING WANG, A Uniform Knowledge Representation for Intelligent CAI Systems In examining the current situation of Computer Aided Instruction (CAI), we find that Intelligent CAI (ICAI) and its authoring system are necessary. By studying the knowledge representation methods and expert system concepts, we choose a frame representation method to construct an Intelligent Tutor, called ITES. We show that a frame can be used to represent knowledge in semantic nets, procedures and production rules. Furthermore, this method is very convenient in authoring system creation. 2:15 - 2:45 RICK LIVELY, Semantics for Abstract Data Types An abstract data type is often defined as a pair < A , S >, where A is a set (of objects) and S is a set of operations defined on cartesian products of the types of the objects. Axiomatic methods are used to develop specifications for the defined data type. Semantics for abstract data types have been treated by Adj using initial algebras, and by Janssen (inspired by Montague semantics) using many-sorted algebras. A comparison is made of the mathematical properties and applicability to computer science of these approaches. 3:00 - 3:30 SCOTT CAMPBELL, Using Belief Revision to Detect Faults in Circuits To detect faults in electrical circuits, programs must be able to reason about whether the observed inputs and outputs are consistent with the desired function of the circuit. The SNePS Belief Revision System (SNeBR) is designed to reason about the consistency of rules and hypotheses defined within a particular context or belief space. This paper shows how belief revision can be used for fault detection in circuits, and so leads to a unification of the fields of belief revision (also known as truth maintenance) and fault detection. 3:30 - 4:00 DOUGLAS H. MacFADDEN, DUNE: A Demon Based Expert System Architecture for Complex and Incompletely Defined Domains Traditional expert system architectures use the rule (an `` if ... then '' data structure) as the primary unit of knowledge. The primary unit of knowledge in the DUNE system architecture is the demon. Each DUNE demon is an individual processing element that can contain a variety of types of data and can perform a variety of operations on its data. Each demon can communicate with any other demon or with the user via messages. Typical data for these demons may be a traditional type rule, a list of weight values for the features in the left-hand-side of the rule, an (English) description of each feature, a list of related demons, etc. Typical operations that these demons may perform are: calculating the ``closeness'' of the rule to firing, calculating the most important feature of the rule yet to be resolved, telling the system to not consider this demon anymore (entering a sleep state), telling other demons (and the user) that the demon is either satisfied or will never be satisfied, etc. We hope to show that these features of DUNE demons can be exploited to express the knowledge of many expert domains that have proven unfeasible to traditional expert system architectures. 4:00 - 4:30 JOYCE DANIELS, Understanding Time and Space in Narrative Text The Graduate Group in Cognitive Science at SUNY at Buffalo is an interdisciplinary group of faculty and graduate students. Participants in the group's activities come from over seventeen departments within the university and local colleges in Western New York and Canada. There are six core faculty and their graduate students, comprising a standing research group investigating how we understand movement through time and space in narrative text. This research addresses both the general issue of how time and space are expressed in language, and specific individual disciplinary interests such as identifying the exact lexical items signaling movement; developing experiments to collect data on the psychological validity of the supposed influence of suspected lexical items; examining the problems encountered by speech pathologists when a client cannot understand spatial or temporal concepts in language; and artificial intelligence program models of human and linguistic data on the SNePS network. Research conducted by group members has resulted in the identification of what we term the ``Deictic Center'' (DC). This contains a WHO-point, a WHEN-point, and a WHERE-point. It is the locus of a particular point in conceptual space-time. We will explain the significance of the DC concept in greater detail. and present some results of our linguistic and psychological investigation. ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 11:42:01 1986 Date: Thu, 17 Apr 86 11:41:55 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #61 Status: RO Received: From WISCVM(SMTPUSER) by VTCS1 with RSCS id 2208 for FOX@VTCS1; Thu, 17-APR-1986 11:43 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 08:16:34 CST Mail-From: LAWS created at 20-Mar-86 15:01:50 Date: Thu 20 Mar 1986 14:58-PST 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 V4 #61 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:46-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Friday, 21 Mar 1986 Volume 4 : Issue 61 Today's Topics: Publications - Japanese Technical Reports ---------------------------------------------------------------------- Date: Wed, 19 Mar 86 19:38:21 pst From: eugene@AMES-NAS.ARPA (Eugene Miya) Subject: New Japanese Technical Reports at Stanford Richard Manuck of the Stanford Math/CS library and I are soliciting parties interested in helping to foot the cost of translating some technical reports from ICOT. The list is included below, and several are in English. Many unlisted reports have come (150 total) which do not even have their titles translated. We are seeking organizations in the San Francisco Area who might be interested in footing the cost of translation of some of these reports. The cost will run between $50-100 per hour (not cheap). Demand for this service is high. Richard and I are seeking either an organization (perhaps H-P?) to do the work, or help pay for the work. The content of the reports vary considerably from statements of requirements and highly technical documents. Several appear, on loose translation, to be "interesting." Please contact me if your organization can help. --eugene miya NASA Ames Research Center eugene@ames-nas {decwrl,ihnp4,hao,menlo70,allegra,hplabs,riacs,tektronix}!ames!eugene UUCP STANFORD UNIVERSITY MATH & COMPUTER SCIENCE LIBRARY NEW Japanese REPORTS LIST 102667 SEVERAL ASPECTS ON UNIFICATION. T. Adachi et al. [Institute for New Generation Computer Technology (ICOT). TM-0046. 1984.] 102671 OBJECT ORIENTED PARSER IN THE LOGIC PROGRAMMING LANGUAGE ESP. H. Miyoshi and K. Furukawa. [Institute for New Generation Computer Technology (ICOT). TM-0053. 1984.] 102673 UNIQUE FEATURES OF ESP. T. Chikayama. [Institute for New Generation Computer Technology (ICOT). TM-0055. 1984.] 102674 A CONSTRAINT BASED DYNAMIC SEMANTIC MODEL FOR LOGIC DATABASES. T. Miyachi et al. [Institute for New Generation Computer Technology (ICOT). TM-0056. 1984.] 102675 WRITING IN A FOREIGN LANGUAGE AND PROGRAMMING IN WARNIER'S METHODOLOGY - A STUDY OF PROGRAMMING PROCESSES. A. Taguchi. [Institute for New Generation Computer Technology (ICOT). TM-0057. 1984.] 102676 MAID: A MAN-MACHINE INTERFACE FOR DOMESTIC AFFAIRS. S. Hiroyuki. [Institute for New Generation Computer Technology (ICOT). TM-0058. 1984.] 102677 PROBLEMS IN DEVELOPING AN EXPERIMENTAL SYSTEM ABLE TO REUSE EXISTING PROGRAMS. Y. Nagai, E. Chigira, and M. Kobayashi. [Institute for New Generation Computer Technology (ICOT). TM-0059. 1984.] 102683 AN OPERATING SYSTEM FOR SEQUENTIAL INFERENCE MACHINE PSI. T. Hattori et al. [Institute for New Generation Computer Technology (ICOT). TM-0065. 1984.] 102690 SYNTACTIC PARSING WITH POPS - ITS PARSING TIME ORDER AND THE COMPARISON WITH OTHER SYSTEMS. H. Hirakawa and K. Furukawa. [Institute for New Generation Computer Technology (ICOT). TM-0073. 1984.] 102691 PROGRESS IN THE INITIAL STAGE OF THE FGCS PROJECT. K. Takei. [Institute for New Generation Computer Technology (ICOT). TM-0074. 1984.] 102694 A PERSONAL PERSPECTIVE ON SOME ASPECTS OF THE FGCS - PRELIMINARY CONSIDERATIONS FOR FIFTH-GENERATION-COMPUTER NETWORKS. A. Taguchi. [Institute for New Generation Computer Technology (ICOT). TM-0077. 1984.] 102699 WIRING DESIGN EXPERT SYSTEM FOR VLSI: WIREX. H. Mori et al. [Institute for New Generation Computer Technology (ICOT). TM-0083. 1984.] 102700 GDLO: A GRAMMAR DESCRIPTION LANGUAGE BASED ON DCG. T. Morishita and H. Hirakawa. [Institute for New Generation Computer Technology (ICOT). TM-0084. 1984.] 102701 DELTA DEMONSTRATION AT ICOT OPEN HOUSE. K. Murakami et al. [Institute for New Generation Computer Technology (ICOT). TM-0085. 1984.] 102702 THE BOYER-MOORE THEOREM PROVER IN PROLOG. USER'S MANUAL. [Institute for New Generation Computer Technology (ICOT). TM-0086. 1984. V3.6, November 1984.] 102703 KNUTH-BENDIX ALGORITHM FOR THUE SYSTEM BASED ON KACHINUKI ORDERING. K. Sakai. [Institute for New Generation Computer Technology (ICOT). TM-0087. 1984.] 102707 SOURCE-LEVEL OPTIMIZATION TECHNIQUES FOR PROLOG. H. Sawamura, T. Takeshima, and A. Kato. [Institute for New Generation Computer Technology (ICOT). TM-0091. 1985.] 102710 PROTOTYPING A DIALOGING SYSTEM WITH A TOPIC MANAGEMENT FUNCTION. T. Miyachi et al. [Institute for New Generation Computer Technology (ICOT). TM-0094. 1985.] 102711 CONSTRAINT-BASED LOGIC DATABASE MANAGEMENT: STRUCTURING META-KNOWLEDGE IN DATABASE MANAGEMENT. T. Miyachi et al. [Institute for New Generation Computer Technology (ICOT). TM-0095. 1985.] 102713 SOME CONSIDERATIONS ON ESSENTIAL REQUIREMENTS OF INTELLIGENT HUMAN INTERFACES. A. Taguchi. [Institute for New Generation Computer Technology (ICOT). TM-0097. 1985.] 102715 SOME ASPECTS OF FUTURE KNOWLEDGE-COMMUNICATION NETWORKS AS INFRASTRUCTURE FOR FIFTH GENERATION COMPUTERS. A. Taguchi. [Institute for New Generation Computer Technology (ICOT). TM-0099. 1985.] 102716 CONSTRUCTING THE SIMPOS SUPERVISOR IN AN OBJECT-ORIENTED APPROACH. T. Hattori, N. Yoshida, and T. Fujisaki. [Institute for New Generation Computer Technology (ICOT). TM-0100. 1985.] 102717 SOME EXPERIMENTS ON EKL. M. Hagiya and S. Hayashi. [Institute for New Generation Computer Technology (ICOT). TM-0101. 1985.] 102719 SOME ASPECTS OF GENERALIZED PHRASE STRUCTURE GRAMMAR. S. Amano et al. [Institute for New Generation Computer Technology (ICOT). TM-0103. 1985.] 102721 DESIGN OF A HIGH-SPEED PROLOG MACHINE (HPM). R. Nakazaki et al. [Institute for New Generation Computer Technology (ICOT). TM-0105. 1985.] 102725 WIREX: VSLI WIRING DESIGN EXPERT SYSTEM. H. Mori et al. [Institute for New Generation Computer Technology (ICOT). TM-0109. 1985.] 102728 PSI FONT EDITOR USER GUIDE. H. Touati. [Institute for New Generation Computer Technology (ICOT). TM-0112. 1985.] 102731 PSI FONT EDITOR IMPLEMENTATION NOTES. H. Touati. [Institute for New Generation Computer Technology (ICOT). TM-0115. 1985.] 102762 SOME COMMENTS ON SEMANTICAL DISK CACHE MANAGEMENT FOR KNOWLEDGE BASE SYSTEMS. H. Schweppe. [Institute for New Generation Computer Technology (ICOT). TR-040. 1984.] 102763 [SIMULATOR OF XP'S] M. Aso. [Institute for New Generation Computer Technology (ICOT). TR-041. 1984. IN JAPANESE. English abstract.] 102764 AN APPROACH TO A PARALLEL INFERENCE MACHINE BASED ON CONTROL-DRIVEN AND DATA-DRIVEN MECHANISMS. R. Onai, M. Asou, and A. Takeuchi. [Institute for New Generation Computer Technology (ICOT). TR-042. 1984.] 102765 [MANDALA: KNOWLEDGE PROGRAMMING SYSTEM ON LOGIC PROGRAMMING LANGUAGE] K. Furukawa, A. Takeuchi, and S. Kunifuji. [Institute for New Generation Computer Technology (ICOT). TR-043. 1984. IN JAPANESE. English abstract.] 102766 ESP REFERENCE MANUAL. T. Chikayama. [Institute for New Generation Computer Technology (ICOT). TR-044. 1984.] 102767 THE DESIGN AND IMPLEMENTATION OF A PERSONAL SEQUENTIAL INFERENCE MACHINE: PSI. M. Yokota et al. [Institute for New Generation Computer Technology (ICOT). TR-045. 1984.] 102768 DIALOGUE MANAGEMENT IN THE PERSONAL SEQUENTIAL INFERENCE MACHINE (PSI). J. Tsuji et al. [Institute for New Generation Computer Technology (ICOT). TR-046. 1984.] 102769 [PROLOG SOURCE LEVEL OPTIMIZER: CATALOGUE OF OPTIMIZATION METHODOLOGY] H. Sawamura. [Institute for New Generation Computer Technology (ICOT). TR-047. 1984. IN JAPANESE. No English abstract. By H. Sawamura et al.] 102770 [ANALYSIS OF SEQUENTIAL PROLOG PROGRAM] R. Onai. [Institute for New Generation Computer Technology (ICOT). TR-048. 1984. IN JAPANESE. No English abstract. By R. Onai et al.] 102771 [META-INFERENCE AND ITS APPLICATION IN A LOGIC PROGRAMMING LANGUAGE] S. Kunifuji et al. [Institute for New Generation Computer Technology (ICOT). TR-049. 1984. IN JAPANESES. No English abstract.] 102772 [ARCHITECTURE OF DATAFLOW PARALLEL INFERENCE MACHINE] T. Ito. [Institute for New Generation Computer Technology (ICOT). TR-050. 1984. IN JAPANESE. No English abstract. By T. Ito et al.] 102773 [SOFTWARE DEVELOPMENT SUPPORTING SYSTEM] M. Sugimoto. [Institute for New Generation Computer Technology (ICOT). TR-051. 1984. IN JAPANESE. No English abstract.] 102774 [HARDWARE DESIGN OF PERSONAL SEQUENTIAL INFERENCE MACHINE] K. Taki. [Institute for New Generation Computer Technology (ICOT). TR-052. 1984. IN JAPANESE. No English abstract. By K. Taki et al.] 102775 A RELATIONAL DATABASE MACHINE WITH LARGE SEMICONDUCTOR DISK AND HARDWARE RELATIONAL ALGEBRA PROCESSOR. S. Shibayama et al. [Institute for New Generation Computer Technology (ICOT). TR-053. 1984.] 102776 [THE CONCEPTUAL SPECIFICATION OF THE KERNEL LANGUAGE, VERSION 1] K. Furukawa et al. [Institute for New Generation Computer Technology (ICOT). TR-054. 1984. IN JAPANESE. No English abstract.] 102777 SIMPOS: AN OPERATING SYSTEM FOR A PERSONAL PROLOG MACHINE PSI. T. Hattori, J. Tsuji, and T. Yokoi. [Institute for New Generation Computer Technology (ICOT). TR-055. 1984.] 102778 THE CONCEPTS AND FACILITIES OF SIMPOS SUPERVISOR. T. Hattori and T. Yokoi. [Institute for New Generation Computer Technology (ICOT). TR-056. 1984.] 102779 OVERALL DESIGN OF SIMPOS (SEQUENTIAL INFERENCE MACHINE PROGRAMMING AND OPERATING SYSTEM). S. Takagi et al. [Institute for New Generation Computer Technology (ICOT). TR-057. 1984.] 102780 PROLOG-BASED EXPERT SYSTEM FOR LOGIC DESIGN. F. Maruyama et al. [Institute for New Generation Computer Technology (ICOT). TR-058. 1984.] 102781 THE CONCEPTS AND FACILITIES OF SIMPOS FILE SYSTEM. T. Hattori and T. Yokoi. [Institute for New Generation Computer Technology (ICOT). TR-059. 1984.] 102782 A NOTE ON THE SET ABSTRACTION IN LOGIC PROGRAMMING LANGUAGE. T. Yokomori. [Institute for New Generation Computer Technology (ICOT). TR-060. 1984.] 102783 COORDINATOR - THE KERNEL OF THE PROGRAMMING SYSTEM FOR THE PERSONAL SEQUENTIAL INFERENCE MACHINE (PSI). T. Kurokawa and S. Tojo. [Institute for New Generation Computer Technology (ICOT). TR-061. 1984.] 102784 AN ORDERING METHOD FOR TERM REWRITING SYSTEMS. K. Sakai. [Institute for New Generation Computer Technology (ICOT). TR-062. 1984.] 102785 DESIGN AND IMPLEMENTATION OF THE RELATIONAL DATABASE ENGINE. H. Sakai et al. [Institute for New Generation Computer Technology (ICOT). TR-063. 1984.] 102786 QUERY PROCESSING FLOW ON RDBM DELTA'S FUNCTIONALLY-DISTRIBUTED ARCHITECTURE. S. Shibayama et al. [Institute for New Generation Computer Technology (ICOT). TR-064. 1984.] 102787 EFFICIENT STREAM/ARRAY PROCESSING IN LOGIC PROGRAMMING LANGUAGE. K. Ueda and T. Chikayama. [Institute for New Generation Computer Technology (ICOT). TR-065. 1984.] 102788 DESIGN AND IMPLEMENTATION OF A TWO-WAY MERGE-SORTER AND ITS APPLICATION TO RELATIONAL DATABASE PROCESSING. K. Iwata et al. [Institute for New Generation Computer Technology (ICOT). TR-066. 1984.] 102789 NATURAL LANGUAGE BASED SOFTWARE DEVELOPMENT SYSTEM TELL. H. Enomoto et al. [Institute for New Generation Computer Technology (ICOT). TR-067. 1984.] 102790 FORMAL SPECIFICATION AND VERIFICATION FOR CONCURRENT SYSTEMS BY TELL. H. Enomoto et al. [Institute for New Generation Computer Technology (ICOT). TR-068. 1984.] 102791 [KNOWLEDGE REPRESENTATION (FOR WG4 WORKSHOP '83)] F. Mizoguchi and K. Furukawa. [Institute for New Generation Computer Technology (ICOT). TR-070. 1984. IN JAPANESE. No English abstract. Edited by F. Mizoguchi and K. Furukawa.] 102792 DESIGN CONCEPT FOR A SOFTWARE DEVELOPMENT CONSULTATION SYSTEM. M. Sugimoto, H. Kato, and H. Yoshida. [Institute for New Generation Computer Technology (ICOT). TR-071. 1984.] 102793 COMPARISON OF CLOSURE REDUCTION AND COMBINATORY REDUCTION SCHEMES. T. Ida and A. Konagaya. [Institute for New Generation Computer Technology (ICOT). TR-072. 1984.] 102794 [APPROACH TO TRANSLATION IN MORE NATURAL WAY (1)] H. Tanaka. [Institute for New Generation Computer Technology (ICOT). TR-073. 1984. IN JAPANESE. No English abstract. By H. Tanaka et al.] 102795 AN OVERVIEW OF RELATIONAL DATABASE MACHINE DELTA. N. Miyazaki et al. [Institute for New Generation Computer Technology (ICOT). TR-074. 1984.] 102796 HARDWARE DESIGN AND IMPLEMENTATION OF THE PERSONAL SEQUENTIAL INFERENCE MACHINE (PSI). K. Taki et al. [Institute for New Generation Computer Technology (ICOT). TR-075. 1984.] 102797 MANDALA: A LOGIC BASED KNOWLEDGE PROGRAMMING SYSTEM. K. Furukawa et al. [Institute for New Generation Computer Technology (ICOT). TR-076. 1984.] 102798 [PARALLEL INFERENCE MACHINE PIM-R: ITS ARCHITECURE AND SOFTWARE SIMULATION] R. Onai. [Institute for New Generation Computer Technology (ICOT). TR-077. 1984. IN JAPANESE. No English abstract. By R. Onai et al.] 102799 [PLAN FOR CONSTRUCTING KNOWLEDGE ARCHITECTURE] H. Kondou. [Institute for New Generation Computer Technology (ICOT). TR-078. 1984. IN JAPANESE. No English abstract.] 102800 [A MICROPROGRAMMED INTERPRETER FOR THE PERSONAL SEQUENTIAL INFERENCE MACHINE PSI] A. Yamamoto. [Institute for New Generation Computer Technology (ICOT). TR-079. 1984. IN JAPANESE. No English abstract. By A. Yamamoto et al.] 102801 [THE DEVELOPMENT OF EXPERIMENTAL QA-SYSTEMS ON SITUATION SEMANTICS] T. Kato. [Institute for New Generation Computer Technology (ICOT). TR-080. 1984. IN JAPANESE. No English abstract.] 102802 [THE COMPOUND LOCAL AREA NETWORK INI - ITS PHYSICAL NETWORK CONFIGURATION AND CHARACTERISTICS OF PHYSICAL LAYER PROTOCOLS] A. Taguchi. [Institute for New Generation Computer Technology (ICOT). TR-081. 1984. IN JAPANESE. No English abstract. By A. Taguchi et al.] 102803 CURRENT STATUS AND FUTURE PLANS OF THE FIFTH GENERATION COMPUTER SYSTEMS PROJECT. K. Kawanobe. [Institute for New Generation Computer Technology (ICOT). TR-083. 1984.] 102804 ARCHITECTURES AND HARDWARE SYSTEMS: PARALLEL INFERENCE MACHINE AND KNOWLEDGE BASE MACHINE. K. Murakami, T. Kakuta, and R. Onai. [Institute for New Generation Computer Technology (ICOT). TR-084. 1984.] 102805 BASIC SOFTWARE SYSTEM. K. Furukawa and T. Yokoi. [Institute for New Generation Computer Technology (ICOT). TR-085. 1984.] 102806 SEQUENTIAL INFERENCE MACHINE: SIM PROGRESS REPORT. S. Uchida and T. Yokoi. [Institute for New Generation Computer Technology (ICOT). TR-086. 1984.] 102807 SEQUENTIAL INFERENCE MACHINE: SIM - ITS PROGRAMMING AND OPERATING SYSTEM. T. Yokoi and S. Uchida. [Institute for New Generation Computer Technology (ICOT). TR-087. 1984.] 102808 RECURSIVE UNSOLVABILITY OF DETERMINACY, SOLVABLE CASES OF DETERMINACY AND THEIR APPLICATIONS TO PROLOG OPTIMIZATION. H. Sawamura and T. Takeshima. [Institute for New Generation Computer Technology (ICOT). TR-088. 1984.] 102809 THE DESIGN AND IMPLEMENTATION OF RELATIONAL DATABASE MACHINE DELTA. T. Kakuta et al. [Institute for New Generation Computer Technology (ICOT). TR-089. 1984.] 102810 A SEQUENTIAL IMPLEMENTATION OF CONCURRENCT PROLOG BASED ON THE SHALLOW BINDING SCHEME. T. Miyazaki, A. Takeuchi, and T. Chikayama. [Institute for New Generation Computer Technology (ICOT). TR-090. 1984.] 102811 CONCURRENT PROLOG ON TOP OF PROLOG. K. Ueda and T. Chikayama. [Institute for New Generation Computer Technology (ICOT). TR-092. 1984.] 102812 OCCAM TO CMOS EXPERIMENTAL LOGIC DESIGN SUPPORT SYSTEM. T. Mano et al. [Institute for New Generation Computer Technology (ICOT). TR-093. 1984.] 102813 FORMULATION OF INDUCTION FORMULAS IN VERIFICATION OF PROLOG PROGRAMS. T. Kanamori and H. Fujita. [Institute for New Generation Computer Technology (ICOT). TR-094. 1984.] 102814 TYPE INFERENCE IN PROLOG AND ITS APPLICATIONS. T. Kanamori and K. Horiuchi. [Institute for New Generation Computer Technology (ICOT). TR-095. 1984.] 102815 VERIFICATION OF PROLOG PROGRAMS USING AN EXTENSION OF EXECUTION. T. Kanamori and H. Seki. [Institute for New Generation Computer Technology (ICOT). TR-096. 1984.] 102816 PRINCIPLES OF OBJ2. J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. [Institute for New Generation Computer Technology (ICOT). TR-097. 1984.] 102817 LOGIC DESIGN: ISSUES IN BUILDING KNOWLEDGE-BASED DESIGN SYSTEMS. F. Maruyama et al. [Institute for New Generation Computer Technology (ICOT). TR-098. 1984.] 102818 DATA-FLOW BASED EXECUTION MECHANISMS OF PARALLEL AND CONCURRENT PROLOG. N. Ito et al. [Institute for New Generation Computer Technology (ICOT). TR-099. 1984.] 102819 HORN CLAUSE LOGIC WITH PARAMETERIZED TYPES FOR SITUATION SEMANTICS PROGRAMMING. K. Mukai. [Institute for New Generation Computer Technology (ICOT). TR-101. 1985.] 102820 TOWARDS AUTOMATED SYNTHETIC DIFFERENTIAL GEOMETRY 1 - BASIC CATEGORICAL CONSTRUCTION. S. Hayashi. [Institute for New Generation Computer Technology (ICOT). TR-104. 1985.] 102821 ARCHITECTURE OF REDUCTION-BASED PARALLEL INFERENCE MACHINE: PIM-R. R. Onai et al. [Institute for New Generation Computer Technology (ICOT). TR-105. 1985.] 102822 [OPERATION MANUAL FOR QUTE PROCESSOR] T. Sakurai and M. Fujita. [Institute for New Generation Computer Technology (ICOT). TR-106. 1985. IN JAPANESE. No English abstract.] 102823 [FOUNDATIONS AND APPLICATIONS OF KNOWLEDGE ENGINEERING: PROLOG-BASED KNOWLEDGE BASE MANAGEMENT] S. Kunifuji et al. [Institute for New Generation Computer Technology (ICOT). TR-107. 1985. IN JAPANESE. No English abstract.] Many more only in the Kanji and Kana. ------------------------------ End of AIList Digest ******************** From vtcs1::bitnet% Thu Apr 17 15:12:12 1986 Date: Thu, 17 Apr 86 15:12:09 est From: vtcs1::bitnet% (AIList-REQUEST@SRI-AI) To: fox Subject: AIList Digest V4 #62 Status: RO Received: From WISCVM(SMTPUSR1) by VTCS1 with RSCS id 3866 for FOX@VTCS1; Thu, 17-APR-1986 15:14 EST Received: from SRI-AI.ARPA by wiscvm.wisc.edu on 04/17/86 at 09:40:53 CST Mail-From: LAWS created at 20-Mar-86 15:08:32 Date: Thu 20 Mar 1986 15:06-PST 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 V4 #62 To: AIList@SRI-AI ReSent-date: Wed 16 Apr 86 21:54:48-PST ReSent-From: Ken Laws ReSent-To: fox%vtcs1.bitnet@WISCVM.WISC.EDU AIList Digest Friday, 21 Mar 1986 Volume 4 : Issue 62 Today's Topics: Publications - Prolog Books & Prolog Tutorial Software, Comment - Uses of FORTRAN, Theory : Turing Test & Computer Intelligence ---------------------------------------------------------------------- Date: Thu, 20 Mar 86 13:47:46 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: Re: PROLOG Books ``Start Problem Solving with PROLOG" by Tom Conlon. Published in 1985 by Addison-Wesley, Wokingham, U.K. ISBN 0-201-18270-X. This book uses micro-PROLOG (available for Sinclair Spectrum/(Timex 2000?) and IBM PC, for example). It includes many examples and complete programs, one, for example, for playing Tic-Tac-Toe. Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ Date: 17 Mar 86 02:50:44 GMT From: ulysses!burl!clyde!watmath!utzoo!utcsri!utai!uthub!utecfa!logicwa @ucbvax.berkeley.edu (Logicware) Subject: new Prolog textbook/tutorial software Readers may be interested in a new Prolog textbook and tutorial software that myself and two colleagues have put together. The package is called: The MPROLOG Primer The book --- A Primer for Logic Programming --- is a 500 page textbook (18 chapters) with many example programs that are fully explained. The tutorial software --- MTUTOR --- contains 9 tutorials on execution subjects (backtracking, recursion and so forth) and instruction in use of the built-in predicates. In addition, there is a "freeform" area where you can enter and test you own programs. The package is intended both as a general introduction to logic programming and to Prolog. It should be of interest to: -- anyone wanting an inexpensive introduction to Prolog -- anyone requiring an introductory textbook to teach Prolog -- anyone who is familiar with other Prologs but who want to make an assessment of MProlog before purchasing the language. The tutorial software which accompanies the book will run on the following machines: -- IBM PC/XT/AT (and compatibles) (512K needed) -- Tektronix 4404 -- VAX/VMS -- VAX/UNIX -- ISI and portings are currently underway for: -- SUN -- APOLLO Price of the package is 49.95 (US Funds) For more information send electronic mail or contact our customer service representative: Roger Walker, Logicware, 1000 Finch Ave. W. Suite 600, Toronto, Ontario, Canada, M3J 2V5 416-665-0022 Richard J. Young ------------------------------ Date: Thu, 20 Mar 86 13:50:20 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: Re: Future AI Language (Vol 4 # 57). Some AI packages soon could have interfaces to numerical code, particularly those in process control; expert systems will make decisions about a fault, then a simulation, written in FORTRAN, will be run to see if the fix will work. Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ Date: Thu, 20 Mar 86 11:59:30 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: More on Turing and the Turing test. >From AIList Vol 4 # 56 :- ``: he [Turing] designed it to be nothing more than a philosophical conversation-stopper.'' >From "Turing's Man : Western Culture in the Computer Age", by J. David Bolter :- `` It would be a machine that knew men and women better than they knew themselves. Turing was optimistic about the prospect of this supercomputer : " I believe that in about fifty years' time it will be plausible to programme computers ... to make them play the imitation game so well that an average interregator will not have more than a 70 per cent chance of making the right identification after five minutes of questioning" (Feigenbaum and Feldman, Computers and Thought, 19).'' Since this is not directly quoting from Turing's own work, it cannot be regarded as being the giving the true version of his own hopes for the test. Bolter continues in the next paragraph with :- `` The appeal of Turing's test is easy to understand. It offers an operational defintion of intelligence quite in the spirit of behavioral psychology in the postwar era. A programmer can measure success by statistics - the number of human subjects fooled by the machine.'' Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ Date: Thu, 20 Mar 86 13:49:26 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: More on IQ tests for Computers. ``How a pair of dull-witted programs can look like geniuses on I.Q. tests.'' This article appeared in the March issue of Scientific American in the Computer Recreations column of A.K.Dewdney which discusses the concept of an IQ test for computers, (cf Vol 3 # 164 et seq). He mentions the HI Q program of Marcel Feenstra, which solves problems of the "sequence completion" and "numerical analogies" types. This scores 160 on the corresponding parts of the IQ tests described by Hans J. Eysenck. Dewdney describes his own putative program SE Q. Dewdney paraphrases ``The Mismeasure of Man'' by Stephen J. Gould and says :- ``What it comes to is this: The traditional I.Q. test rests on the unstated assumption that intelligence, like strength, is a single quality of human physiology that can be measured by a graded series of tasks.'' So far, so good. He then quotes Gould directly :- `` Our brains are enormously complex computers''. Hmmm... getting a bit fishy. Finally, he says :- `` Does the score on the test measure the intelligence of the computer? If it does not, just how does one go about measuring the intelligence of a computer, whether it is made of silicon and plastic or carbon and tissue? The answer: Probably not by running some I.Q. program through a battery of tests.'' Two gripes with this. Who are the carbon/tissue *computers* he is talking about? Secondly, computers will never be "intelligent"; however software might *appear* intelligent in certain respects. Nuff said. Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj P.S. Funny, I thought the Answer was 42. `` The monkey spoke!'' - Zaphod Beeblebrox on Arthur Dent. ------------------------------ Date: Thu, 20 Mar 86 15:51:04 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: Future Ph.D. The worlds first Ph.D. to an AI system awarded today for PiQ's work in the field of ... The World Times, 2185. The Joka. ------------------------------ Date: Thu, 20 Mar 86 08:34:35 -0500 From: johnson Subject: Re: The Turing Test - A Third Quantisation? |Now, supposing a system has been built which "passes" the test. Why |not take the process one stage further? Why not try to design an |intelligent system which can decide whether *it* is talking to machine |or not? | |Gordon Joly |ARPA: gcj%qmc-ori@ucl-cs.arpa |UUCP: ...!ukc!qmc-cs!qmc-ori!gcj Let me get this straight, a human cannot distinguish machine M1 from another human, but machine M2 *can* distinguish M1 from a human. Will machines of type M2 then debate about whether it is possible for a human to be modified to pass the M2turing test? Alternatively, perhaps M2s should try to create M3 s.t. an M3 cannot be distinguished from a human by an M2, or how about an M4, which is a machine that an M2 cannot distinguish from an M1? But wait, how can an M2 be sure that an M4 is not simply a copy of an M1? Is some descendent of the turing test a test that which tries to infer the nature of the designer from the design? -johnson@UDEL.EDU ------------------------------ End of AIList Digest ******************** From vtcs1::in% Thu Mar 27 12:46:44 1986 Date: Thu, 27 Mar 86 12:46:38 est From: vtcs1::in% (LAWS%sri-ai.ARPA%relay.cs.net@vpi.CSNET) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #63 Status: R AIList Digest Wednesday, 26 Mar 1986 Volume 4 : Issue 63 Today's Topics: Seminars - Parallel OPS5 and Relational Algebraic Operators (UPenn) & Mental Representation of Bilinguals (BBN) & Cognitive Model of Ada-Based Development (SMU) & An Interactive Proof Editor (Edinburgh) & Graphical Access To Expert Systems (PARC) & Automatic Design of Graphical Presentations (SU), Conference - Expert Systems in Process Safety & Artificial Intelligence Impacts Forum ---------------------------------------------------------------------- Date: Wed, 19 Mar 86 21:25 EST From: Tim Finin Subject: Seminar - Parallel OPS5 and Relational Algebraic Operators (UPenn) Forwarded From: Glenda Kent on Wed 19 Mar 1986 at 9:52 OPS5 PRODUCTION SYSTEMS AND RELATIONAL ALGEBRAIC OPERATORS ON A MASSIVELY PARALLEL MACHINE Bruce K. Hillyer Columbia University AI production systems and relational database management systems exhibit complementary characteristics that suggest the possibility of a synergistic integration. One difficulty is that both types of systems execute relatively slowly. This talk discusses algorithms, performance analyses, and simulation results for the execution of database queries and production systems on a parallel machine called NON-VON. The results indicate that relational algebraic operations will be processed as fast as on special-purpose database architectures, with speedup linear in the size of the machine, and typical OPS5 production systems will fire more than 850 rules per second. Thursday, March 20, 1986 Room 216 - Moore School 3:00 p.m. - 4:30 p.m. ------------------------------ Date: 17 Mar 1986 07:55-EST From: Brad Goodman Subject: Seminar - Mental Representation of Bilinguals (BBN) [Forwarded from the MIT bboard by SASW@MIT-MC.] BBN Labs AI/Education Seminar Speaker: Prof. Molly Potter, MIT Title: The Mental Representation of Bilinguals Date: Friday, March 21st, 2:00pm Place: 2nd floor large conference room, BBN Labs, 10 Moulton Street, Cambridge Are the two lexicons of a bilingual directly interconnected, or connected via only a common, nonlexical concept? Two experiments on that question will be discussed, one with novice bilinguals and one with expert bilinguals (Potter, So, von Eckardt and Feldman, 1984). Related issues concerning mental representation in bilinguals will be raised for general discussion. ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET%WISCVM.WISC.EDU%relay.cs.net@vtcs.csnet Subject: Seminar - Cognitive Model of Ada-Based Development (SMU) Computer Science and Engineering Seminar Toward A Cognitive Model of Ada Based Embedded System Development Jerry Snodgrass, Southern Methodist University (Seminar already held, announcement for record only) Embedded systems, such as aircraft avionic and hospital intensive car eunit systems, have been developed for several years. But, the early steps of the development process have not been researched. The related research in software engineering has focused on the artifact and almost entirely ignored the design p rocess used to develop the artifact. In contrast, the artificial intelligence reeserch (particularly automatic programming, knowledge-based assistant and cognition research) has forced a more detailed investigation of the design processes used in programming. In this seminar emprical research results are presented along with conceptual results requiring further research. The empirical results show that the human problem solving control in the early steps of embedded system development is essentially the same as the recent cognitive research results in algorithm and software design. The planned research, for which most of the conceptual work has been accomplished, involves 1) integrating the Ada language, object-oriented paradigm, and empirical results into a Uniform Modularity model; and 2) developing a frame-based software tool to guide and record the process of determining the structure of the embedded system being developed. ------------------------------ Date: Thu, 20 Mar 86 10:34:10 GMT From: Gideon Sahar Subject: Seminar - An Interactive Proof Editor (Edinburgh) EDINBURGH AI SEMINARS Date: Wednesday 19th March l986 Time: 2.00 p.m. Place: Department of Artificial Intelligence Seminar Room Forrest Hill EDINBURGH. Professor R. Burstall, Department of Computer Science, University of Edinburgh will give a seminar entitled - "An Interactive Proof Editor". This proof editor works like a structure editor for programmes but enables one to create proofs in first order intuitionist logic. It uses attribute grammar techniques with local re-evaluation of attributes. The idea is due to Tom Reps at Cornell, and the work was done jointly with Brian Ritchie and Tatsuya Hagino. ------------------------------ Date: 21 Mar 86 15:08 PST From: Ahenderson.pa%Xerox.COM%relay.cs.net@vtcs.csnet Reply-to: Ahenderson.pa@Xerox.COM Subject: Seminar - Graphical Access To Expert Systems (PARC) PARC Forum Thursday, March 27 4PM, PARC Auditorium Ted Shortlife and Larry Fagan Medical Computer Science Group Knowledge Systems Laboratory Stanford Medical School GRAPHICAL ACCESS TO EXPERT SYSTEMS: EXAMPLES FROM THE ONCOCIN SYSTEM The research goals of Stanford's Medical Computer Science group are directed both toward the basic science of artificial intelligence and toward the development of clinically useful consultation tools. Our approach has been eclectic, drawing on fields such as decision analysis, interactive graphics, and both qualitative and probabilistic simulation as well as AI. In this presentation we will discuss ONCOCIN, an advice system designed to suggest optimal therapy for patients undergoing cancer treatment, as well as to assist in the data management tasks required to support research treatment plans (protocols). A prototype version, developed in Interlisp and SAIL on a DEC-20, was used between May 1981 and May 1985 by oncology faculty and fellows in the Debbie Probst Oncology Day Care Center at the Stanford University Medical Center. In recent years, however, we have spent much of our time redesigning ONCOCIN to run on Xerox 1100 series workstations and to take advantage of the graphics environment provided on those machines. The physician's interface has been redesigned to approximate the appearance and functionality of the paper forms traditionally used for recording patient status. We have also made changes to correct problems with the prototype system noted during its clinical use during the early 1980's. This has involved adopting an object-center knowledge base design which has provided an increase in the speed of the program while providing more flexible access to the large amount of knowledge required by the system. The workstation version of ONCOCIN has recently been introduced in the Stanford clinic, and we will demonstrate its operation during the presentation. We will also describe and demonstrate OPAL, the knowledge acquisition environment we have developed for ONCOCIN so that expert oncologists can directly enter their knowledge of protocol-directed cancer therapy using graphics-based forms developed in the Interlisp-D environment. This Forum is OPEN. All are invited. Host: Austin Henderson (Intelligent Systems Lab, 494-4308) Refreshments will be served at 3:45 pm Requests for videotaping should be sent to Susie Mulhern before Tuesday noon. ------------------------------ Date: Wed 19 Mar 86 09:46:55-PST From: Jock Mackinlay Subject: Seminar - Automatic Design of Graphical Presentations (SU) Automatic Design of Graphical Presentations PhD Oral Exam Jock D. Mackinlay Computer Science Department Monday, March 31, 10am History 205 The goal of the research described in this talk is to develop an application-independent presentation tool that automatically designs graphical presentations (e.g. bar charts, scatter plots, and connected graphs) for relational information. There are two major criteria for evaluating designs of graphical presentations: expressiveness and effectiveness. Expressiveness means that a design expresses the intended information. Effectiveness means that a design exploits the capabilities of the output medium and the human visual system. A presentation tool is intended to be used to build user interfaces. However, a presentation tool will not be useful unless it generates expressive and effective designs for a wide range of information. This talk describes a theory of graphical presentations that can be used to systematically generate a wide range of designs. Complex designs are described as compositions of primitive designs. This theory leads to the following synthesis algorithm: o First, the information is divided into components, each of which satisfies the expressiveness criterion for a primitive graphical design. o Next, a conjectural theory of human perception is used to select the most effective primitive design for each component. An effective design requires perceptual tasks of low difficulty. o Finally, composition operators are used to compose the individual designs into a unified presentation of all the information. A composition operator composes two designs when the same information is expressed the same way in both designs (identical parts are merged). The synthesis algorithm has been implemented in a prototype presentation tool, called APT (A Presentation Tool). Even though only a few primitive designs are implemented, APT can generate a wide range of designs that express information effectively. ------------------------------ Date: 21 Mar 86 16:57:50 EST From: Patty.Hodgson%ISL1.RI.CMU.EDU%relay.cs.net@vtcs.csnet Subject: Conference - Expert Systems in Process Safety "CALL FOR PAPERS" EXPERT SYSTEMS AND COMPUTATIONAL METHODS IN PROCESS SAFETY American Institute of Chemical Engineers (AIChE) Meeting Houston, Texas, March 29 - April 2, 1987 Sponsored by the divisions on Computing and Systems Technology (10a) and Safety and Health Session Chair: Session Co-Chair: Prof. V. Venkatasubramanian Prof. E. J. Henley Intelligent Process Engineering Lab Dept. of Chemical Engineering Dept. of Chemical Engineering University of Houston Columbia University University Park New York, NY 10027 Houston, TX 77004 Tel: (212) 280-4453 Tel: (713) 749-4407 Papers are solicited in the areas of Expert Systems and Computational Methods in Process Safety for the Houston AIChE Meeting. Topics of interest include Process Plant Diagnosis, Process Safety and Reliability, Process Risk Analysis etc. Please submit TWO copies of the abstract by "MAY 15, 1986" to both the session chairman and co- chairman at the addresses given above. Final manuscripts of the accepted papers are due by October 15, 1986. ------------------------------ Date: 24 Mar 86 16:02:23 GMT From: sdcsvax!sdcrdcf!burdvax!ted%ucbvax.berkeley.EDU%relay.cs.net@vtcs.csnet Subject: Conference - Artificial Intelligence Impacts Forum ARTIFICIAL INTELLIGENCE IMPACTS FORUM PRESENTED BY AMERICAN COMPUTER TECHNOLOGIES, INC. May 13, 1986 St. Davids Inn St. Davids, Pennsylvania American Computer Technologies, Inc. 237 Lancaster Avenue, Suite 255 Devon, PA 19333 WORKSHOP OBJECTIVES: describe the business opportunities of Artificial Intelligence technologies examine the strengths and limitations of these technologies identify current AI products and services on the market and their potential applications analyze companies at the fore-front of the AI market and those expected to enter soon analyze current and emerging international markets for AI technology clarify the business growth opportunities and threats associated with AI technology provide an understanding of the potential impact Artificial Intelligence will have on business identify promising new frontiers in AI research with applications to the commercial and military sectors analyze software and hardware needs for emerging AI markets and assess the impacts on U.S. business WORKSHOP SCHEDULE: Tuesday Morning, 8:00 - 9:45 AM I. Introduction Opening Remarks Creating Computers that Think Emerging International AI Markets II. Assessment of AI Opportunities Expert Systems Movement in Space Vision Natural Language Comprehension Learning Tuesday Morning, 10:15 - 12:00 AM III. Analyses of AI Products and Services Current/Future Software Packages Stand-Alone AI Hardware AI in Personal Computers Embedded AI Systems Knowledge Expert Services IV. Assessment of Competitive Issues Strategic Computing/Defense Initiatives New Japanese MITI-ICOT Perspectives Western European Consortia Emerging Eastern Bloc Cooperation Established AI Firms Emerging AI Ventures Joint Ventures and R&D Partnerships Mergers and Acquisitions Tuesday Lunch, 12:00 - 1:30 PM IV. Strategic Risks and Constraints Financial Risks Social/Legal Risks Technological Constraints Market Constraints Tuesday Afternoon, 2:00 - 3:30 PM VI. Analyses of End-User Applications Direct Military Applications Software Engineering Applications Non-Military Government Applications Commercial Applications Tuesday Afternoon, 3:45 - 5:00 PM VII. Analyses of Global Trends Fifth-Generation Machine Architectures Emerging Fourth-Generation Languages Other Major Technological Thrusts Near-Real Time Systems Economic impact of International AI Markets Growth of AI products and services WORKSHOP LEADERS T. S. Hermann, Ph.D., President of American Computer Technologies, Inc., has served as the Manager, Plans and Programs at Burroughs' Paoli Research Center; Director of R&D at Analytics, Inc.; Sr. VP Technology of Sun Company; President of Franklin Research Center; and President of Mellon Institute, Carnegie-Mellon University. Ronald L. Krutz, Ph.D., Director, Computer Engineering Center, Carnegie Mellon University. Lewis J. Petrovic, Ph.D., President, Resource Engineering, Inc. B.K. Wesley Copeland, MBA, President, International Science & Technology G. Richard Patton, Ph.D., Ex.VP, Resource Assessment, Inc., and Faculty Member, Graduate School of Business, University of Pittsburgh WHO SHOULD ATTEND? The ARTIFICIAL INTELLIGENCE IMPACTS forum has been established primarily to address the needs of business persons who are interested in or are responsible for planning, marketing and manufacturing. WHAT ARE THE MAJOR ISSUES? This workshop will assess major AI product opportunities, explore fundamental trends and market concepts of Artificial Intelligence and will go beyond conventional strategic assertions within an International business context. WHAT ARE THE BENEFITS? THE WORKSHOP will answer the hard business questions of Artificial Intelligence. Participants will learn of the emerging AI business growth opportunities; become aware of the key players and their product strategies; analyze the growing international markets and potential competitors; acquire forecasts of important technological impacts and thrusts; and will scutinize the constraints and risks of the AI products. For Information call Carol Ward, A.C.T., Inc. (215) 687-4015. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Thu Mar 27 12:47:08 1986 Date: Thu, 27 Mar 86 12:47:04 est From: vtcs1::in% (LAWS%sri-ai.ARPA%relay.cs.net%vpi.CSNET%relay.cs.net%vpi.CSNET%relay.cs.net@vpi.CSNET) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #64 Status: RO AIList Digest Wednesday, 26 Mar 1986 Volume 4 : Issue 64 Today's Topics: Queries - Expert Systems in Wine, Medicine, Documentation, Military & Parallel Implementation of Rule-Based Expert Systems & Reactions to Cliches & AI Market Survey & AI in Resource Management & Funding of AI Proposals ---------------------------------------------------------------------- Date: Thu, 20 Mar 86 23:41:05 CST From: S076786%UMRVMA.BITNET%WISCVM.WISC.EDU%relay.cs.net@vtcs.csnet Subject: expert systems/enology I'd like to contact individuals at university of califorinia-davis involved with enology as it might pertain to expert systems/artificial intelligence. Please send a list of anyone involved so that I might contact them in regard to current research and development. ------------------------------ Date: 19 Mar 86 22:07:16 GMT From: decvax!mcnc!ecsvax!ircil%ucbvax.berkeley.EDU%relay.cs.net@vtcs.csnet Subject: HEME Medical Expert System I am looking for any information on the HEME medical expert system - diagnosis of hematologic diseases. If you can help me, please send any information or phone numbers and electronic addresses of anyone associated with the project at either Cornell Medical School or Cornell University. My electronic address is ecsvax!ircil. Thank - you very much. Chip Gentry ------------------------------ Date: 23 Mar 86 19:57:47 GMT From: sdcsvax!drillsys!gatech!seismo!ut-sally!ut-ngp!gknight@ucbvax. berkeley.edu (gknight) Subject: Neuropsychology expert system inquiry. Is anyone aware of research or development work on an expert system for clinical neuropsychological assessment? If so, please send relevant information to me by e-mail and I will summarize and post responses. Thanks, Gary Knight, 3604 Pinnacle Road, Austin, TX 78746 (512/328-2480). Biopsychology Program, Univ. of Texas at Austin. "There is nothing better in life than to have a goal and be working toward it." -- Goethe. ------------------------------ Date: 18 Mar 86 14:17:00 GMT From: pur-ee!uiucdcs!convex!graham%ucbvax.berkeley.EDU%relay.cs.net@vtcs.csnet Subject: towards better documentation Toward better documentation: Graham's law: The manual is useless. Corollaries: 1. It's not in the manual. 2. If it is in the manual, you can't find it. 3. If you find it, it's wrong. I am interested in creating an expert system to serve as on-line documentation. The intent is to abrogate the above law and corollaries. Does anyone know of such a system or any effort(s) to produce one? I am an AI novice. This system is to serve as my introduction to the field. What referecnes should I read to get started on this? What approach would you recommend? Marv Graham; Convex Computer Corp. {allegra,ihnp4,uiucdcs,ctvax}!convex!graham ------------------------------ Date: 21 Mar 86 17:58:07 GMT From: sdcsvax!noscvax!priebe%ucbvax.berkeley.EDU%relay.cs.net@vtcs.csnet Subject: rule-based expert system We are searching for an EXISTING rule based expert system. We intend to implement the selected system on a SIMD machine using an experimental bit-vector approach to determine the degree of performance enhancement. Ideally we would like a time-sensitive, joint services appli- cation, but any and all proposed systems will be considered. The one characteristic the system MUST possess is rules. The closer the system is to a pure-production system the better. We will recode the inference engine specifically for our parallel processor. Anyone with such a system in hand, or pointers to same, should contact me either via the net or by phone. Any help will be greatly appreciated. Additionally, anyone with information on any of the following systems, please drop me a note: Application of A I to Tactical Operations Maj. Timothy Campen Don E Gordon, HRB-Singer,Inc Expert Systems for Intelligence Fusion R Peter Bonasso, The MITRE Corp. Expert System for Tactical I&W Analysis Douglas Lenat, Stanford Albert Clarkson, Garo Kiremidjian, ESL/TRW Thanx, Carey Priebe ********************************* * carey priebe * * * * priebe@cod.UUCP * * priebe@nosc.UUCP * * priebe@cod.nosc.MIL * * ucbvax!sdcsvax!noscvax!priebe * * * * Naval Ocean Systems Center * * Code 421 * * San Diego, CA 92152 * * * * Ph. (619) 225-6571 * ********************************* ------------------------------ Date: Fri, 21 Mar 86 23:30 EST From: KROVETZ%umass-cs.csnet%CSNET-RELAY.ARPA%relay.cs.net@vtcs.csnet Subject: cliche's Does anyone know of any studies or literature relating to the reactions of people the first time they hear a cliche'? Thanks, Bob krovetz@umass (csnet) krovetz%umass.csnet@csnet-relay (arpanet) ------------------------------ Date: Friday, 21 Mar 1986 05:33:05-PST From: wachsmuth%gvaic2.DEC%decwrl.DEC.COM%relay.cs.net@vtcs.csnet Subject: AI market(ing) issues. Does anyone have solidly founded information concerning AI's market potential, and present share of the software and hardware markets? In reply to this note, (or directly to myself) I would appreciate responses for the US, Japanese, and European S/W & H/W markets, in dollar values. Are any AI market studies available for viewing? If you have copies, please either attach it as a response to this note, or send it directly to me. Thank you, in anticipation, for your replies. Markus Wachsmuth 43 Route de Prevessin CH-1217 GENEVA, SWITZERLAND wachsmuth%gvaic2.DEC@decwrl wax%gvaic2.DEC@decwrl wachsmuth%gva04.DEC@decwrl wachsmuth%gvaeis.DEC@decwrl ------------------------------ Date: Fri, 21 Mar 86 13:43:30 est From: munnari!trlvlsi.trl.oz!andrew%seismo.CSS.GOV%relay.cs.net@vtcs.csnet Subject: Small AI companies I will be visiting the States later this year and I am looking for places to visit active in AI. Whilst I am familiar with the larger companies and academic institutions I am aware that I should also perhaps look for the smaller companies active in AI. Can anyone help ? (Areas of interest : application of AI to resource management (eg. network management), learning research, design using AI). ARPA: andrew%trlvlsi.trl.oz@seismo.css.gov ACSNET: andrew@trlvlsi.trl UUCP: !{seismo, mcvax, ucb-vision, ukc}!munnari!trlvlsi.trl!andrew VOICE: +1 61 3 5416241 Andrew Jennings Telecom Australia Research Laboratories, P.O. Box 249 Clayton, Victoria 3168, AUSTRALIA. ------------------------------ Date: Mon 24 Mar 86 15:20:14-PST From: Daniel Davison Subject: funding of AI proposals I'm developing a pattern recognition system for specific biological structures (helices in ribosomal RNAs). After a demonstration version is running (we are currently using OPS5), I'd like to apply for a grant to continue the work. I'd also like to apply to places other than ONR, DARPA, and their friends.. I would like to know if there are non-DoD agencies that fund AI work. I don't think NIH would, but maybe NSF? By the way, I'm familiar with the work of Abarbanel and coworkers on pattern recognition for protein structure-this work would derive from that work but not duplicate it. If anyone knows of other biological AI- guided pattern recognition, please drop me a line. Thanks, dan (davison@sumex-aim.arpa, davison@bnl.arpa) best e-mail address: bchs6@uhupvm1.bitnet ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon Mar 31 06:43:30 1986 Date: Mon, 31 Mar 86 06:43:24 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #65 Status: RO AIList Digest Monday, 31 Mar 1986 Volume 4 : Issue 65 Today's Topics: Seminars - Concurrent Processing with Result Sharing (SMU) & Planning by Procedural Inference (SRI) & Processes, Events, and the Frame Problem (CSLI) & Inexact Reasoning using Graphs (MIT), Conference - 1st Australian Applied AI Congress & Knowledge Representation Tools for Expert Systems & AI Impacts Workshop ---------------------------------------------------------------------- Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Seminar - Concurrent Processing with Result Sharing (SMU) Concurrent Processing with Result Sharing: A Unified View of Efficient Computaitons Speaker: S. Krishnaprasad, Southern Methodist University (kp%smu@csnet-relay convex!smu!kp) Location: 315SIC, Southern Methodist University Time 2:00 PM Date: April 3, 1986 Abstract A major aspect of efficient problem solving is to avoid reduandant recomputations, This talk identifies the need for and ways to incorporate both problem structure and problem dynamics, in the context of concurrent processing, for fast and efficient problem solving. The notion of horizontal locality and vertical locality are introduced to capture the essence of problem dynamics. Algorithms for decomposition under dynamics are discussed for a special class of computations. A new model of problem solving called Concurrent Processing with Result Sharing (CPRS) is defined along with measures that characterize efficiency of problem solving. In a general setting, this model is related to the notion of working set under concurrent processing environment. A simulation strategy is presented to prove the usefulness of CPRS model when multiple concurrent computations compete for limited computational resources. ------------------------------ Date: Wed 26 Mar 86 18:30:50-PST From: LANSKY@SRI-AI.ARPA Subject: Seminar - Planning by Procedural Inference (SRI) PLANNING BY PROCEDURAL INFERENCE Dan Carnese (CARNESE@SRI-KL) AI Lab, Schlumberger Palo Alto Research (SPAR) 11:00 AM, MONDAY, March 31 SRI International, Building E, Room EJ228 (new conference room) The standard approach to plan construction involves applying a general planning algorithm to a representation of a problem to be solved. This approach will fail on a given problem when the search space explored by the algorithm is too large. If this occurs, the only alternatives are to re-encode the problem or to improve the general algorithm. In this talk, I'll describe an alternative approach where control of the planning process is provided by a procedure which constructs proofs from premises characterizing the domain. This approach allows arbitrary procedures to be used for control, while retaining the desirable property that unsound inferences cannot be made. The technique will be illustrated with examples from the domain of computer-aided manufacturing. ------------------------------ Date: 25 Mar 86 1134 PST From: Vladimir Lifschitz Subject: Seminar - Processes, Events, and the Frame Problem (CSLI) PROCESSES, EVENTS, AND THE FRAME PROBLEM Michael Georgeff Artificial Intelligence Center, SRI International and Center for the Study of Language and Information Stanford University Thursday, March 27, 3pm (NB: New time!) MJH 252 In this talk we will consider various models of actions and events suited to reasoning about multiple agents situated in dynamic environments. We will also show how the notion of process is essential in multiagent domains, and contrast this with most approaches in AI that are based solely on the allowable behaviors of agents. We will then consider how we might go about specifying the properties of events and processes, and whether or not such specifications require nonmonotonicity or circumscription. Finally, we will examine various views of the frame problem and see to what extent some of the major difficulties can be overcome. ------------------------------ Date: Fri 28 Mar 86 11:38-EST From: "Lisa F. Melcher" Subject: Seminar - Inexact Reasoning using Graphs (MIT) Wednesday, April 16, 1986 3:45 p.m.....Refreshments 4:00 p.m.....Lecture NE43 - 512A JUDEA PEARL Computer Science Department UCLA "Inexact Reasoning Using Graphs" Probability theory is shunned by most researchers in Artifical Intelligence. New calculi, claimed to better represent human reasoning under uncertainty, are being invented and reinvented at an ever-increasing rate. A major reason for the emergence of this curious episode has been the objective of making reasoning systems TRANSPARENT i.e., capable of producing PSYCHOLOGICALLY MEANINGFUL explanations for the intermediate steps used in deriving the conclusions. While traditional probability theory, admittedly, has erected cultural barriers against meeting this requirement, we shall show that these barriers are superficial, and can be eliminated with the use of DEPENDENCY GRAPHS. The nodes in these graphs represent propositions (or variables), and the arcs represent causal dependencies among conceptually-related propositions. We further argue that the basic steps invoked while people query and update their knowledge correspond to mental tracings of preestablished links in such graphs, and it is the degree to which an explanation mirrors these tracings that determines whether it is considered "psychologically meaningful". The first part of the talk will examine what properties of probabilistic models can be captured by graphical representations, and will compare the properties of two such representations: Markov Networks and Bayes Networks. The second part will introduce a calculus for performing inferences in Bayes Networks. The impact of each new evidence is viewed as a perturbation that propagates through the network via local communication among neighboring concepts. We show that such autonomous propagation mechanism leads to flexible control strategies and sound explanations, that it supports both predictive and diagnostic inferences, that it is guaranteed to converge in time proportional to the network's diameter, and that every proposition is eventually accorded a measure of belief consistent with the axioms of probability theory. In conclusion, we will show that the current trend of abandoning probability theory is grossly premature--taking graph propagation as the basis for probabilistic reasoning satisfies most computational requirements for managing uncertainties in reasoning systems and, simultaneously, it exhibits epistemological features unavailable in any competing formalism. Sponsored by TOC, Laboratory for Computer Science Ronald Rivest, Host ------------------------------ Date: Wed, 26 Mar 86 15:20:02 est From: decvax!mulga!aragorn.oz!brian@decwrl.DEC.COM (Brian J. Garner) Subject: Conference - 1st Australian Applied AI Congress Call for Papers: 1 11 st 111 AUSTRALIAN 11 ARTIFICIAL 11 INTELLIGENCE 11 CONGRESS 11 1111 Melbourne, November 18-20, 1986 CALL FOR PAPERS Abstract of papers to be selected for presentation to the 1st Australian Artificial Intelligence Congress are now invited. The three-part program comprises: i) AI in Education - Intelligent tutors - Computer-managed learning - Course developers environment - Learning models - Course authoring software ii) Expert System Applications - Deductive databases - Conceptual schema - Expert system shells (applications and limitations) - Interactive knowledge base systems - Knowledge engineering environments - Automated knowledge acquisition iii) Office Knowledge Bases - Document classification and retrieval - Publishing systems - Knowledge source systems - Decision support systems - Office information systems Tutorial presenters are also sought. Specialists are required in the areas of: - Common loops - Natural language processing - Inference engines - Building knowledge databases - Search strategies - Heuristics for AI solving Format: ACSnet address: brian!aragorn.oz CSNET address: brian@aragorn.oz UUCP address: seismo!munnari!aragorn.oz!brian decvax!mulga!aragorn.oz!brian ARPA address: munnari!aragorn.oz!brian@seismo.arpa decvax!mulga!aragorn.oz!brian@Berkeley PC diskette to Division of Computing and Mathematics, Deakin University, Victoria 3217, Australia. Attn. Dr. Brian Garner. DEADLINES: All submissions by May 16, 1986. Notification by June 30. Inquiries: Stephen Moore, Director, 1AAIC86, tel: (02)439-5133. ------------------------------ Date: 26 Mar 86 21:06:04 GMT From: ucdavis!lll-lcc!lll-crg!seismo!mcvax!prlb2!lln-cs!hb@ucbvax.berk eley.edu (Hubert Broze) Subject: Conference - Knowledge Representation Tools for Expert Systems ================================================================= Conference announcement : "KNOWLEDGE REPRESENTATION TOOLS FOR EXPERT SYSTEMS" Louvain-la-Neuve (Belgium), April 21st, 1986. Place des Sciences, Auditorium A01 Organized jointly by : L'Unite d'Informatique de l'Universite Catholique de Louvain The Belgian Association for Artificial Intelligence (BAAI) The ACM Student Chapter of Louvain-la-Neuve. PROGRAM : 9 H 30 Participants welcome & Opening of the industrial exhibition 10 H 00 - 11 H 00 F. ARLABOSSE (Framentec, Paris) : "The representation of Knowledge : the industrial phase" 11 H 15 - 12 H 15 J. FERBER (LRI-Univ. Paris-Sud) "Reflections in object-oriented languages" 12 H 15 - 14 H 30 lunch 14 H 30 - 15 H 30 P.Y. GLOESS (CNRS & Graphael) : "OBLOGIS : une implantation orientee objet de la logique de Prolog et liaison de cette logique avec des objets" 15 H 45 - 16 H 45 R. VENKEN (Bim) "BIM-Prolog : A new implementation of Prolog" 16 H 45 - 18 H 00 Cocktail (kindly offered by intersem-Sligos) _____________________________ During the whole day, an industrial exhibition will be held with the participation of Apollo Computer, BIM (Sun), CPP (KES), Ferranti (ART), IBM, Rank Xerox, Symbolics, Tektronix, Texas Instrument etc. Participation to the meeting is FREE OF CHARGE Additional Information may be obtained from : E. Gregoire, Unite Info, Place Ste Barbe, 2, B1348 Louvain-la-Neuve, Belgium. Tel : + 32 10 43 24 15 UUCP : {prlb2,vmucnam}!lln-cs!eg ------------------------------ Date: 26 Mar 86 15:54:10 GMT From: hplabs!sdcrdcf!burdvax!ted@ucbvax.berkeley.edu (Ted Hermann) Subject: Conference - AI Impacts Workshop ARTIFICIAL INTELLIGENCE IMPACTS WORKSHOP PRESENTED BY AMERICAN COMPUTER TECHNOLOGIES, INC. June 4-6, 1986 FAA Technical Center Atlantic City Airpot. New Jersey American Computer Technologies, Inc. 237 Lancaster Avenue, Suite 255 Devon, PA 19333 For Information call Carol Ward, A.C.T., Inc. (215) 687-4148 or write to above address. WORKSHOP OBJECTIVES: describe the business opportunities of Artificial Intelligence technologies examine the strengths and limitations of these technologies identify current AI products and services on the market and their potential applications analyze companies at the fore-front of the AI market and those expected to enter soon analyze current and emerging international markets for AI technology clarify the business growth opportunities and threats associated with AI technology provide an understanding of the potential impact Artificial Intelligence will have on business identify promising new frontiers in AI research with applications to the commercial and military sectors analyze software and hardware needs for emerging AI markets and assess the impacts on U.S. business WORKSHOP TOPICS: I. Introduction Opening Remarks Creating Computers that Think Emerging International AI Markets II. Assessment of AI Opportunities Expert Systems Movement in Space Vision Natural Language Comprehension Learning III. Analyses of AI Products and Services Current/Future Software Packages Stand-Alone AI Hardware AI in Personal Computers Embedded AI Systems Knowledge Expert Services IV. Assessment of Competitive Issues Strategic Computing/Defense Initiatives New Japanese MITI-ICOT Perspectives Western European Consortia Emerging Eastern Bloc Cooperation Established AI Firms Emerging AI Ventures Joint Ventures and R&D Partnerships Mergers and Acquisitions IV. Strategic Risks and Constraints Financial Risks Social/Legal Risks Technological Constraints Market Constraints VI. Analyses of End-User Applications Direct Military Applications Software Engineering Applications Non-Military Government Applications Commercial Applications VII. Analyses of Global Trends Fifth-Generation Machine Architectures Emerging Fourth-Generation Languages Other Major Technological Thrusts Near-Real Time Systems Economic impact of International AI Markets Growth of AI products and services WORKSHOP LEADERS T. S. Hermann, Ph.D., President of American Computer Technologies, Inc., has served as the Manager, Plans and Programs at Burroughs' Paoli Research Center; Director of R&D at Analytics, Inc.; Sr. VP Technology of Sun Company; President of Franklin Research Center; and President of Mellon Institute, Carnegie-Mellon University. Ronald L. Krutz, Ph.D., Director, Computer Engineering Center, Carnegie Mellon University. Lewis J. Petrovic, Ph.D., President, Resource Engineering, Inc. B.K. Wesley Copeland, MBA, President, International Science & Technology G. Richard Patton, Ph.D., Ex.VP, Resource Assessment, Inc., and Faculty Member, Graduate School of Business, University of Pittsburgh WHO SHOULD ATTEND? The ARTIFICIAL INTELLIGENCE IMPACTS workshop has been established primarily to address the needs of business persons who are interested in or are responsible for Governmental Program planning, marketing and manufacturing. WHAT ARE THE MAJOR ISSUES? This workshop will assess major AI product opportunities, explore fundamental trends and market concepts of Artificial Intelligence and will go beyond conventional strategic assertions within an International business context. WHAT ARE THE BENEFITS? THE WORKSHOP will answer the hard business questions of Artificial Intelligence. Participants will learn of the emerging AI business growth opportunities; become aware of the key players and their product strategies; analyze the growing international markets and potential competitors; acquire forecasts of important technological impacts and thrusts; and will scutinize the constraints and risks of the AI products. For Information call Carol Ward, A.C.T., Inc. (215) 687-4148 or write to above address. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon Mar 31 06:43:38 1986 Date: Mon, 31 Mar 86 06:43:33 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #66 Status: RO AIList Digest Monday, 31 Mar 1986 Volume 4 : Issue 66 Today's Topics: Queries - Eliza & BKG & Public Domain Software & Lisp Syntax & Basic ATN & Economics of Expert Systems, Discussion - IQ Tests for Computers & Computer Dialog ---------------------------------------------------------------------- Date: Thu 27 Mar 86 13:26:15-CST From: AI.HASSAN@MCC.ARPA Subject: Eliza Where could I run Eliza (Weizenbaum's program) or get a copy of the source code? Send reply to hassan@mcc.arpa---Thanks. H. ------------------------------ Date: Thu, 27 Mar 86 10:35:57 cst From: Dan Nichols Subject: BKG request I am interested in obtaining a copy of Hans Berliner's famous BKG program. Does anyone know of an implementation in LISP or for UNIX? I would also love to have a copy of the source for studying. Can anyone help or can anyone tell me if Mr. Berliner is on the net and how to reach him? Please respond to me rather than flooding this list. *USNail* *electronic* Dan Nichols USENET: {ctvax,im4u,texsun,rice}!ti-csl!dnichols POB 226015 M/S 238 ARPA: Dnichols%TI-CSL@CSNet-Relay Texas Instruments Inc. CSNET: Dnichols@Ti-CSL Dallas, Texas VOICE: (214) 995-6090 75266 COMPUSERVE: 72067,1465 He o shite shiri-tsubome! ------------------------------ Date: Fri, 28 Mar 86 9:45:20 EST From: John Shaver STEEP-TMAC 879-7602 Subject: Public Domain Software I recently found a public doman PROLOG at Simtel20 pd:. Are the other such programs which could be used by person s with access to and IBM PC or similar computers. John ------------------------------ Date: 28 Mar 86 10:29:00 EST From: "CUGINI, JOHN" Reply-to: "CUGINI, JOHN" Subject: Lisp syntax for inference engines OK, I have a dumb question for you Lisp wizards. In any fact-rule inferencing system, there must be a distinction between constants and variables. In Prolog and OPS5 these are clearly distinguished by syntax, a la: | constant variable CProlog | red Color (capital letter on variable) OPS5 | red (angle brackets on variable) The Lisp analogs would appear to be: Lisp | 'red color (quote on constant) Note, for instance that you can bind "color" to "'red", or to another variable, like "hair-color", or leave it unbound, just like a good ole variable in Prolog and OPS5. Similarly, 'red has an unchanging, self-evident value, just like a well-behaved constant. But in the published algorithms, like in "Lisp" by Winston or "AI Programming" by Charniak, it seems that some spelling convention for symbols is dreamed up to distinguish the two, eg, red (constant) and ?color (variable), and the quoted form is not used at all. Why not use the mechanism provided directly by the language? Is this just a matter of taste, that people like to decorate the variable and not the constant? Or is there some deep-seated semantic/efficiency-type reason lurking here? John Cugini National Bureau of Standards ------------------------------ Date: Sun 30 Mar 86 16:28:53-EST From: John C. Akbari Subject: basic atn are there new, readable introductions to the theory (and implementation!) of atns? examples of code would be most helpful. anyone researching (or just hacking) with object-oriented approaches to parsing, PLEASE inform me of your work (e.g., FLAVORS, LOOPS, NoteCards, etc.). will summarize for ai bb. thanks. john akbari akbari@cs.columbia.edu ------------------------------ Date: Thu, 27 Mar 86 10:50:41 est From: munnari!psych.uq.oz!ross@seismo.CSS.GOV (Ross Gayler) Subject: economics of expert systems - assistance please I am currently working on a project which, amongst other things, requires me to find out something about the economics of expert systems. The technology of expert systems seems to be a classical case of a solution searching for appropriate problems. I am quite happy to believe that expert systems can be much more cost-effective than conventional systems for certain classes of problems, but what are the characteristics of these problems? Specifically, I would like to know how the implementation costs of expert systems vary as a function of attributes of the problem (complexity, size, uncertainty etc.), attributes of the implementors (experience with tools and domain etc.) and the attributes of the tools (representations, inference methods, strategies etc.). I would also like to know how the system costs are distributed across the system life cycle and how all this information compares with conventional computer systems. If this was a movie it would be "Yourdon and de Marco do expert systems". I can't recall having seen any serious discussion of this area. The only statements have been along the lines of "We coded 10 rules per week" and unsubstantiated claims for ease of maintenance. I don't actually expect strong empirical work at this stage but some good conceptual analyses would be nice. Any references, pointers or opinions would be gratefully accepted. Ross Gayler | ACSnet: ross@psych.uq.oz Division of Research & Planning | ARPA: ross%psych.uq.oz@seismo.css.gov Queensland Department of Health | CSNET: ross@psych.uq.oz GPO Box 48 | JANET: psych.uq.oz!ross@ukc Brisbane 4001 | UUCP: ..!seismo!munnari!psych.uq.oz!ross AUSTRALIA | Phone: +61 7 227 7060 ------------------------------ Date: Fri, 21 Mar 86 09:57:28 cst From: preece%ccvaxa@gswd-vms (Scott E. Preece) Subject: More on IQ tests for Computers. Two gripes with this. Who are the carbon/tissue *computers* he is talking about? Secondly, computers will never be "intelligent"; however software might *appear* intelligent in certain respects. Nuff said. Gordon Joly Do we really want this list to be a battleground for unsubstantiated personal opinions on the potential for machine intelligence? scott preece gould/csd - urbana uucp: ihnp4!uiucdcs!ccvaxa!preece arpa: preece@gswd-vms ------------------------------ Date: 25 Mar 86 03:14:07 GMT From: pur-ee!pucc-j!pucc-h!ahh@ucbvax.berkeley.edu (Mark Davis) Subject: Computer Dialogue I have a question that I have been pondering over for some time. I have asked a few people about it and have received a few different answers. The question is: Can a Computer feel, and tell you it's feelings? I say that if the computer is actually having a bad day (ie. disk troubles and the like ) that somewhere in the operating system there should exist some functions to let the user know how it feels in some friendly way. I consider this to be a true feeling of the computer. However many of my associates tell me that this would be something that is built into the system of an un-living thing, And that this is only simulated. I would like to hear your opinions on this subject. Mark Davis ------------------------------ Date: 24 Mar 86 13:59:30 GMT From: allegra!mit-eddie!think!harvard!talcott!panda!teddy!mjn@ucbvax. berkeley.edu Subject: Re: re: Computer Dialogue #1 > Maybe not, but this only applies to present-day computers. "Some people > realize that brain cells don't feel emotions any more than toasters do"... > doesn't mean that a combination of many brain cells cannot, and the same > could apply to future computers with many times the capability of today's > computers. "Some people realize that brain cells don't feel emotions any more than toasters do"... doesn't mean that a combination of many toasters cannot, and the same could apply to future toasters with many times the capability of today's toasters. Mark J. Norton {decvax,linus,wjh12,mit-eddie,cbosgd,masscomp}!genrad!panda!mjn mjn@sunspot ------------------------------ Date: 27 Mar 86 02:52:36 GMT From: ulysses!mhuxr!mhuxt!houxm!hounx!kort@ucbvax.berkeley.edu (B.KORT) Subject: Re: Computer Dialogue Mark Davis asks if computers have anything akin to human feelings. One of the most salient of human feelings is pain, which is the name of the brain state triggered by neural impulses signalling damage or distress to body tissue. Consider one of the most complex computers in operation today--a No. 5 ESS (Electronic Switching System) in the North American Telephone Network. It has many sensors throughout its equipment bays which detect loss of functionality. These sensors raise alarms in the central processor which are functionally equivalent to the human sensation of pain. The central processor responds by taking steps to ameliorate the problem. It calls the "doctor" (craftsperson) for assistance and otherwise takes prudent steps to protect itself from consequential harm. On another level of analogy, there is an interesting comparison between diagnostic messages from a computer and human emotional responses when faced with a situation ("input") for which the computer or person is unprepared. (See my Computer Dialogues #1 and #2 for a somewhat whimsical portrayal of this comparison.) Leaving aside the semantic issues, one notes a curious mapping between machine states/brain states and the corresponding input/output patterns. It seems to me that human feelings correspond *mutatis mutandis* to functionally equivalent phenomena within computers and other complex systems. --Barry Kort ...ihnp4!hounx!kort ------------------------------ Date: 23 Mar 86 15:03:20 GMT From: ulysses!mhuxr!mhuxt!houxm!hounx!kort@ucbvax.berkeley.edu (B.KORT) Subject: Re: Computer Dialogue #1 Dear Charles and Peter, Please understand that I wrote Computer Dialogues #1 and #2 as "flights of fancy" to imagine some of the problems that might arise when self-programming computers begin to interact with each other. I gave the computers some anthropomorphic emotions, thinly disguised as diagnostic messages. My goal was to bridge the gulf between those who love machines and those who dread them. [...] For those who are interested in the deeper philosophical issues of the soul, may I recommend the two short stories by Terrell Miedener in The Mind's I. One is the touching story of a chmimpanzee with an enquiring mind entitled The Soul of Martha, a Beast. The other is about a mechanical mouse with a survival instinct entitled The Soul of the Mark III Beast. Regards, Barry ------------------------------ End of AIList Digest ******************** From vtcs1::in% Wed Apr 9 01:03:13 1986 Date: Wed, 9 Apr 86 01:03:05 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #67 Status: RO AIList Digest Monday, 31 Mar 1986 Volume 4 : Issue 67 Today's Topics: Applications - Machine Translation & Automated Documentation, Book - Machine Learning: A Guide To Current Research, Journals - Aviation Week Technical Survey & Dr. Dobbs Journal AI Issue & AI in Engineering, Theory - P = NP ?, Linguistics - Ambiguity, AI Tools - FORTRAN ---------------------------------------------------------------------- Date: Fri, 21 Mar 86 17:37 EST From: Steve Dourson - Delco Subject: Machine Translation of Documents I am quoting the following article from the Dayton SIGART newsletter dated March 13, 1986: COMMERCIAL MACHINE TRANSLATION Business Week (# 2912, 9/16/85, pp. 90D ff.) reports in an article by Joyce Heard with Leslie Helm that several companies are active in developing machines to produce commercial translations of documents. This article describes translation systems that are currently available for translating English, German, French, Spanish, Italian and Japanese. Speeds of up to 100,000 words per hour are claimed, as are accuracies of up to 90% and prices as low as $3000. (Not all the same system of course). Customers are apparently willing to accept rough translations as long as they can get them quickly; translators, however, are not happy just polishing machine translations. Most of the companies offering multilingual services are converting text to a "neutral" language, then into the target language -- this greatly reduces the cost of additional source or target languages. ----- I haven't seen the original article. It may be worth investigating if any of these machines could deliver a usable rough translation. Perhaps the collection of papers could be machine-translated and surveyed. Selected papers would be professionally translated. Stephen Dourson dourson%gmr.csnet@CSNET-RELAY.ARPA (arpa) dourson@gmr (csnet) ------------------------------ Date: Wed, 26 Mar 86 14:27:00 pst From: George Cross Subject: Re: towards better documentation >>I am interested in creating an expert system to serve as >>on-line documentation. You probably want to look at Nathaniel Borenstein's dissertation The Design and Evaluation of On-Line Help Systems CMU, 1985 Available as Technical Report CMU-CS-85-151 In addition to a description of Borenstein's system, this has a large bibliography and discussion of existing systems. ---- George - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - George R. Cross cross@wsu.CSNET Computer Science Department cross%wsu@csnet-relay.ARPA Washington State University faccross@wsuvm1.BITNET Pullman, WA 99164-1210 Phone: 509-335-6319 or 509-335-6636 ------------------------------ Date: 27 Mar 86 09:12 EST From: WAnderson.wbst@Xerox.COM Subject: towards better documentation An excellent recent article entitled "Interactive Documentation" by P.J. Brown (Computing Lab, The University, Canterbury, Kent) appears in the March 1986 issue of Software -- Practice and Experience. The full reference is: Brown, P.J., Interactive Documentation, Software -- Practice and Experience, Vol 16(3), March 1986, pp. 291-299. He talks to many issues relating to display of documentation, and describes a tool that "allows readers of computer-based documents to peruse these documents at any desired level of detail" (from the Abstract). Especially interesting is his distinction between "replace-buttons" and "glossary-buttons." Bill Anderson ------------------------------ Date: 27 Mar 86 10:36:08 est From: Walter Hamscher Subject: towards better documentation Date: 18 Mar 86 14:17:00 GMT From: pur-ee!uiucdcs!convex!graham@ucbvax.berkeley.edu Subject: towards better documentation I am interested in creating an expert system to serve as on-line documentation. The intent is to abrogate the above law and corollaries. Does anyone know of such a system or any effort(s) to produce one? [...] Frankly, it sounds like a black hole to me. Building an expert system to do something that people don't know how to do very well is generally a bad idea. The ubiquity of crummy documentation is prima facie evidence that creating *good* documentation isn't yet a widely understood art. Nevertheless I'll toss some ideas out, first trying to figure out what the functionality of this system is supposed to be. Maybe you're talking about automatically generating documentation from existing source code. You might start with Rich & Waters' stuff on the programmers apprentice, also Bob Balzer's stuff at USC-ISI. See IEEE Transactions on Software Engineering, November 1985, as one place to start looking for lots of other related references. The problem here is extracting the users-eye-view from an implementation. I would think it would be easier to extract it from the original specification (assuming it exists). Another thing you might mean is building a ``user's assistant'' for a complicated program. Along these lines I can suggest Mike Genesereth's work (circa 1977, MIT) on the ``MACSYMA advisor,'' a design with some interesting ideas. Also I seem to recall that people have done expert systems for advising users on how to use a complicated set of models embedded in a packages of dozens of FORTRAN subroutines. E.g. statistical, econometric, ecological models. I believe there was a paper in ECAI-84 on one of these, maybe Bundy was an author (big help, eh?)? Also I believe there is an ongoing project at Berkeley on a user's assistant for Unix. The idea is to be able to ask it things like like ``how do I get these 90 files copied from one machine to another'' and it makes a plan and guides you through the steps, modifying the plan as it goes to deal with contingencies (e.g. the machine you want to copy to turns out to have no network connection so you have to make a tape). (I wonder what the program says if you ask it ``how can I get back the files I accidentally deleted?'' :-) To be useful the system needs to be able to generate plans of action from its own knowledge of the program. Makes a good forcing function on its knowledge. Finally, maybe you just mean building an expert system that knows a lot about a particular program, and presents hunks of canned text on various topics. However, I don't see what such a thing could possibly boil down to anything other than an index. Somebody still has to figure out what to put in the index. To make it ``smart'' you need to think about how to build that index automatically, or have it defined implicitly by having the program search the hunks of canned text for strings that match things the user is asking about. But then you have the natural language problem on your hands again due to synonyms, verb vs noun forms, etc. Ick. And the problem with this last approach of course is that it doesn't abrogate Graham's Law: the canned text is, after all, canned. The system is not an expert on the program, it's an expert on the manual! The only way to abrogate the law is to have the system look at the source code of the program... and then you're back in the black hole again. Well, good luck. I hope these ramblings may lead to something helpful (and provoke errata from more knowledgeable readers). -w ------------------------------ Date: 24 Mar 86 14:34:36 EST From: GABINELLI@RED.RUTGERS.EDU Subject: Machine Learning: A Guide To Current Research [Forwarded from the Rutgers bboard by Laws@SRI-AI.] MACHINE LEARNING: A Guide To Current Research (a collection of 77 papers--most of which were contributed by participants at the last ML Workshop held in June, 1985) is being offered by the publisher, Kluwer Academic Publishers, at a special pre-publication rate of $27.95 (shipping included). This is a discount of 30% off the regular price. [...] Jo Ann Gabinelli ------------------------------ Date: Wed 26 Mar 86 09:08:28-PST From: Oscar Firschein Subject: Aviation Week Technical Survey AILIST readers might be interested in the following: Aviation Week and Space Technology, Feb. 17, 1986 has a technical survey of artificial intelligence, mostly applied to military applications. Included are the DARPA-supported programs in Pilot's Associate and the Autonomous Land Vehicle (ALV) and the VLSI lisp machine being built by Texas Instruments. Company profiles include McDonnell Aircraft's work in the Pilot's Associate and avionics maintenance expert system; Boeing's AI Center; MITRE's work in natural language understanding; Grumman's decision support systems; Hughes AI center; and Westinghouse avionics troubleshooting expert system. ------------------------------ Date: Fri 28 Mar 86 13:15:10-CST From: Werner Uhrig Subject: pointer: Dr. Dobbs Journal (April 86) The Annual AI Issue TABLE OF CONTENTS Programming in LISP and PROLOG 24 AI: BRIE - The Boca Raton Inference Engine by Robert Jay Brown III An exploration of artificial intelligence techniques, using LISP, PROLOG, and Expert-2. An Expert at Life 42 AI: A Cellular Automation in Expert-2 by Jack Park Jack visited our pages two years ago with an expert system for predicting the weather. This little game could teach even more about AI tools. 46 AI: Modeling a System in PROLOG by Sheldon D Softky PROGLOG may be the language of choice for some very practical tasks, says the author. ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Journal - AI in Engineering The International Journal for Artificial Intelligence in Engineering is a new quarterly available from Computational Mechanics Publications, subscription only, price $130. Please apply to Computational Mechanics Inc., Suite 6200, 400 West Cummings Park, Woburn, MA 01801, USA. (USA, Canada and Mexico). Ashurst Lodge, Ashurst, Southampton SO4 2AA, England for others. ------------------------------ Date: 29 March 1986 2129-EST From: Andreas Nowatzyk@A.CS.CMU.EDU Subject: P=NP Is this for real? [Forwarded from the CMU bboard by Laws@SRI-AI.] Article 355 of net.research: From: ghgonnet@watdaisy Title: P = NP by E.R. Swart, Department of Computing and Information Science, University of Guelph, Research Report CIS86-02, February 1986. Abstract: A mathematical progamming formulation of the Hamilton circuit problem involving zero/one restrictions and triply subscripted variables is presented and by relaxing the zero/one restrictions and adding additional linear constraints together with additional variables, with up to as many as 8 subscripts, this formulation is converted into a linear programming formulation. In the light of the results of Kachiyan and Karmakar concerning the existence of polynomial time algorithms for linear programming this establishes the fact that the Hamilton circuit problem can be solved in polynomial time. Since the Hamilton circuit problem belongs to the set of NP-complete problems it follows that P = NP. ------------------------------ Date: Fri, 21 Mar 86 12:01:34 pst From: Allen VanGelder Subject: P=NP(?) still open [Forwarded from the SRI bboard by Laws@SRI-AI.] [...] > From: lawler@ernie.berkeley.edu (Eugene Lawler) > Subject: Swart's paper > Not surprisingly, it seems to be fatally flawed. Bob Solovay started > reading it carefully, found gaps in proofs, wrote Swart about them. > The P=NP question is still with us, I believe. --Gene Lawler ------------------------------ Date: Wed, 26 Mar 86 14:28:58 EST From: Bruce Nevin Subject: ambiguity Then there is this from the _Electric_Kool-Aid_Acid_Test . . . on a tree at the foot of the driveway from the commune to the main road was this sign: No Left Turn Unstoned A triple (at least) pun in four words! Bruce ------------------------------ Date: Mon, 24 Mar 86 23:46:05 EST From: "Keith F. Lynch" Subject: AI languages From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Some AI packages soon could have interfaces to numerical code, particularly those in process control; expert systems will make decisions about a fault, then a simulation, written in FORTRAN, will be run to see if the fix will work. Why should the numerical routines be written in FORTRAN rather than Lisp? Is this just for dusty decks, or is it proposed that new FORTRAN code be written for this? ...Keith ------------------------------ Date: Wed, 26 Mar 86 13:24:52 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: Re: AI Languages. > Why should the numerical routines be written in FORTRAN rather than > Lisp? Is this just for dusty decks, or is it proposed that new > FORTRAN code be written for this? /Keith Lynch I agree that LISP code can be faster than FORTRAN. Certainly MACLISP produces fast numerical code. But most of the software effort for numerical simulations, goes into FORTRAN, be it 66, 77 or 8X! So they ain't just those dusty decks of cards. Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ End of AIList Digest ******************** From vtcs1::in% Wed Apr 9 01:02:50 1986 Date: Wed, 9 Apr 86 01:02:42 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #68 Status: RO AIList Digest Tuesday, 8 Apr 1986 Volume 4 : Issue 68 Today's Topics: Seminars - Tek Tools and Technology (Ames) & Machine Learning, Clustering and Polymorphy (Rutgers) & Feedback During Skill Acquisition (CMU) & Growing Min-Max Game Trees (MIT) & State, Models, and Qualitative Reasoning (MIT) & Functional Computations in Logic Programs (UPenn) ---------------------------------------------------------------------- Date: Tue, 1 Apr 86 08:32:09 pst From: eugene@AMES-NAS.ARPA (Eugene Miya) Subject: Seminar - Tek Tools and Technology (Ames) From: MER::ANDREWS National Aeronautics and Space Administration Ames Research Center AMES AI FORUM SEMINAR ANNOUNCEMENT Tektronix AI Tools and Technology Tektronix Representatives: Steve Levine - AI Specialist Brad Martinson - Systems Analyst Tamarah Day - Sales Engineer Tuesday, April 8, 1986 10:30 - 11:30 am B 239 rm B39 (Life Sciences Basement Auditorium) NASA Ames Research Center Agenda: 10:30 - 11:00 Slide presentation - AI history overview Question & answer period 11:00 - 11:30 or Product demonstrations on the Tektronix 4404 and 4406 12:00 Artificial Intelligence Workstations. Demonstrations will include a Preliminary Expert Ground Analysis Scheduler developed by Harris Corporation for Kennedy Space Center to assist in the scheduling of ground processing activities. Also presented will be an electronic circuit board diagnostic expert system and applications of software prototyping and user interfacing. point of contact: Alison Andrews (415)694-6741 mer.andrews@ames-vmsb.ARPA N.B. For those of you who cannot make it to this Ames AI Forum, Tektronix is having a similar presentation and demo on April 3, with the following agenda: 8:30-9:00 Coffee and doughnuts 9:00-10:30 Presentations (AI Overview, AI at TEK Labs, Managing the Knowledge Engineering Process) 10:30-11:15 Demonstrations 11:15-11:30 Summary 11:30-12:00 Questions and Answers 12:30-4:00 Afternoon Schedule R.S.V.P. Mary Clement (408)496-0800 Tektronix is located at 3003 Bunker Hill Lane (just off Great America Parkway, near cross street Betsy Ross), Santa Clara. Attendees of the April 3 demo will not be shown the Kennedy Space Center expert system, so do try to make it to the Ames AI Forum, despite the lack of doughnuts! ------------------------------ Date: 3 Apr 86 16:56:24 EST From: PRASAD@RED.RUTGERS.EDU Subject: Seminar - Machine Learning, Clustering and Polymorphy (Rutgers) MACHINE LEARNING COLLOQUIUM Machine Learning, Clustering and Polymorphy Stephen Jose Hanson and Malcolm Bauer Bell Communications Research and Princeton University Cognitive Science Laboratory April 8, Tuesday #423, Hill Center I will describe a conceptual clustering program (WITT) that attempts to model human categorization. Experiments will also be described in which the output of WITT and other Conceptual clustering programs will be compared to the performance of human subjects using the same stimuli. Properties of categories to which human subjects are sensitive includes best or prototypical members, relative contrasts between putative categories, and polymorphy (neither necessary or sufficient features). Polymorphy (m out of N, m < N) represents a weakening of conjunction predicates which still seem to be of an order that is learnable to humans. Wittengentein refers to polymorphy as a basis for a category theory in which category "criteria" determine the nature of the membership rule. This approach represents an alternative to usual Artificial Intelligence approaches to generalization, conceptual clustering and semantic analysis which tend to focus on common feature rules, impoverished category structure, and simple search and match schemes. WITT uses feature inter-correlations, category structure (prototypes, basic levels, etc..) and a conservative search strategy in order to construct a set of categories given objects defined on a multi-valued feature list. Information retrieval was used for a test domain for WITT in order to discover reasonable categories from the psychological abstracts, which were subsequently compared to psychologists from Princeton psychology department sorting the same abstracts. Another test domain involved constructing meta-level categories for nations of the world, where semantic features were extracted from a machine readable version of the 1985 World Almanac. WITT discovered concepts like "third world countries" and "european countries" and "technologically advanced countries". ** If you wish to host the speakers or meet with them, please send a message to PRASAD@RUTGERS.ARPA ------------------------------ Date: 4 April 1986 1433-EST From: Cathy Hill@A.CS.CMU.EDU Subject: Seminar - Feedback During Skill Acquisition (CMU) Impact of Feedback Content during Initial Skill Acquisition Jean McKendree Wednesday, April 9 12:00-1:30 pm ****** BH 340A ****** Most theories of learning and skill acquisition acknowledge the importance of feedback, particularly after errors. However, none of them are explicit about the content of this information. I will present hypotheses about the efficacy of different sorts of feedback content and relate them briefly to current information processing theories. I will then present the results from experiments which vary information content after errors and which begin to look at differences in experience level. The proposed experiment will use verbal protocols as well as quantitative data to better understand the usefulness of different sorts of information for error correction. A simulation model will attempt to compare the impact of these different types of information assuming an identical starting point. ------------------------------ Date: Mon, 7 Apr 1986 18:12 EST From: JHC%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU Subject: Seminar - Growing Min-Max Game Trees (MIT) [Forwarded from the MIT bboard by SASW@MIT-MC.] Thursday , April 10 4:00pm Room: NE43 8th floor Playroom The Artificial Intelligence Lab Revolving Seminar Series A New Procedure for Growing Min-Max Game Trees David McAllester AI Lab, MIT In games such as chess decisions must be based on incomplete search trees. A new tree-growth procedure is presented which is based on "conspiracy numbers" as a formal measure of the accuracy of the root minimax value of an incomplete tree. Trees can be grown with the goal of maximizing the accuracy of the root value. Trees grown in this way are often deeper and narrower than alpha-beta optimal trees with the same number of nodes. On the other hand, if all nodes have the same static value then the new procedure reduces to d-ply search with alpha-beta pruning. Unlike B* search, non-uniform growth is achieved without any modification of the static board evaluator. ------------------------------ Date: Mon, 31 Mar 1986 17:21 EST From: JHC%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU Subject: Seminar - State, Models, and Qualitative Reasoning (MIT) [Forwarded from the MIT bboard by SASW@MIT-MC.] The Artificial Intelligence Lab Revolving Seminar Series State, Models, and Qualitative Reasoning Jerry Roylance AI Lab, MIT Qualitative reasoning, modeling, and representations of state are important issues in AI. Machines need interesting models of their task and methods that enable them to reason with those models. Without models machines can offer little help in relieving the programmer's or system builder's workload. A conventional program is a literal description of what to do. By investing the program with a model of what it is doing and some methods, we can use code that is both simpler and more believable. Numerical subroutines, for example, have several unifying ideas about search, approximation, and transformation. Using these ideas directly (rather than the results of the ideas) eliminates a lot of ugly code. While qualitative reasoners gain their power in the simplicity of their algebra, they pay a price in resolving the ambiguity that that simplicity produces. We look at the simplifications that qualitative reasoners do in light of the mathematical properties of the original equations, the choice of distinguished values, and traditional simulation methods. Modeling a world is a difficult problem. State is a part of modeling that is not described very well; the best descriptions that we have are Moore machine descriptions that the current state and the inputs give us the next state. Better, goal-oriented, descriptions that do more than just simulation are needed. Thursday, April 3 4:00pm Room: NE43 8th floor Playroom Refreshments at 3:30pm ------------------------------ Date: Mon, 31 Mar 86 11:09 EST From: Tim Finin Subject: Seminar - Functional Computations in Logic Programs (UPenn) Forwarded From: Glenda Kent on Mon 31 Mar 1986 at 10:42 FUNCTIONAL COMPUTATIONS IN LOGIC PROGRAMS Saumya K. Debray SUNY at Stony Brook Tuesday, April 1, 1986 Room 216 - Moore School 3:00 - 4:30 p.m. While the ability to simulate nondeterminism and return multiple outputs for a single input is a powerful and attractive feature of logic programming languages, it is expensive in both time and space. This overhead is especialy undesirable because programs are very often functional, i.e. do not return more than one output for any given input, and so do not use this feature of these languages. This talk describes how programs may be analyzed statically to determine which literals and predicates are functional, and how the program may then be optimized using this information. Our notion of "functionality" subsumes the notion of "determinacy" that has been considered by various researchers. The algorithm we describe is less reliant on features such as cut, and thus extends more easily to parallel evaluation strategies, than others that have been proposed. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Wed Apr 9 01:02:40 1986 Date: Wed, 9 Apr 86 01:02:32 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #69 Status: RO AIList Digest Tuesday, 8 Apr 1986 Volume 4 : Issue 69 Today's Topics: Seminars - Metaplanning: Controlling Planning in a Complex Domain (CMU) & Rule-Based Systems and Heuristic Classification (SU) & The MACE System (USC) & Expert Systems for System Management (MIT) & Temporal Theorem Proving (SRI) & Network Propagation for Reasoning about Uncertainty (CMU) & Optical Artifical Intelligence Research in ECE (CMU) & Pragmatic Modeling: Robust NL Interface (MIT) ---------------------------------------------------------------------- Date: 1 April 1986 0108-EST From: Paul Birkel@A.CS.CMU.EDU Subject: Seminar - Metaplanning: Controlling Planning in a Complex Domain (CMU) Metaplanning: Controlling Planning in a Complex Domain Dissertation Proposal Friday, April 4th 1:00-2:30 PM Wean Hall 5409 All planners metaplan; few do so explicitly. Many planners find very simple control mechanisms sufficient; the added overhead of a metaplanner outweighs any apparent advantages. Whether implementing an explicit metaplanner increases the capabilities of the resulting system is unknown. Complex domains, such as therapy planning, include problems which would be best handled by a metaplanner identifying and choosing alternative planning strategies separate from the process of plan generation. These problems include: unresolvably conflicting goals, conflicting measures of goal satisfaction, unreliable operators, and incompletely specified initial states. Previous therapeutic (@b, @b) and non-therapeutic (@b, @b) planners alike are incapable of explicitly reasoning about, and solving, combinations of these types of problems. A hierarchical therapeutic planner will be implemented based on a @b(MOLGEN/SPEX) hybrid architecture incorporating both tactical planning and strategic metaplanning components. Four additional planning techniques are proposed which will be developed and integrated into the architecture. The metaplanner will subsequently be extended to achieve acceptable clinical performance on two dozen clinical cases covering all combinations of these problems. The performance of the system with and without the planning extensions, and with and without the metaplanner will be analyzed. A copy of the thesis proposal is available in the CS lounge, 4th floor, Wean Hall. Please contact me for additional copies of the proposal (its long!). birkel@a or x3074 ------------------------------ Date: Mon 31 Mar 86 18:31:41-PST From: Christine Pasley Subject: Seminar - Rule-Based Systems and Heuristic Classification (SU) CS529 - AI In Design & Manufacturing Instructor: Dr. J. M. Tenenbaum Title: Rule-based Systems; Application to Heuristic Classification Speaker: William J. Clancey From: Knowledge Systems Laboratory Date: Wednesday, April 2, 1986 Time: 4:00 - 5:30 Place: Terman 556 This talk provides an broad overview of expert systems research, using the Neomycin program as an example. We consider in particular the rule-based knowledge representation, showing how rules can be controlled by an inference procedure. Generalizing from this example, we consider first the heuristic classification method of problem solving, showing how a broad range of well-structured problems--embracing forms of diagnosis, catalog selection, and skeletal planning--are solved in typical expert systems. Next, we consider kinds of problems that expert systems can be used to solve, emphasizing the idea of a "system in the world" that is being synthesized or analyzed. Finally, we introduce the idea of a qualitative model, showing how different kinds of network formalisms are used in expert systems to describe processes. The material in this talk will enable you to relate the kinds of problems, solution methods, and representations in expert systems. ------------------------------ Date: 2 Apr 1986 18:45-EST From: gasser@usc-cse.usc.edu Subject: Seminar - The MACE System (USC) USC DPS GROUP MEETING Wednesday, 4/9/86 3:00 - 5:00 PM Seaver Science 319 Les Gasser will speak on the MACE system. MACE is a testbed for building generic Distribiuted AI systems from organized collections of active "intelligent" entities called @i[Agents] which run in parallel. It comprises a language for describing agents, a language for describing a network of processors upon which the agents run, and a simulator for executing the agents in parallel. This talk will describe the philosophy and design goals of MACE, the current versions of the MACE description languages, the MACE simulator, and briefly discusses several experimental MACE implementations. The MACE language is constructed in two parts: the MACE Agent Description Language which is sufficient for expressing agents or collections of agents at any level (including composite agents), and the MACE Environment Description Language which describes the underlying computation hardware and simulator parameters. Individual agents may draw upon other existing languages. MACE has been implemented in COMMON LISP on a TI Explorer Lisp Machine. We have several trial systems implemented (*) or partially implemented (-). - An ACTORS-like recursive Fibonacci computation which we have tested by creating up to 90 agents running in parallel.* - An agent called BUILDER which interactively builds other agents through a second agent called USER-INTERFACE, both agents running in parallel.* - An agent-based production system where each rule is an agent, and there is no global database nor centralized inference engine. (-) - An 8-node hypercube with MACE agents running on each node, and a parallel broadcast facility among agents.* - A distributed, multi-level blackboard built of agents. (-) - A two-robot cooperative planner. (-) Questions: Dr. Les Gasser, (213) 743-7794, gasser@usc-cse.usc.edu ------------------------------ Date: Wed 2 Apr 86 08:54:20-EST From: Natalie F. Tarbet Subject: Seminar - Expert Systems for System Management (MIT) [Forwarded from the MIT bboard by SASW@MIT-MC.] Fourth in a series of seminars on Large and Complex Computer Systems in the Commercial World "Expert Systems for System Management and Control or What jobs in a large computing center can be automated?" Keith R. Milliken IBM, Thomas Watson Research Center Yorktown Heights, NY NE43-512A Wednesday, April 2, 1986 at 3:15 p.m. Several years ago, IBM's Thomas Watson Research Center began to develop an expert system to assist with the operation of a large computing complex. This expert system, called YES/MVS (Yorktown Expert System / MVS Manager), runs in real-time and can either give advice or automatically take actions to manage computing resources and respond to problems in a running system. This system is of interest because it actively helps control, in real-time, a very complex process. YES/MVS has been used extensively in the Yorktown Computing Center, and a second version is now being developed. We will briefly describe YES/MVS and then focus on some of the expert system issues that have arisen during YES/MVS development and the approaches taken to resolve them. Two of the issues that will be emphasized are (1) knowledge representation for process control expert systems and (2) approaches to knowledge base organization that reduce the difficulty involved in modifying a large knowledge base. The latter issue is especially important in the automation of computing system operation because there are large variations between computing centers in operational policy. We shall briefly describe related efforts to automatically analyze the performance of large computing systems, to deveop a special purpose shell for computer performance expert systems and to use rule-based techniques to control resource allocation in a large computing system. Host: Arvind ------------------------------ Date: Wed 2 Apr 86 17:21:06-PST From: LANSKY@SRI-AI.ARPA Subject: Seminar - Temporal Theorem Proving (SRI) TEMPORAL THEOREM PROVING Martin Abadi (MA@SAIL) Stanford University 11:00 AM, MONDAY, April 7 SRI International, Building E, Room EJ228 (new conference room) In spite of the wide range of applications of temporal logic, proof techniques (especially for first-order temporal logic (FTL)) have been quite limited up to now. We have developed a proof system R for FTL. The system R is based on nonclausal resolution; proofs are natural and generally short. Special quantifier rules, unification techniques, and a resolution rule are introduced. The system R is directly useful for such tasks as verification of concurrent programs and reasoning about hardware devices. Other uses of temporal resolution, such as temporal-logic programming, are currently being considered. We relate R to other proof systems for FTL and discuss completeness issues. In particular, one variant of R is ``as complete as'' an extension of Peano Arithmetic. We also describe resolution systems analogous to R for other modal logics. In fact, the resolution techniques and the corresponding completeness arguments apply to a large class of modal logics. ------------------------------ Date: 2 April 1986 1720-EST From: Betsy Herk@A.CS.CMU.EDU Subject: Seminar - Network Propagation for Reasoning about Uncertainty (CMU) Speaker: Judea Pearl, UCLA Date: Tuesday, April 15 Time: 3:30 - 5:00 Place: 5409 Wean Hall Title: Network propagation for reasoning about uncertainty Abstract: In order to meet requirements of modularity, transparency and flexibility, the designers of 1st-generation expert systems have abandoned traditional probability theory and ventured to devise new formalisms for managing uncertainties. The talk will describe a message-passing scheme in propositional networks which, using traditional probability theory, fulfills these objectives of expert systems technology. I will argue that the notion of TRANSPARENCY is closely related to reasoning with GRAPHS, namely, that an argument is perceived to be "psychologically meaningful" if its derivational steps correspond to mental tracings of pre-established links in some conceptual dependency network. Accordingly the first part of the talk will introduce an axiomatic legitimization of representing inferential dependencies by networks, and will compare the properties of two such representations: Markov Networks and Bayes Networks. The second part will introduce a calculus for performing inferences in Bayes Networks. The impace of each new evidence is viewed as a perturbation that propagates through the network via asynchronous local communication among neighboring concepts. We show that such propagation mechanism facilitates flexible control strategies and sound explanations, that it supports both predictive and diagnostic inferences, that it is guaranteed (in sparse graphs) to converge in time proportional to the network's diameter, and that every proposition is eventually accorded a measure of belief consistent with the axioms of probability theory. ------------------------------ Date: 3 April 1986 1023-EST From: Richard Wallstein@A.CS.CMU.EDU Subject: Seminar - Optical Artifical Intelligence Research in ECE (CMU) Robotics Seminar 3:30 Friday April 11, 4623 Wean Hall David Casasent, Director Center for Excellence in Optical Data Processing Department of Electrical and Computer Engineering OPTICAL ARTIFICAL INTELLIGENCE RESEARCH IN ECE Optical feature extraction and correlation distortion-invariant multi-class multi-object recognition and identification research will be reviewed. This will be followed by a discussion of optical artificial intelligence efforts currently in progress. This effort includes: optical relational graph and decision net processors, optical symbolic processors, optical associative memory processors, and optical neural net processors. ------------------------------ Date: 4 Apr 1986 09:57-EST From: Brad Goodman Subject: Seminar - Pragmatic Modeling: Robust NL Interface (MIT) [Forwarded from the MIT bboard by SASW@MIT-MC.] BBN Laboratories Inc. Science Development Program AI/Education Seminar Speaker: Professor Sandra Carberry University of Delaware Title: Pragmatic Modeling: Toward a Robust Natural Language Interface Date: Tuesday, April 15th, 10:30 a.m. Place: 2nd floor large conference room BBN Labs, 10 Moulton Street, Cambridge PRAGMATIC MODELING: TOWARD A ROBUST NATURAL LANGUAGE INTERFACE Naturally occurring dialogue is both imperfect and incomplete. Not only does the information-seeker fail to communicate all aspects of his underlying task and partially constructed plan for accomplishing it, but also his utterances are often imperfectly or imcompletely formulated. It appears that human information-seekers expect an information-provider to facilitate a productive exchange by assimilating the dialogue and using this knowledge to remedy many of the information-seeker's faulty utterances. This talk will describe an on-going research effort aimed both at developing techniques for inferring and constructing a user model from an information-seeking dialogue and at identifying strategies for using this model to develop more robust natural language interfaces. Emphasis will be on the dynamic construction of the task-related plan motivating the information-seeker's queries, and its application in handling pragmatically ill-formed and incomplete utterances. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Wed Apr 9 06:51:47 1986 Date: Wed, 9 Apr 86 06:51:42 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #70 Status: RO AIList Digest Wednesday, 9 Apr 1986 Volume 4 : Issue 70 Today's Topics: Queries - BKG Backgammon & LISP Machines & Games, Applications - Machine Translation, Correction - Research Credits for Aviation Week Survey, AI Tools - Common Lisp Systems & Borland Prolog, Book - Machine Learning: A Guide to Current Research, Databases - Nonmilitary AI Jobs & Reference Database on Logic, Techniques - Rete Algorithm Survey ---------------------------------------------------------------------- Date: 27 Mar 86 16:37:00 GMT From: pur-ee!uiucdcs!convex!ti-csl!dnichols@ucbvax.berkeley.edu Subject: BKG request I am interested in obtaining a copy of Hans Berliner's famous BKG program. Does anyone know of an implementation in LISP or for UNIX? I would also love to have a copy of the source for studying. Can anyone help or can anyone tell me if Mr. Berliner is on the net and how to reach him? Please respond to me rather than flooding this list. *USNail* *electronic* Dan Nichols USENET: {ctvax,im4u,texsun,rice}!ti-csl!dnichols POB 226015 M/S 238 ARPA: Dnichols%TI-CSL@CSNet-Relay Texas Instruments Inc. CSNET: Dnichols@Ti-CSL Dallas, Texas VOICE: (214) 995-6090 75266 COMPUSERVE: 72067,1465 He o shite shiri-tsubome! ------------------------------ Date: Wed, 2 Apr 86 15:46:09 EST From: reiter@harvard.HARVARD.EDU (Ehud Reiter) Subject: LISP machines Has anyone done a price/performance comparison of LISP machines with conventional workstations running LISP? If so, could they please send me the results of their investigations? I will summarize to the net if there is a lot of interest. My interest is academic (price/performance of different computer architectures) not practical. My initial hypothesis, based on looking over Richard Gabriel's book PERFORMANCE AND EVALUATION OF LISP SYSTEMS and on talking to people is that special LISP processors offer a 2-3 fold speed advantage over a SUN 3 or MicroVAX II class workstation, but at 2-3 fold greater cost. Microcoded architectures like Xerox's D-machines seem to offer little performance improvement. Please note that I am NOT interested in software issues like how good an environment a machine provides. This is strictly a hardware comparison. Thanks. Ehud Reiter reiter@harvard.ARPA reiter@harvunxh.BITNET harvard!reiter.UUCP ------------------------------ Date: Tue, 8 Apr 86 08:12 ??? From: Black holes are where God is dividing by zero Subject: Wanted: info on game playing systems Can anyone give me any information on game playing AI programs? I am especially interested in systems that play games where there is a great deal of uncertainty. Poker (or any card game) would be a good example. This is because a Poker player does not have complete information about the other players hand. The player is therefore forced to deduce the other players hand by observing his play. Chess would be a bad example because there is no missing information. All possible moves for both players are known with total certainty. I would also be interested in any programs that build models of a users behavior (especially a hostile one) with the goal of guessing future behavior. Thanks in advance Allen Sherzer SHERZER@TI-EG.CSNET ------------------------------ Date: 8 Apr 86 09:49 EST From: Gocek.henr@Xerox.COM Subject: Re: Machine Translation of Documents I read a similar report that said machines are translating 100,000 pages of text per year for various applications, and in some cases reach 95 percent accuracy. The article I read, which was printed in the Rochester Democrat & Chronicle on Sunday, 4/6/86, appeared to be prompted by Xerox's use of machine translation. (Xerox is big in Rochester.) The 95 percent accuracy was reached only in very specialized applications, though. Highly technical applications where the technical jargon is unambiguous is a good application for machine translation. The European Common Market is trying to use a machine translation system and is not obtaining 90 percent accuracy. Gary Gocek.Henr@Xerox.Com ------------------------------ Date: Tue 8 Apr 86 13:19:44-PST From: GARVEY@SRI-AI.ARPA Subject: Re: Aviation Week Technical Survey I think you should have given credit where credit is due: for example, the DARPA Pilot's Associate program is also jointly supported by Lockheed-Georgia and McDonnell Aircraft Company, since they together are providing approximately half of the total $20 million. Likewise, the Autonomous Land Vehicle is jointly supported by DARPA and Martin-Marietta and the first Navy Battle-Management Program (FRESH) is partially supported by TI. Cheers, Tom ------------------------------ Date: 25 Mar 86 1257 PST From: Les Earnest Subject: Common Lisp systems We have been reviewing Common Lisp implementations that run on Sun workstations. The principal alternatives appear to be those made by Lucid and marketed by Sun (415 965-780), Franz Inc. (415 769-5656) and Kyoto University, which is marketed by Ibuki (415 949-1126). We expect to be getting some of each of these implementations for various purposes. Ibuki's product description is attached. Les Earnest ******************************************************************************** KCL PRODUCT DESCRIPTION Kyoto Common Lisp (KCL) is a full implementation of Common Lisp. It contains all the Common Lisp functions, macros and special forms defined in the Common Lisp Reference Manual. It has both a compiler and an interpreter. Full sources are available for modification. KCL was developed at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan by Masami Hagiya and Taiichi Yuasa. It is used throughout Japan for building expert systems and conducting research in Artificial Intelligence. THE FEATURES OF KCL -- KCL is complete: It supports all Common Lisp functions, macros and special forms defined in the Common Lisp Reference Manual; COMMON LISP: THE LANGUAGE, by Guy L. Steele et al, Digital Press, 1984. -- A complete KCL is small: It is only 1.4 MB with interpreter and compiler loaded. For customers with source code, this core image may be made even smaller by separating the compiler, intepreter and run-times and making everything inessential autoloadable. -- KCL is efficient: Its compilation time (including the two passes) and run time (both of compiled and interpreted code) have times comparable with the other Commmon Lisps present on the market (benchmarks appear in the KCL report). -- The kernal of KCL is written in C and the rest in Common Lisp itself. Thus KCL is totally embedded in the C language and provides clean access to the underlying operating system. -- KCL uses C and the standard C libraries as the interface to the operating system. Using the standard I/O facilities greatly enhances the portability of KCL. -- The KCL compiler is a two pass compiler with a first pass from LISP to C and a second from C to compiled code. This allows the use of any optimizing C running on the machine to create efficient code which is totally compatible with preexisting compiled C code. -- Having a kernel written in C and compiling to C, KCL is highly portable and independent of the machine and operating system. It currently runs on the machines of six manufacturers and more are being added soon. -- All KCL versions are made from the same sources. This means that all versions behave the same and any Common Lisp code can be cross- compiled (by the KCL compiler) and the C code generated can be used on any of the systems running KCL. -- The runtime efficiency of interpreted code has been as important a design criterion as the efficiency of compiled code. This, together with its small size makes KCL appropriate for teaching. Educational discounts are available. IBUKI is dedicated to providing high quality software that is fairly priced and allows the people using it maximal flexibility to get their problems solved. We believe in symbolic computing and want to make it available on a wide scale. For this reason we provide source code and simple, inexpensive licensing arrangements. Versions for VAXes and SUNs running UNIX 4.2 bsd are currently available in the US and are being distributed by IBUKI. For commercial use, distribution fees are $700 per CPU for the object code and an additional $700 for the sources. For educational institutions the distribution fees are $450 object and sources respectively. Quantity discounts are available. For further information about ordering, contact IBUKI 399 Main Street Los Altos, CA 94022 Phone: 415 949-1126 Telex: 348369 Netmail: KCL@SU-Carmel.ARPA ------------------------------ Date: 31 Mar 86 21:33:29 GMT From: dual!islenet!jayf@ucbvax.berkeley.edu (Jay Fields) Subject: Borland Prolog I just read in today's Infoworld that Borland has announced a new Prolog for the IBM priced at 99.95. They didn't say, "Sorry, one per customer," either. Aloha, J Fields PRC, Honolulu ...ihnp4/islenet/jayf /* The usual disclaimers go here */ ------------------------------ Date: 3 April 1986 1616-EST From: Jaime Carbonell@A.CS.CMU.EDU Subject: Yet another ML book... [Forwarded from the CMU bboard by Laws@SRI-AI.] Not to be confused with "Machine Learning Vol I" and "... Vol II", Kluwer Academic Publishers is coming out with a book titled: "Machine Learning: A Guide to Current Research", which contains a zillion (i.e. 77) very short papers -- rather than a lot fewer, but much more detailed papers of the two ML volumes. Thus, the Kluwer book is very useful as a survey and guide to the symbolic machine learning field, but not as useful for in-depth analysis of techniques, ideas or applications. Most of the short papers are revised versions of those presented at the 1985 Machine Learning III workshop. [...] There's a 30% discount on the 39.95 price and no shipping cost (hence: 27.95) for prepaid orders received "soon" (ignore the April 1 date on the form). ------------------------------ Date: Tue, 1 Apr 1986 14:23 EST From: HENRY%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU Subject: AI Jobs A while back on this list, I mentioned a job bulletin board sponsored by High Technology Professionals for Peace. It is now available. The number is (617) 969-2273, and hours of operation are after 5 PM Eastern time weekdays and all day weekends. It lists employers recruiting for non-military jobs. Later versions of the system will provide keyword retrieval. ------------------------------ Date: 3 Apr 86 22:22:39 GMT From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs! abc@ucbvax.berkeley.edu (Andy Cheese) Subject: Reference Database on Logic I currently post out a reference database on functional and logic languages, denotational semantics and formal methods to various people. It is never up to date but i add more when i have the time. If anybody is interesting in recieving a copy, i post it at the beginning of every month, please reply and i will add you to my distribution list. Andy Cheese Department of Computer Science University of Nottingham University Park Nottingham NG7 2RD England ARPA : abc@uk.ac.nott.cs UUCP : ukc!nott.cs!abc Andy Cheese ------------------------------ Date: Wed 2 Apr 86 10:46:43-PST From: Matt Heffron Subject: Rete query summary Thanks to all who replied to my query about Rete algorithm info. Here is a summary of the replies: From: Dan Scales I'm doing a master's thesis on modifying the Rete network implementation in OPS5 to be more efficient for an AI architecture called SOAR built on top of OPS5. The main references for the Rete network itself are: Forgy, C. L., On the Efficient Implementation of Production Systems. PhD thesis, Dept. of Computer Science, CMU, February, 1979. Forgy, C. L. Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem, Artifical Intelligence 19(1), September 1982, 17-37. Also, you should try to get the OPS5 (or other OPS) source code. I assume it is freely distributed, since we have it here at Stanford. Unfortunately, it is not commented at all. ________________ From: Duke Briscoe ... The person in the office next to mine has implemented the Rete algorithm. It doesn't sound like he had too much trouble doing it. I guess the tricky part is keeping track of variable bindings for different invocations of a rule. ________________ From: Robert Farrell Lee Brownston, Elaine Kant, Nancy Martin and I have a book called "Programming Expert Systems in OPS5" available that describes the algorithm in some detail. Also look at Forgy's AAAI article about how to implement them in assembler and his thesis from CMU. Or you can contact Forgy directectly at Forgy@CMU-CS-A. Also Liz Allen (used to be at MD) has hacked up one in the YAPS system, so she would be of help. Please don't contact me - I'm too busy. ________________ FROM: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU In response to your query regarding Rete algorithms, here is a reference to a conference that will be published in April. It may prove useful to you: D BOOK22 Applications of Artificial Intelligence\ %I Society of Photo-Optical Instrumentation Engineers\ %D 1-3 April 1986\ %N 635\ %C Orlando %A L. Lafferty %A D. Bridgeland %T Scavenger: an Experimental Rete Compiler %B BOOK22 %K AI01 ________________ From: Dan Miranker A cornerstone of my thesis, which I am just completing, is the development of a new production system algorithm, TREAT, and its comparison to RETE. The preliminary results are just coming in. Even though TREAT was motivated by the algorithmic requirements of parallel processing it is doing better even in a sequential environment. I have an OPS5 implementation just coming to life. It appears that TREAT reduces the number of comparisons to do variable binding by about 30%. (TREAT does more work on an add to wm, but eliminates all the work RETE has to unwind when doing a delete). TREAT also doen't use any of the "beta memories", which can be combinatorially explosive in size. So it does better in space as well. The absolute speed of the two OPS5 implementations,(mine and Forgy's) is currently roughly the same, but we haven't yet made any attempt to cleanup and speed up our code. The TREAT algorithm is also much easier to implement. Our run time interpreter is 4 pages of LISP compared to Forgy's 12. The TREAT algorithm was described in the 1984 International conference on fifth generation computing, held in Tokyo. There is a slight error in the algorithm as published. If you think you will be implementing TREAT let me know and I'll finally insert the correction into the tech report version and send that to you. ________________ From: Jim Wogulis We have a production system here that was developed my a number of people over a long period of time. Currently, Pat Langley has taken over maintaining/improving the system. It is written in Franzlisp, and I have ported it to Interlisp-D. Prism uses a rete net to store all the partial matches from the rules and facts. We will send it to anyone who is willing to pay for the taping charges (I think $100 for tape or floppy and $30 for the manual). This might help since there would be code to look at. ________________ Matt Heffron ------------------------------ End of AIList Digest ******************** From vtcs1::in% Wed Apr 9 06:52:16 1986 Date: Wed, 9 Apr 86 06:52:11 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #71 Status: RO AIList Digest Wednesday, 9 Apr 1986 Volume 4 : Issue 71 Today's Topics: Conferences - AAAI & Ames Symposium on Manufacturing Systems & Automated Reasoning Workshop 1986 & Knowledge Engineering Forum ---------------------------------------------------------------------- Date: 4 Apr 86 13:58:40 GMT From: decvax!linus!raybed2!gxm@ucbvax.berkeley.edu (GERARD MAYER) Subject: Conference - AAAI The national conference on artificial intelligence AAAI-86 is Aug 11-15, 1986 Philadelphia, PA. Send program and registration inquiries to: AAAI-86, AAAI, 445 Burgess Dr., Menlo Park, CA 94025. This year there will be sessions (as in the past) and a new emphasis on workshops. See AI magazine, winter 1986 for more information. Gerard Mayer Raytheon Research Division uucp ..linus!raybed2!gxm ------------------------------ Date: Tue, 1 Apr 86 08:33:51 pst From: eugene@AMES-NAS.ARPA (Eugene Miya) Subject: Conference - Ames Symposium on Manufacturing Systems From: MER::ANDREWS National Aeronautics and Space Administration Ames Research Center SYMPOSIUM MODELING AND CONTROL IN FLEXIBLE MANUFACTURING SYSTEMS Friday, April 11, 1986 The fiels of ARTIFICIAL INTELLIGENCE and AUTOMATIC CONTROL have been developing independently of one another despite many intrinsic common interests. A series of symposia is planned to explore this common ground to better understand what are the long-range issues and fruitful directions of basic research in AUTOMATIC CONTROL THEORY. The present sysmposium is organized by Professor Giuseppe Menga, Department of Automation and Information, Politecnico di Torino, Italy. PROGRAM: Friday, April 11, 1986 Morning 9:30 - 10:00 Yu-Chi Ho, Harvard University Opening Address - Modern System Theory in Manufacturing Applications 10:00 - 11:00 Giuseppe Menga, Politecnico di Torino Modeling Flexible Manufacturing Systems by Heuristic Network Analysis 11:00 - 12:00 Yu-Chi Ho, Harvard University Perturbation Analysis in Discrete Event Dynamic Systems: An Application to Manufacturing Afternoon 1:00 - 2:00 Giuseppe Menga, Politecnico di Torino The Planning and Control System for Flexible Manufacturing Shops 2:00 - 3:00 Agostino Villa, Politecnico di Torino Planning and Control in Multi-Stage Multi-Product Systems The symposium will be held in Conference Room 172 in Building 233. For additional information, please contact anyone listed below: Ralph Bach (415)695-5429 Rajiv Mehta x5440 George Meyer x5444 mar.bach@ames-vmsb.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, 5 Apr 86 18:35:15 cst From: stevens@anl-mcs.ARPA (Rick Lyndon Stevens) Subject: Conference - Automated Reasoning Workshop 1986 Automated Reasoning Workshop 1986 Mathematics and Computer Science Division Argonne National Laboratory You are invited to a workshop on automated reasoning to be held at Argonne National Laboratory on June 24 and 25, 1986. This workshop, the fifth of its kind, will take the form of a set of tutorials. Our first objective is to acquaint people with the basic aspects of automated reasoning and with the possible appli- cations. Thus we shall discuss some of the previously open ques- tions we have solved and feature topics such as the design of logic circuits, the validation of existing circuit designs, and proving properties of computer programs. Our second objective is to learn of new problems on which the current methodology might have an impact. In fact, the preceding workshops did lead to such discoveries, as well as to collaborative efforts to seek solutions to these problems. Enclosed is a tentative schedule that briefly describes the various talks. On the first day, we shall begin with an introductory lecture on what automated rea- soning is. We shall illustrate the various concepts first with puzzles. Next, we shall focus on some applications of automated reasoning. We shall include a demonstration of an automated rea- soning program (ITP) that is portable, runs on relatively inex- pensive machines, and is available to other users. On the second day we shall give an introduction to Prolog, discuss additional applications, and focus on state/space problems. On both days, we have scheduled reviews of the material and open discussions. We welcome you to this 1986 workshop on automated reasoning. Participation will require a small charge, no more than $60. In- cluded in this fee will be the cost of the book Automated Reason- ing: Introduction and Applications, written by Wos, Overbeek, Lusk, and Boyle and published by Prentice-Hall. This book covers the field of automated reasoning from its basic elements through various applications. Its tutorial nature will guide our approach to the workshop. We urge you to respond to this invitation as soon as possible for, to retain the tutorial atmosphere of the workshop, we may be forced to limit the number of participants. The order in which requests are received will be an important parameter in issuing invitations to attend the workshop. Sincerely, L. Wos Senior Mathematician Please send all replies to ARPA: wos@anl-mcs.arpa or Dr. Larry Wos Mathematics and Computer Science Division Argonne National Laboratory Argonne IL 60439 Schedule for Automated Reasoning Workshop 1986 June 24-25, 1986 Argonne National Laboratory Argonne, Illinois Tuesday, June 24 9:00 - 9:15 Preliminary remarks - Larry Wos 9:15 - 10:15 Introduction to automated reasoning - Larry Wos 10:15 - 10:30 Break 10:30 - 11:30 Solving reasoning puzzles - Brian Smith 11:30 - 12:30 Lunch 12:30 - 1:15 Choices of strategies and inference rules - Rusty Lusk 1:15 - 1:30 Demonstration 1:30 - 1:45 Break 1:45 - 2:45 Proving properties of computer programs - Jim Boyle 2:45 - 3:00 Closing discussion - Larry Wos Wednesday, June 25 9:00 - 9:15 Discussion - Larry Wos 9:15 - 10:15 Introduction to Prolog - Rusty Lusk 10:15 - 10:30 Break 10:30 - 11:30 State-space problems - Rusty Lusk 11:30 - 12:30 Lunch 12:30 - 1:15 Circuit design and validation - Jim Boyle 1:15 - 1:45 Open problems in mathematics and logic - Rusty Lusk 1:45 - 2:00 Break 2:00 - 2:45 Details of the solution of an open problem in logic - Larry Wos 2:45 - 3:15 Our automated reasoning software - Rusty Lusk 3:15 - 3:30 Closing remarks - Larry Wos ------------------------------ Date: Thu, 3 Apr 86 10:45:07 est From: Tom Scott Subject: Conference - Knowledge Engineering Forum I. ANNOUNCEMENT Announcing KNOWLEDGE-ENGINEERING FORUM Tuesday, May 6, 1986 University of Wisconsin-Green Bay Christie Theatre Announcing a conference on knowledge engineering (KE) and applications of artificial intelligence (AI) in business and industry in the Northeastern Wisconsin area. Featured are presentations by practitioners in the field, demonstrations of hardware and software, and an executive briefing/group discussion on developing applications and building an in-house KE group in your own situation. The fee for attending the conference is $30.00. Enrollment in the conference is limited. For further information about attendance and fee payment, please contact Prof. Dennis Girard College of Environmental Sciences University of Wisconsin-Green Bay Green Bay, WI 54301-7001 Phone: 414-465-2285 (office) 414-465-2371 (secretaries) II. SCHEDULE OF EVENTS 8:30 Registration and coffee hour 9:00 "Welcome" by David Jowett, Vice-Chancellor for Academic Affairs, UW-Green Bay 9:15 "An Overview of Knowledge Engineering: The Theory, Practice, and Technology of Knowledge-Based Decision- Support Systems" by Roger Pick, Assistant Professor, Information Systems, Graduate School of Business, UW-Madison 9:45 "Artificial Intelligence and Knowledge Engineering: A Perspective on the Future" by Clarke Harrison, Symbolics, Inc., Chicago, IL 10:15 Break 10:30 "Knowledge Engineering: A Practical Perspective" by Stephen Zvolner, Senior Research Scientist, Johnson Controls, Milwaukee, WI 11:30 Lunch and informal group discussions 1:00 Executive Briefing/Group Discussion (1) Executive Briefing: "Knowledge Engineering Methodology" by Gene Korienek, Johnson Controls, Milwaukee, WI (2) Group Discussion: "Developing an In-House Knowledge-Engineering Group" by those attending the conference 2:30 Break 2:45 Hardware and Software Demonstrations (to be announced) 3:45 Review and Closing III. COMMENTS AND TENTATIVE OUTLINE OF GENE KORIENEK'S EXECUTIVE BRIEFING ON KE METHODOLOGY The cornerstone of the conference is the 1:00-2:30 slot, which is dedicated to the executive briefing on KE methodology and the group discussion on developing in-house KE groups. The executive briefing will be presented by Gene Korienek of Johnson Controls. Gene is well versed in the theory, practice, and technology of knowledge engineering and will integrate his presentation on KE methodology with the group discussion on developing in-house KE groups. The key to the integration of the topics of the executive briefing and the group discussion is to view KE methodology on an object level and the developing of in-house KE groups on a meta level. Executives and managers are concerned with the design, building, and maintaining of KE groups, which in turn are concerned with the design, building, and maintaining of KE systems: executives and managers build groups that build KE systems. In order to build a KE group, one must have at least a general idea how to build a KE system. The two topics are intimately related and are best considered in one breath. Gene plans to complete his presentation in the first hour (1:00-2:00). During that time he will solicit questions and comments and will generally encourage group participation. The last half hour (2:00-2:30) will be given over to the dynamics of group discussion. Gene's presentation on KE methodology will include some of the following points of interest: (1) KE methodology in general: What is the methodology for the engineering of knowledge? Does KE methodology differ from previous methodologies for the design, building, and maintenance of MIS and EDP applications? If there is a difference, what is it? Does the process of iterative development and testing occur more in knowledge engineering than in MIS/EDP? What role does Prolog play in the prototyping of KE systems? (2) The recruiting, training, and maintaining of personnel to staff an in-house KE group: How can local talent be developed? Do KE personnel have to be trained and imported from Silicon Valley and Boston, or can they be trained locally? Once the personnel are recruited and trained, how can they be maintained? How does a corporation in Northeastern Wisconsin keep the interest and education level of its in-house KE group alive? What is to prevent members of a KE group from leaving the local area for greener pastures on the East and West Coasts? (3) The acquisition and development of hardware and software environments to be used by an in-house KE group in the development of KE systems: Why have DEC-compatible systems and the VAX computer family been so popular in the AI/KE community? How can the Unix development environment for KE systems be integrated with the IBM environment that many corporations have installed for MIS/EDP applications? How do the GNU Project and the emergence of freeware as a viable economic force affect a corporation's strategic KE plan? What is the GNU Project Emacs? What is GNU Emacs? It is said that Emacs is more than an editor: Emacs is an entire development environment which fits naturally and effortlessly into a Unix development environment. Why is this the case? Should a business or industrial corporation that plans to develop an in-house KE group follow the traditional academic AI/KE path of DEC, VAX, Unix, and GNU Emacs, or should the corporation instead follow the commercial path laid out by IBM? What are the theoretical, practical, and technological considerations for comparing, contrasting, and integrating the DEC/VAX/Unix/Emacs environment with the IBM environment? (4) The human process of actually building KE systems: What are the group dynamics involved in the process of building KE systems? How do this process and the group dynamics of in-house KE groups differ from what takes place under the MIS/EDP paradigm? IV. EXECUTIVE SUMMARY AND OUTLINE OF POSSIBLE TOPICS FOR THE GROUP DISCUSSION ON DEVELOPING IN-HOUSE KNOWLEDGE-ENGINEERING GROUPS The development of an in-house knowledge-engineering group is a deliberate and gradual process that unfolds within a corporation's long-range strategic plan. This process requires a commitment on both the corporate and community levels in order to train, recruit, and maintain the human resources and to acquire and develop the knowledge-engineering environment. There are three areas to consider in the development of in-house KE groups: A. Individual Corporate Action; B. Community Action; C. A Vision of Knowledge Engineering. A. Individual Corporate Action (1) Cooperation with other businesses in the training and maintaining of local personnel (2) A team to fulfill the five basic functions of each KE project: (a) Project leader (b) Domain expert--hence the name "expert system" (c) Conceptualist: Plan, design, and document (d) Encoder: Implement and test (e) Systems programmer: Unix and IBM systems B. Community Action (1) Formation of an ACM-SIGART chapter (2) Teaching of AI languages (Lisp, Prolog), production systems (ITP, OPS5, OPS83), and KE courses in area high schools, technical colleges, and at the university (both undergraduate and graduate levels) (3) Establishment of a regional AI/KE training center for Northeastern Wisconsin at the university level C. A Vision of Knowledge Engineering (1) The Knowledge Age: theory, practice, and technology (a) The practical focus of KE on decision-support systems (DSS) and information-retrieval systems (IRS) differentiates KE from AI. (b) Such articles as "Why Computers May Never Think Like People" (Hubert and Stuart Dreyfus, "Technology Review", January, 1986) are of immediate benefit to KE and of questionable value to AI. (2) Theory, practice, and technology: A modern structure in America and Japan inherited from ancient Greece (theoria, praxis, and techne) (a) Forthcoming Prentice-Hall manuscript, "A Vision of Knowledge Engineering" by Tom Scott (Autumn 1987) (b) Japanese R&D projects in AI/KE: Fifth Generation Computing System (FGCS) and Sixth Generation Computing System (SGCS) (c) MCC: America's cooperative challenge to Japanese FGCS and SGCS V. FINAL COMMENTS Since the detailed format and content of the conference are still being arranged, the schedule of events and comments in the above four sections (I-IV) are subject to change. For information on the final schedule and attendance at the conference, please contact Prof. Dennis Girard at the phone number or address listed in section I. * * * Tom Scott CSNET: scott@bgsu Dept. of Math. & Stat. ARPANET: scott%bgsu@csnet-relay Bowling Green State Univ. UUCP: cbosgd!osu-eddie!bgsuvax!scott Bowling Green OH 43403-0221 ATT: 419-372-2636 (work) ------------------------------ End of AIList Digest ******************** From vtcs1::in% Wed Apr 9 18:47:27 1986 Date: Wed, 9 Apr 86 18:47:24 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #72 Status: R AIList Digest Wednesday, 9 Apr 1986 Volume 4 : Issue 72 Today's Topics: Psychology - Computer Emotions ---------------------------------------------------------------------- Date: 29 Mar 86 19:27:23 GMT From: hplabs!hao!seismo!harvard!bu-cs!bzs@ucbvax.berkeley.edu (Barry Shein) Subject: Re: Computer Dialogue Re: should computers display emotions I guess a question I would be more comfortable with is "would people be happier if computers mimicked emotions". Ok, from experience we see that people don't love seeing messages like "Segmentation Violation -- Core Dumped" (although some of us for different reasons.) Would they be 'happier' if it said 'ouch'? Well, probably not, but the question probably comes down to more of a human-engineering machine interface issue. We certainly got somewhat ridiculous at one extreme (we being systems people not unlike myself, maybe not you) with things like: IEF007001 PSW=001049FC 0E100302 pretending to be error messages, let's face it, that's no less artificial (and barely more useful unless you have a manual in hand and know how to use that manual and know how to understand that manual, often the manual was written by the same sort of brain that thought IEF007001 was helpful) than 'ouch'. We (again, we system types) have just come to accept that sort of cruft as being socially correct (at least not embarrasing as we might feel if we put 'ouch' into our O/S err routines). The macintosh displays a a frowning face when it's real unhappy, most people I know chuckled once and then remarked "that's really stupid, how about some useful info jerks?" (like IEF007001?) I wouldn't be the least bit surprised to hear that those smiley/frowney macs lost them heaps of sales (we can't have CUTE on the CEO's desk...give me IEH007001!) I think we keep straddling some line of appearing real professional (IEF007001) vs terminal cutesiness (ouch.) I suppose there is a huge middle ground with some dialogue (like computer dialogues). -Barry Shein, Boston University ------------------------------ Date: 31 Mar 86 23:36:03 GMT From: decvax!hplabsb!marvit@ucbvax.berkeley.edu (Peter Marvit) Subject: Re: Computer Dialogue > Mark Davis asks if computers have anything akin to human feelings. > > Barry Kort responds with a wonderful description of a gigantic telephone switching system and draws a powerful parallel with its sensors and resulting information about physical problems and the very human sense of pain. A friend of mine and I were discussing a similar point. If a computer were able to tell us "what it is like to be a computer," would it be considered concious? That is, what would be our nomenclature for a system which could describe its innards and current state (and possibly modify some of itself - perhaps by taking "home remedies"). My friend is a philosopher and I am a computerscientist/humanist (admittedly an oxymoron at times). I contend conciousness is a slippery term which I find uncomfortable. Further, existing computer systems exhibit such behavior, albeit in a somewhat crude and unsophiticated fashion (see "df" or "fsck"). Barry gave another excellent example, cited above. However, the question is still a valid one- if one looks beyond the operational issues and poses the more subtle philosophical query: What is it like to "be" anything and what would/could a computer say about itself? At one point, I argued that the question may be completely outside the computer's world view. That is, it would be like asking a five year old what sex feels like (please, no flames about sophisticated tykes). The computer wouldn't have the vocabu- lary or internal model to be able to answer that. Yet, if we programmed that capability in ... I look forward to your thoughts on the net or to me. Peter Marvit ...!hplabs!marvit Hewlett-Packard Laboratories ------------------------------ Date: 31 Mar 86 14:53:58 GMT From: nike!riacs!seismo!cit-vax!trent@ucbvax.berkeley.edu (Ray Trent) Subject: Re: re: Computer Dialogue #1 In article <2345@jhunix.UUCP> ins_akaa@jhunix.UUCP (Ken Arromdee) writes: >>toasters do"... doesn't mean that a combination of many toasters cannot, and >You are actually quite correct. There's one problem here. Toasters can store >perhaps two or three bytes of information. Consider how many toasters Correct me if I'm wrong, but my understanding of the currently dominant theory about the way human beings remember things says that brain store NO "bytes" of information at all, but that memory is a congregate effect generated by the _interconnections_ of the brain cells. The only papers I have read on this subject are by John Hopfield here at Caltech. Does anyone out there have any pointers to good research (people or papers) being done in this field? (have email, will summarize) I am particularly interested by this subject because I have seen simple programs that simulate the connection matrix of a simple neural network. This program can "remember" things in a connection matrix, and then "recall" them at a later time given only pieces of the original data. Sample session: % learn "Ross" "Richard" "Sandy"... % ask "Ro" Ross % ask "Ri" Richard % ask "R" Rqchird Note the program's reaction to an ambiguous request; it extrapolated from what it "knew" to a reasonable guess at a "real memory" (note that 'i' + 8 = 'q' and 'a' + 8 = 'i' so the memory was correct up to 1 bit in each of two places.) The interesting thing about this sort of scheme is its reaction to failed active elements. If you destroy (delete) several locations in the connection matrix, the program doesn't lose any specific knowledge, but it becomes harder for it to extrapolate to the "real memory" and distinguish these from "spurious memories." Of course, after a certain point...things break down completely, but it's still interesting. "In a valiant attempt to save the universe, his large intestine leapt out of his body and throttled him..." (if you don't understand that, ignore it.) -- ../ray\.. (trent@csvax.caltech.edu) "The above is someone else's opinion only at great coincidence" ------------------------------ Date: Wed 2 Apr 86 17:41:51-PST From: GARVEY@SRI-AI.ARPA Subject: Re: Computer Dialogue Why don't you try to define what you mean by "feel?" If you get beyond a definition based on fairly mechanistic principles, then you have a discussion; if you don't, then your computer will probably be shown (uninterestingly) to feel by definition. I think it's koans like this (assuming it isn't an April Fool joke) that keep the Dreyfi in business and that suggest that the field needs serious tightening. If the computer should "feel" anything, why should you assume that it feels bad when it doesn't seem to be working correctly? Perhaps it's taking a vacation; probably it hates people and loves to make them mad. Cheers, Tom ------------------------------ Date: 1 Apr 86 12:53:34 GMT From: ulysses!mhuxr!mhuxt!houxm!hounx!kort@ucbvax.berkeley.edu (B.KORT) Subject: Re: Computer Dialogue Peter Marvit asks if computers can have anything akin to consciousness or self-awareness similar to humans. Excellent question. One thing that computers *can* have is simulation models of other systems. The National Weather Bureau's computers have a model of atmospheric dynamics that tracks the evolution of weather patterns with sufficient accuracy that their forecasts are at least useful, if not perfect. NASA and JPL (Jet Propulsion Laboratory) have elaborate computer models of spacecraft behavior and interplanetary ballistics, which accurately track the behavior and trajectory of the real mission hardware. Computers can also have models of other computers, which emulate in software the functioning of another piece of hardware. What would happen if you gave a computer a software model of *its own* hardware configuration and functioning? The computer could run the model with various perturbations (e.g. faults or design changes) and see what happened. Now suppose that the computer was empowered to use this model in conjunction with its own fault-detection network. The computer could diagnose many of its own ills, and choose remedial action. It could also explore the wisdom of possible reconfigurations or redesigns. Digital Equipment Corporation (DEC) has an Expert System that works out optimal configurations for their VAX line of computers. The Expert Systems runs on....(you guessed it)... a VAX. If a computer can have a reliable model of itself, and can use that model to maintain and enhance its own well-being, are we very far away from rudimentary consciousness? For some delightful and delicious reading on computer self-awareness, the meaning of the word "soul", and related philosophical musings, I recommend _The Mind's I_, composed and arranged by Douglas Hofstadter and Daniel Dennett. --Barry Kort ...ihnp4!houxm!hounx!kort ------------------------------ Date: Sat, 5 Apr 86 14:46:35 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: A Byte of Toast. Quoted in Vol 4 # 62 :- ``Our brains are enormously complex computers''. If so, then do we all run the same operating system? And what are the operating systems of toasters? Gordon Joly, ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj ------------------------------ Date: 7 Apr 86 03:09:16 GMT From: ulysses!mhuxr!mhuxt!houxm!whuxl!whuxlm!akgua!gatech!seismo!rochester !rocksanne!sunybcs!ellie!colonel@ucbvax.berkeley.edu Subject: Re: what's it like (TV dialogue #1) Reporter: "Mr. Computer, what's it like to be a computer?" Computer: "Well, it's hard to explain, Frank, ..." Reporter: "For example, what's it like to be able to read a magtape at 6250 bpi?" Computer: "It feels just great, Frank. Really great." Col. G. L. Sicherman UU: ...{rocksvax|decvax}!sunybcs!colonel CS: colonel@buffalo-cs BI: csdsicher@sunyabva ------------------------------ End of AIList Digest ********************