From vtcs1::in% Thu Apr 17 00:58:57 1986 Date: Thu, 17 Apr 86 00:58:50 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #92 Status: RO AIList Digest Wednesday, 16 Apr 1986 Volume 4 : Issue 92 Today's Topics: Query - KEE Experiences, Seminars - Cortical Activity for Conscious Sensory Experience (UCB) & Inexact Reasoning Using Graphs (UTexas) & Prolog: Application to Design Verification (SU) & An Application of Machine Self-Reflection (SUNY-Buffalo), Conferences - ACL Annual Meeting & II Finish AI Symposium (STeP 86) ---------------------------------------------------------------------- Date: Mon, 14 Apr 86 10:04:34 est From: jcm@ORNL-MSR.ARPA (James A. Mullens) Subject: KEE experiences (Posted for a friend) As part of a class in expert systems at the University of Tennessee I am preparing a report on KEE. I thought it would be interesting to include the reactions/experience of the users of KEE. Any comments would be greatly appreciated. I also have a more practical interest in any response I might get because the Dept. of Nuclear Eng., recently purchased KEE. You can respond privately to jcm@ornl-msr.arpa if you wish. The report will be available to the network. Contributors will be identified unless they request otherwise. Thanks in advance, Ray Brittain ------------------------------ Date: Mon, 14 Apr 86 14:58:30 PST From: admin%cogsci@berkeley.edu (Cognitive Science Program) Subject: Seminar - Cortical Activity for Conscious Sensory Experience (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Spring 1986 Cognitive Science Seminar - IDS 237B Tuesday, April 22, 11:00 - 12:30 2515 Tolman Hall Discussion: 12:30 - 1:30 3105 Tolman (Beach Room) ``Cortical activity required for a conscious sensory experience, with cognitive implications'' Benjamin Libet Physiology, UC San Francisco Abstract Experiments involving direct electrical stimulation and recordings in the cerebral somatosensory system of awake human patients have indicated that a substantial period of activity (up to 500 msec+/-) is required to elicit a sensory experience. More indirect evidence supports this requirement for brief peripheral inputs as well. However, subjective timing of the experience is "antedated" back to the time of the initial fast-arriving signal. This hypothesis of "neuronal delay plus subjective antedating" for a conscious sensory experience has important implications for the processing of conscious and unconscious sensory functions. ------------------------------ Date: Mon, 14 Apr 86 19:04:08 cst From: kumar@SALLY.UTEXAS.EDU (Vipin Kumar) Subject: Seminar - Inexact Reasoning Using Graphs (UTexas) University of Texas Computer Sciences Department COLLOQUIUM SPEAKER: Judea Pearl University of California, Los Angeles TITLE: Inexact Reasoning Using Graphs DATE: Thursday, April 17, 1986 PLACE: WEL 3.502 TIME: 4:00-5:00 p.m. In order to meet requirements of modularity, transparency and flexibility, the designers of 1st-generation expert systems have abandoned traditional probability theory and have 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 ob- jectives of experts systems technology. The first part of the talk will stress the relationship between TRANSPARENCY and reasoning with GRAPHS. We will examine what kind of inferential dependencies are representable by graphs, and will compare the properties of two such representa- tions: Markov Networks and Bayes Networks. The second part will describe a distributed scheme for coherently propagating beliefs in Bayes Networks. It facilitates flexible control strategies and sound explanations, it supports both predictive and diagnostic inferences, and it is guaranteed (in sparse graphs) to converge in time proportional to the network's diameter. COFFEE AT 3:30 in TAY 3.128 ------------------------------ Date: Mon 14 Apr 86 19:31:12-PST From: Christine Pasley Subject: Seminar - Prolog: Application to Design Verification (SU) CS529 - AI In Design & Manufacturing Instructor: Dr. J. M. Tenenbaum Title: Prolog: Application to Design Verification Speaker: Harry G. Barrow From: Schlumberger Palo Alto Research Date: Wednesday, April 16, 1986 Time: 4:00 - 5:30 Place: Terman 556 PROLOG is a programming language based upon predicate logic. It was developed in Europe, where it is widely used, and subsequently adopted in Japan as a basis for much of the "Fifth Generation" research and development. At SPAR, we have been developing a program called VERIFY, written in PROLOG, that attempts to prove correctness of digital hardware designs. VERIFY first derives a description of the behavior of the whole design from the behavior of its components and the way they are interconnected. The derived behavior description is then shown to be equivalent (or not) to the intended behavior given in a specification. VERIFY has successfully verified large designs involving many thousands of transistors in just ten minutes. Visitors welcome! ------------------------------ Date: Mon, 14 Apr 86 16:32:25 EST From: "William J. Rapaport" Subject: Seminar - An Application of Machine Self-Reflection (SUNY-Buffalo) UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK DEPARTMENT OF COMPUTER SCIENCE COLLOQUIUM JOHN CASE Department of Computer Science University at Buffalo ANSWERING THE MATHEMATICAL OBJECTION TO MACHINE INTELLIGENCE: AN APPLICATION OF MACHINE SELF-REFLECTION We briefly consider the standard paradox in the notion of a machine ``having'' a complete model of itself and show how to circumvent it. Then we pictorially present a simple theoretical application of machine self-reflection and use this application as a vehicle to illustrate what Turing called the mathematical objection to machine intelligence. Lastly, we employ machine self-reflection to completely answer this objection. Thursday, April 17, 1986 4:00 P.M. Bell 338, Amherst Campus Coffee and doughnuts will be served at 3:30 P.M., 224 Bell Hall For further information, call (716) 636-3181. ------------------------------ Date: Tue, 15 Apr 86 21:24:04 est From: walker@mouton.bellcore.com (Don Walker at mouton.bellcore.com) Subject: Conference - ACL Annual Meeting ACL Annual Meeting, 10-13 June, Columbia University, New York City The Program and Registration Information brochure is just being mailed to all ACL members and to selected members of AAAI and LSA. If you are not sure you will be receiving it and would like a net copy, send a message to one of the addresses below; and I will (try to--even electronic mail is not always reliable) send you one. Please include the phrase "ACL net info" in the subject line. And include the full net address in the body of the message; the complexity of network connections coupled with the poverty of our mail system sometimes makes "replies" unsendable. The file has about 20,000 characters; it contains the full program (33 papers; an invited presentation by Gary Hendrix; two forums, one on Connectionism with Terry Sejnowski and Dave Waltz, the other on Machine Translation with Martin Kay and Maghi King); descriptions of the 6 tutorials (Intro to Computational Linguistics, Natural Language Generation, Structuring the Lexicon, Recent Developments in Syntactic Theory and Their Computational Import, Current Approaches to Natural Language Semantics, and Machine Translation--all held on 10 June); registration information and directions; and an Application Form that can be printed out, filled in (or filled in, printed out), and mailed in. Inexpensive air-conditioned dormitory accommodations are available, and some good rates for hotels have been secured. We are still encouraging people who would like to exhibit or demonstrate programs to contact Ralph Grishman (Computer Science, New York University, 251 Mercer Street, New York, NY 10012; 212:460-7492; grishman@nyu.arpa). Don Walker walker@mouton.arpa walker%mouton@csnet-relay {ucbvax, ihnp4, ...}!bellcore!walker address mail to: Donald E. Walker (ACL) Bell Communications Research 445 South Street, MRE 2A379 Morristown, NJ 07960, USA 201:829-4312 ACL Annual Meeting, 10-13 June 1986, Columbia University, New York City ------------------------------ Date: Tue, 15 Apr 86 17:16:37 -0200 From: mit%hut.UUCP%fingate.bitnet@WISCVM.WISC.EDU (Markku Tamminen) Subject: Conference - II Finish AI Symposium (STeP 86) CALL FOR PAPERS Deadline May 30 STeP 86 - II Finnish Artificial Intelligence Symposium Helsinki University of Technology, Otaniemi, Espoo, Finland August 20-22, 1986 The Second Finnish Artificial Intelligence Symposium will be or- ganized by the Finnish Society of Information Processing Science and the Helsinki University of Technology. The Symposium is to provide an overview of the research and development that has taken place since STeP 84. Papers are re- quested on all aspects of artificial intelligence. The contribu- tions will be published as the STeP 86 Proceedings and distribut- ed to particiants of the symposium. Please send an abstract (no longer than one page) by May 30. The program committee will inform you about its decicions by June 15. Final camera-ready copy of papers corresponding to 30 minute talks will be required by July 31. The formatting conventions will be sent separately to authors. Tutorials will be held at the start of the symposium, and propo- sals for them are also solicited. Signed Markku Syrjaenen Jouko Seppaenen Head of Program Committee Head of Organizing Committee Please use one of the following adresses for submitting the abstract, and for any queries: BITNET, EARNET: mit%hut.uucp@fingate ARPANET: mit%hut.uucp%fingate.bitnet%cernvax.bitnet@wiscvm.wisc.edu Please use uucp only if the above nets not available: {seismo!mcvax, enea!tut}!penet!hut Non-electronic mail: STeP 86 c/o Jouko Seppaenen Computing Centre Helsinki University of Technology SF-02150 Espoo 15 Finland APPENDIX Examples of topics suited for papers: - Theoretical foundations - Expert systems - Knowledge representation - Tools of knowledge engineering - Problem solving methods - Languages (Lisp, Prolog etc.) - Searching and planning - Programming techniques - Logic programming - AI workstations, environments etc. - Pattern recognition, vision - Industrial applications, robotics etc - Natural language, speech - Applications to management - Cognitive modeling - Applications to education - Knowledge acquisition, learning - AI and arts Markku Tamminen Helsinki University of Technology Laboratory of Information Processing Science 02150 ESPOO 15 FINLAND Tel: 358-0-4512020 (460144) ARPANET: mit%hut.uucp%fingate.bitnet%cernvax.bitnet@wiscvm.wisc.edu BITNET: mit%hut.uucp@fingate ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri Apr 18 07:01:32 1986 Date: Fri, 18 Apr 86 07:01:28 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #93 Status: RO AIList Digest Friday, 18 Apr 1986 Volume 4 : Issue 93 Today's Topics: Queries - Machine Translation & Nontrivial Expert Systems, Representation - Shape, Project - Real-Time Machine Learning, News - Max the Robot, Review - Canadian AI Newsletter, March 1986 ---------------------------------------------------------------------- Date: Wed, 16 Apr 86 08:42:55 GMT From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: Points Arising. Re: Computer Dialogue (Vol 4 # 57 & 58). I wonder how (many) psychological "strokes" were exchanged in this conversation? Re: Machine Translation (Vol 4 # 67 & 70). Impressive claims are made for machine translation systems; are there any systems that could produce a precis (summary) of a large document? Gordon Joly ARPA: gcj%qmc-ori@ucl-cs.arpa UUCP: ...!ukc!qmc-cs!qmc-ori!gcj "They who often look far into the distance have excellent vision." ------------------------------ Date: 16 Apr 86 04:11:07 GMT From: ihnp4!lzaz!psc@ucbvax.berkeley.edu (Paul S. R. Chisholm) Subject: Non-trivial expert systems < The electronic funds transfer is in the electronic mail. . . . > For those of you who remember my Usenet posting in November, I'm *still* looking for MS-DOS based expert systems for a review. I'll shortly post a much longer list of such packages. For the moment, I want to deal with something more fundamental. I want to show the difference between an expert system and a simple decision tree. Yet most of the examples (and the one software package) I've seen, there *is* no difference . . . or at least, the one can be transformed into the other. Nearly all the expert system shells are actually based on productions: if and and ... then . The conditions can be arbitrarily complicated, but usually involve testing "global variables" against constant values, and possible a bit of trivial arithmetic. The consequent assert that yet another global variable has some constant value. There are wrinkles: the most common is having variables that are "local" to a rule. This isn't strictly necessary, but saves a lot of tedious, repetitious rule writing. In theory, it's always possible to treat each production as a node, and construct a tree of questions without knowing any of the answers ahead of time. This disturbs me, though I realize generating a meaningful tree is nontrivial. In practice, damn near *everyone* draws that tree first, then writes the rules. This is missing the point! If your "expert" knowledge is that trivial, you don't need logic, just a branch follower. I tried drawing a "subway network", and writing rules of how to get from one station to another. This isn't very instructive: forward chaining doesn't find anything like an optimal solution, and backwards chaining takes every damn trip. (*sigh* - Can you tell my first AI course was taught out of Nilsson's PROBLEM-SOLVING METHODS IN ARTIFICIAL INTELLIGENCE? Nilsson thought all AI reduced to search.) I've seen one sample expert system that didn't reduce to a tree, and I'm not at all sure simple shells can solve it! C. J. Culbert (sp?) of NASA sent me a wonderful "monkey and banana" system that requires about eighty inferences. The solution involves things like "move the ladder under the red box, climb up and get the green key out, climb down and move the ladder under the green box, climb up, unlock the green box with the green key, get the blue key . . ." Very nice, but the expert system shells I've seen can't handle time, e.g., "first move the ladder to A, then once you've finished this subtask, move the ladder to B". Once a value (e.g., ladder location) is deduced, it's hard or impossible to change. "Undoing" isn't always kosher either: if I have a glass of milk, I can quench my thirst or make butter, but once I've done one . . . What are my points? + First and foremost, I'd like a expert system that can be solved with simple productions. It shouldn't be an example provided by a vendor I'll review; that'd potentially give his or her product an edge. + Second, I'd like some reassurance that production-based expert systems go beyond decision tree programs. Please don't flame to the net on this one. I'm posting to both Usenet and Arpanet groups; if you send me mail (I'm reachable from both), I'll summarize and repost. Sorry to ramble, thanks in advance for your help, and I'll post the MS-DOS expert systems as soon as I can. -- -Paul S. R. Chisholm, UUCP {ihnp4,cbosgd,pegasus,mtgzz}!lznv!psc AT&T Mail !psrchisholm, Internet mtgzz!lznv!psc@topaz.rutgers.edu The above opinions may not be shared by any telecomm company. ------------------------------ Date: Sun, 13 Apr 86 11:45:51 EST From: Jim Hendler Subject: shape Ken- The work done so far on shape falls loosely into the classes of ``solid modeling'' and ``functionality.'' The questions you ask in the AI digest were more from the solid modeling camp -- i.e. Can I put this peg in this hole? I'm not incredibly familiar with that literature, but some recent work in automated manufacturing (a big buzzword these days) has included this type of work. Dana Nau (dsn@maryland) has a paper which will be appearing in a new journal (I forget the name, it's one of the new ``applied AI'' journals) which discusses a frame based approach to solid modeling. He also has several tech. reports at U of Maryland on such a topic. The functionality work is more my line (I have a couple of students starting thesis work on it now). This research has traditionally focused on recognizing objects from functional information (i.e. from the dialogue John: Do you know the time Mary: 1 PM we infer that Mary has a watch) I'm looking into expanding it in a direction that starts to interact more with the solid modeling stuff. I'd like a description of a ``cleaver'' such that I could INFER that it is a weapon. At the moment most systems (including my own planners) must have this information stored explicitely. It is this my students are now looking into. Hope this is of some help Jim Hendler Ass't Professor University of Maryland Hendler@maryland ------------------------------ Date: Wed, 16 Apr 86 13:28:00 est From: Stanley Letovsky Subject: shape To: laws@sri-iu Ernie Davis at NYU was working on this problem; I read a manuscript of his entitled something like "Buttons, Rakes and Rings" last year. I don't know if he published it anywhere but you might ask him what the status of the work is. He was trying to define an ontology for qualitative and loose quantitative reasoning about shape. -Stan ------------------------------ Date: Thu, 17 Apr 86 13:45:04 PST From: Scott Turner Reply-to: srt@ucla-cs.UUCP (Scott Turner) Subject: Re: Shape Jack Hodges of the UCLA Artificial Intelligence Laboratory is working on EDISON, a program that invents mechanical devices. Jack is in England this week presenting his work at a conference, so I'm standing in for him in presenting some references that might be useful for understanding "hooks and rings". First of all, the Edison project looks at naive invention: the kind of tinkering that backyard inventors or (one supposes) children do. There is no complex of mathematical forces in the project. It focuses instead on the issues of creativity and problem-solving. How _does_ one get that great idea? The reference: EDISON: An Engineering Design Invention System Operating Naively, Hodges, Dyer, Flowers, Tech Report UCLA-AI-85-20, Dec. 1985 There has been a lot of work done on naive physics. The reference I'm aware of is: Hayes, P.J., "The Second Naive Physics Manifesto," pp. 467-486 in _Readings in Knowledge Representation_, ed. Brachman & Levesque, Morgan Kaufman, 1985 There has been some work done on object representation, primarily: Lehnert, W.G., _The Process of Question Answering_, LEA 1978. (see Chapter 9). Rieger, C. "An Organization of Knowledge for Problem Solving and Language Comprehension", pp. 487-508, _Readings in Knowledge Representation_... Wasserman, K. and Lebowitz, M., "Representing Complex Physical Objects," _Cognition and Brain Theory_, 6(3), pp. 259-285 (1983) Finally, for the particular area of children's problem solving: DeBono, E., _Children Solve Problems_, Penguin, NY 1980. And not to overlook work by Forbus, DeKleer and Brown, though I won't bother to type in the cites. That should get you started. Scott R. Turner ARPA: (now) srt@UCLA-LOCUS.ARPA (soon) srt@LOCUS.UCLA.EDU UUCP: ...!{cepu,ihnp4,trwspp,ucbvax}!ucla-cs!srt FISHNET: ...!{flounder,crappie,flipper}!srt@fishnet-relay.arpa ------------------------------ Date: Wed, 16 Apr 86 15:46:06 pst From: malkoff@nprdc.arpa (Don Malkoff) Subject: real-time machine learning The "REAL-TIME MACHINE LEARNING LABORATORY" has been established at the Navy Personnel Research and Development Center, Code 71, San Diego, CA 92152-6800. Ongoing work includes: 1. Real-time fault detection and diagnosis in complex control systems, involving random time variability, and 2. Automated sonar detection and classification. These and other related project areas make use of machine learning techniques. For information contact Don Malkoff, (619) 225-6617. ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Max the Robot Source: KRLD News, Dallas A man, for unknown reasons, baricaded himself into an apartment. Since he had a history of explosive law violations, the police did not want to enter the apartment. They did not even know if he was still alive as he was not talking to them and a friend said he was extremely depressed. They sent in Max the Robot, a tank-like entity complete with camera and manipulator. It smashed through the window and pushed a drape aside when the man, in astonishment, left the apartment peacefully without any shots being fired. [...] ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Review - Canadian AI Newsletter, March 1986 Canadian Artificial Intelligence March 1986 Issue Number 7 Biographies of new officers, letter from someone protesting the research effort into emulating the brain. Discussion of Intelligent Computer-Aided Instruction research in Canada, bemoaned the scarcity of AI researchers in Canada with psychology training. Specific Projects: University of Alberta: automate the teaching of statistics first course Bell Northern Research: modelled personality interactions between expert and builder and developed an artificial expert in horticulture University of Calgary: training materials for medical students including the use of videodisc University of Calgary: user modelling project Concordia University: application of Pask's "Conversation Theory" to team decision support and a course assembly and tutorial environment which runs on Apples ForceTen enterprises: expert system and natural language interface to be part of their courseware development system. The product runs on IBM PC's National Research Council: Project to develop adaptive computer- based training with natural language interface. University of Saskatchewan: Project to develop Lisp teacher and conception corrector, programming environment for first year students University of Waterloo: attempt to model students in a manner independent of system used __________________________________________________________________________ The Canadian Society for Fifth Generation Research has signed an agreement of understanding with the Japanese ICOT for exchange of technical informaiton and research meetings. This is the first collaboration that ICOT has signed with a foreign organization. __________________________________________________________________________ Machine Vision International has established its head office in Ottawa. __________________________________________________________________________ "Interest in artifical intelligence and expert systems is relatively new in Canada" From a Canadian government report on expert systems by the Office of Industrial Innovation, Department of Regional Industrial Expansion October 1985 __________________________________________________________________________ Reviews of Artificial Intelligence: A Personal, Commonsense Journey by William R. Arnold and John S. Bowie (an introduction to AI for lay readers but got a poor review.) Progress in Artifical Intelligence by Luc Steels and John A. Campbell (collection of papers from the 1982 European Conference on artificial intelligence) (Some short reviews as well) __________________________________________________________________________ List of AI Tech reports from Canadian Universities __________________________________________________________________________ Summary of the third and fourth University of Waterloo-University of Ontario AI workshops , Queen's University Expert System Workshop __________________________________________________________________________ Obituary for Paul A. Kolers, a researcher in psychology of visual perception ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri Apr 18 18:41:49 1986 Date: Fri, 18 Apr 86 18:41:42 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #94 Status: R AIList Digest Friday, 18 Apr 1986 Volume 4 : Issue 94 Today's Topics: Philosophy - Consciousness ---------------------------------------------------------------------- Date: 14 Apr 86 07:44:00 EST From: "CUGINI, JOHN" Subject: More wrangling on consciousness > >me: Briefly, we believe other people are conscious > >for TWO reasons: 1) they are capable of certain clever activities, > >like holding English conversations in real-time, and 2) they > >have brains, just like us, and each of us knows darn well that > >he/she is conscious. > > Nigel Goddard: Personally I think that the only practical > criterion (i.e. the ones we use when judging whether this > particular human or robot is "conscious") are performance ones. > Is a monkey conscious ?. If not, why not ? There are people I > meet who I consider to be very "unconscious", i.e. their stated > explanations of their motives and actions seem to me to > completely misunderstand what I consider to be the *real* > explanations. Nevertheless, I still think they are conscious > entities, and the only way I can rationalize this paradox is > that I think they have the ability to learn to understand the > *real* reasons for their actions. This requires an ability to > abstract and to make an internal model of the self, which may be > the main factors underlying what we call consciousness. At the technical level, I think it's simply wrong to dismiss brains as a criterion for consciousness - if mechanism M causes C (consciousness) and enables P (performance), then clearly it is an open question whether something that can do P, but does not have M, does or does not have C. At the "gut" level I think the whole tenor of the reply misses the point that consciousness is a very "low-level", primitive sort of phenomenon. Do severely retarded persons have "the ability to learn to understand the *real* reasons for their actions...an ability to abstract and to make an internal model of the self" ? or cows, or cats? Yet no one, I hope, doubts that they are conscious (eg, can feel pain, experience shapes, colors, sounds). This has very little to do with any clever information processing capabilities. And it is these "raw feelings" that a) are essential to what most people mean by consciousness and b) seem least susceptible to implementation by Lisp machines, regardless of size. John Cugini ------------------------------ Date: 13 Apr 86 09:50:25 GMT From: ihnp4!houxm!hounx!kort@ucbvax.berkeley.edu (B.KORT) Subject: Re: Computer Dialogue I think Paul King is right on the mark in his comments about the nature of feelings, instincts, and conscious awareness. Paul's point about a system having a world-model which includes the system itself as an entity within that world model is perhaps the most salient point in his article. Self-diagnosis, self-reconfiguration, and self-repair are already found in complex computer installations. Self-perpetuation is the higher-level goal of those three capabilities. The first industrial robots were put to work to build--you guessed it--more industrial robots. So we have self-reproduction, as well. In the case of industrial robots, evolution is speeded up by the hand of the creator, who introduces new models through intelligent intervention. We no longer have to wait for a serendipitous random perturbation to yield a more successful offspring. In my original Computer Dialogues #1 and #2, I playfully introduced a pair of self-programming computers who gradually developed a protocol for mutual self-learning. I think it may be possible, by the end of the millenium, to create the first rudimentary Artificial Sentient Being. --Barry Kort ...ihnp4!houxm!hounx!kort ------------------------------ Date: 13 Apr 86 22:07:13 GMT From: tektronix!uw-beaver!ssc-vax!eder@ucbvax.berkeley.edu (Dani Eder) Subject: Re: Computer Dialogue > Before the recent tragedy, there had been a number of > instances where the space shuttle computers aborted the mission in the > final seconds before launch. My explanation for this was that the > on-board computers were displaying a form of 'programmed survival > instinct.' In short: they were programmed to survive, and if the > launch had continued, they might not have. > In almost every countdown there have been delays because some measured parameter of the vehicle was out of tolerance. The ground launch sequencer, which controls events from t-9 minutes to t-25 seconds, and the onboard computers, which control events in the last 25 seconds, are required because there are too many time critical events for humans to handle. They command a series of actions, such as opening a valve, and take measurements from sensors, such as the temperature in the combustion chamber. When a sensor reading is outside allowable limits, the software stops the countdown and attempts to return the vehicle to a 'safe' condition. Earlier in the countdown, events occur at a slower pace, and humans monitoring the data coming from the sensors have often called a halt to the operation. The Shuttle system, men and machines, is designed to operate under the rule 'do not launch unless all the data says it is safe to do so'. Because the early 1970's technology used in the Shuttle is marginal for a reuseable transportation system, EVERYTHING has to be working just right for a successful launch. The computers used onboard the Shuttle are too dumb even to be programmed for survival. If there is an in-flight abort that requires returning to the ground from halfway to orbit, the pilot must turn a rotary switch on the console to choose between returning to Florida and landing in Senegal. The switch controls loading of data and routines into the computers. This was required because the software for flying the Shuttle runs ~500k of code, and the computers can only handle 64k. The decision routines for which part of the software to swap in were left in the pilots head. Dani Eder/Advanced Space Transportation/Boeing/ssc-vax!eder ------------------------------ Date: 14 Apr 86 19:26:11 GMT From: decvax!linus!faron!rubenk@ucbvax.berkeley.edu (Ruben J. Kleiman) Subject: Re: Natural Language processing In article <3500011@uiucdcsp> bsmith@uiucdcsp.CS.UIUC.EDU writes: > >You are probably correct in your belief that Wittgenstein is closer to >the truth than most current natural language programming. I also believe >it is impossible to go through Wittgenstein with a fine enough toothed >comb. However, there are a couple of things to say. First, it is >patently easier to implement a computer model based on 2-valued logic. >The Investigations have not yet found a universally acceptable >interpretation (or anything close, for that matter). To try to implement >the theories contained within would be a monumental task. Second, in >general it seems that much AI programming starts as an attempt to >codify a cognitive model. However, considering such things as grant >money and egos, when the system runs into trouble, an engineering-type >solution (ie, make it work) is usually chosen. The fact that progress >in AI is slow, and that the great philosophical theories have not yet >found their way into the "state of the art," is not surprising. But >give it time--philosophers have been working hard at it for 2500 years! > >Barry Smith Whoever believes that "engineering-type solution[s]" are the consequence of small grants or large egos: 1. should be able to conceive of an implementation of some concept (or the concept of an implementation) which does not involve "engineering-type solutions." 2. should NOT be able to give form to the notion of a "lag" between research ("great philosophical theories") and implementation ("state of the art"). - Ruben ------------------------------ Date: Tue, 15 Apr 86 15:08:54 EST From: tes%bostonu.csnet@CSNET-RELAY.ARPA Subject: please include In volume 4, Issue 87, Ray Trent wrote > Please define this concept of "consciousness" before > using it. Please do so in a fashion that does not resort > to saying that human beings are mystically different > from other animals or machines. Please also avoid self- > important definitions. (e.g. consciousness is what humans > have) ... > The above request also applies to the term "desire". ... > My definition of these concepts ["desires" and "feelings"] > would say that they "are" the actions that a life process > take in response to certain stimuli. Bravo, but with qualification: Mr. Trent has the "physicalist" point of view, which recognizes ONLY objects and phenomena describable in the "language of science" (what I mean by this is the language that deals exclusively with molecules, gravity, velocity, entropy, etc.). This general view of the universe is FINE, and it's obviously powerful and result-oriented (look at what we have done with it in the last few hundred years). BUT - this view is not the only one, or the "right" one, in any sense. I'll bet that the term "consciousness" is undefinable in the language of science, and therefore useless to the physicalists. (I have a hunch that physicalists cannot get any further than a behaviorial or mechanistic description of conscious beings). Therefore, in discussions about the mind like the kind that is going on in AIList, perhaps one thing that should be made clear by each participant is whether he or she is assuming the "scientific" or some "non-scientific" viewpoint. If one is to adopt the physicalist approach, I agree with Ray Trent that terms like "desire" and "feeling" and "consciousness" can only be used if they have been (sorry if I'm putting words into Ray's mouth here) mechanistically defined. Tom Schutz CSNET: tes@bu-cs ARPA: tes%bu-cs@csnet-relay UUCP: ...harvard!bu-cs!tes ------------------------------ Date: Tue, 15 Apr 86 15:29:13 EST From: tes%bostonu.csnet@CSNET-RELAY.ARPA Subject: One more little thing Just a brief question here: Nigel Goddard wrote in Volume 4 Issue 87 > I meet [people] who I consider to be very "unconscious", > i.e. their stated explanations of their motives and actions > seem to me to completely misunderstand what I consider to > be the *real* explanations. What, by Jove, is a "*real* explanation" ?????????????????????? I can't digest my food properly until I find out. Tom Schutz CSNET: tes@bu-cs ------------------------------ Date: 14 Apr 86 13:19:55 GMT From: ihnp4!houxm!hounx!kort@ucbvax.berkeley.edu (B.KORT) Subject: Re: Computer Dialogue I enjoyed Ray Trent's rejoinder to Paul King's article on computer feelings and self-awareness. In particular the description of the relational database system--as an entity that collects and organizes information into an abstract model that it then uses to interact with the world--was most suggestive. Now if we give that system some further rules of logic and assign it some goals, could we turn it into a "rational database system"? (I would give it the goal of nudging the external world into one which operates more successfully than the current implementation.) --Barry Kort ...ihnp4!houxm!hounx!kort ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon Apr 21 06:42:30 1986 Date: Mon, 21 Apr 86 06:42:25 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #95 Status: R AIList Digest Monday, 21 Apr 1986 Volume 4 : Issue 95 Today's Topics: Seminars - Learning Robots, Approximate Theories (Rutgers) & A Localized Model of Concurrency (SRI) & Analogical Representations in Naive Physics (Edinburgh) & Learning Apprentice Systems (SU) & A Theory of Diagnosis (SU) & A Formal Logic for Planning (UPenn) & Editorial Comprehension in Op-Ed (UTexas) & Run-Length Code for Geographical Information (SMU), Conference - Symbolics User Group National Symposium & Workshop on Engineering Design & ACM SIGMOD & Design Automation & Computers and Math ---------------------------------------------------------------------- Date: 15 Apr 86 11:03:24 EST From: PRASAD@RED.RUTGERS.EDU Subject: Seminar - Learning Robots, Approximate Theories (Rutgers) MACHINE LEARNING COLLOQUIUM Learning Robots as Users and Refiners of Approximate Theories Tom Mitchell Rutgers University 11 AM, April 29, 1986 #423, Hill Center This talk will describe some recent (and fairly tentative) research toward building a learning robot. The robot is viewed as having an approximate theory of its world, which it uses to guide problem solving, and which is in turn refined as the robot gains experience. The initial theory may contain fairly abstract assertions such as "executing motor commands causes changes in the configuration of parts of oneself", "coming into physical contact with a rigid object often causes changes in its position", and "changes in the configuation of physical objects correlate with changes in the visual appearance of the object". This abstract theory is used by the robot to construct PLAUSIBLE plans for achieving its goals. When these plans are executed, the world provides feedback--training data which is useful for refining the theory. This training data is generalized by a combined explanation based/empirical method (the approximate theory is used to contruct plausible explanations which are verified and refined empirically). Tom Fawcett and I have recently begun implementing parts of this system, but many open research issues remain. ------------------------------ Date: Wed 16 Apr 86 11:59:17-PST From: LANSKY@SRI-AI.ARPA Subject: Seminar - A Localized Model of Concurrency (SRI) A LOCALIZED MODEL OF CONCURRENCY Fernando Pereira (PEREIRA@SRI-AI) SRI International, AI Center 11:00 AM, MONDAY, April 21 SRI International, Building E, Room EJ228 (new conference room) In this talk I will give an informal overview of a structural theory of concurrency that I have been developing with Luis Monteiro. The main goal of our theory is to model the way in which local interactions between components of a system lead to global behavior. The theory, which is based on the mathematical concept of sheaf, allows us to model precisely the idea of processes interacting through common behavior at shared locations. In contrast to behavioral models, ours keeps track of the individual contributions of subsystems to overall system behavior, allowing a finer-grained analysis of subsystem interactions. >From event signatures that specify relations of independence and exclusivity between events, we construct spaces of locations where activity may occur. Behaviors are then modeled as elements of sheaves of monoids over those spaces and processes as certain sets of behaviors. The construction of the model, and in particular its avoidance of interleaving, gives it very convenient mathematical properties --- sheaves of behavior monoids are to event signatures what free monoids are to alphabets. The theory also allows us to identify on purely structural grounds event signatures with a potential for deadlock. Time permitting, I will engage in rambling speculation as to possible applications of the theory. VISITORS: Please arrive 5 minutes before the seminar (10:55), as you must now be escorted from the reception desk. ------------------------------ Date: Mon, 14 Apr 86 11:07:53 GMT From: Gideon Sahar Subject: Seminar - Analogical Representations in Naive Physics (Edinburgh) EDINBURGH AI SEMINARS Date: Wednesday 16th April 1986 Time: 2.00 p.m. Place: Department of Artificial Intelligence Seminar Room - F10 80 South Bridge EDINBURGH EH1 1HN. Professor Bernard Meltzer, Joint Research Centre, Ispra Establishment, Italy w will give a seminar entitled - ``Analogical Representations in Modelling Naive Physics". Ideas and experimental results will be presented on the use of analogical representations of knowledge, in Sloman's sense, that is, ones which bear a structural similarity to what is represented. This was done for the qualitative modelling of the everyday behaviour of objects and substances like strings, liquids and gases, represented by pixel sets built up from message-passing between adjacent base elements. These messages embody a very small number of local constraints derived from naive observation such as material continuity and non-copenetrability. Based as they are on fundamental phenomenological properties of the physical world, these programs turned out to have capacities for solving other problems than those for which they were designed. The use of such programs in integrated reasoning and problem-solving systems, and the relationship of this approach to those of classical physics and current AI ones in qualitative physics will also be discussed. ------------------------------ Date: Wed 16 Apr 86 10:10:57-PST From: Anne Richardson Subject: Seminar - Learning Apprentice Systems (SU) DAY: April 22, 1986 EVENT: CS 520 AI Seminar PLACE: Terman Auditorium TIME: 11:00 TITLE: Learning Apprentice Systems PERSON: Tom Mitchell FROM: Rutgers University This talk introduces a class of knowledge-based systems called Learning Apprentices: systems that provide interactive aid in solving some problem and acquire new knowledge by observing the actions of their users. The talk focuses on a particular Learning Apprentice, called LEAP, which is presently being developed in the domain of digital circuit design. By analyzing circuit fragments contributed by its users, LEAP infers rules that allow it to recommend similar circuits in subsequent cases. We discuss the type of problem solving architecture, knowledge organization, and learning methods required to support such learning apprentices in a variety of domains. ------------------------------ Date: 16 Apr 86 1742 PST From: Vladimir Lifschitz Subject: Seminar - A Theory of Diagnosis (SU) A THEORY OF DIAGNOSIS FROM FIRST PRINCIPLES Raymond Reiter Department of Computer Science, University of Toronto and The Canadian Institute for Advanced Research Thursday, April 17, 4pm MJH 252 Suppose given a description of a system, together with an observation of the system's behaviour which conflicts with the way the system is meant to behave. The diagnostic problem is to determine those components of the system which, when assumed to be functioning abnormally, will explain the discrepancy between the observed and correct system behaviour. We propose a general theory for this problem.The theory requires only that the system be described in a suitable logic. Moreover, there are many such suitable logics, e.g., first order, temporal, dynamic, etc. As a result, the theory accomodates diagnostic reasoning in a wide variety of practical settings, including digital and analogue circuits, medicine, and database updates. The theory leads to an algorithm for computing all diagnoses, and to various results concerning principles of measurement for discriminating between competing diagnoses. Finally, the theory reveals close connections between diagnostic reasoning and non-monotonic reasoning. ------------------------------ Date: Wed, 16 Apr 86 14:22 EST From: Tim Finin Subject: Seminar - A Formal Logic for Planning (UPenn) COLLOQUIUM 3pm Thursday, April 17, 1986 216 Moore School - University of Pennsylvania A FORMAL LOGIC THAT SUPPORTS PLANNING WITH EXTERNAL EVENTS AND CONCURRENT ACTIONS Richard Pelavin - University of Rochester A formal logic will be presented that provides a foundation for a theory of plans in temporally rich domains. These domains include actions that occur over intervals that may overlap in time. Thus, we can represent plans with concurrent actions. We also can treat domains with external events, i.e. actions by other agents and natural forces, that the planner may need to interact with. These interactions include the prevention of an event, the assurance of the successful completion of an event, and the performance an action that is enabled by some external event. The logic is an extension of a linear time logic (Allen's interval logic) with a modal operator expressing temporal possibility and a counterfactual-like modality that can be used to encode what can and cannot be done by the planning agent. The semantic model consists of a set of possible worlds related by two accessibility relations in terms of which the modalities are interpreted. The approach of interpreting a counterfactual-like modality in terms of an accessibility relation derives from Lewis' and Stalnaker's semantic theories of conditionals. ------------------------------ Date: Thu, 17 Apr 86 11:09:17 CST From: Rose M. Herring Subject: Seminar - Editorial Comprehension in Op-Ed (UTexas) University of Texas Computer Sciences Department COLLOQUIUM SPEAKER: Sergio Alvarado University of California at Los Angeles TITLE: Editorial Comprehension in OpEd Through Argument Units DATE: Tuesday, April 22, 1986 PLACE: TAY 3.144 TIME: 11 - 12 noon OpEd (Opinions to/from the Editor) is a computer program that reads short polito-economic editorial segments and answers questions about their contents. For OpEd, understanding editori- als involves: (1) applying a large amount of domain-specific knowledge; (2) recognizing beliefs and belief relationships; (3) following reasoning about plans and goals; (4) applying abstract knowledge of argumentation; (5) mapping text into conceptual representation; and (6) indexing recognized concepts for later retrieval during question answering. Here, I discuss OpEd's abstract knowledge of argumenta- tion. In OpEd, knowledge of argument structure is organized by memory structures called Argument Units (AUs). These structures package belief support and attack relationships and reasoning chains. When combined with domain-specific knowledge, AUs can be used to understand and generate arguments involving plans, goals, and beliefs. Thus, argument comprehension is viewed in OpEd fun- damentally as the process of accessing and instantiating these units. A description of OpEd's architecture and examples of its current input/output behavior are also presented. COFFEE AT 10:30 in TAY 3.128 ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Seminar - Run-Length Code for Geographical Information (SMU) A Spatial Knowledge Structure Based on Run-Length-Code for a Geographical Information System Speaker: Erland Jungert Illinois Institute of Technology Location: 315SIC, Southern Methodist University, CS Time: 3PM Run-Length-Code (RLC) is an example of a simple data structure used mainly for compacting images. A method where RLC is used as an object oriented data structure for Geographical Information Systems (GIS) will be presented. The usage of this object structure as a basis for spatial reasoning while regarding the RLC-objects as part of a spatial knowledge structure will be discussed. ------------------------------ Date: Sun, 20 Apr 86 14:45:46 pst From: grover@aids-unix (Mark Grover) Subject: Conference - Symbolics User Group National Symposium Registration materials are now available to the National Symposium of the Symbolics Lisp Users Group, to be held June 2-6, 1986 at Georgetown University in Washington, DC. Both tutorials and technical sessions will be held. The theme of this year's Symposium is "Programming in Style". Many interesting and exciting guests are expected. Registration materials and housing information can be obtained via telephone or US mail to: Symbolics National Symposium Attn: Annmarie Pittman 655 15th St. NW #300 Washington, DC 20005 (202) 639-4228 ------------------------------ Date: Thu, 17 Apr 86 08:40:33 -0500 From: sriram@ATHENA.MIT.EDU Subject: Conference - Workshop on Engineering Design AAAI-86 WORKSHOP ON KNOWLEDGE-BASED EXPERT SYSTEMS FOR ENGINEERING DESIGN In the 60's, AI researchers explored weak methods applicable to a very broad class of problems. In the 70's, we created knowledge-intensive, "strong" methods for solving quite specific types of problems. A major trend in the 80's is to identify coherent problem classes of intermediate generality; the proof of coherence is in the further identification of correspondingly general problem-solving methods. For instance, "classification problems" have been defined, a general but still knowledge-based classification problem-solving process and system architecture have been laid out, and tools exist for facilitating development of classification systems. Design problems also appear to constitute a coherent problem class. At present, however, we are only beginning the enterprise of: defining this class; formalizing a model of the design problem-solving process and design system architecture; and creating tools for developing design systems. To model (and ultimately facilitate) human designers and their enormous flexibility in terms of conventional AI "primitives" requires integrating such diverse functions as refinement techniques, constraint reasoning, and goal satisfaction, and encoding these functions in such varied forms as rules, heuristics, and algorithms. Viewing design tools as "knowledge-based expert systems" provides a framework for capturing such diversity. The purpose of this workshop is to provide a forum in which both engineers and computer scientists can discuss knowledge-based frameworks for organizing and developing useful engineering design systems. TOPICS TO BE DISCUSSED 1. Definition of "a design problem". 2. A general model of the design process. 3. Knowledge representation formalisms for design. 4. Problem-solving strategies required for design. 5. Existing frameworks and for design. 6. Existing architectures for design aids. 7. Capabilities and tools desired by engineers. 8. Automated vs.interactive design aids. 9. Software environments and tools for developing design aids. ORGANIZERS Sriram [sriram@athena.mit.edu] and Chris Tong [tong@red.rutgers.edu] PARTICIPATION The workshop will take place on Monday, August 11, at the University of Pennsylvania. Participation in the workshop is by invitation, limited to 35 participants. Those wishing to be invited should submit four copies of a 1000-word abstract describing their work in AI and engineering design to Sriram, 1-253b, Dept. of Civil Engineering, M. I.T., Cambridge, MA 02139 OR to Chris Tong, Dept. of Computer Science, Rutgers University, New Brunswick, NJ 08903. The deadline for application is May 30, 1986. Invitations will be issued by July 1. ------------------------------ Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Conferences - ACM SIGMOD & Design Automation & Computers and Math 1986 ACM SIGMOD international Conference on the management of data May 28-30 1986 Washington DC Session 6a Logic and Databases 11:00 - 12:30 Thursday May 30 A. Van Gelder "A Message Passing Framework for Logical Query Evaluation" A. Rosenthal, S. Heller, U. Dayal, F. Manola "Traversal Recursion: A Practical Approach to Supporting Recursive Applications: G. Gardarin C. DeMaindreville "Evaluation of Databse Recursive Logic as Recurrent Function Series" Session 7 Query Processing Thursday May 30 2:00 - 3:30 J. C. Freytag "Rule Based Transformation of Relational Queries into Interactive Programs" Session 9a Rule Based Systems M. T. Harandi T. Schang S. Cohen "Rule Base Management Using Meta Knowledge" T. Imelinksi "Query Processing in Deductive Databases with Incomplete Information" Q. Chu "A Rule-Based Object/Task Modelling Approach" __________________________________________________________________________ Twenty Third ACM/IEEE Design Automation Conference June 29-July 2, 1986 Las Vegas, Nevada Session 4 Intelligent Systems Time Monday 10:30 - 12:00 An Expert System Paradigm for Design Forrest D. Brewer, Daniel D. Gajaski University of Illinois at Urbana Session 12 Timing Verification Monday Monday 4:00 - 5:30 Reasoning About Digital Systems Using Temporal Logic G. Venkatesh Session 14 Test Generation Techniques Tuesday 8:00 - 10:00 A Heuristic Chip-Level Test Generation Algorithm Daniel S. Barclay, James R. Armstrong Virginia Polytechnic Institute Session 29 Hardware Design Languages Tuesday 3:30 - 5:30 A Design Rule Database System to Support Technology Adaptable Applications Hilary J. Kahn, J. S. Aude University of Manchester Session 34 Expert Systems for Design Automation Wednesday 8:00 - 10:00 A Rule-Based Logic Circuit Synthesis System for CMOS Gate Arrays Takao Saito, Hiroyuki Sugimoto, Masami Yamazaki, NObuaki Kawato Fujitsu Labs FLUTE - A Floorplanning Agent for Full Custom VLSI Design Hityuki Wantanabe, Bryan Ackland AT&T Bell Laboratories, Holmdel NJ Knowledge-Based Optimal Ill Circuit Generator From Conventional Logic Descriptions T. Watanabe, T. Masuishi, T. Nishiyama, N. Horie Hitachi PEARL: An Expert System for Power Supply Layout Ed DeJesus DEC Session 38 Short Papers: Representing and Manipulating VLSI Design Wednesday 10:30 - 12:00 Precedent Based Reasoning About VLSI Structures Richard H. Lasthrop, Robert S. Kirk MIT and Gould AMI respectively A Frame Based System for Representing Knowledge About VLSI Design Hassan K. Reghbati, W. Stephen ADolph, Amar Sanmugasundam Simon Fraser University Session 39 Timing Verification Wednesday 10:30 - 12:00 A Rule Based Approach to Unifying Functional and Fault Simulation and Timing Verification Sujmit Ghosh AT & T Session 42 Database II Wednesday 1:30 - 3:30 Rules-Based Object Clustering: A Data Structure for Symbolic VLSI Synthesis and Analysis Robert P. Larsen Rockwell International Corporation __________________________________________________________________________ A Conference on Computers and Mathematics July 30 - August 1 Stanford University Woodrow Bledsoe Automated Theorem Proving and Artificial Intelligence Rudiger Loos Tarski's Dream ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue Apr 22 18:50:32 1986 Date: Tue, 22 Apr 86 18:50:16 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #96 Status: RO AIList Digest Tuesday, 22 Apr 1986 Volume 4 : Issue 96 Today's Topics: Queries - Technical Report Sources & FRL and HEARSAY-III & Lisp Machine Information & AI Conference in Long Beach & National Youth Science Camp Alums & Battleware, Projects - EDISON Project & Non-DoD Funding, Techniques - String Reduction, Publications - Journal Prices, Applications - Compuscan Page Reader ---------------------------------------------------------------------- Date: Fri 18 Apr 86 17:17:43-PST From: Daniel Davison Subject: How do I get technical reports? There were several technical reports mentioned in a recent AIlist that I'd like to get...but I don't know how. Would some kind soul send me a note about how to get tech reports from (1) LSU and (2) CMU? Thanks, dan davison davison@sumex-aim.arpa ------------------------------ Date: 24 Apr 86 21:35:30 GMT From: ihnp4!houxm!whuxl!whuxlm!akgua!gatech!seismo!mcvax!euroies!rreilly @ucbvax.berkeley.edu Subject: FRL and HEARSAY-III I have two queries: (1) Does anybody have any information on public domain implementations of Goldstein's FRL or any frame system in Lisp? (2) I believe that CMU make available an empty version of HEARSAY (HEARSAY-III I think). Does aybody have any details on this? Has anybody used the system? Thanks in advance. -- ...mcvax!euroies!rreilly (Ronan Reilly) Educational Research Centre, St Patrick's College Dublin 9, Ireland. ------------------------------ Date: Mon, 21 Apr 1986 12:23:33 EST From: WALLFESH%UCONNVM.BITNET@WISCVM.WISC.EDU Subject: Lisp Machine information sought Can anyone suggest any papers on Lisp machines, particularly those which stress their architectural aspects? I'm attempting to write a paper on Lisp machines for my computer architecture class, but I cannot seem to find many references. Thanks, Sande Wallfesh (wallfesh@uconnvm.bitnet, wallfesh@carcvax.csnet) CS Dept. Box U-157 University of Connecticut Storrs, CT 06268 ------------------------------ Date: Fri, 18 Apr 86 14:14:17 cst From: Girish Kumthekar Subject: AI Conference in Long Beach I am trying to find information about an AI conference in Long Beach, CA to be held by the end of this month (April). I looked in recent issues of AI magazine but could not get info. If you have any info as to exact dates, whom to contact, tel # or address etc, I would appreciate if you could mail it to me at kumthek%lsu@csnet-relay.csnet Thanks in advance Girish kumthekar (504)-388-1495 ------------------------------ Date: Sun 20 Apr 86 11:23:59-PST From: Lee Altenberg Subject: NATIONAL YOUTH SCIENCE CAMP ALUMS I am an alum of the National Youth Science Camp (California 1975), which was a great boost for me going into science, and I was wondering how many other NYSC alums are involved in AI . NYSC Alums please send me your name , and the state and year you represented, and also what you're doing now if you want to. Thanks. -Lee Altenberg ------------------------------ Date: Fri, 18 Apr 86 11:42 EST From: JOHNSON%northeastern.csnet@CSNET-RELAY.ARPA Subject: Rampant misunderstanding, speculation and questions. I've been reading the April CACM (my first issue). One of the sections seems to be a debate over battle management software. It seems that nobody is sure whether or not battleware would do the "right" (if there is a right) thing in a real battle. Also, no one is sure if it ever can be proven one way or the other. I'm not a military historian. What little I do know tells me that one doesn't necessarily win a battle with logic or one set of rules. History seems to say that you start losing wars if the other side doesn't play by the rules or invents their own. I've been seeing shorts in the ailist of late dealing with inexact logic. I don't claim to understand it. I'm not at all certain, however, that I'd want a piece of ai battleware defending me even if it did have some kind of rudimentary understanding of non-binary logic. In an impossible situation where the other side doesn't play by the rules, battleware might decide to give up or pull the doomsday switch. I guess I have several questions here. How inexact is inexact? Can battleware but made to recognize that new rules exist and adapt to them in real-time? Can battleware be made to fully understand constraints? If my cat has fleas and fire kills fleas, burning the cat will eliminate the fleas. Problems are usually easier to solve without constraints. I'd rather battleware (or any ai program) didn't think like this. I know a little about how rules can be made to work in Prolog. I'm not sure how one would go about defining rules for a battle. Can there really be inexact (fuzzy) rules? Any references on this? A side issue is this, can battleware be made to run in real-time at all? One of the ideas of having it is because humans can't assimilate all necessary information in time to act on it in a highly electronic war. I don't think this is just an issue of having 10 cray's doing the job. I don't know. Maybe 20,000 toasters running in parallel would be just as good as two or three crays running battleware. Maybe I just don't understand the problem. (I'm new to ai obviously.) Can we please define or describe some things in words of one syllable or less? (yes I know graph is one syllable.) Besides defining inexact, can anyone point me to a GOOD beginner something or other on ai. I've seen several and they're all not very good yet (or I might be missing the point). Chris Johnson Northeastern University johnson@northeastern.csnet ------------------------------ Date: Fri, 18 Apr 86 11:34:41 PST From: Scott Turner Subject: Re: EDISON Project Before I get innudated with requests for the Edison report, all UCLA Technical Reports can be ordered through: Brenda Ramsey UCLA Dept. of Computer Science 3713 Boelter Hall 801 Hilgard Ave. Los Angeles, CA 90024 ramsey@ucla-cs.arpa (213) 825-2778 -- Scott ------------------------------ Date: Fri 18 Apr 86 17:18:30-PST From: Daniel Davison Subject: Summary of non-DoD funding for AI I recently asked about non-DOD sources of funding for AI projects. I received three replies. Two cited NSF and one said NIH (but not which institute[s]) fund AI work. Of course, NIH funds this facility (SUMEX); apparently smaller grants are funded also. dan davison davison@sumex-aim.arpa ------------------------------ Date: 18 Apr 86 16:59:06 GMT From: ihnp4!stolaf!mmm!umn-cs!amit@ucbvax.berkeley.edu (Neta Amit) Subject: Re: String reduction In article <1031@eagle.ukc.ac.uk> sjl@ukc.ac.uk (S.J.Leviseur) writes: >Does anybody have any references to articles on string reduction >as a reduction technique for applicative languages (or anything >else)? They seem to be almost impossible to find! Anything welcome. String reduction as a model of computation was suggested by A.A. Markov, in his 1954(?) paper, and is proved to be equivalent in power to the other two general models of computation (Turing machine and the Lambda Calculus). Markov algorithm consists of an input string S and a program P, which is a sequence of BNF-like productions LHS --> RHS. The evaluator scans P top to bottom (that's sequencing), looking for a match between a substring of S and the LHS of a production (that's conditionals). When a match is found, the RHS replaces the matching substring in S, and the scanning is restarted from the top of P (that's looping). Let's not consider termination and error conditions. As stated here, this isn't a purely applicative model, but there is no inherent reason why the new S couldn't in fact be new! Michael Barnett of Brooklyn College, CUNY, (a Chemist turned Computer Scientist) has recently suggested (See Sigplan Notices in the last 12 months) that it may be possible to synthesize molecules that will do string substitution (a biological computer) and that this might be a good model to describe the functionality of the human brain. If I understand correctly, you are looking for an applicative model, in which functions cause string-substitution instead of returning values. Notice that this is the mechanism used by parametrized macro expansion (so you can easily simulate an applicative string reduction machine in Pure Lisp, using macros alone.) A guy named Karl Fant, from Honeywell Research (in Minneapolis), has been developing an applicative string-reduction model, but I don't think he has published in a publicly available journal. Anyway, I would be interested in expanding this discussion. Cheers, --Neta CSNET: amit@umn-cs ARPA: amit%umn-cs@csnet-relay.ARPA UUCP: ...ihnp4!umn-cs!amit ------------------------------ Date: 19 Apr 86 15:35:22 GMT From: ihnp4!stolaf!mmm!srcsip!meier@ucbvax.berkeley.edu (Christopher Meier) Subject: Re: String reduction In article <994@umn-cs.UUCP> amit@umn-cs.UUCP (Neta Amit) writes: >A guy named Karl Fant, from Honeywell Research (in Minneapolis), has >been developing an applicative string-reduction model, but I don't >think he has published in a publicly available journal. > Karl can be reached at ihnp4!srcsip!fant (or through any path I can...). -- Christopher Meier MN65-2300 {osu-eddie,okstate,bthpyd}\ S&RC Signal and Image Processing {ihnp4,philabs,,gnutemp}\ 3660 Technology Drive (612) {hyper,umn-cs,mmm,meccts}!srcsip!meier Mpls, MN 55413 782-7191 ------------------------------ Date: Mon, 21 Apr 86 07:15:35 -0500 From: sriram@ATHENA.MIT.EDU Subject: Journal Prices In a recent message on the AI bboard, some of you raised concerns about the subscription price for the AI IN ENGG. JOURNAL. As a co-editor of the journal, I forwarded the message to Mr. Lance Sucharov, the publisher director of the journal. His reply follows. Sriram Dear Friends: I have just received a copy of the message "Journal prices hit the moon!" on the AI list bulletin board and I feel this needs an answer and is an excellent opportunity to put the publishing record straight. The journal referred to is our new launch the "INTERNATIONAL JOURNAL FOR AI IN ENGINEERING", which has aroused a good deal of interest internationally and in this one case, controversy over the price! First of all, may I say I sympathise with the writer: in wishing to keep prices down as much as possible and thereby giving the widest audience to published information. However, although the writer mentions the authors, reviewers and editorial board members who give their services freely, he makes no mention of others who do not: typesetters, printers, agents, editorial staff, designers, editors, and so on. How significant are these costs? Significant enough for some journals to close. Many others of important academic interest, financially only limp along and as publishers, would be better off putting their money in a bank. At the same time some publishers are extremely profitable: a well-known name and powerful marketing arm all help. But it is by having some profitable journals that more marginal ones can be popped up, and new launches can be afforded, which can take several years to pay their way. Furthermore, for overseas publishers the US market can be expensive because of postage, uncertainty in dollar movements and banking costs. Other publishres have pitched their prices higher than ours, and I can mention the "IMA JOURNAL OF NUMERAL ANALYSIS" ($172), "COMPUTER SYSTEMS SCIENCE AND ENGINEERING" ($166), "IMAGE AND VISION COMPUTING" ($171), and there are many more. Finally, I am delighted that authors and the editorial team do provide a service just as we provide a service in disseminating their work world-wide. Sincerely yours, Lance Sucharov ------------------------------ Date: 18 Apr 1986 13:16:39-EST From: kushnier@NADC Subject: Compuscan COMPUSCAN I had an opportunity to see a demonstration of the CompuScan Model 230 Page reader. This is a desk top device which looks like a small copier, and using optical character recognition, can read a page of text and send it as an ASCII file to a waiting IBM-PC or other micro over an RS-232 port. The unit sells for about $6K. I had provided several different font sets on several qualities of paper. Also, I used originals and text that had been Xeroxed several times. As for the results... If I put on my R&D AI hat, then the results were both exciting and thought provoking. I was amazed at the number of characters that the machine was able to successfully recognize- especially for a machine in that price category. Although it usually took longer than the advertised 30 seconds per page, it was tolerable. The results were inconsistent. If you put the same page in twice, the results, both errors and correct characters, would come out different each time. Now, this is not to say that the machine was "screwing up". It WAS, in each case following a set of rules based on what it perceived to be a specific character. It was going through a set of probabilities and percentages and based on the result, printed a particular character. Being a deterministic programmer, this at first rubbed me the wrong way. After all, we are dealing with a computer here..No matter how many times you put in 2+3, it should always equal 5. Not so with AI type solutions. Although this inconsistency should be minimized in the design, the AI programmer must recognize the possibility of it occurrence. If I put on my Office Manager's hat, then I would say that COMPUSCAN is not quite ready to come into everyday service. It made too many mistakes to provide efficient page-to-text translation. This was especially true when the quality of the documents and the font type varied. One page had been slightly cocked when Xeroxed. This caused havoc to the optical recognition software. Compuscan is promising a new generation Model 240, to be out shortly. I am interested in seeing what improvements are made. For INFO write to: Compuscan Inc. 81 Two Bridges Rd./Bldg.2 Fairfield, N.J. 07006 TEL: (201) 575-0500 This review is a personal opinion and does not reflect any official view of the government or any one else in the world. - Ron Kushnier Ron Kushnier kushnier@nadc.arpa ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue Apr 22 18:50:52 1986 Date: Tue, 22 Apr 86 18:50:36 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #97 Status: RO AIList Digest Tuesday, 22 Apr 1986 Volume 4 : Issue 97 Today's Topics: Bibliography - Recent Articles #7 ---------------------------------------------------------------------- Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Recent Articles #7 %A H. Bernstein %T Determining the Shape of a Convex n-sided Polygon by Using 2n+k Tactile Probes %R 125 R29 %D JUN 1984 %I New York University, Courant Institute, Department of Computer Sciences %K AI07 AI06 %A A. Tuzhilin %A P. Spirakis %T A Semantic Approach to Correctness of Concurrent Executions %R 130 %D JUL 1984 %I New York University, Courant Institute, Department of Computer Sciences %K AA08 %A E. Davis %T Shape and Function of Solid objects: Some Examples %R 137 %D OCT 1984 %I New York University, Courant Institute, Department of Computer Sciences %A C. O'Dunlaing %A M. Sharir %A C. Yap %T Generalized Vornoi Diagrams for Moving a Ladder: I Topological Analysis %R 139 R32 %D NOV 1984 %I New York University, Courant Institute, Department of Computer Sciences %A C. O Dunlaing %A M. Sharir %A C. Yap %T Generalized Vornoi Diagrams for Moving a Ladder: II Efficient Construction of the Diagram %D NOV 1984 %R 140 R33 %I New York University, Courant Institute, Department of Computer Sciences %A M. Bastuscheck %T Look Up Table Computation for A Ratio Image Depth Sensor %R 141 R34 %D NOV 1984 %I New York University, Courant Institute, Department of Computer Sciences %A J. Schwartz %A M. Sharir %A A. Siegel %T An Efficient Algorithm for Finding Connected Components of a Binary Image %R 154 R38 %D FEB 1985 %I New York University, Courant Institute, Department of Computer Sciences %K AI06 %A D. Cantone %A A. Ferro %A J. Schwartz %T Decision Procedures for Elementary Sublanguages of Set Theory VI. Multi-Level Syllogistic Extended by the Power Set Operator %R 156 %D FEB 1985 %I New York University, Courant Institute, Department of Computer Sciences %K AI11 %A E. Kishon %A X. D. Yang %T A Video Camera Interface for High Speed Region Boundary Locations %R 157 R40 %D FEB 1985 %I New York University, Courant Institute, Department of Computer Sciences %K AI06 %R 13 %A N. V. Findler %A H. Klein %A W. Gould %A A. Kowal %A J. Menig %T (1) Studies on decision making using the game of poker; (2) Computer experiments on the formation and optimization of heuristic rules %I Suny Buffalo Computer Science %R 14 %A N. V. Findler %A D. Chen %T On the problems of time, retrieval of temporal relations, causality and co-existence %I Suny Buffalo Computer Science %R 15 %A G. T. Herman %A J. A. Jackowski %T A decision procedure using discrete geometry %I Suny Buffalo Computer Science %K AI14 %R 20 %A N. V. Findler %T Short note on a heuristic search strategy %I Suny Buffalo Computer Science %K AI03 %A N. V. Findler %T Heuristic programmers and their gambling machines %A H. Klein %A A. Kowal %A Z. Levine %A J. Menig %I SUNY Buffalo Computer Science %K AI03 %R 72 %A G. T. Herman %T A decision procedure using the geometry of convex sets %A P. W. Aitchison %I SUNY Buffalo Computer Science %K AI14 %R 84 %A G. T. Herman %A A. V. Lakshminarayanan %A S. W. Rowland %T The reconstruction of objects from shadowgraphs with high contrasts %D August 1974 %I SUNY Buffalo Computer Science %K AI06 %R 91 %A G. T. Herman %A A. Lent %T A computer implementation of a Bayesian analysis of image reconstruction %D January 1975 %I SUNY Buffalo Computer Science %K AI06 %R 92 %A A. V. Lakshminarayanan %T Reconstruction from divergent ray data %D January 1975 %I SUNY Buffalo Computer Science %K AI06 %R 93 %T Iterative relaxation methods for image reconstruction %A G. T. Herman %A A. Lent %A P. H. Lutz %D July 1975 %I SUNY Buffalo Computer Science %K AI06 %R 99 %A N. V. Findler %T Studies in machine cognition using the game of Poker %D June 1975 %I SUNY Buffalo Computer Science %K AA17 %X A progress report is presented of our on-going research efforts concerning human decision making under uncertainty and risk, human problem solving and learning processes, on one hand, and machine learning, large scale programming systems and novel programming techniques, on the other. %R 103 %A G. T. Herman %T Quadratic optimization for image reconstruction, Part I %A A. Lent %I SUNY Buffalo Computer Science %K AI06 %R 104 %A P. H. Lutz %T Fourier image reconstruction incorporating three simple interpolation techniques %I SUNY Buffalo Computer Science %K AI06 %R 110 %A T. L. Roy %T A contribution to the Poker Project: The development of and experience with a Statistically Fair Player %D May 1976 %I SUNY Buffalo Computer Science %K AA17 %X This paper is a report on my efforts over the past several months, in the development of a Player Function for the Poker System, called the Statistically Fair Player. %R 111 %A J. N. Shaw %T Multi-Pierre, a learning robot system %D May 1976 %I SUNY Buffalo Computer Science %K AI07 %X The goal of this project is to simulate several robots under partial human control, and operating in a lifelike'' environment. The robots have an overall goal of survival and an instinct'' to explore their environment. The project is an extension of an existing system which has a single organism functioning in a similar environment. The environment consists of a flat terrain, populated with three-dimensional objects of varying types, sizes and shapes. %R 115 %A T. W. Chen %A N. V. Findler %T Toward analogical reasoning in problem solving by computers %D December 1976 %K AA17 %I SUNY Buffalo Computer Science %X We attempt in the present paper to investigate Analogical Reasoning (AR) detached from specific tasks and to formulate its general principles so that it may become a component of problem solving programs as much as the means-ends analysis has been shown to be one in the literature on GPS. %R 119 %A S. C. Shapiro %T A Scrabble crossword game playing program %I SUNY Buffalo Computer Science %K AA17 %R 127 %A J. K. Cipolaro %A N. V. Findler %T MARSHA, the daughter of ELIZA \- a simple program for information retrieval in natural language %I SUNY Buffalo Computer Science %K AA02 AA14 %R 130 %T SNARK77: A programming system for the reconstruction of pictures from projections %A G. T. Herman %A S. W. Rowland %D January 1978 %I SUNY Buffalo Computer Science %K AI06 %R 134 %T On the Bayesian approach to image reconstruction %A G. T. Herman %A H. Hurwitz %A A. Lent %A H. P. Lung %D June 1978 %I SUNY Buffalo Computer Science %K AI06 %R 141 %A N. V. Findler %T A heuristic information retrievalsystem based on associative networks %D February 1978 %I SUNY Buffalo Computer Science %K AI12 AA14 %R 145 %A E. Artzy %T Boundary detection of internal organs in mini-computers %I SUNY Buffalo Computer Science %K AI06 AA01 %R 147 %A S. N. Srihari %T On choosing measurements for invariant pattern recognition %D September 1978 %I SUNY Buffalo Computer Science %K AI06 %R 152 %A J. Case %A S. Ngo\ Manuelle %T Refinements of inductive inference by Popperian machines %I SUNY Buffalo Computer Science %K AI04 %R 154 %A J. Case %A C. H. Smith %T Comparison of identification criteria for mechanized inductive inference %I SUNY Buffalo Computer Science %K AI04 %R 155 %A C. H. Smith %T Finite covers of inductive inference machines %I SUNY Buffalo Computer Science %K AI04 %R 164 %A D. P. McKay %A S. C. Shapiro %T MULTI \- a Lisp based multiprocessing system %I SUNY Buffalo Computer Science %K H03 T01 %R 169 %A E. M. Gurari %A H. Wechsler %T On the difficulties involved in the segmentation of pictures %I SUNY Buffalo Computer Science %K AI0 %R 170 %A M. M. Yau %A S. N. Srihari %T Recursive generation of hierarchical data structures for multidimensional digital images %I SUNY Buffalo Computer Science %K AI06 %R 171 %A A. S. Maida %A S. C. Shapiro %T Intensional concepts in propositional semantic networks %I SUNY Buffalo Computer Science %R 172 %A S. N. Srihari %A J. J. Hull %A R. Bo\o'z\(hc'inovi\o'c\(aa' %T Representation of contextual knowledge in word recognition %I SUNY Buffalo Computer Science %K AI02 %R 173 %A S. C. Shapiro %T COCCI: a deductive semantic network program for solving microbiology unknowns %I SUNY Buffalo Computer Science %K AA10 %R 174 %A J. E. S. P. Martins %A D. P. McKay %A S. C. Shapiro %T Bi-directional inference %I SUNY Buffalo Computer Science %R 175 %A J. E. S. P. Martins %A S. C. Shapiro %T A belief revision system based on relevance logic and heterarchical contexts %I SUNY Buffalo Computer Science %R 177 %A S. N. Srihari %A M. E. Jernigan %T Pattern recognition %I SUNY Buffalo Computer Science %K AI06 %R 178 %A K. J. Chen %T Tradeoffs in machine inductive inference %I SUNY Buffalo Computer Science %K AI04 %R 179 %A J. G. Neal %T A knowledge engineering approach to natural language understanding %I SUNY Buffalo Computer Science %K AI02 %R 183 %A R. K. Srihari %T Combining path-based and node-based inference in SNePS %I SUNY Buffalo Computer Science %R 184 %A S. N. Srihari %A J. J. Hull %T Experiments in text recognition with binary \fIn\fP-gram and Viterbi algorithms %I SUNY Buffalo Computer Science %R 186 %A H. Shubin %T Inference and control in multiprocessing environments %I SUNY Buffalo Computer Science %K H03 %R 187 %A N. V. Findler %T A preliminary report on a multi-level learning technique using production systems %I SUNY Buffalo Computer Science %K AI04 AI01 %R 188 %A N. V. Findler %A E. J. M. Morgado %T Morph-fitting \- an effective technique of approximation %I SUNY Buffalo Computer Science %K AI02 %R 189 %A N. V. Findler %A N. M. Mazur %A B. B. McCall %T A note on computing the asymptotic form of a limited sequence of decision trees %I SUNY Buffalo Computer Science %R 190 %A N. V. Findler %A J. E. Brown %A R. Lo %A H. Y. You %T A module to estimate numerical values of hidden variables for expert systems %I SUNY Buffalo Computer Science %K AI01 %R 192 %A S. N. Srihari %A J. J. Hull %A R. Choudhari %T An algorithm for integrating diverse knowledge sources in text recognition %I SUNY Buffalo Computer Science %K AI06 %R 193 %A G. L. Sicherman %T The Advice-Taker/Inquirer %I SUNY Buffalo Computer Science %R 194 %A N. V. Findler %T Toward a theory of strategies %I SUNY Buffalo Computer Science %R 195 %A S. Moriya %T An algebraic structure theory of rule sets, I: a formalization of both production systems and decision tables %I SUNY Buffalo Computer Science %R 196 %A N. V. Findler %T An overview of the Quasi-Optimizer system %I SUNY Buffalo Computer Science %R 197 %A N. V. Findler %A G. L. Sicherman %A B. B. McCall %T A multi-strategy gaming environment %I SUNY Buffalo Computer Science %R 198 %A L. M. Tranchell %T A SNePS implementation of KL-ONE %I SUNY Buffalo Computer Science %R 199 %A M. M. Yau %T Generating quadtrees of cross-sections from octrees %I SUNY Buffalo Computer Science %R 202 %A G. L. Sicherman %T Parsley 1.1: A general text parser in LISP %D April 1983 %I SUNY Buffalo Computer Science %X T01 AI02 %R 203 %A J. E. S. P. Martins %D May 1983 %T Reasoning in multiple belief spaces %I SUNY Buffalo Computer Science %R 204 %A J. T. Nutter %D October 1983 %T Default reasoning in A.I. systems %I SUNY Buffalo Computer Science %R 206 %A P. F. Kung %A S. L. Hardt %T Understanding `Circuit Stories;' or, Using Micro PAM to explain VLSI systems %D December 1983 %I SUNY Buffalo Computer Science %K AA04 %R 207 %T Grinlib \- Grinnell graphics in Lisp %A P. Schlossman %A S. L. Hardt %D 1983 %K T01 %R 208 %T Correcting and translating ill-formed ship messages %A J. Rosenberg %A M. E. Haefner %A S. L. Hardt %D January 1984 %I SUNY Buffalo Computer Science %R 209 %T A step towards a friendly psychiatric diagnosis tool %A P. Schlossman %A G. K. Phillips %A S. L. Hardt %D April 1984 %I SUNY Buffalo Computer Science %K AA01 %R 210 %T Developing a knowledge-based psychiatric diagnostic tool: The investigation of opportunistic processing %A M. E. Haefner %A S. L. Hardt %D February 1984 %I SUNY Buffalo Computer Science %K AA01 %R 211 %T Naive physics and the physics of diffusion; or, When intuition fails %A S. L. Hardt %D June 1984 %I SUNY Buffalo Computer Science %X AA16 %R 212 %T From CD to mandarin Chinese: The language generation project %A M. Y. Lo %A S. L. Hardt %D August 1984 %I SUNY Buffalo Computer Science %X The investigation reported here is centered on the development of the Chinese language generator, SINO-MUMBLES. This natural language generator takes as input a CD expression and expresses its meaning in Mandarin Chinese. The program is based on the English generator, MICRO-MUMBLE and on an earlier version of the Chinese generator developed in our project. %R 213 %T Knowledge based parsing %A J. G. Neal %A S. C. Shapiro %D May 1984 %I SUNY Buffalo Computer Science %K AI02 %X An extremely significant feature of any Natural Language (NL) is that it is its own meta-language. One can use a NL to talk about the NL itself. One can use a NL to tutor a non-native speaker, or other poor language user, in the use of the same NL. We have been exploring methods of knowledge representation and NL Understanding (NLU) which would allow an Artificial Intelligence (AI) system to play the role of poor language user in this setting. The AI system would have to understand NL utterances about how the NL is used, and improve its NLU abilities according to this instruction. It would be an NLU system for which the domain being discusses in NL is the NL itself. %R 214 %T Optical character recognition techniques in mail sorting: A review of algorithms %A J. J. Hull %A G. Krishnan %A P. W. Palumbo %A S. N. Srihari %D June 1984 %I SUNY Buffalo Computer Science %K AI06 %X A study of Optical Character Recognition (OCR) techniques employed in automatic mail sorting equipment is presented. Methods and algorithms for image preprocessing, character recognition, and contextual postprocessing are discussed and compared. The objective of this study is to provide a background in the state-of-the-art of this equipment as the first element in a search for techniques to significantly improve the capabilites of postal address recognition. %R 215 %T Belief representation and quasi-indicators %A W. J. Rapaport %D August 1984 %I SUNY Buffalo Computer Science %K AI02 %X This thesis is a study in knowledge'' representation, specifically, how to represent beliefs expressed by sentences containing quasi-indicators. An \fIindicator\fP is a personal or demonstrative pronoun or adverb used to make a strictly demonstrative reference. A \fIquasi-indicator\fP is an expression that occurs within an intentional context and that represents a use of an indicator by another speaker. E.g., if John says, I am rich,'' then if \fIwe\fP say, John believes that he himself is rich,'' our use of `he himself' is quasi-indexical. Quasi-indicators pose problems for natural-language question-answering systems, since they cannot be replaced by any co-referential noun phrases without changing the meaning of the embedding sentence. Therefore, the referent of the quasi-indicator must be represented in such a way that no ivnalid co-referential claims are entailed. %R 216 %T Searle's experiments with thought %A W. J. Rapaport %D November 1984 %I SUNY Buffalo Computer Science %X A critique of several recent objections to John Searle's Chinese Room argument against the possibility of strong AI is presented. The objections are found to miss the point, and a stronger argument against Searle is presented, based on a distinction between syntactic and semantic understanding. %R 217 %T Review of Lambert's \fIMeinong and the Principle of Independence\fP %A W. J. Rapaport %D November 1984 %I SUNY Buffalo Computer Science %K AI08 %X This is a critical study of Karel Lambert's \fIMeinong and the Principle of Independence.\fP Alexius Meinong was a turn-of-the-century philosopher and psychologist who played a role in the early development of analytic philosophy, phenomenology, and Gestalt psychology. His theory of objects has become of increasing relevance to intensionally-based semantics and, hence, ought to be of interest to AI researchers in the field of knowledge representation. Lambert's book explores the relevance of Meinong's theory to free logics. %R 85-01 %T Recognition of off-line cursive handwriting: A case of multi-level machine perception %A R. M. Bo\o'z\(hc'inovi\o'c\(aa' %D March 1985 %I SUNY Buffalo Computer Science %K AI06 %X Cursive script recognition by computer (CSR) is the problem of transforming language from the form of cursive human handwriting to one of digital text representation. Off-line CSR involves elements of computer vision at a low level of processing andk those of language perception and understanding at a higher level. The problem is approached in this work as a multi-level machine perception problem in which an image of a cursive script word is transformed through a hierarchy of representation levels. Four distinct levels are employed, based on descriptions that use pixels, chain codes, features and letters, before the final word level of representation is obtained. %R 85-05 %A P. B. Van\ Verth %T A system for automatic program grading %D May 1985 %I SUNY Buffalo Computer Science %K AA08 AA07 %X This doctoral dissertation presents an automated system for grading program quality based upon a mathematical model of program quality. Our research investigates whether such a system will perform at least as well as, and perhaps even do better than, human graders. %R 85-06 %A J. G. Neal %T A knowledge-based approach to natural language understanding %D May 1985 %I SUNY Buffalo Computer Science %K AI01 AI02 %X In this thesis we present a language processing expert system that we have implemented in the role of an educable cognitive agent whose domain of expertise is language understanding and whose discourse domain includes its own language knowledge. We present a representation of language processing knowledge and a core of knowledge, including a Kernel Language, which forms the knowledge base for this AI system. %R 85-07 %A S. L. Hardt %A J. Rosenberg %A M. E. Haefner %A K. S. Arora %T The three ERIK\-AMVER progress reports %D July 1985 %I SUNY Buffalo Computer Science %K AA18 %X This is a collection of three progress reports submitted by our group to the U. S. Coast Guard. The reports chart the development of the ERIK (Evaluating Reports using Integrated Knowledge) system. The systems design and implementation were orchestrated by Jay Rosenberg. The final report as well as the manuals for the system can be found elsewhere. %R 85-08 %A S. L. Hardt %A J. Rosenberg %T The ERIK project: Final report and manuals %D July 1985 %I SUNY Buffalo Computer Science %K AA18 H02 %X The ERIK system is a computer program that was developed to interpret ship reports for the United States Coast Guard. The system is now completed an installed in the Coast Guard's AMVER Center on Governors Island. It was running in a testing mode on a dedicated DEC VAX-11/730 system running VMS, from February to June 1985. The final system will be running on a Symbolics Lisp Machine in July 1985. This report provides a brief description of the project, the system, and user manuals. The latter contains a detailed description of the theory behind the system and the necessary implementation and maintenance information. %A S. N. Srihari %A J. J. Hull %A P. W. Palumbo %A D. Niyogi %A C. H. Wang %T Address recognition techniques in mail sorting: Research directions %R 85-09 %D August 1985 %I SUNY Buffalo Computer Science %K AI06 AI02 %X This report is a discussion of techniques of computer vision, pattern recognition, and language processing relevant to the problem of mail sorting as well as a presentation of the results of preliminary experiments with several new techniques applied to letter mail images. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue Apr 22 18:50:52 1986 Date: Tue, 22 Apr 86 18:50:42 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #98 Status: RO AIList Digest Tuesday, 22 Apr 1986 Volume 4 : Issue 98 Today's Topics: Bibliography - Recent Articles #8 ---------------------------------------------------------------------- Date: WED, 10 JAN 84 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Recent Articles #8 Definitions D BOOK26 Qualitative Reasoning about Physcial Systems\ %E Daniel G. Bobrow\ %D 1985\ %I MIT PRESS\ %X 504 pages $$232.50 ISBN 02218-4 D BOOK27 Visual Cognition\ %E STeven Pinker\ %D 1985\ %I MIT PRESS\ %X 296 pages $17.50 paper ISBN 16103-6 __________________________________________________________________________ %A Gyungho Lee %A Clyde P. Kruskal %A David J. Kuck %T An Empirical Study of Automatic Restructuring of Nonnumerical Programs for Parallel Processors %J IEEE Transactions on Computers %V C-34 %N 10 %P 927-933 %D OCT 1985 %K H03 %A W. Daniel Hillis %T The Connection Machine %I MIT Press %D 1985 %K H03 AT15 %X $22.50 ISBN 08157-1 175 pages %A Richard P. Gabriel %T Performance and Evaluation of Lisp Machines %I MIT Press %D 1985 %K T01 H02 AT15 %X $22.50 ISBN 07093-6 350 pages %A Michael J. O'Donnell %T Equational Logic as a Programming Language %I MIT Press %D 1985 %K AI10 AT15 %X $25.00 ISBN 15028-X 300 pages %A Ehud Y. Shapiro %T Algorithmic Programming Debugging %I MIT Press %D 1983 %K T02 AT15 %X $35.00 ISBN 19218-7 232 pages %A Marc H. Raibert %T Legged Robots That Balance %I MIT Press %D 1985 %K AT15 AI07 %X $30.00 ISBN 18117-7 250 pages %A Matthew T. Mason %A J. Kenneth Salisbury, Jr. %T Robot Hands and the Mechanics of Manipulation %I MIT Press %D 1985 %K AT15 AI07 %X $30.00 ISBN 13205-2 325 pages %A A. Morecki %A G. Bianchi %A K. Kedzior %T Theory and Practice of Robots and Manipulators %I MIT Press %D 1985 %K AT15 AI07 %X $45.00 ISBN 13208-7 %A Richard P. Paul %T Robot Manipulators: Mathematics, Programming, and Control %I MIT Press %D 1981 %K AT15 AI07 %X $34.50 ISBN 16082-X 279 pages %A HIdeo Hanafusa %A Hirochika Inoue %T Robotics Research: The Second International Symposium %I MIT Press %D 1985 %K AT15 AI07 %X $45.00 ISBN 08151-2 500 pages %A Michael Brady %A Richard Paul %T Robotics Research: The First International Symposium %I MIT Press %D 1984 %K AT15 AI07 %X $65.00 ISBN 02207-9 1000 pages %A James U. Korein %T A Geometric Investigation of Reach %I MIT Press %D 1985 %K AT15 AI07 %X $30.00 ISBN 11104-7 210 pages %A Michael Brady %A John M. Hollerbach %A Timothy L. Johnson %A Thomas Lozano-Perez %A Matthew T. Mason %T Robot Motion: Planning and Control %I MIT Press %D 1983 %K AT15 AI07 AI09 %X 585 pages $39.50 ISBN 02182-X %A Robert Berwick %T The Acquisition of Syntactic Knowledge %D 1985 %I MIT Press %K AT15 AI02 %X 350 pages $27.50 ISBN 02226-5 %A Michael G. Dyer %T In-Depth Understanding: A Computer Model of Integrated Processing for Narrative Comprehension %D 1983 %I MIT Press %K AT15 AI02 AI08 %X ISBN 04073-5 458 pages $37.50 %A Mitchell P. Marcus %T A Theory of Syntactic Recognition for Natural Language %D 1980 %I MIT Press %K AI02 AT15 %X ISBN 13149-8 335 pages $35.00 %A Henry S. Baird %T Model-Based Image Matching Using Location %D 1985 %I MIT Press %K AI06 AT15 %X ISBN 02220-6 $25.00 115 pages %A Harold Abelson %A Gerald Jay Sussman %T Structure and Interpretation of Computer Programs %D 1984 %I MIT Press %K Scheme T01 AT15 %X ISBN 01077-1 542 pages $34.95 %A Scott E. Fahlman %T NETL: A System for Representing and Using Real-World Knowledge %D 1979 %I MIT Press %K H03 AT15 %X ISBN 06069-8 278 pages $27.50 %A Ellen Catherine Hildreth %T Measurement of Visual Motion %D 1984 %I MIT Press %K AT15 AI06 %X ISBN 08143-1 241 pages $32.50 %A Herbert A. Simon %T The Sciences of the Artificial %D 1981 %I MIT Press %K AT15 %X ISBN 69073-X 247 pages $6.95 paper %A Michael Brady %A Robert C. Berwick %T Computational Models of Discourse %D 1983 %I MIT Press %K AI02 AT15 %X ISBN 02183-8 $37.50 403 pages %A Marvin L. Minsky %T Semantic Information Processing %D 1969 %I MIT Press %K AT15 %X ISBN 13044-0 $35.00 440 pages %A Eric Leifur Grimson %T From Images to Surfaces: A Computational STudy of the Human Early Visual System %D 1981 %I MIT Press %K AT15 AI06 AI08 %X ISBN 07083-9 274 pages $35.00 %A Shimonn Ullman %T The Interpretation of Visual Motion %D 1979 %I MIT Press %K AT15 AI06 %X ISBN 21007-4 229 pages $30.00 %A John Haugeland %T Mind Design: Philosophy, Psychology, Artificial Intelligence %D 1981 %I MIT Press %K AT15 AI08 %X ISBN 58052-7 368 pages $10.95 paper %A Daniel C. Dennet %T Brainstorms: Philosophical Essays on Mind and Psychology %D 1980 %I MIT Press %K AT15 AI08 %X 353 pages ISBN 54037-1 $10.00 paper Cloth: $30.00 ISBN 04064-6 %A Zenon W. Pylyshyn %T Computation and Cognition: Toward a Foundation for Cognitive Science %D 1984 %I MIT Press %K AI08 AT15 %X 320 pages $27.50 ISBN 16098-6 %A D. Bobrow %T Qualitative Reasoning about Physical Systems - An Introduction %B BOOK26 %K AA16 %A J. de Kleer %A J. Seely Brown %T A Qualitative Physics Based on Confluences %B BOOK26 %K AA16 %A K. Forbus %T Qualitative Process Theory %B BOOK26 %A B. Kuipers %T Common Sense Reasoning about Causality: Deriving Behavior From Structure %B BOOK26 %A J. de Kleer %T How Circuits Work %B BOOK26 %K AA04 %A B. C. Williams %T Qualitative Analysis of MOS Circuits %B BOOK26 %K AA04 %A R. Davis %T Diagnostic Reasoning Based on Structure and Behavior %B BOOK26 %A M. R. Genesereth %T The Use of Design Descriptions in Automated Diagnosis %B BOOK26 %A H. Barrow %T VERIFY: A Program for Proving Correctness of Digital Hardware Designs %B BOOK26 %K AA04 %A Rachel Reichman %T Getting Computers to Talk Like You and Me: Discourse Context, Focus and Semantics %D 1985 %I MIT PRESS %X 144 pages $20.00 ISBN 18118-5 %A Steven Pinker %T Visual Cognition: An Introduction %B BOOK27 %K AI06 AI08 %A D. D. Hoffman %A W. A. Richards %T Parts of Recognition %B BOOK27 %K AI06 AI08 %A Shimon Ullman %T Visual Routines %B BOOK27 %K AI06 AI08 %A Roger Shepard %A Shelley Hurwitz %T Upward Direction, Mentasl Rotation, and Discrimination of Left and Right Turs in Maps %B BOOK27 %K AI06 AI08 %A Stephen M. Kosslyn %A Jennifer Brunn %A Kyle R. Cave %A Roger W. Wallach %T Individual Differences in Mental Imagery: A Computational Analysis %B BOOK27 %K AI06 AI08 %A Martha J. Farah %T The Neurological Basis of Mental Imagery: A Computational Analysis %B BOOK27 %K AI06 AI08 %A Jon Barwise %A John Perry %T Situations and Attitudes %D 1983 %I MIT PRESS %K AI02 AI11 AI08 %X 352 pages $9.95 paper ISBN 52099-0 Cloth $27.50 $27.50 ISBN 02189-7 %A N. Fuhr %A G. E. Knorz %T Retrieval Test Evaluation of a Rule Based Automatic Indexing (AIR/PHYS) %K AI01 AA14 %B Proceedings of the Third Joint BCS and ACM Symposium %E C. J. van Rijsbergen %I Cambridge University Press %D 1984 %A W. S. Cooper %T Bridging the Gap between AI and IR %B Proceedings of the Third Joint BCS and ACM Symposium %E C. J. van Rijsbergen %I Cambridge University Press %D 1984 %K AI01 AA14 %A Richard L. Derr %T Linguistic Meaning and Language Comprehension %J Information Processing and Management %V 19 %N 6 %D 1983 %P 369-380 %K AI02 %A John O'Connor %T Biomedical Citing Statements Computer Recognition and Use to Aid Full-Text Re trieval %J Information Processing and Management %V 19 %N 6 %P 361-368 %D 1983 %K AI02 AI14 %A Martin Dillon %A Laura K. McDonald %T Fully Automatic Book Indexing %J Journal of Documentation %V 39 %N 3 %P 135-154 %D 1983 %K AI02 AI14 %A M. R. Cutkowsky %A P. K. Wright %T Active Control of a Compliant Wrist in Manufacturing Tasks %R ASME Paper Number 850WA/Prod-15 %D 1985 %K AA05 AA07 %A Tony Owen %T Assembly With Robots %I Prentice Hall %C Englewood Cliffs %D 1985 %K AI07 AA05 %X $29.95 %A J. D. Gould %A J. Conti %A T. Hovanyecz %T Composing Letters with a Simulated Listening Typewriter %J Communications of the ACM %D 1983 %V 26 %N 4 %P 295-308 %K AI05 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri Apr 25 00:45:12 1986 Date: Fri, 25 Apr 86 00:45:04 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #99 Status: R AIList Digest Thursday, 24 Apr 1986 Volume 4 : Issue 99 Today's Topics: Seminars - Run-Length Code for Geographical Information (SMU) & Logic in Design (SU) & A VLSI Architecture for Chess (SU) & Minimal Entailment (SU) & Chronological Ignorance (SU) & Refutational Completeness in Theorem Proving (UTexas) & Interpreting Logic Programs on an FFP Machine (UPenn) & The Non-Von Project (UPenn) & A Mathematical Theory of Plan Synthesis (SRI), Conference - American Control Conference & AAAI Workshop on AI and Simulation ---------------------------------------------------------------------- Date: WED, 23 APR 86 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Seminar - Run-Length Code for Geographical Information (SMU) A Spatial Knowledge Structure Based on Run-Length-Code for a Geographical Information System Speaker: Erland Jungert Illinois Institute of Technology Location: 315SIC, Southern Methodist University, CS Time: 3PM Run-Length-Code (RLC) is an example of a simple data structure used mainly for compacting images. A method where RLC is used as an object oriented data structure for Geographical Information Systems (GIS) will be presented. The usage of this object structure as a basis for spatial reasoning while regarding the RLC-objects as part of a spatial knowledge structure will be discussed. ------------------------------ Date: Mon 21 Apr 86 13:35:09-PST From: Christine Pasley Subject: Seminar - Logic in Design (SU) CS529 - AI In Design & Manufacturing Instructor: Dr. J. M. Tenenbaum Title: Logic: Application to Design Debugging, Diagnosis, And Test Speaker: Narinder Singh From: Stanford University Date: Wednesday, April 23, 1986 Time: 4:00 - 5:30 Place: Terman 556 Abstract: Logic programming is a software engineering methodology based on techniques from the field of Artificial Intelligence. One builds a logic program by describing the application area of the program and its goal, rather than specifying the actions necessary to achieve the goal. In this talk we will examine the use of logic to represent and reason about digital devices for simulation, test generation, and diagnosis. Describing designs in logic permits capturing high level design descriptions, reasoning with a single description for a collection of tasks, and reasoning with incomplete descriptions. In addition, logic provides a flexible interpreter for reasoning about a design, e.g., it permits reasoning forwards and backwards through a design, and generating single or multiple answers to a goal. Visitors welcome! ------------------------------ Date: Mon 21 Apr 86 09:49:49-PST From: Sharon Gerlach Subject: Seminar - A VLSI Architecture for Chess (SU) This Friday, April 25, at 1:30 in CIS 101: All the Right Moves: A VLSI Architecture for Chess Carl Ebeling Carnegie Mellon University Hitech, the Carnegie-Mellon chess program that recently won the ACM computer chess championship and owns a USCF rating of 2340, owes its success in large part to an architecture that is used for both move generation and position evaluation. Previous programs have been subject to a tradeoff between speed and knowledge: applying more chess knowledge to position evaluation necessarily slows the search. Although the previous computer chess champions, Belle and Cray Blitz, have demonstrated the importance of deep search, it is clear that better knowledge is required for first-rate chess. With this new architecture, Hitech is able to search both deeply and knowledgeably. We will first describe the design and implementation of the move generator which uses fine-grained parallelism to reduce the time to produce and order moves. By generating all moves for both sides, this move generator is able to order moves based both on capture information and an estimate of the safety of the destination square. This effort is rewarded by smaller search trees since the efficiency of the alpha-beta search depends on the order in which moves are examined. Experiments show that Hitech search trees are within a factor of 1.5 of optimal. Although the amount of hardware required is substantial, this architecture is eminently suited to VLSI. We then describe the requirements of position evaluation and discuss how this architecture can be adapted to perform evaluation. This will include the description of a VLSI implementation that we propose for position evaluation. Finally we will describe the other components of the chess machine and present some performance results that indicate how well the hardware supports the search. ------------------------------ Date: Tue 22 Apr 86 10:09:41-PST From: Anne Richardson Subject: Seminar - Minimal Entailment (SU) DAY: April 28, 1986 EVENT: AI Seminar PLACE: Jordan 050 TIME: 4:15 TITLE: "Minimal Entailment and Non-Monotonic Reasoning" PERSON: David W. Etherington FROM: University of British Columbia Circumstances commonly require that conclusions be drawn (conjectured) even though they are not strictly warranted by the available evidence. Various forms of minimal entailment have been suggested as ways of generating appropriate conjectures. Minimal entailment is a consequence relation in which those facts which hold in minimal models of a theory are considered to follow from that theory. Thus minimal entailment is less restrictive than the standard logical entailment relation, which strongly constrains what evidence may be taken as supporting a conclusion. Different definitions of minimality of models yield different entailment relations. The talk will outline a variety of such relations. Domain, Predicate, and Formula Circumscription [McCarthy 1978, 1980, 1984] are syntactic formalisms intended to capture these relations. We examine each from a semantic viewpoint, in the hope of clarifying their respective capabilities and weaknesses. Results on the consistency, correctness, and adequacy of these formalisms will be presented. While minimal entailment corresponds most directly to the Closed-World Assumption that positive information not implicit in what is known can be assumed false McCarthy and others have suggested applications of circumscription to more general default reasoning tasks. With this in mind, connections between minimal entailment and Reiter's Default Logic will be sketched, if time permits. In this connection, we will consider positive and negative results due to Grosof and Imielinski, respectively. ------------------------------ Date: 22 Apr 86 1306 PST From: Vladimir Lifschitz Subject: Seminar - Chronological Ignorance (SU) CHRONOLOGICAL IGNORANCE: time, knowledge, nonmonotonicity and causation Yoav Shoham Yale University Thursday, May 1, 4pm Room 380X, Mathematics Building We are concerned with the problem of reasoning about change within a formal system. We identify two problems that arise from practical considerations of efficiency and naturalness of expression: the persistence problem (otherwise known as the frame problem, and a new, but no less evil, initiation problem. In this talk we concentrate on the latter one. We propose a new logic that allows efficient and natural reasoning about change and which avoids the initiation problem. The logic, called the logic of chronological ignorance, is a fusion of recent ideas on temporal logic, modal logic of knowledge, and nonmonotonic logic. We identify a special class of theories, called causal theories, and show these have elegant model-theoretic properties which make reasoning about causal theories very easy. Finally, we contrast our logic with previous work on nonmonotonic logics in computer science, and discuss its connection to the philosophical literature on causation. ------------------------------ Date: Tue 22 Apr 86 09:59:26-CST From: Ellie Huck Subject: Seminar - Refutational Completeness in Theorem Proving (UTexas) A New Method For Establishing Refutational Completeness in Theorem Proving Jieh Hsiang SUNY at Stony Brook April 25 - 10:00am Echelon I, Room 409 In this talk we present a new technique for establishing completeness of refutational theorem proving strategies. Our method employs semantic trees and, in contrast to most of the semantic tree methods, is based on proof-by-refutation as opposed to proof-by-induction. Thus, it works well on transfinite semantic trees (to be introduced) as well as on finite ones. This method is particularly useful for proving the completeness of the following strategies (without the need of the functionally reflexive axioms): Resolution + oriented paramodulation P1-resolution + oriented paramodulation Resolution with ordered predicates + oriented paramodulation using clauses only containing the equality predicate A version of an unfailing Knuth-Bendix algorithm The EN-Strategy, a complete refutational method for first order theory with equality based on the term rewriting method The Manna-Waldinger Tableau method with inference rules for special relations, where oriented paramodulation is an improvement of paramodulation. ------------------------------ Date: Tue, 22 Apr 86 11:44 EST From: Tim Finin Subject: Seminar - Interpreting Logic Programs on an FFP Machine (UPenn) University of Pennsylvania Colloquium 11:00am April 23, 1986 - 216 Moore School "INTERPRETING LOGIC PROGRAMS ON AN FFP MACHINE" Bruce T. Smith University of North Carolina - Chapel Hill This talk describes a strategy for interpreting logic programs (e.g. Prolog) on Gyula Mago's FFP Machine. The FFP Machine is a small-grain parallel computer designed to interpret Backus' FFP language. The question is how to fit logic programs into the FFP Machine's string reduction style of operation without losing potential parallelism. In each machine cycle, the FFP Machine partitions itself into a set of virtual MIMD computers-- one for each innermost FFP application. These virtual computers work independently to re-write their FFP expressions. In constrast with the standard approach to parallelism in logic programming, i.e. communicating processes cooperating to search an AND/OR tree, this approach represents the search as an FFP sequence and searches by creating appropriate reductions that re-write sub-trees. OR-parallelism is provided by expanding different branches of the tree. AND-parallelism is provided by creating virtual computers that perform unification (by a version of the Martelli and Montanari algorithm) over sets of conjoined goals. ------------------------------ Date: Wed, 23 Apr 86 16:24 EST From: Tim Finin Subject: Seminar - The Non-Von Project (UPenn) Colloquium - University of Pennsylvania 3:00pm 4-24-86, 216 Moore THE NON-VON PROJECT: EXPERIMENTS WITH MASSIVELY PARALLEL MACHINES David Elliott Shaw Columbia University NON-VON is a massively parallel non-von Neumann machine that has been shown to support the extremely rapid execution of a wide range of computationally intensive symbolic information processing tasks, including a number of artificial intelligence applications. An early prototype called NON-VON 1, which implements some, but not all of the features of the full architecture, is presently operational at Columbia University. Central to the NON-VON architecture is an active memory which is implemented using custom VLSI chips, each containing eight 8-bit small processing elements. A full-scale machine would contain hundreds of thousdands of small processing elements, together with several hundred large processing elements, each based on a conventional 32-bit microprocessor. NON-VON's processing elements are physically interconnected in three ways, and can be dynamically reconfigured to support a fourth logical communication topology. The machine is capable of synchronous (SIMD), asynchronous (MIMD) and partitioned (multiple SIMD) execution. In this presentation, Professor Shaw will describe the organization of the NON-VON programming techniques. Performance results in the areas of low-and intermediate-level computer vision, database and knowledge base management, and AI production systems will be presented. ------------------------------ Date: Wed 23 Apr 86 14:42:11-PST From: LANSKY@SRI-AI.ARPA Subject: Seminar - A Mathematical Theory of Plan Synthesis (SRI) TOWARD A MATHEMATICAL THEORY OF PLAN SYNTHESIS Edwin P.D. Pednault (PEDNAULT@SRI-AI) Stanford University and SRI International, AI Center 11:00 AM, MONDAY, April 28 SRI International, Building E, Room EJ228 (new conference room) Classical planning problems have the following form: given a set of goals, a set of allowable actions, and a description of the current state of the world, find a sequence of actions that will transform the world from its current state to a state in which all of the goals are satisfied. This talk is a presentation of my thesis research, which examines the question of how to solve such problems automatically. The question will be addressed from a rigorous, mathematical standpoint, in contrast to the informal and highly experimental treatments found in most previous work. By introducing mathematical rigor, it has been possible to unify many existing ideas in automatic planning, showing how they arise from first principles and how they may be applied to solve a much broader class of problems than had previously been considered. In addition, a number of theorems have been proved that further our understanding of the synthesis problem, and a language has been developed for describing actions that combines the notational convenience of STRIPS with the expressive power of the situation calculus. This talk will concentrate on my techniques for plan synthesis with only a brief summary of the other contributions of my research. A mathematical framework will be introduced, along with a number of theorems that form the basis for the synthesis techniques. These theorems will then be combined with a least-commitment search strategy to obtain a solution method that unifies and generalizes means-ends analysis, opportunistic planning, goal protection, goal regression, constraint posting/propagation, hierarchical planning, and nonlinear planning. ------------------------------ Date: 23 Apr 1986 23:53:49 EST From: ALSPACH@USC-ISI.ARPA Subject: Conference - American Control Conference Write to me at this address for registration and housing reservation forms for the 1986 ACC (American Control Conference) described in a previous message. ------------------------------ Date: 23 Apr 1986 1029-PST From: STELZNER@ALADIN Subject: Conference - AAAI Workshop on AI and Simulation AAAI Workshop on AI and Simulation Simulation shares with AI a concern for effective world modeling. Currently, some computer scientists are trying to build systems that integrate the strengths of simulation and AI---AI's ability to represent complex system models and to reason over those models, and simulation's ability to model dynamic behavior. This initial work is already being realized in commercial products. We intend that this workshop bring together researchers in knowledge-based simulation, tool builders who are developing simulation systems that combine AI and classical techniques, and system designers who have built AI-based simulation applications. Topics to be discussed Expert reasoning in simulation Scenario construction for expert systems Integration of AI techniques with conventional simulations Graphical representation for simulation Application of new hardware architectures for simulation AI-based simulation tools Knowledge representation formalisms for simulation Simulation at multiple levels of abstraction Automatic analysis of simulation results Organizers The workshop organizers are Arthur Gerstenfeld (Worcester Polytechnic Institute), Richard B. Modjeski (U.S. Army Concepts Analysis Agency), Ramana Reddy (West Virginia University and the Robotics Institute, Carnegie-Mellon University) and Marilyn Stelzner, Chair (IntelliCorp) Participation The workshop will take place on Monday, August 11 at the University of Pennsylvania. Participation in the workshop is by invitation, limited to 35 participants. People wishing to be invited should submit {\bf five} copies of a 1000-word abstract describing their work in AI and simulation to the workshop Chair, Marilyn Stelzner, IntelliCorp, 1975 El Camino Real West, Mountain View, California 94040 by May 30, 1986. Invitations will be issued by July 1. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri Apr 25 00:45:30 1986 Date: Fri, 25 Apr 86 00:45:15 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #100 Status: R AIList Digest Thursday, 24 Apr 1986 Volume 4 : Issue 100 Today's Topics: Queries - Parallel Languages & Tutoring Systems & Object-Oriented Support For Common Lisp & LISP Coding Standards, Methodology - LISP Coding Standards & String Reduction & Shape, Comments - Use of the Xerox Name & Search, Philosophy - Consciousness, Review - OpEd Seminar ---------------------------------------------------------------------- Date: Mon 21 Apr 86 09:09:03-EST From: Michael van Biema Subject: Parallel Languages: The Dado project at Columbia is in the process of preparing a paper in which we hope to give a taxonomy of parallel programming languages. We ask that you be so kind as to send us any papers on languages that you may have implemented or that you are designing. This would be not only very helpful to us, but useful to the community as well. If your language is being designed to run on a particular architecture please include a description of the particular architectural features of the machine. Also, if you could briefly describe to us: 1) The state of development of your language. 2) The intended application area. 3) The intended or current user community. 4) Your thoughts on the current state of parallel language design. What particular problems does your language address. If you do not have time for the survey questions please do send a copy of the papers or even just references to them! Thank you for your time and we look forward to sending you a copy of this survey, Michael van Biema Columbia University Dept. of Computer Science New York, N.Y. 10027 ------------------------------ Date: 23 Apr 1986 12:41-EST From: Eswaran.Subrahmanian@H.CS.CMU.EDU Subject: Tutoring Systems I am currently creating a bibliography of computer aided tutoring systems. I would like references to literature on both AI based and non-AI based systems. I will be willing to send anybody who may want a copy of the compiled bibliography. Thanks in advance Eswaran Subrahmanian ARPA: eswaran@h.cs.cmu.edu.arpa Postal: Eswaran Subrahmanian DH 226 Design Research Center Carnegie Mellon University Pittsburgh Pa 15213. ------------------------------ Date: 18 Apr 86 20:14:56 GMT From: ihnp4!houxm!whuxl!whuxlm!akgua!gatech!seismo!umcp-cs!aplcen!jhunix !ins_amrh@ucbvax.berkeley.edu Subject: LISP coding standards Is anyone aware of any official LISP coding standards comparable to the standards for Pascal, Ada, etc? Folks at my new employer have been looking... -Marty Hall. Arpa: (preferred) hall@hopkins CSnet: ("") hall.hopkins@csnet-relay uucp: seismo!umcp-cs!jhunix!ins_amrh allegra!hopkins!jhunix!ins_amrh ------------------------------ Date: 19 Apr 86 From: "Jennings, Richard" Subject: Object Oriented Support For Common Lisp I am working on a project trying to couple a good programming environment exploiting object oriented paradigms to a grid of INMOS Transputers. Rather than build up everything from the OCCAM development system, I would like to use the VAX LISP (a variant of Common Lisp) environment augmented with a public domain (preferably) object oriented package as a model for the system I intend to build for the Transputers. 1) I would like pointers to environments which are compatible (sit on top of) VAX LISP which directly support object oriented programming; 2) notes from those who may be working on (or interested in) such projects; and 3) responses sent directly to me since I do not have regular access to AILIST. I will summarize. Richard Jennings PO Box 808 L-228 (L-228 is CRITICAL) LLNL Livermore, CA 94550 ARPA: preferred -> jennings%icdc@lll-crg slow, reliable -> jennings@lll-crg (INMOS is a company which has probably trademarked OCCAM and TRANSPUTER) ------------------------------ Date: 22 Apr 86 16:03:00 GMT From: pur-ee!uiucdcs!uiucdcsp!bsmith@ucbvax.berkeley.edu Subject: Re: LISP coding standards Look at Guy Steele's book Common Lisp. All Lisps seem to be going in this direction, implementing as large a subset of Common Lisp as is possible. It's my understanding that Symbolics will be releasing a new version of its system that will default to Common Lisp this summer (instead of having to specify it in the mode line). ------------------------------ Date: 22 Apr 86 03:17:10 GMT From: ucdavis!lll-lcc!lll-crg!seismo!cit-vax!alfke@ucbvax.berkeley.edu (J. Peter Alfke) Subject: Re: String reduction Organization : California Institute of Technology Keywords: In article <994@umn-cs.UUCP> amit@umn-cs.UUCP (Neta Amit) writes: >In article <1031@eagle.ukc.ac.uk> sjl@ukc.ac.uk (S.J.Leviseur) writes: >>Does anybody have any references to articles on string reduction >>as a reduction technique for applicative languages (or anything >>else)? They seem to be almost impossible to find! Anything welcome. > >String reduction as a model of computation was suggested by >A.A.Markov, in his 1954(?) paper, and is proved to be equivalent in >power to the other two general models of compution (Turing machine and >the Lambda Calculus). This sounds similar to Calvin Mooers' TRAC language of mid-sixties. That language was based entirely on macro expansion; rather strange, but actually a lot more powerful than the toy it first appeared to be. There was also a language called SAM76 that showed up in 1976, that seemed close enough to TRAC to warrant a lawsuit. It seemed identical in concept, with only minor differences in syntax and function-names. TRAC is pretty easy to implement; I have an incomplete version written in C that I did some years back. I also have a paper on TRAC which is probably long out of print by now. --Peter Alfke alfke@csvax.caltech.edu ------------------------------ Date: Tue, 22 Apr 86 15:14:13 est From: franc%UPenn-Grasp%upenn.csnet@CSNET-RELAY.ARPA Subject: shape >Jerry Hobbs has asked me "What is a hook and what is a ring that we know >the ring can hang on the hook?" More specifically, what do we have to >know about hooks and rings in general (for default reasoning) and >about a particular hook-like object and ring-like object (dimensions, >radius of curvature, surface normals, clearances, tolerances, etc.) >in order to say whether a particular ring may be placed on a particular >hook and whether it is likely to stay in place once put there. We believe that the ability to model categories or generic objects would make questions like this easier. We have approached the problem of category shape representation in the context of model based object recognition i.e. "how can a computer vision system recognize different coffee cups based on single category model of a coffee cup?" Given that the most important common property of objects in a category is their function, the shape of categorically related objects must satisfy the same functional constraints. By analysing these constraints we try to come up with a prototypical shape, and a set of allowable deformations that account for variations within the category. I have started thesis work on this topic recently with Dr. Ruzena Bajcsy. Franc Solina GRASP Laboratory University of Pennsylvania csnet: Franc@Upenn ------------------------------ Date: 22 Apr 86 08:51:55 PST (Tuesday) From: McNelly.OsbuSouth@Xerox.COM Subject: Re: Compuscan When you say you "used originals and text that had been Xeroxed several times," do you mean that you copied it on a Xerox copier? Or do you mean that some sales rep in New York Xeroxed the text into an 820 PC, then Xeroxed it across the country to the corporate office in Los Angeles, where the manager Xeroxed all the sales reports together on a Xerox 6085 (Daybreak) workstation, and then finally Xeroxed that document to a Xerox 8040 (Raven) laser printer before Xeroxing the document to an Xerox 8030 File Service for storage? As someone who wears an "Office Manager's hat," you should know better than to use Xerox as a verb... John McNelly Member Programming Staff Information Systems Div, Xerox Corp. ------------------------------ Date: Fri, 18 Apr 86 09:21 PST From: Tom Garvey Subject: Re: Non-trivial expert systems I wish you amateur AI guys out there wouldn't try to exalt your own understanding of the field by making snide, offhand remarks about its founders: "(*sigh* - Can you tell my first AI course was taught out of Nilsson's PROBLEM-SOLVING METHODS IN ARTIFICIAL INTELLIGENCE? Nilsson thought all AI reduced to search.)" Just because you wrote a faulty program that had no control over its search space is no reason to conclude (as you apparently do) that search is not an appropriate method for solving the problem. I would agree with Nilsson that search is a pervasive aspect of most AI problems -- it is precisely the determinism of most expert systems that makes them uninteresting from an AI perspective. Cheers, Tom ------------------------------ Date: Fri 18 Apr 86 09:53:30-PST From: Stephen Barnard Subject: performance considered insufficient Are viruses conscious? How about protozoa, mollusks, insects, fish, reptiles, and birds? Certainly some mammals are conscious. How about cats, dogs, and chimpanzees? Does anyone maintain that homo sapiens is the only species with consciousness? My point is that consciousness is an emergent phenomenon. The more complex the nervous system of an organism, the more likely one is to ascribe consciousness to it. Computers, at present, are too simple, regardless of performance. I would have no problem believing a massively parallel system with size and connectivity of biological proportions to be conscious, provided it did interesting things. ------------------------------ Date: Mon, 21 Apr 86 11:43:18 est From: Nigel Goddard Reply-to: goddard@rochester.UUCP (Nigel Goddard) Subject: Re: One more little thing In article <8604152029.AA07125@bucsd.ARPA> tes@bostonu.CSNET writes: > >Nigel Goddard wrote in Volume 4 Issue 87 > >> I meet [people] who I consider to be very "unconscious", >> i.e. their stated explanations of their motives and actions >> seem to me to completely misunderstand what I consider to >> be the *real* explanations. > >What, by Jove, is a "*real* explanation" ?????????????????????? >I can't digest my food properly until I find out. > > Tom Schutz > CSNET: tes@bu-cs A *real* explanation is an explication of MY internal model, as opposed to someone else's internal model. I trust you will suffer no longer. Nigel Goddard ------------------------------ Date: Wed, 23 Apr 86 20:35:28 WST From: munnari!wacsvax.oz!marke@seismo.CSS.GOV (Mark Ellison) Reply-to: wacsvax!marke@seismo.CSS.GOV (Mark Ellison) Subject: Re: More wrangling on consciousness In article <8604180725.AA11124@ucbvax.berkeley.edu> "CUGINI, JOHN" writes: >At the technical level, I think it's simply wrong to dismiss >brains as a criterion for consciousness - if mechanism M >causes C (consciousness) and enables P (performance), then >clearly it is an open question whether something that can do P, >but does not have M, does or does not have C. Mechanism M causes C? You know many people who (may) have brains, and you have no DIRECT evidence that they are conscious. You only have direct evidence of one case of C (barring ESP, etc.), and no DIRECT evidence of that person's brain. Except for the performances in each case. >At the "gut" level I think the whole tenor of the reply misses >the point that consciousness is a very "low-level", primitive >sort of phenomenon. Do severely retarded persons have "the >ability to learn to understand the *real* reasons for their >actions...an ability to abstract and to make an internal model >of the self" ? or cows, or cats? Yet no one, I hope, doubts >that they are conscious (eg, can feel pain, experience shapes, >colors, sounds). We only know of their ability to feel pain, experience shapes, colors, sounds, etc., by their reactions to those stimuli. In other words, by their performance. But on the other hand their performance might not involve abstract statements. >This has very little to do with any clever >information processing capabilities. And it is these "raw >feelings" that a) are essential to what most people mean by >consciousness and b) seem least susceptible to implementation by >Lisp machines, regardless of size. I would argue that "raw feelings" in others are known only by their performance. In effect we egomorphise(I don't know the right word, I mean something like anthropmorphise with regard to oneself) them. And we (some of us) do the same to machines, if not so seriously. `The is really struggling today.' `The process is tired (niced).' One criterion that I have not seen yet proposed is the following. It is more useful to pretend that people are conscious than not. They tend to cause you less pain, and are more likely to do what you want. So I'll believe someone's 8600 or Cray is conscious if it works better, according to whatever criteria I have for that at the moment, when I so believe. --- Mark Ellison lambda f . (lambda x . f x x) (lambda x . f x x) Department of Computer Science, CSNet: marke@wacsvax.oz University of Western Australia, ARPA: marke%wacsvax.oz@seismo.edu.gov Stirling Highway, UUCP: ..!seismo!munnari!wacsvax!marke Nedlands, Western Australia, 6009. PHONE: (09) 380 2305 OVERSEAS: +61 9 380 2305 ------------------------------ Date: Tue 22 Apr 86 12:55:27-CST From: Aaron Temin Subject: seminar reviews Ken - Given that ailist posts seminar announcements, I would like to encourage folks who attend the seminar to post summaries/critiques/reviews of them. Then we see the differences between what the researcher hoped to accomplish v. what really seems to exist. I append a short review of Sergio Alvarado's talk on his OpEd system, which I just returned from hearing. ---- This is a review of the seminar given by Sergio Alvarado on his OpEd system at the Univ. of Texas on 22 April. The announcement and abstract have been posted to ailist previously. The nub of the talk seemed to be that one is interested in understanding arguments and the supports (beliefs) for the arguments. Domain is letters to the editor. A belief seems to be an atomic entity that implies another belief or supports an argument. There are various arguments (strategies?), about 30 all together. Alvarado calls the arguments ArgumentUnits, and an editorial parses into an argument-graph. The system parses English text into argument graphs, and can "answer" questions from this. The example text was a short (10 sentence) paragraph from an '82 letter by Milton Friedman about import/export and the steel and automobile industries. It parsed into two argument units and about 8 belief (though in somecases there is "double counting" -- belief1 might be "Friedman believes tariffs are good" and belief2 is just the opposite "Reagan believes tariffs are bad" or whatever, as the argument is modelled as having two opposing views.) Alvarado hinted that there was another sample text but we didn't see it. He didn't do any of the obvious extensions e.g. using real-world knowledge of facts external to the paragraph to make inferences about the argument. I couldn't see much difference between this and the previous work done by folks on understanding legal arguments. -Aaron ------------------------------ End of AIList Digest ******************** From vtcs1::in% Sun Apr 27 00:40:39 1986 Date: Sun, 27 Apr 86 00:40:27 est From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #101 Status: RO AIList Digest Saturday, 26 Apr 1986 Volume 4 : Issue 101 Today's Topics: Bibliography - References #1 ---------------------------------------------------------------------- Date: 9 Apr 86 13:20:13 GMT From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs! abc@ucbvax.berkeley.edu (Andy Cheese) Subject: Bibliography - References #1 >From Andy Cheese, CS Department, Nottingham University, UK: ABDA76a Abdali S.K. An Abstraction Algorithm for Combinatory Logic Journal of Symbolic Logic Vol 41, Number 1, March 1976 ABEL85a * Abelson H. & Sussman G.J. with Sussman J. Structure and Interpretation of Computer Programs MIT Press 1985 ABEL? Abelson H. & Sussman G.J. Computation: An Introduction to Engineering Design Massachusetts Institute of technology, U.S.A. ABEL? Abelson H. & Sussman G.J. Scheme Demonstration Programs for Structure and Interpretation of Computer Programs Massachusetts Institute of Technology, U.S.A. ABRA82a Abramsky S. SECD-M - A Virtual Machine for Applicative Multiprogramming Computer Systems Lab, Queen Mary College, Nov 82 ABRA82b Abramson H. Unification-Based Conditional Binding Constructs TR 82-7, Department of Computer Science, Univ of British Columbia, Canada August 1982 ABRA83a Abramsky S. On Semantic Foundations For Applicative Multiprogramming Computer Systems Lab, Queen Mary College, 1983 ABRA83b Abramson H. A Prological Definition of HASL a Purely Functional Language With Unification Based Conditional Binding Expressions TR 83-8, Department of Computer Science, Univ of British Columbia, Canada July 26, 1983 ABRI85a Abrial J.R. Programming as a Mathematical Exercise in HOA85a 1985 ACK79a Ackerman W.B. & Dennis J.B. VAL - Preliminary Reference Manual MIT Laboratory for Computer Science, June 79 AIDA84a Aida H. & Moto-oka T. Performance Measurement of Parallel Logic Programming System "Paralog" Dept. of Electrical Eng., University of Tokyo ALEX85a * Alexandridis N.A. & Bilalis N.A. & Tsanakas P.D. Using Functional Programming For Hierarchical Structures in Image Processing in Digital Techniques in Simulation, Communication and Control (IMACS) (ed Tzafestas S.G. ) pp 175-181 North Holland 1985 ALLI85a * Allison L. Programming Denotational Semantics II Computer Journal, Vol 28, no 5, pp 480-486 1985 AMAM82a Amamiya M. & Takahashi N. & Naruse T. & Yoshida M. A Data Flow Processor Array System for Solving Partial Differential Equations Int. Symp. on Applied Mathematics and Information Science, March 1982 ARBI75a Arbib M.A. & Manes E.G. Arrows, Structures and Functors : The Categorical Imperative Academic Press 1975 ARVI78a Arvind & Gostelow K.P. & Plouffe W. An Asynchronous Programming Language and Computing Machine Dept. of Information and Computer Science, Tech Rep 114A University of California Irvine, December 1978 ARVI83a Arvind & Dertouzos M.L. & Iannucci R.A. A Multiprocessor Emulation Facility MIT Lab for Computer Science Technical Report 302 October 1983 ARVI84a Arvind & Brock J.D. Resource Managers in Functional Programming Journal of Parallel and Distributed Computing 1, 5-21 1984 ARVI84b Arvind & Kathail V. & Pingali K. Sharing of Computation in Functional Language Implementations Lab for Computer Science Tech Rep ??? (sic), 24 July 1984 ASHC76a * Ashcroft E.A. & Wadge W. Lucid - A Formal System For Writing and Proving Programs SIAM J on Computing Vol 5 no 3, 1976 pp 336-354 1976 ASHC77a Ashcroft E.A. & Wadge W.W. LUCID, a Non-Procedural Language with Iteration CACM Vol 20 No 7 p519-526 July 1977 ASHC82a Ashcroft E.A. & Wadge W.W. R for Semantics ACM TOPLAS Vol 4 No 2 p283-294 April 1982 ASHC83a Ashcroft E.A. Proposal for a Demand-Driven Tagged Dataflow Machine SRI Document Sept 1983 ASH85a Ashcroft E.A. Eazyflow Architecture SRI Technical Report CSL-147, April 1985 ASH85b Ashcroft E.A. Ferds--Massive Parallelism in Lucid Document 1985 ASH85c Ashcroft E.A. & Wadge W.W. The Syntax and Semantics of Lucid SRI Technical Report CSL-147 April 1985 ASO84a Aso M. Simulator of XP's ICOT Research Center, Technical Report TR-041 January 1984 ATKI83a * Atkinson M.P & Bailey P.J. & Chisholm K.J. & Cockshott P.W. & Morrison R. "An Approach to Persistent Programming" The Computer Journal,Vol.26,No.4, pp 360-365 1983 AUGU84a * Augustsson L. A Compiler for Lazy ML Proceedings of 1984 ACM Symposium on LISP and Functional Programming, Austin, Texas pp 218-227 August 1984 AZAR85a * Azari H. & Veler Y. Functional Language Directed Data Driven machine Microprocessing and Microprogramming 16, pp 127-132 September/October 1985 BACK74a * Backus J. Programming Language Semantics and Closed Applicative Languages ACM Symposium on Principles of Programming Languages, 1974 pp 71-86 1974 BACK78a * Backus J. Can Programming be liberated from the von-Neumann Style? CACM Vol 21 No 8 p613-641 Aug 1978 BACK79a Backus J.W. On Extending The Concept Of Program And Solving Linear Functional Equations Draft Paper Distributed at Summer Workshop on Programming Methodology, University of California at Santa Cruz, August 1979 BACK81a Backus J.W. The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions In "Formalization of Programming Concepts", LNCS 107 Springer Verlag April 1981 BAKE78a Baker, Henry B., Jr. List Processing in Real Time on a Serial Computer CACM 21 no 4, pp 280-294, 1978 BAKE78b Baker H.G. Actor Systems for Real Time Computation MIT Laboratory for Computer Science, MIT/LCS/TR-197, March 1978 BAKK76a * Bakker J.W. De Semantics and Termination of Nondeterministic Recursive Programs Proceedings 3rd International Colloquium on Automata Languages and Programming pp 435-477 Edinburgh University Press, 1976 BAKK79a * Bakker J.W. De & Zucker J.I. Derivatives of Programs mathematisch centrum iw 116/79 1979 BAKK80a Bakker J.De Mathematical Theory of Program Correctness Prentice Hall International Series in Computer Science, 1980 BARA85a * Barahona P. & Gurd J.R. Processor Allocation in a Multi-Ring Dataflow Machine Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-10-3 1985 BARB84a * Barbuti R. & Bellia M. & Levi G. & Martelli M. On the Integration of Logic Programming and Functional Programming IEEE 1984 International Symposium on Logic Programming, pp 160-167 6 February 1984 BARE81a Barendregt H.P. The Lambda Calculus, Its Syntax and Semantics North Holland 1981 BARR85a * Barringer H. Up and Down the Temporal Way Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-9-3 September 4, 1985 BCS86a * British Computer Society Reading Branch Parallel Processing Seminar, Proceedings Tuesday 21st January 1986 BELL80a * Bellia M & Degano P. & Levi G. A Functional Plus Predicate Logic Programming Language Proceedings of the Logic Programming Workshop, 14 July 1980 pp 334-347 1980 BERG79a * Bergstra J.A. & Tucker J.V. Algebraic Specifications of Computable and Semi-Computable Data Structures mathematisch centrum iw 115/79 1979 BERG79b * Bergstra J.A. & Tiuryn J. & Tucker J.V. Correctness Theories and Program Equivalence mathematisch centrum iw 119/79 1979 BERG79c * Bergstra J.A. & Tucker J.V. A Characterisation of Computable Data Types By Means of a Finite, Equational Specification Method mathematisch centrum iw 124/79 1979 BERG81a * Bergstra J.A. & Tucker J.V. Hoare's Logic and Peano's Arithmetic Mathematisch Centrum iw 160/81 1981 BERK75a * Berkling K. Reduction Languages For Reduction Machines Proc. 2nd Int. Symp. on Comp. Arch., pp 133-140 also available as an extended version as GMD Tech Rep ISF-76-8 14 September 1976 1975 BERK76a * Berkling K.J. A Symmetric Complement To The Lambda Calculus GMD Tech Rep ISF-76-7 14 September 1976 BERK82a * Berkling K.J. A Consistent Extension of the Lambda-Calculus as a Base for Functional Programming Languages Information and Control, vol 55, nos 1-3 oct/nov/dec 1982, pp 89-101 Academic Press 1982 BERL84a Berliner H. & Goetsch G. A Quantative Study of Search Methods and the Effect of Constraint Satisfaction CMU-CS-84-147 Dept of Comp Sci, Carnegie-Mellon Univ. July 1984 BERN80a * Bernstein A.J. Output Guards and Nondeterminism in Communicating Sequential Processes ACM Transactions on Programming Languages and Systems, Vol 2, No 2, pp 234 - 238 April 1980 BERR77a * Berry G. & Levy J-J. Minimal and Optimal Computations of Recursive Programs 4th ACM Symposium on Principles of Programming Languages pp 215-226 1977 BERT84a ed. Bertolazzi P VLSI: Algorithms and Architectures North Holland 1984 BETZ85a * Betz D. XLISP: An Experimental Object Oriented Language Version 1.4 January 1, 1985 BIC85a * Bic L. Processing of Semantic Nets on Dataflow Architectures Artificial Intelligence 27 pp 219 - 227 1985 BIRD76a Bird R.S. Programs & Machines- An Introduction to the Theory of Computation Wiley 1976 BIRD83a Bird R.S. Some Notational Suggestions for Transformational Programming Tech Rep no 153, Univ. of Reading, 1983 BIRD84a Bird R.S. Using Circular Programs to Eliminate Multiple Traversals of Data Acta Informatica Vol21 Fasc 3 1984 p239-250 BISH77a Bishop P.B. Computer Systems with a Very Large Address Space and Garbage Collection MIT Laboratory for Computer Science, MIT/LCS/TR-178, May 1977 BOBR80a Bobrow D.G. Managing Reentrant Structures Using Reference Counts ACM Trans. on Programming Languages and Systems, 2, no 3, pp 269-273 1980 BOHM81a * Bohm A.P.W. & Leeuwen J. Van A Basis for Dataflow Computing Dept of Computer Science, Univ of Utrecht, Tech Rep RUU-CS-81-6 1981 BOHM85a * Bohm A.P.W. & Gurd J.R. & Sargeant J. Hardware and Software Enhancement of the Manchester Dataflow Machine Document, Dept of Computer Science, Univ. of Manchester BORN81a * Borning A. & Bundy A. Using Matching in Algebraic Equation Solving Dept of Comp Sci, Univ of Washington, Technical Report No. 81-05-01 May 1981 BOSS84a * Bossi A. & Ghezzi C. Using FP As A Query Language For Relational Data-Bases Computer Languages, Vol 9, No 1, pp 25-37 1984 BOWE79a * Bowen K.A. Prolog Proceedings of the Annual Conference of the ACM 1979 pp 14-23 1979 BOW81a Bowen D.L. Implementation of Data Structures on a Data Flow Computer PhD Thesis, Dept of Comp Sci, Univ. of Manchester, April 1981 BOWE85a Bowen K.A. Meta-Level Programming and Knowledge Representation New Generation Computing, Vol 3, No 4, pp 359-383 1985 BOYE75a Boyer R.S. & Moore J.S. Proving Theorems about LISP Functions JACM Vol 22,No. 1, p129-144 BRAI83 Brain S. The Transputer-"exploiting the opportunity of VLSI" Electronic Product Design, December 1983 BRAI84a Brain S. Applying the Transputer Electronic Product Design, January 1984 BRAI84b Brain S. Writing Parallel Programs in OCCAM Electronic Product Design, Sept 1984 BRAM84a * Bramer M. & Bramer D. The Fifth Generation, An Annotated Bibliography Addison-Wesley Publishing Co., 1984 BROO84a Brookes S.D. Reasoning About Synchronous Systems CMU-CS-84-145 Dept of Comp Sci, Carnegie-Mellon Univ. March 1984 BROW84a Brownbridge D. Recursive Structures in Computer Systems PhD Thesis, Univ. of Newcastle upon Tyne, 1984 BROY82a eds Broy M. & Schmidt G. Proceedings of Nato Summer School on Theoretical Foundations of Programming Methodology, Munich, Dordrecht: Reidel, 1982 BROY82b Broy M. A Fixed Point Approach to Applicative Multiprogramming in BROY82a, pp 565-624 1982 BROY83a Broy M. Applicative Real-Time Programming Proc. 9th IFIP, Information Processing 1983, pp 259-264 North Holland 1983 BROY85a * Broy M. On The Herbrand-Kleene Universe For Nondeterministic Computations Theoretical Computer Science, 36, pp 1 - 19 March 1985 BRUI81a * Bruin A. De On the Existence of Cook Semantics Mathematisch Centrum iw 163/81 1981 BRUI85a * Bruin A. De & Bohm W. The Denotational Semantics of Dynamic Networks of Processes ACM Transactions on Programming Languages and Systems, Vol 7, No 4, pp 656-679 October 1985 BRUY83a * Bruynooghe M. & Pereira L.M. Deduction revision by Intelligent Backtracking Universidade Nova de Lisboa, report no UNL-10/83 July 1983 BRYA85a * Bryant R.E. Symbolic Verification of MOS Circuits 1985 Chapel Hill Conference on VLSI pp 419-438 1985 BUND85a * Bunder M.W. An Exension of Klop's Counterexample to the Church-Rosser Property to Lambda-Calculus With Other Ordered Pair Combinators Theoretical Computer Science 39, pp 337-342 North Holland August 1983 BUNE82a Buneman P. Frankel R.E. & Nikhil R. An Implementation Technique for Database Query Languages ACM TODS Vol 7 No. 2 p164-186 June 1982 BURG75a Recursive Programming Techniques Addison Wesley Publising Co., 1975 BURN85a * Burn G.L. & Hankin C.L. & Abramsky S. The Theory and Practise of Strictness Analysis for Higher Order Functions Research Report DoC 85/6 Dept of Computing, Imperial College April 1985 BURS69a Burstall R.M. Proving Properties of Programs by Structural Induction Computer Journal 12, p41 1969 BURS77a Burstall R.M. & Darlington J. A Transformation System for Developing Recursive Programs JACM Vol 24,No. 1,p44-67 BURS77b Burstall R.M. Design Considerations for a Functional Programming Language pp 54-57 Proc. Infotech State of the Art Conference, Copenhagen, 1977 BURS80a * Burstall R.M. & MacQueen D.B. & Sannella D.T. HOPE: An Experimental Applicative Language Proc of LISP Conference Aug 1980 (Also Edinburgh report CSR-62-80, 1981) BURS82a Burstall R.M. & Goguen J.A. Algebras, Theories and Freeness: An Introduction For Computer Scientists in BROY82a, pp 329-348 1982 BURS84a * Burstall R.M. Programming with Modules as Typed Functional Programming Proc. Int. Conf. on Fifth Gen. Computing Systems, Tokyo, Nov 84 BURT84a Burton F.W. Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs ACM TOPLAS Vol 6 No. 2 April 1984 p159-174 1984 BURT85a * Burton F.W. & Huntbach M.M. & Kollias J.G. Multiple Generation Text Files Using Overlapping Tree Structures Computer Journal, Vol 28, no 4, pp 414-416 1985 BUSH79a Bush V.J. A Data Flow Implementation of Lucid Msc Dissertation, Dept of Comp Sci, Univ. of Manchester, October 1979 BYTE85a * Byte Magazine, August 1985. Special Issue on Declarative Languages 1985 CAMP84a * ed. Campbell J.A. Implementations of Prolog Ellis Horwood Series Artificial Intelligence Ellis Horwood 1984 CARD?? * Cardelli L. A Semantics of Multiple Inheritance CARD84a * Cardelli L. Compiling a Functional Language Proceedings of 1984 ACM Symposium on Lisp and Functional Programming, Austin, Texas pp 208-217 August 1984 CARD85a * Cardelli L. Amber Proceedings of the Treizieme Ecole de Printemps d'Informatique Theorique, Le Val D'Ajol, Vosges, France May 1985 CARD?? Cardelli L. The Amber Machine CART79a * Cartwright R. & McCarthy J. First Order Programming Logic Proceedings ACM 6th Symposium on Principles of Programming Languages pp 68-80 1979 CART83a * Cartwright R. & Donahue J. The Semantics of Lazy (and Industrious) Evaluation CSL-83-9 , Xerox PARC 1983 CAT81a Catto A.J. Nondeterministic Programming in a Dataflow Environment PhD thesis, Dept of Comp Sci, Univ. of Manchester, June 1981 CHAM84a * eds. Chambers F.B. & Duce D.A. & Jones G.P. Distributed Computing Apic Studies in Data Processing no 20 Academic Press, 1984 CHAN84a Chang J.H. & DeGroot D. AND-Parallelism of Logic Programs Based on Static Data Dependency Analysis Dept. of Electrical Eng. & Computer Sci, Univ. of California,Berkely,Sept 1984 CHEE85a * Cheese A.B. The Applicability of SKI(BC) Combinators in a Parallel Rewrite Rule Environment Msc Thesis Department of Computer Science, University of Manchester October 1985 CHES80a * Chester D. HCPRVR: An Interpreter for Logic Programs Proc 1st Annual National Conference on Artificial Intelligence pp 93-95 1980 CHEW80a * Chew P. An Improved Algorithm for Computing with Equations IEEE 21st Annual Symposium on Foundations of Computer Science pp 108-117 1980 CHEW81a * Chew P. Unique Normal Forms in Term Rewriting Systems with Repeated Variables 13th Annual ACM Symposium on Theory of Computing (STOC) pp 7-18 1981 CHIK83a Chikayama T. ESP as Preliminary Kernel Language of Fifth Generation Computers ( Also in New Generation Computing, Vol 1, No 1, 1983 ) ICOT Research Center, Technical Report TR-005 1983 CHUR41a Church A. The Calculi of Lambda-Conversion Princeton University Press, Princeton, N.J., 1941 CLAC85a * Clack C. & Peyton-Jones S. Strictness Analysis - A Practical Approach in Proc. IFIP Conf. on Functional Programming Languages and Computer Architecture, Sept 16-19 '85, Nancy, France 1985 CLAR77a Clark K.L. & Sickel Predicate Logic: A Calculus For Deriving Programs Proc. 5th Int. Joint Conf. on Artif. Intell., Cambridge, Mass 1977 CLAR77b Clark K.L. & Tarnlund S. -A. A First Order Theory of Data and Programs Proc. IFIP 1977, pp 939-944 Amsterdam: North Holland CLAR78a Clark K.L. Negation As Failiure In "Logic and Databases", pp 293-322 New York: Plenum Press, 1978 CLAR79a Clark K.L. & McCabe F. The Control Facilities of IC-Prolog Internal Report, Dept of Computing, Imperial College 1979 CLAR79b Clark D.W. Measurements of Dynamic List Structure Use in LISP IEEE TOSE Vol SE-5 No 1, Jan 1979 CLAR80a Clark K.L. & Darlington J. Algorithm Classification Through Synthesis Computer Journal, 61-65, 1980 CLAR80b * Clarke J.W. & Gladstone P.J.S. & Maclean C.D. & Norman A.C. SKIM - S,K,I Reduction Machine Proceedings LISP Conference, Stanford, 1980 CLAR80c * Clark J.H. Structuring A VLSI System Architecture Lambda, second quarter, 1980 , pp25-30 1980 CLAR80d * Clark K.L. & McCabe F.G. IC-PROLOG: Aspects of its Implementation Proceedings of Logic Programming Workshop, Debrecen 1980 CLAR81a Clark D.W. & Lampson B.W. & McDaniel G.A. & Ornstein S.M. The Memory System of a High-Performance Personal Computer CSL-81-1 , Xerox PARC, Jan 1981 CLAR82a * Clark K.L. & Tarnlund S. -A. Logic Programming London: Academic Press, 1982 CLAR82b * Clark T.S. S-K Reduction Engine For An Applicative Language Dept of Comp Sci, University of Illinois at Urbana-Champaign Report no UIUCDCS-R-82-1119, UILU-ENG 82 1741 December 1982 CLAR83a * Clark K. & Gregory S. PARLOG: A Parallel Logic Programming Language (Draft) Research Report DOC 83/5, Dept. of Computing, Imperial College CLAR84a * Clark K. & Gregory S. PARLOG: Parallel Programming in Logic Research Report DOC 84/4, Dept. of Computing, Imperial College CLAR84b Clark K.L. & McCabe F.G. Micro-Prolog: Programming in Logic Prentice Hall International Series in Computer Science January 1984 CLAR85a Clarke E.M. Jr. The Characterization Problem For Hoare Logics in HOA85a 1985 CLAY84a Clayton B.D. ART Programming Primer Inference Corporation, 1984 CLOC81a * Clocksin W.F. & Mellish C.S. Programming in PROLOG Springer Verlag 1981 (2nd Edition 1984) CLOC83a * Clocksin W.F. Hortus Logico-Calculus Notes for Tutorial Session on Declarative Languages and Architectures 1983 CLOC83b * Clocksin W.F. The ZIP Virtual Machine Computer Laboratory, University of Cambridge CLOC84a Clocksin W.F. Memory Representation Issues for Prolog Implementation Computer Laboratory, University of Cambridge CLOC84b * Clocksin W.F. Notes on FlexiFlow Computer Laboratory, University of Cambridge Jan. 1984 CLOC84c * Clocksin W.F. On a Declarative Constraint Language Computer Laboratory, University of Cambridge Jan. 1984 CLOC84d * Clocksin W.F. What is Prolog-X? Computer Laboratory, University of Cambridge CLOC85a * Clocksin W.F. Implementation Techniques for Prolog Databases. Software - Practise and Experience Vol 15(7), pp 669-675 July 1985 CLOC85b * Clocksin W.F. Logic Programming and the Specification of Circuits Computer Laboratory, University of Cambridge Technical Report no 72 1985 COEL83a * Coelho H. Prolog: A Programming Tool For Logical Domain Modelling in Processes and Tools for Decision Suport (ed Sol H.G.), pp 37-45 North Holland 1983 COHE81a Cohen J. Garbage Collection of Linked Data Structures ACM Computing Surveys Vol 13 No.3 Sept 1981, pp 341-367 COLL60a Collins G.E. A Method For Overlapping and Erasure of Lists CACM 3, no 12, pp 655-657 1960 COLM73a Colmerauer A. & Kanoui H. & Pasero R. & Roussel P. Un Systeme de Communication Homme-machine en Francais Group Intelligence Artificielle Universite d,Aix Marseille, Luminy, 1973 CONE83a Conery J.S. The AND/OR Process Model for Parallel Execution of Logic Programs Phd Dissertation, Univ of California, Irvine, Tech rep 204, Information and computer science 1983 COOM84a * ed. Coombs M.J. Developments in Expert Systems Academic Press 1984 CORN79a * Cornish M. et al The TI Data Flow Architectures: The Power of Concurrency For Avionics Proc. 3rd Digital Avionics Systems Conf., pp 19-25 November 1979 CORY84a Cory H.T. & Hammond P. & Kowalski R.A. & Kriwaczek F. & Sadri F. & Sergot M. The British Nationality Act As A Logic Program Dept of Computing, Imperial College, London 1984 COST84a * Costa G. A Metric Characterization of Fair Computations in CCS Department of Computer Science, University of Edinburgh Internal Report CSR-169-84 October 1984 COST85a * Costa G. & Stirling C. Weak and Strong Fairness in CCS Department of Computer Science, University of Edinburgh Internal Report CSR-167-85 January 1985 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Sun Apr 27 07:44:01 1986 Date: Sun, 27 Apr 86 07:43:51 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #102 Status: RO AIList Digest Saturday, 26 Apr 1986 Volume 4 : Issue 102 Today's Topics: Bibliography - References #2 ---------------------------------------------------------------------- Date: 9 Apr 86 13:20:13 GMT From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs! abc@ucbvax.berkeley.edu (Andy Cheese) Subject: Bibliography - References #2 COX83a Cox Brad J. Object Oriented Programming in C Unix review, October/Novemeber 1983 Page 67 COX84a Cox Brad J. Object Oriented Programming in C Unix Review, February/March 1984 Page 56 COUR82a Courcelle B. Fundamental Properties of Infinite Trees in BROY82a, pp 417-470 1982 COUR84a ed. Courcelle B. Ninth Colloquium on Trees in Algebra and Programming CUP 1984 COUS85a Cousineau G. & Curien P. -L. & Mauny M. The Categorical Abstract Machine CNRS-Universite Paris VII LITP 85-8 January 1985 CRAM * Crammond J.A. & Miller C.D.F. An Architecture For Parallel Logic Languages 2nd International Logic Programming Conference pp 183-194 CRAM85a * Crammond J.A. A Comparative Study of Unification Algorithms for OR_Parallel Execution of Logic Languages IEEE Transactions on Computers, Vol c-34, no 10, pp 911-917 October 1985 CURI85a Curien P. -L. Typed Categorical Combinatory Logic CNRS-Universite Paris VII LITP 85-15 February 1985 CURI85b Currien P. -L. Categorical Combinators, Sequentials Algorithms and Functional Programming CNRS-Universite Paris VII LITP 85-26 March 1985 CURR58a Curry H.B. & Feys R. Combinatory Logic, Vol 1 North Holland Publishing Company, Amsterdam, 1958 CURR72a Curry H.B & Hindley J.R. & Seldin J.P. Combinatory Logic, Vol II North Holland Publishing Company, Amsterdam, 1972 DA83a Da Silva J.G.D. & Watson I. A Pseudo Associative Store with Hardware hashing Proc. IEE, Part E, 1983 DAM82a Damas L. & Milner R. Principal Type Schemes For Functional Programs Proc. ACM Symposium on Principles of Programming Languages, pp 207-212, 1982 DARL75a Darlington J. Application of Program Transformation to Program Synthesis Proc of International Symposium on Proving and Improving Programs, Arc et Senans, France 1975 DARL76a Darlington J. & Burstall R.M. A System that Automatically Improves Programs Acta Informatica, Vol 6,p41-60 DARL77a Darlington J. Program Transformation and Synthesis Present Capabilities Report 77/43 Dept of Computing, Imperial College (Also in Artificial Intelligence Journal Vol 16, 1981) 1977 DARL79a Darlington J. A Synthesis of Several Sorting Algorithms Acta Informatica, Vol 11, no 1 1979 DARL80a Darlington J. An Abstract Scheme For a Multiprocessor Implementation of Applicative Languages Proc. of Joint SRC/Newcastle Univ. Workshop on VLSI, Machine Architecture and Very High Level Languages 1980 DARL80b Darlington J. Synthesis of Implementations For Abstract Data Types Report 80/4 Dept of Computing, Imperial College 1980 DARL80c Darlington J. The Design of Efficient Data Representations Dept of Computing, Imperial College 1980 DARL81a Darlington J. The Structured Description of Algorithm Derivations To Appear in Amsterdam Conf. on Algorithms October 1981 DARL81b * Darlington J. & Reeve M. ALICE- A Multi-Processor Reduction Machine for the Parallel Evaluation of Applicative Languages Proc of 1981 ACM Conf on Functional Programming Languages & Computer Architecture DARL82a Darlington J. & Henderson P. & Turner D.A. Functional Programming and its Applications- An Advanced Course Cambridge University Press 1982 DARL82b Darlington J. Program Transformation in DARL82a 1982 DARL83a * Darlington J. The New Programming:Functional & Logic Languages Distributed Computing- A Review for Industry, SERC, Manchester 1983 DARL83b * Darlington J. & Reeve M. ALICE- and the Parallel Evaluation of Logic Programs Invited Paper, 10th Annual Int. Symposium on Computer Architecture,1983 DARL83c * Darlington J. Unification of Logic and Functional Languages Dept. of Computing, Imperial College, Date Unknown DARL85a * Darlington J. & Field A.J. & Pull H. The Unification of Functional and Logic Languages Department of Computing, Imperial College Doc 85/3 February 1985 DAVI78a Davis A.L. The Architecture and System Method of DDM1: A Recursively Structured Data Driven Machine Proc. 5th Int. Symp on Comp. Arch., pp 210-215 April 1978 DEGR84a DeGroot D. Restricted And-Parallelism Proc. Int. Conf. 5th Generation Computer Systems, 1984, pp 471-478 1984 DEGR85a * DeGroot D. Alternate Graph Expressions for Restricted And-Parallelism IEEE Spring Compcon 1985, pp 206-210 1985 DEGR85b * DeGroot D. & Chang J-H Une Comparison de Deux Modeles d'Execution de Parallelisme "et" a Comparison of Two And-Parallel Execution Models Hardware and Software Components and Architectures for the 5th Generation, March 5-7 1985, pp 271-280 1985 DELI79a Deliyanni A. & Kowalski R.A. Logic and Semantic Networks CACM Vol 22,No 3,p184-192 DEN75a Dennis J.B. & Misunas D.P. A Preliminary Architecture for a Basic Dataflow Processor Proc. 2nd Annual Symposium on Computer Architecture SIGARCH vol 3, no 4 , Jan 75, pp 126-132 1975 DEN79a Dennis J.B. The Varieties of Data Flow Computers MIT Computation Structures Group, Memo 183, August 1979 DELV85a * Delves L.M. & Mawdsley S.C. DAP-Algol: A Development System for Parallel Algorithms Computer Journal, Vol 28, no 2, pp 148-153 1985 DERT84a Derthick M. Variations on the Boltzmann Machine Learning Algorithm CMU-CS-84-120 Dept of Comp Sci, Carnegie-Mellon Univ August 1984 DETT86a * Dettmer R. Flagship A Fifth Generation Machine Electronics and Power, pp 203-208 March 1986 DEU76a Duetsch & Peter L. & Bobrow & Daniel G. An Efficient, Incremental, Automatic Garbage Collector CACM Vol 19,no 9, pp 522-526, 1976 DIJK82a Dijkstra E.W. Lambek and Moser Revisited in BROY82a, pp 19-22 1982 DIJK82b Dijkstra E.W. Repaying our Debts in BROY82a, pp 135-141 1982 DIJK82c Dijkstra E.W. A Tutorial on the Split Binary Semaphore in BROY82a, pp 555-564 1982 DIJK85a Dijkstra E.W. Invariance and Non-Determinacy in HOA85a 1985 DONA85a * Donahue J. & Demers A. Data Types Are Values ACM Transactions on Programming Languages and Systems, vol 7, no 3 pp 426-445 July 1985 DOWN76a Downey P.J. & Sethi R. Correct Computation Rules For Recursive Languages SIAM Journal of Computing 5(3), pp 378-401, September 1976 DUCE84a * ed. Duce D.A. Distributed Computing Systems Programme IEE Digital Electronics and Computing Series no 5 Peter Peregrinus Ltd., 1984 DUCK85a * Duckworth R.J. & Brailsford D.F. & Harrison L. A Structured Data Flow Computer Internal Report, Comp Sci Group, Univ of Nottingham October 14, 1985 EGA79a Egan G.K. Data Flow: Its Applications to Decentralised Control PhD Thesis, Dept of Comp Sci, Univ. of Manchester, 1979 ELIT84a eds. Elithorn A. & Banerji R. Artificial and Human Intelligence: Symposium North Holland 1984 ENNA82a Ennals J.R. Beginning Micro-Prolog Ellis Horwood Series Artificial Intelligence Ellis Horwood Ltd., 1982 ENOM84a Enomoto H. & Yonezaki N. & Saeki M. & Chiba K. & Takizuka T. & Yokoi T. Natural Language Based System Development System TELL ICOT Research Center, Technical Report TR-067 June 1986 ENOM84b Enomoto H. & Yonezaki N. & Saeki M. Formal Specification and Verification for Concurrent Systems by TELL ICOT Research Center, Technical Report TR-068 June 1986 FAGE83a Fages F. & Huet G.P. Complete Sets Of Unifiers And Matches In Equational Theories Proc. 8th Colloquium on Trees In Algebra And Programming Springer Verlag, LNCS 159, pp 205-220, 1983 FAHL83a Fahlman S.E. & Hinton G.E. & Sejnowski T.J. Massively Parallel Architectures for AI: NETL,THISTLE,and Boltzmann Machines Proc. National Conf. on Artificial Intelligence, Aug 1983 p109-113 FAIR82a Fairburn J. Ponder, And Its Type System Cambridge Computer Lab Technical Report 31, 1982 FAIR85a * Fairbairn J. Design and Implementation of a Simple Typed Language Based on the Lambda Calculus Computer Laboratory, University of Cambridge, Tech Rep no 75 (also submitted as PhD thesis in December 1984) 1985 FARR79a Farrell E.P. et al A Concurrent Computer Architecture and Ring Based Implementation Proc 6th Int. Symp. on Comp. Arch., pp 1-11 April 1979 FAUS83a Faustini A.A. Mathews S.G. & Yaghi A.G The pLUCID Programming Manual University of Warwick Distributed Computing Report No. 4 ,1983 FEHR84a * Fehr E. Expressive power of Typed and Type-Free Programming Languages Theoretical Computer Science 33 (1984) pp 195-238 North Holland 1984 FEHR84b * Fehr E. Dokumentation eines PROLOG-Interpreters implementiert in der funktionalen Sprache BRL GMD Nr 122 November 1984 FILG82a * Filgueiras M. On The Implementation of Control in Logic Programming Languages Universidade Nova de Lisboa, Tech rep UNL 8/82 1982 FINN85a * Finn S. The Simplex Programming Language Department of Computing Science, University of Stirling 27th March 1985 FOLE? Foley J. A Multi-Ring Dataflow Machine PhD Thesis, Dept of Computer Science, Univ. of Manchester In Preparation FOO86a * Foo N.Y. Dewey Indexing of Prolog Traces Computer Journal, Vol 29, no 1, pp 17-19 1986 FREI74a Freidman D.P. The Little LISPer Science Research Associates, Palo Alto 1974 FREI76a * Freidman D.P. & Wise D.S. CONS Should Not Evaluate Its Arguments Proceedings 3rd International Colloquium on Automata Languages and Programming pp 257-284 Edinburgh University Press, 1976 FREI77a Freidman D.P. & Wise D.P. Applicative Multiprogramming Tech rep no 72, Indiana univ., Bloomington 1977 FREI77b Freidman D.P. & Wise D.S. Aspects of Applicative Programming for File Systems SIGPLAN notices Vol 12 no 3 march 77 pp 41-55 1977 FREI78a Friedman D.P. Wise D.S. A Note on Conditional Expressions CACM 21(11), pp 931-933, November 1978 FREI78b * Freidman D.P. & Wise D.S. Functional Combination Computer Languages, 3, pp 31-35 1978 FREI78c Freidman D.P. & Wise D.S. Unbounded Computational Structures Software, Practise and Experience, 8, pp 407-415 1978 FREI79a * Freidman D.P. & Wise D.S. Reference Counting Can Manage The Circular Environments of Mutual Recursion Information Processing Letters, 8, no 2, pp 921-930 1979 FREI80a Freidman D.P. & Wise D.S. An Indeterminate Constructor for Applicative programming Conf. Record of ACM Symp. on Princ. of Prog. Langs., Las Vegas 1980 FROS85a * Frost R.A. Using Semantic Concepts to Characterise Various Knowledge Representation Formalisms: A Method of Facilitating the Interface of Knowledge Base System Components Computer Journal, Vol 28, no 2, pp 112-116 1985 FUJI83a Fujita M. & Tanaka H. Moto-oka T. Verification with PROLOG and Temporal Logic Faculty of Eng. Univ. of Tokyo FURU83a * Furukawa K. & Takeuchi A. & Kunifuji S. Mandala: A Concurrent Prolog Based Knowledge Programming Language System ICOT Research center, Technical Report TR-029 November 1983 FURU83b * Furukawa K. & Nakajima R. & Yonezawa A. Modularization and Abstraction in PROLOG Document ETL ICOT Research Center, Technical Report TR-022 ( Also in New Generation Computing, Vol 1, No 2, 1983 ) August 1983 FURU83c Furukawa K. Mandala: A Knowledge Programming Language on Concurrent Prolog ICOT Research Center, Technical Memorandum TM-0028 October 1983 FURU84a * Furukawa K. & Kunifuji S. & Takeuchi A. & Ueda K. The Conceptual Specification of the Kernel Language Version 1 ( Also in Workshop on Implementation of Concurrent Prolog, Rehovot, 1984 ) ICOT Research Center, Technical Report TR-054 March 1984 FURU84a * Furukawa K. & Takeuchi A. & Kunifuji S. & Yasukawa H. & Ohki M. & Ueda K. Mandala: A Logic Based Knowledge Programming System ( Also in Second Japanese Swedish Workshop on Logic Programming and Functional Programming, Uppsala, 1984 ) ICOT Research Center, Technical Report TR-076 August 1984 FUTA85a Futatsugi K. & Goguen J.A. & Jouannaud J-P & Meseguer J. Principles of OBJ2 In Proc. 1985 Principles of Programming Languages 1985 GIER80a Gierz G. & Hofmann K.H. & Keimel K. & Lawson J.D. & Mislove M. & Scott D.S. A Compendium of Continuous Lattices Springer Verlag 1980 GLAS84a * Glaser H. & Hankin C. & Till D. Principles of Functional Programming Prentice Hall International, 1984 GLAU78a Glauert J.R.W. A Single-Assignment Language for Data Flow Computing MSc Dissertation, Dept of Comp Sci, Univ. of Manchester, January 1978 GLAU85a * Glauert J.R.W. & Holt N.P. & Kennaway J.R. & Sleep M.R. An Active Term Rewrite Model for Parallel Computation Document, Alvey DACTL group, March 1985 GLAU85b * Glauert J.R.W. & Holt N.P. & Kennaway J.R. & Sleep M.R. DACTL Report 3/5 Document, Alvey DACTL group, March 1985 GLAU85c * Glauert J.R.W. & Holt N.P. & Kennaway J.R. & Reeve M.J. & Sleep M.R. & Watson I. DACTL0: A Computational Model and an Associated Compiler Target Language University of East Anglia May 1985 GOEB85a Goebel R. The Design and Implementation of DLOG, a Prolog-Based Knowledge Representation System New Generation Computing, Vol 3, No 4, pp 385-401 1985 GOGU67a Goguen J.A. L-Fuzzy Sets Journal of Mathematical Analysis and Applications Vol 18 no 1, pp 145-174 1967 GOGU68a Goguen J.A. Categories of Fuzzy Sets Phd Dissertation Dept. of mathematics, Univ. of california, berkeley 1968 GOGU68b Goguen J.A. The Logic of Inexact Concepts Synthese, Vol 19, pp 325-373 1968-69 GOGU69a Goguen J.A. Categories of V-Sets Bulletin of the American Mathematical Society, Vol 75, no 3, pp 622-624 1969 GOGU71a Mathematical Representation of Hierarchically organised Systems in "Global Systems Dynamics" (ed. Attinger E. & Karger S.) Basel, Switzerland pp 112-128 1971 GOGU72a Goguen J.A. Systems and Minimal Realisation Proc. IEEE Conf. on Decision and Control, Miami Beach, Florida pp 42-46 1972 GOGU72b Goguen J.A. Minimal Realisation of Machines in Closed Categories Bulletin of the American Mathematical Society Vol 78, no 5, pp 777-783 1972 GOGU72c Goguen J.A. Hierarchical Inexact Data structures in Artificial Intelligence Problems Proc. 5th Hawaii Int. Conf. on System Sciences Honolulu, Hawaii, pp 345-347 1972 GOGU72d Goguen J.A. & Yacobellis R.H. The Myhill Functor, Input-Reduced Machines, and Generalised Krohn-Rhodes Theory Proc. 5th Princeton Conf. on Information Sciences and Systems Princeton, New Jersey pp 574-578 1972 GOGU72e Goguen J.A. On Homomorphisms, Simulation, Correctness and Subroutines for programs and Program schemes Proc. 13th IEEE Symp. on Switching and Automata Theory College Park, Maryland pp 52-60 1972 GOGU73a Goguen J.A. Realisation is Universal mathematical System Theory Vol 6, no 4, pp 359-374 1973 GOGU73b Goguen J.A. System theory concepts in Computer Science Proc. 6th Hawaii Int. Conf. on Systems Sciences Honolulu, Hawaii, pp 77-80 1973 GOGU73c Goguen J.A. The Fuzzy Tychonoff Theorem Journal of mathematical Analysis and applications vol 43, pp 734-742 1973 GOGU73d Goguen J.A. Categorical Foundations for general Systems Theory in "Advances in Cybernetics and Systems research" (ed. Pichler F. & Trappl R.) Transcripta Books, London pp 121-130 1973 GOGU74a Goguen J.A. Semantics of Computation Proc. 1st Int. Symp. on Category Theory Applied to Computation and Control (1974 American Association for the Advancement of Science, San francisco) Univ. of massachusetts at Amherst, 1974, pp 234-249 also published in LNCS vol 25, pp 151-163, springer-verlag 1975 GOGU74b Goguen J.A. & Thatcher J.W. Initial Algebra Semantics proc. 15th IEEE Symp. on Switching and Automata pp 63-77 1974 GOGU74c Goguen J.A. Concept Representation in Natural and Artificial languages: Axioms, extensions and Applications for Fuzzy sets" Int. Journal of man-Machine Studies vol 6, pp 513-561 1974 reprinted in "Fuzzy Reasoning and its Applications" (ed. Mamdani E.H. & Gaines B.R.) pp 67-115 Academic Press 1981 GOGU74d Goguen J.A. On Homomorphisms, Correctness, termination, Unfoldments and Equivalence of Flow Diagram Programs" Journal of Computer and System Sciences, vol 8, no 3, pp 333-365 1974 GOGU74e Goguen J.A. Some Comments on Applying Mathematical System Theory in "Systems Approaches and Environmental Problems" (ed. Gottinger H.W. & Vandenhoeck & Rupert) pp 47-67 (Gottingen, Germany) 1974 GOGU75a Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B. Factorisation, Congruences, and the Decomposition of Automata and Systems in "Mathematical Foundations of Computer Science" LNCS Vol 28, pp 33-45, Springer-Verlag 1975 GOGU75b Goguen J.A. Objects International Journal of general systems, vol 1, no 4, pp 237-243 1975 GOGU75c Goguen J.A. Discrete-Time Machines in Closed Monoidal Categories, I, Journal of Computer and System sciences, Vol 10, No 1, February, pp 1-43 1975 GOGU75c Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B. Abstract Data types as Initial algebras and the Correctness of Data Representations Proc. Conf. on Computer Graphics, Pattern recognition, and Data Structure (Beverly Hills, California), pp 89-93 1975 GOGU75d Goguen J.A. & Carlson L. Axioms for Discrimination Information IEEE Transactions on Information Theory, Sept '75 pp 572-574 1975 GOGU75e Goguen J.A. On Fuzzy Robot Planning in "Fuzzy Sets and Their Applications to Cognitive and Decision Processes (ed. Zadeh L.A. & Fu K.S. & Tanaka K. & Shimura M.) pp 429-448 Academic Press 1975 GOGU75f Goguen J.A. Robust Programming Languages and the Principle of Maximum Meaningfulness Proc. Milwaukee Symp. on Automatic Computation and Control (Milwaukee, Wisconsin) pp 87-90 1975 GOGU75g Goguen J.A. Complexity of Hierarchically Organised Systems and the Structure of Musical Experiences Int. Journal of General Systems, vol 3, no 4, 1975, pp 237-251 originally in UCLA Comp. Sci. Dept. Quarterly, October 1975, pp 51-88 1975 GOGU76a Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B. Some Fundamentals of Order-Algebraic Semantics Proc. 5th Int. Symp. on Mathematical Foundations of Computer Sciences (Gdansk, Poland, 1976) LNCS vol 46, 1976, pp153-168, Springer-Verlag 1976 GOGU76b Goguen J.A. & Thatcher J.W. & Wagner E.W. & Wright J.B. Parallel Realisation of Systems, Using Factorisations and Quotients in Categories Journal of Franklin Institute, vol 301, no6, June '76, pp 547-558 1976 GOGU76c Goguen J.A. Correctness and Equivalence of Data Types Proc Symp. on Mathematical Systems Theory (Udine, Italy) Springer Verlag Lecture Notes (ed. Marchesini G.) pp 352-358 1976 GOGU76d Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B. Rational Algebraic Theories and Fixed-point Solutions Proc. IEEE 17th Symp on Foundations of Computer Science (Houston, Texas), 1976, pp 147-158 1976 GOGU77a Goguen J.A. & Thatcher J.W. & Wagner E.G. & Wright J.B. Initial Algebra Semantics and Continuous Algebras JACM, vol 24, no 1, January 1977, pp 68-95 1977 GOGU77b Goguen J.A. Abstract Errors for Abstract Data Types in "Formal Descriptions of Programming Concepts" (ed. E.Neuhold) North-Holland, 1978, pp 491-522 also in Proc. IFIP Working Conf. on Formal Description of Programming Concepts (ed. Dennis J.) MIT Press, 1977, pp 21.1-21.32 1977 GOGU77c * Goguen J.A. & Burstall R.M. Putting Theories Together to Make Specifications Proc. 5th Int. Joint Conf. on Artificial Intelligence (MIT, Cambridge, Massachusetts), 1977, pp 1045-1058 1977 GOGU77d Goguen J.A. & Meseguer J. Correctness of Recursive Flow Diagram Programs Proc. Conf. on Mathematical Foundations of Comp. Sci. (Tatranska Lomnica, Czechoslovakia) pp 580-595 1977 GOGU77e Goguen J.A. Algebraic Specification Techniques UCLA Comp. Sci. Dept. Quarterly Vol 5, no 4 pp 53-58 1977 GOGU78a Goguen J.A. & Varela F. The Arithmetic of Closure Journal of Cybernetics, Vol 8, 1978 also in "Progress in Cybernetics and Systems research, vol 3" (ed. Trappl R. & Klir G.J. & Ricciardi L.) Hemisphere Pub Co. (Washington D.C.) 1978 GOGU78b Goguen J.A. & Ginali S. A Categorical Approach to General Systems in "Applied General Systems research" (ed. Klir G.) Plenum Press pp 257-270 1978 GOGU78c Goguen J.A. & Thatcher J.W. & Wagner E.G. An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract data Types in "Current Trends in Programming, vol 4, Data Structuring" pp 80-149 (ed. Yeh R.) Prentice Hall 1978 GOGU78d Goguen J.A. Some Design Principles and Theory for OBJ-0, a Language for Expressing and Executing Algebraic Specifications of Programs Proc. Int. Conf. on Mathematical Studies of Information Processing (Kyoto, Japan) pp 429-475 1978 GOGU78e Goguen J.A. & Linde C. Structure of Planning Discourse Journal of Social and Biological Structures, Vol 1 pp 219-251 1978 GOGU79a Goguen J.A. & Shaket E. Fuzzy Sets at UCLA Kybernetes, vol 8 pp 65-66 1979 GOGU79b Goguen J.A. & Varela F. Systems and Distinctions; Duality and Complementarity International Journal of General Systems, vol 5 pp 31-43 1979 GOGU79c Goguen J.A. & Tardo J.J. An Introduction to OBJ: A Language for writing and Testing formal algebraic specifications Reliable Software Conf. Proc. (ed. Yeh R.) (Cambridge, Massachusetts) pp 170-189 Prentice Hall 1979 GOGU79d Goguen J.A. Algebraic Specification in "Research Directions in Software Technology" (ed. Wegner P.) pp 370-376 MIT Press 1979 GOGU79e Goguen J.A. Some Ideas in Algebraic Semantics Proc. 3rd IBM Symp on Mathematical Foundations of Computer Science (Kobe, Japan) 53 pages 1979 GOGU79f Goguen J.A. Fuzzy Sets and the Social Nature of Truth in "Advances in Fuzzy Set Theory and Applications" (eds. Gupta M.M. & Yager R.) pp 49-68 North-Holland Press 1979 GOGU79g Goguen J.A. & Tardo J. & Williamson N. & Zamfir M. A Practical Method for Testing Algebraic Specifications UCLA Computer Science Quarterly, Vol 7, no 1 pp 59-80 1979 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Sun Apr 27 07:44:15 1986 Date: Sun, 27 Apr 86 07:44:04 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #103 Status: RO AIList Digest Saturday, 26 Apr 1986 Volume 4 : Issue 103 Today's Topics: Bibliography - References #3 ---------------------------------------------------------------------- Date: 9 Apr 86 13:20:13 GMT From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs! abc@ucbvax.berkeley.edu (Andy Cheese) Subject: Bibliography - References #3 GOGU80a Goguen J.A. Thoughts on Specification, Design and Verification Software Engineering Notes, Vol 5, no 3 pp 29-33 1980 GOGU80b How to Prove Algebraic Inductive Hypotheses Without Induction: with Applications to the Correctness of Data Type Implementation Proc. 5th Conf. on Automated Deduction, (Les Arcs, France) (eds. Bibel W. & Kowalski R.) LNCS, vol 87 pp 356-373 Springer Verlag 1980 GOGU80c Goguen J.A. & Burstall R.M. The Semantics of CLEAR, a Specification Language in "Abstract Software Specification" (eds Bjorner D.) (Proc. 1979 Copenhagen Winter School) LNCS, vol 86 pp294-332 1980 GOGU80d Goguen J.A. & Linde C. On the Independence of Discourse Structure and Semantic Domain Proc. 18th Annual Meeting of the Association for Computational Linguistics, Parasession on Topics in Interactive Discourse (Univ. of Pennsylvania, Philadelphia, Pennsylvania) pp 35-37 1980 GOGU81a Goguen J.A. & Parsaye-Ghomi K. Algebraic Denotational Semantics Using Parameterised Abstract Modules Proc. Int. Conf on Formalising Concepts (Peniscola, Spain) (ed. Diaz J. & Ramos I.) LNCS, vol 107 pp 292-309 Springer verlag 1981 GOGU81b Goguen J.A. & Burstall R.M. An Informal Introduction to CLEAR, a Specification Language in "The Correctness Problem in Computer Science" (eds. Boyer R. & Moore J.) pp 185-213 Academic Press 1981 GOGU81c Goguen J.A. & Meseguer J. Completeness of many-Sorted Equational Logic SIGPLAN Notes, Vol 16, no 7, pp 24-32, 1981 also in SIGPLAN Notes, vol 17, no 1, pp 9-17, 1982 extended version as Tech Rep CSLI-84-15, Center for the Study of Language and Information, Standford Univ., September 1984 GOGU82a Goguen J.A. ORDINARY Specification of KWIC Index Generation Proc Workshop on Program Specification (ed. Staunstrup J.) LNCS, Vol 134 pp 114-117 Springer Verlag 1982 GOGU82b Goguen J.A. ORDINARY Specification of Some Constructions in Plane Geometry Proc Workshop on Program Specification (ed. Staunstrup J.) LNCS, Vol 134 pp 31-46 Springer verlag 1982 GOGU82c Goguen J.A. & Burstall R.M. Algebras, Theories and Freeness: An Introduction for Computer Scientists in "Theoretical Foundations of Programming Methodology" (eds. Broy M. & Schmidt G.) pp 329-348 D. Reidel 1982 GOGU82d Goguen J.A. & Meseguer J. Security Policies and Security Models Proc 1982 Berkeley Conf on Computer Security IEEE Computer Society Press pp 11-20 1982 GOGU82e Goguen J.A. Universal Realisation, Persistent Interconnection and Implementation of Abstract Modules Proc 9th Int Colloquium on Automata, Languages and Programming (Aarhus, denmark) LNCS, Springer Verlag 1982 GOGU82f Goguen J.A. Rapid Prototyping in the OBJ Executable Specification Language Proc Rapid Prototyping Workshop (Columbia, Maryland) 1982 also in Software engineering Notes, ACM Special Interest Group on Software engineering, vol 7, no 5, pp 75-84, 1983 GOGU83a Goguen J.A. & Meseguer J. & Plaisted D. Programming with Parameterised Abstract Objects in OBJ in "Theory and practise of Software technology" (eds. Ferrari D. & Bolognani M. & Goguen J.A.) pp 163-193 North-Holland 1983 GOGU83b Future Directions for Software Engineering in "Theory and Practise of Software Technology" (eds. Ferrari D. & Bolognani M. & Goguen J.A.) pp 243-244 North-Holland 1983 GOGU83c Goguen J.A. & Ferrari D. & Bologanani M. Theory and Practise of Software Technology North Holland 1983 GOGU83d Goguen J.A. & Meseguer J. Correctness of recursive Parallel Non-Deterministic Flow Programs Journal of Computer and System Sciences, vol 27, no 2 pp 268-290 October 1983 GOGU83e Goguen J.A. Parameterised Programming IEEE TOSE, vol SE-10, no 5, september 1984, pp 528-543 preliminary version in Proc. Workshop on Reusability in Programming, ITT, pp 138-150 1983 GOGU83f Goguen J.A. & Linde & Weiner J. Reasoning and Natural explanation International Journal of man-Machine Studies, Vol 19 pp 521-559 1983 GOGU83g Goguen J.A. & Burstall R.M. Introducing Institutions Logics of programs (Carnegie-mellon Univ., Pittsburgh PA, June 1983) LNCS, vol 164, Springer Verlag pp 221-256, 1984 GOGU84a Goguen J.A. & Meseguer J. Unwinding and Inference Control 1984 Symp on Security and privacy, IEEE, pp 75-86 1984 GOGU84b Goguen J.A. & Meseguer J. Equality, types, Modules and generics for Logic Programming Tech Rep no. CSLI-84-5, Center for the Study of Logic and Information, Stanford University, March 1984 also in Proc. 2nd int. Logic Programming Conf., Upsala, Sweden, pp 115-125 1984 GOGU84c Goguen J.A. & Bustall R.M. Some Fundamental Properties of Algebraic Theories: A Tool for Semantics of Computation, Part 1: Comma Categories, Colimits and Theories Theoretical Computer Science, vol 31, no 2, pp 175-209 1984 GOGU84d Goguen J.A. & Burstall R.M. Some Fundamental properties of Algebraic Theories: A Tool for Semantics of computation, Part 2: Signed and Abstract theories Theoretical Computer Science, vol 31, no 3 pp 263-295 1984 GOGU84e Goguen J.A. & Meseguer J. Equality, Types, Modules and (Why Not ?) Generics for Logic programming Journal of Logic programming, vol 1, no 2 pp 179-210 1984 GOGU84f Goguen J.A. & Murphy M. & Randle R.J. & Tanner T.A. & Frankel R.M. & Linde C. A Full Mission Simulator study of Aircrew performance: The measurement of Crew Coordination and descisionmaking factors and their relationships to Flight task performance Proc. 20th Annual Conf on Manual control, vol II (eds. Hartzell E.J. & Hart S.) NASA Conference publication 2341, pp 249-262 1984 GOGU84g Goguen J.A. & Linde C. & Murphy M. Crew Communication as a factor in Aviation Accidents Proc 20th Annual Conf on Manual control, vol II (eds. Hartzell E.J. & Hart S.) NASA Conference Publication 2341, pp 217-248 1984 GOGU85a Goguen J.A. Meseguer J. EQLOG: Equality, Types and Generic Modules for Logic Programming In Functional and Logic Programming, Prentice Hall 1985 GOGU85b Goguen J.A. & Jouannaud J-P & Meseguer J. Operational Semantics for Order-Sorted Algebra In Proc. ICALP 1985 GOGU85c Goguen J.A. & Meseguer J. Initiality, Induction and Computability to appear in "Algebraic Methods in Semantics" (ed. Nivat M. & Reynolds J. ) Cambridge U.P. chapter 14, pp 459-540 approx. 1985 GOGU85d Goguen J.A. & Meseguer J. Completeness of Many-Sorted Equational Logic to appear in Houston Journal of Mathematics 1985 GOGU85e * Goguen J.A. & Futatsugi K. & Jouannaud J.-P. & Meseguer J. Principles of OBJ2 Proc 1985 Symp on Principles of programming languages, ACM pp 52-66 1985 GOLD81a Goldfarb W. The Undecidability Of The Second Order Unification Problem Theoretical Computer Science 13, pp 225-230, 1981 GOOD83a Goodall A. Language Of Intelligence (PROLOG) Systems International p21-24 Jan 1983 GOOD85a Good D.I. Mechanical Proofs about Computer Programs in HOA85a 1985 GORD79a * Gordon M.J. & Milner R. & Wadsworth C.P. Edinburgh LCF Lecture Notes In Computer Science, Vol 78 Berlin: Springer Verlag, 1979 GORD85a * Gordon M. HOL : A Machine Oriented Formulation of Higher order Logic Computer Laboratory, University of Cambridge Technical Report no 68 July 16 1985 GOST79a Gostelow K.P. & Thomas R.E. A View of Dataflow Proc. Nat. Comp. Conf., Vol 48, pp 629-636 1979 GOTO82a Goto A. & Moto-oka T. Basic Architecture of Highly Parallel Processing System for Inference Document Univ. of Tokyo, Dec 1982 GREE85a * Greene K.J. A Fully Lazy Higher Order Purely Functional Programming Language with Reduction Semantics CASE Center Technical Report No. 8503 CASE Center, Syracuse University, New York December 1985 GREG85a * Gregory S. Design, Application and Implementation of a Parallel Programming Language PhD Thesis, Dept of Computing, Imperial College, Univ of London September 1985 GRIE77a Gries D. An Exercise in Proving Parallel Programs Correct CACM, 20, no 12, pp 921-930 1977 GRIS71a Griswold R.E. & Poage J.F. & Polonsky J.P. The Snobol-4 Programming Language Prentice Hall 1971 GRIS84a * Griswold R.E. Expression Evaluation in the Icon Programming Language Proceedings of 1984 ACM Symposium on Lisp and Functional Programming Austin, Texas pp 177-183 1984 GUES76a * Guessarian I. Semantic Equivalence of Program Schemes and its Syntactic Characterization Proceedings 3rd International Colloquium on Automata Languages and Programming pp 189-200 Edinburgh University Press, 1976 GUNN84a * Gunn H.I.E. & Harland D.M. Polymorphic Programming II. An Orthogonal Tagged High Level Architecture Abstract Machine Software - Practise and Experience, Vol 14(11), pp 1021-1046 November 1984 GURD78a * Gurd J. & Watson I. & Glauert J. A Multi-Layered Data Flow Computer Architecture Internal Report, Dept of Comp Sci, Univ of Manchester 1978 GURD85a * Gurd J. & Kirkham C.C. & Watson I. The Manchester Prototype Dataflow Computer CACM, vol 28, p 34-52, 1985 GUTT75a Guttag J.V. The Specification and Application to programming of Abstract Data Types PhD dissertation, Univ. of Toronto, Dept of Comp Sci 1975 GUTT77a Guttag J.V. Abstract Data Types and the Development of Data Structures CACM Vol 20, no 6, pp 396-404, June 1977 GUTT78a Guttag J.V. & Horowitz E. & Musser D.R. Abstract Data Types and Software Validation CACM Vol 21, pp 1048-1064, december also USC Information Sciences Institute Tech. Rep. Aug 76 1978 GUTT78b Guttag J.V. & Horning J.J. The Algebraic Specification of Abstract Data Types Acta Informatica, 10, 1, pp 27-52 1978 GUTT80a Guttag J.V. Notes on Type Abstraction (version 2) IEEE Trans. on Soft. Eng. Vol SE-6, no 1, pp 13-23, January 1980 GUTT82a Guttag J. Notes On Using Types and Type Abstraction In Functional Programming in DARL82a 1982 GUZM81a * Guzman A. A heterarchical Multi-Microprocessor Lisp Machine 1981 IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management, Hot Springs, Virginia pp 309 - 317 November 11-13, 1981 HALI84a * Halim Z. A Data-/Demand-Driven Model for the Evaluation of PARLOG And-Relations and Conditional Equations Document, Dept of Computer Science, Univ. of Manchester Jan 1984 HAMI85a * Hamilton A.G. Program Construction in Martin-Lof Type Theory T.R. 24 Tech Rep, Dept of Comp Sci, Univ of Stirling June 1985 HAMM83a Hammond P. & Sergot M. A Prolog Shell for Logic-Based Expert Systens Proc. 3rd BCS Expert Systems Conf. pp 95-104, 1983 HAMM83b Hammond P. Representation of DHSS Regulations as a Logic Program B.C.S. Expert Systems Conference 1983 HAMM84a Hammond K. The KRC Manual CSA/16/1984, DSAG-3, Univ. of East Anglia, May 1984. HANK85a * Hankin C.L. & Osmon P.E. & Shute M.J. COBWEB - A Family of Fifth Generation Computer Architectures 25th January 1985 HANS79a Hansson A. & Tarnlund S. -A. A Natural Programming Calculus Proc. 6th IJCAI, Tokyo, Japan, pp 348-355, 1979 HARL84a * Harland D.M. Polymorphic Programming Languages Ellis Horwood 1984 HARR81a * Harrison P.G. Efficient Storage Management for Functional Languages Dept of Computing, Imperial College, Research Report no DOC 81/12 August 1981 HASE84a Hasegawa R. A List Processing Orientated Data Flow Machine Architecture Electrical Communication Lab, Nippon Telegraph and Telephone Public Corporation HATT83a Hattori T. & Yokoi T. Basic Constructs of the SIM Operating System ( Also in New Generation Computing, Vol 1, No 1, 1983 ) ICOT Research Center, Technical Memorandum TM-0009 June 1986 HATT84a * Hattori T. & Tsuji J. & Yokoi T. SIMPOS: An Operating System for a Personal Prolog Machine PSI ICOT Research Center, Technical Report TR-055 April 1984 HATT84b * Hattori T. & Yokoi T. The Concepts and Facilities of SIMPOS Supervisor ICOT Research Center, Technical Report TR-056 April 1984 HATT84c Hattori T. & Yokoi T. The Concepts and Facilities of SIMPOS File System ICOT Research Center, Technical Report TR-059 April 1984 HAYE84a Hayes P.J. Entity-Oriented Parsing CMU-CS-84-138 Dept of Comp Sci, Carnegie-Mellon Univ. 9 June 1984 HEND76a * Henderson P. & Morris J.M. A Lazy Evaluator Proceedings 3rd POPL Symposium, Atlanta Georgia, 1976, pp 95-103 HEND80a * Henderson P. Functional Programming: Application and Implementation Prentice Hall 1980 HEND82a Henderson P. Purely Functional Operating Systems in DARL82a 1982 HEND83a * Henderson P. & Jones G.A. & Jones S.B. The Lispkit Manual, vol 1 and vol 2 (sources) Oxford University Programming Research Group Technical Monograph PRG-32(i) and PRG-32(ii) 1983 HEND84a * Henderson P. Specifications and Programs FPN-5 Dept of Comp Sci, Univ. of Stirling Paper presented at Centre for Software Reliability Workshop, City University, April1984 to be published in "Software; Requirements, Specification and Testing" (ed Dr. T. Anderson) pub. Blackwell Scientific Publications July 1984 HEND84b Henderson P. Some Distributed Systems FPN-6 Dept of Comp Sci, Univ. of stirling July 1984 HEND84c * Henderson P. Process Combinators FPN-7 Dept of Comp Sci, Univ of Stirling August 1984 HEND84d * Henderson P. Communcating Functional Programs FPN-8 Dept of Comp Sci, Univ of Stirling September 1984 HEND84e * Henderson P. Me Too - A Language for Software Specification and Model Building - Preliminary Report FPN-9 First Draft : October 1984 Second Draft : December 1984 1984 HENN76a * Hennessy M. & Ashcroft E.A. The Semantics of Nondeterminism Proceedings 3rd International Colloquium on Automata Languages and Programming pp 478 - 493 Edinburgh University Press, 1976 HEWI73a Hewitt C. et al. Actor Induction and Meta-Evaluation 1st ACM Symposium on Principles of Programming Languages 1973 HEWI77a Hewitt C. Viewing Control Structures as Patterns of Passing Messages AI Journal 8, no 3, pp 323-364, 1977 HEWI79a Hewitt C. Control Structure as Patterns of Passing Messages Artificial Intelligence: An MIT Perspective ,The MIT Press p433-465 1979 HEWI80a * Hewitt C. The Apiary Network Architecture for Knowledgeable Systems Proc. 1980 LISP Conf. p107-117 HIKI83a Hikita T. Average Size of Turner's Translation to Combinator Program ICOT research Center, Technical Report TR-017 August 1983 HINDI84a Hindin Harvey J. Fifth-Generation Computing: Dedicated Software is The Key Computer Design, Sept 1984, page 150 HINDL69a Hindley R. The Principal Type Scheme of an Object in Combinatory Logic Trans. American Mathematical Society 146, pp 29-60 1969 HINDL83a * Hindley R. The Completeness Theorem For Typing Lambda-Terms Theoretical Computer Science 22, pp 1-17 North Holland January 1983 HIRA83a Chart Parsing in Concurrent Prolog ICOT research Center, Technical Report TR-007 May 1983 HOAR82a Structure of an Operating System in BROY82a, pp 643-658 1982 HOAR85a eds. Hoare C.A.R. & Sheperdson J.C. Mathematical Logic and Programming Languages Prentice Hall International Series in Computer Science, 1985. First published in the Philosophical Transactions of the Royal Society, Series A, Volume 3/12, 1984. HOAR85b Hoare C.A.R. Programs are Predicates in HOA85a 1985 HOCK81a * Hockney R.W. & Jesshope C.R. Parallel Computers Adam Hilger Ltd., Bristol 1981 HOFF82a * Hoffmann C.M. & O'Donnell M.J. Programming With Equations ACM Transactions on Programming Languages and Systems, Vol 4, No 1 pp 83-112 January 1982 HOFF83a Hoffmann C.M. & O'Donnell M. Implementation of an interpreter for abstract equations ACM Conference on Computer Science 1983 HOGG78a Hogger C.J. Program Synthesis in Predicate Logic Proc. AISB/GI Conf. on Artif. Intell, Hamburg, pp 18-20 1978 HOGG78b Hogger C.J. Goal Oriented Derivation of Logic Programs Proc. MFCS Conf., Polish Acadamy of Sciences, Zakopane, pp 267-276 1978 HOGG81a Hogger C.J. Derivation of Logic Programs J. Ass. Comput. Mach. 28, pp 372-422 1981 HOGG84a Hogger C.J. Introduction to Logic Programming Academic Press 1984 HOLL80a Holloway J. & Steele G.L.Jr. & Sussman G.J. & Bell A. The Scheme-79 Chip AI Memo 559, MIT Lab, Cambridge, 1980 HOLL80b Holloway J. & Steel G. & Sussman G.J. & Bell A. The Scheme 79 Chip Proceedings LISP Conference, Stanford, 1980 HOLT86a * Holt N. Parallel Processing For Fifth Generation Systems in BCS86a 1986 HOMM80a * Hommes F. & Kluge W. & Schlutter H. A Reduction Machine Architecture and Expression Oriented Editing GMD ISF 80.04 1980 HOPK79a Hopkins R.P. et al A Computer Supporting Data Flow, Control Flow and Updatable Memory Computing Laboratory, Univ of Newcastle upon Tyne Tech Rep 144 1979 HORA85a * Horacek H. Semantic/Pragmatic Representation Language Forschungsstelle fur Informationswissenschaft und Kunstiliche Intelligenz Universitat Hamburg LOKI Report NLI - 2.1 December 1985 HSIA83a * Hsiang J. & Dershowitz N. Rewrite Methods For Clausal and Non-Clausal Theorem Proving 10th EATCS International Colloquium on Automata, Languages and Programming pp 331-346 1983 HSIA84a Hsiao D.K. Advanced Database Machine Architectures Prentice Hall 1984 HUD81a Hudak P. Call-Graph Reclamation: An Alternative Storage Reclamation Scheme AMPS Technical Memorandum #4 August 1981 HUD81b Hudak P. Real-Time Mark-Scan Garbage Collection on a Distributed Applicative Processing System AMPS Technical Memorandum #5 October 1981 HUD84a Hudak P. & Kranz D. A Combinator Based Compiler For a Functional Language 11th Symposium on Principles of Programming Languages pp 122-132 1984 HUDA84b Hudak P. & Keller R.M. Garbage Collection and Task Deletion in Distributed Applicative Processing System Proc. Conf. on LISP and Functional Programming, ACM, August 1984 HUDA84c * Hudak P. ALFL Reference Manual and Programmers Guide Dept of Computer Science, University of Yale, Technical Report YALEU/DCS/TR-322 Second Edition October 1984 HUDA84d * Hudak P. Distributed Applicative Processing Systems : Project Goals, Motivation, and Status Report Dept of Computer Science, University of Yale, Technical Report YALEU/DCS/TR-317 May 1, 1984 HUDA85a * Hudak P. & Goldberg B. Distributed Execution of Functional Programs Using Serial Combinators IEEE Transactions on Computers, Vol c-34, no 10, pp 881-891 October 1985 HUDA85b * Hudak P. & Guzman J.C. A Proof-Stream Semantics for Lazy Narrowing Dept of Computer Science, University of Yale, Research Report YALEU/DCS/RR-446 December 1985 HUDA85c * Hudak P. & Young J. Higher-Order Strictness Analysis in Untyped Lambda Calculus Dept of Comp Sci, Univ of Yale October 1985 HUDA85d * Hudak P. & Smith L. Para-Functional Programming: A Paradigm for Programming Multiprocessor Systems Dept of Comp Sci, Univ of Yale October 1985 HUDA85e * Hudak P. Functional Programming on Multiprocessor Architectures Dept of Comp Sci, Univ of Yale, Research Report YALEU/DCS/RR-447 December 1985 HUET73a Huet G.P. The Undecidability of Unification in Third Order Logic Information and Control 22, pp 257-267 1973 HUET75a Huet G.P. Unification in the Typed Lambda Calculus Proc. Symposium on the Lambda Calculus and Computer Science Theory, Springer Verlag, LNCS 37, pp 192-212 1975 HUET80a Huet G.P. & Oppen D. Equations and Rewrite Rules: a Survey Report CSL-111, SRI International 1980 HUGH82a * Hughes R.J.M. Super-Combinators:a new Implementation Method for Applicative Languages Proc. ACM Symposium on LISP and Functional Languages (Aug 1982) p1-10 HUGH82b * Hughes R.J.M. Graph Reduction with Super-Combinators Oxford University Programming Research Group Technical Monograph PRG-28 June 1982 HUGH83a * Hughes R.J.M. The Design and Implementation of Programming languages Oxford University Programming Research Group Technical Monograph PRG-40 (published as monograph september 84) July 1983 HUGH84a * Hughes R.J.M. Reference Counting with Circular Structures in Virtual Memory Applicative Systems Programming Research Group, Oxford University 1984 HUGH84b Hughes R.J.M. Parallel Functional Programs Use Less Space Programming Research Group, Oxford University 1984 HUGH84c Hughes G.E. & Cresswell M.J. A Companion to Modal Logic Methuen 1984 HUTC86a * Hutchinson A. A Data Structure and Algorithm for a Self-Augmenting Heuristic Program Computer Journal, Vol 29, No 2, pp 135-150 April 1986 HWAN84a Hwang K. Computer Architecture and Parallel Processing McGraw Hill 1984 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon Apr 28 18:47:08 1986 Date: Mon, 28 Apr 86 18:47:02 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #104 Status: RO AIList Digest Monday, 28 Apr 1986 Volume 4 : Issue 104 Today's Topics: Seminars - Learning Representation by Backpropagation (GTE) & Distributed Object-Oriented Programming (CMU) & Prolog and Geometry (CSLI) & Inferring Domain Plans in Question Answering (UPenn) & Possible Worlds Planning (UPenn) & Parallel Algorithms for Term Matching (MIT), Conference - 19TH Hawaii Int. Conf. on Systems Sciences & 1st Australian AI Congress (Extended Deadline) ---------------------------------------------------------------------- Date: Thu, 24 Apr 86 10:08:52 EST From: Bernard Silver Subject: Seminar - Learning Representation by Backpropagation (GTE) GTE Laboratories Inc Machine Learning Seminar Series Speaker: David E. Rumelhart Institute of Cognitive Science and University of California San Diego Title: Learning Representation by Backpropagation Date: Monday April 28 9am Place: GTE Laboratories 40 Sylvan Rd Waltham MA 02254 Recent work will be presented on using the backpropagation learning procedure for developing internal representations in parallel distributed processing systems. The talk will include a brief introduction to the backpropagation learning procedure followed by a report on a number of new applications of the procedure to storage of semantic information and the discovery of new features. Visitors welcome: Contact Oliver Selfridge (617) 466-2855 or Bernard Silver (617) 466-2663 ------------------------------ Date: 23 Apr 86 11:49:56 EST From: David.Anderson@SPICE.CS.CMU.EDU Subject: Seminar - Distributed Object-Oriented Programming (CMU) Thesis Proposal: Object Oriented Programming for Distributed Systems David B. Anderson Computer Science Department Carnegie-Mellon University dba@k.cs.cmu.edu 28 April 1986 3:30 pm WeH 5409 ABSTRACT Object oriented programming has often been advocated for a variety of programming tasks, particularly interactive, graphical applications and window managers. Software engineers are attracted to this programming methodology because of the modularity, data abstraction and information hiding that it promotes. On the other hand, object oriented techniques have not generally been used in building distributed systems and applications. The difficulty in using object oriented programming techniques for implementing distributed applications lies in the requirements that object oriented languages and systems place on their runtime environment. For example, the remote procedure call mechanisms typically used in building distributed applications must be replaced with a mechanism for remote method invocation. This means that a static remote procedure call stub generator, such as Matchmaker, must be replaced with a mechanism for dynamically locating the correct method to call based on the runtime types of objects. Furthermore, mechanisms are needed to allow objects, classes and methods to be created and destroyed as the system is running. Other difficulties and issues that must be addressed include the naming and scope of objects, garbage collection, error recovery and protection. The proposed dissertation research will develop a solution to these problems in the form of an object manager for distributed systems. This proposal looks at these issues in some detail, and discusses the design of an object manager to meet these requirements. A prototype system is planned, and will be used to implement a distributed, object oriented user interface environment. ------------------------------ Date: Fri 25 Apr 86 19:31:48-PST From: Fred Lakin Subject: Seminar - Prolog and Geometry (CSLI) Pixels and Predicates meeting: note ==> TUESDAY <== PROLOG AND GEOMETRY Who: Randolph Franklin, UC at Berkeley wrf@degas.berkeley.edu Where: CSLI trailers When: 1:00pm - TUESDAY, April 29, 1986 Abstract: The Prolog language is a useful tool for geometric and graphics implementations because its primitives, such as unification, match the requirements of many geometric algorithms. We have im- plemented several problems in Prolog including a subset of the Graphics Kernal Standard, convex hull finding, planar graph traversal, recognizing groupings of objects, and boolean combina- tions of polygons using multiple precision rational numbers. Certain paradigms, or standard forms, of geometric programming in Prolog are becoming evident. They include applying a function to every element of a set, executing a procedure so long as a cer- tain geometric pattern exists, and using unification to propagate a transitive function. Certain strengths and weaknesses of Pro- log for these applications are now apparent. ------------------------------ Date: Sun, 27 Apr 86 21:36 EDT From: Tim Finin Subject: Seminar - Inferring Domain Plans in Question Answering (UPenn) Forwarded From: Bonnie Webber on Sun 27 Apr 1986 at 9:40 INFERRING DOMAIN PLANS IN QUESTION-ANSWERING Martha E. Pollack Thesis Defense Monday, April 28, 1986 Noon-2pm, 216 Moore The importance of plan inference (PI) in models of conversation has been widely noted in the computational-linguistics literature, and its incorporation in question-answering systems has enabled a range of cooperative behaviors. The PI process in each of these systems, however, has assumed that the questioner (Q) whose plan is being inferred and the respondent (R) who is drawing the inference have identical beliefs about the actions in the domain. I demonstrate that this assumption is too strong, and often results in failure not only of the PI process, but also of the communicative process that PI is meant to support. In particular, it precludes the principled generation of appropriate responses to queries that arise from invalid plans. I present a model of PI in conversation that distinguishes between the beliefs of the questioner and the beliefs of the respondent. This model rests on an account of plans as mental phenomena: "having a plan" is analyzed as having a particular configuration of beliefs and intentions. Judgements that a plan is invalid are associated with particular discrepancies between the beliefs that R ascribes to Q, when R believes Q has some particular plan, and the beliefs R herself holds. I define several types of invalidities from which a plan may suffer, relating each to a particular type of belief discrepancy, and show that the types of any invalidities judged to be present in the plan underlying a query can affect the content of a cooperative response. The PI model has been implemented in SPIRIT -- a System for Plan Inference that Reasons about Invalidities Too -- which reasons about plans underlying queries in the domain of computer mail. Advisor: Bonnie Webber Committee: Aravind Joshi, chair Tim Finin Barbara Grosz ------------------------------ Date: Sun, 27 Apr 86 23:35 EDT From: Tim Finin Subject: Seminar - Possible Worlds Planning (UPenn) Forwarded From: Bonnie Webber on Thu 24 Apr 1986 at 14:24 In addition to his talk on Tuesday afternoon, 29 April, on Multi-Valued Logic, Matt Ginsberg will also give a talk on Wednesday morning at 10:30 on Possible Worlds Planning. Room to be announced. POSSIBLE WORLDS PLANNING Matt Ginsberg Stanford University The size of the search space is perhaps the most intractable of all of the problems facing a general-purpose planner. Some planning methods (means-ends analysis being typical) address this problem by encouraging the system designer to give the planner domain-specific information (perhaps in the form of a difference table) to help govern this search. This paper presents a domain-independent approach to this problem based on the examination of possible worlds in which the planning goal has been achieved. Although a weak method, the ideas presented lead to considerable savings in many examples; in addition, the natural implementation of this approach has the attractive property that incremental efforts in controlling the search provide incremental improvements in performance. This is in contract to many other approaches to the control of search or inference, which may require large expenditures of effort before any benefits are realized. ------------------------------ Date: Thu 24 Apr 86 14:29:00-EST From: Lisa F. Melcher Subject: Seminar - Parallel Algorithms for Term Matching (MIT) DATE: Thursday, May 1, 1986 TIME: 3:45 - Refreshments 4:00 - Lecture PLACE: NE43 - 512A "PARALLEL ALGORITHMS FOR TERM MATCHING" CYNTHIA DWORK IBM Almaden Research Center San Jose, CA Unification of terms is a well known problem with applications to a variety of symbolic computation problems. Two terms s and t, involving function symbols and variables, are unifiable if there is a substitution for the variables which makes s and t syntactically identical. For example, f(x,x) and f(g(y),g(g(c))) are unified by substituting g(c) for y and g(g(c)) for x. A special case of unification is term matching where one of the terms contains no variables. Previous work on parallel algorithms for unification by Dwork, Kanellakis and Mitchell (DKM) showed that unification is P-complete in general, even if terms are represented as trees so that common subexpressions must be repeated. However, DKM give an NC2 algorithm for term 2 matching using M(n ) processors where M(m) is the number of operations needed to multiply m-by-m matrices. This algorithm allows a compact dag representation of terms. These resuts have been tightened in two ways. First, the processor bound for term matching of dags has been improved to 2 M(n), while retaining the O(log n) running time, using a randomizing algorithm. There is also some evidence that improving the processor bound further will be difficult since there is an efficient parallel reduction from the graph accessibility problem (GAP) to the term matching problem for dags, 2 so that any improvement in the processor bound for term matching (say, to n ) would imply the same for GAP. The second improvement is a sharper P-completeness result which shows that unification of tree terms is P-complete even for linear terms where each variable can appear at most once in each term. This is joint work with Paris Kanellakis and Larry Stockmeyer. Shafi Goldwasser Host ------------------------------ Date: 25 Apr 1986 10:09:56-EST From: Vasant.Dhar@ISL1.RI.CMU.EDU Subject: Conference - 19TH Hawaii Int. Conf. on Systems Sciences CALL FOR PAPERS: 19TH HAWAII INTERNATIONAL CONFERENCE ON SYSTEMS SCIENCES (HICSS), Hawaii, January 1987. Papers are invited for the KNOWLEDGE-BASED/DECISION-SUPPORT SYSTEMS track. The following are representative areas: 1. Knowledge-Based approaches to large systems development 2. Knowledge-Based support systems in business organizations 3. Knowledge Engineering in Management Science Applications 4. Knowledge Engineering in Database Management/Intelligent Retrieval Systems 5. Decision Support Systems for Group decision making 6. Model Management in Decision Support Systems 7. User Interfaces in Decision Support Systems Papers falling into area 1 above should be sent to: Vasant Dhar Department of Information Systems New York University 90 Trinity Place New York, NY 10006. Papers in all other areas should be sent to Edward Stohr at the same address. The deadline for submission is July 7 1986. Authors will be notified of acceptance before September 8, 1986. Camera ready copies are due on October 20, 1986. The conference is on the island of Oahu, January 6-9, 1987. ------------------------------ Date: 23 Apr 86 13:26:07 +1000 (Wed) From: "ERIC Y.H. TSUI" Subject: Conference - 1st Australian AI Congress (Extended Deadline) 1 11 st 111 AUSTRALIAN 11 ARTIFICIAL 11 INTELLIGENCE 11 CONGRESS 11 1111 Melbourne, November 18-20, 1986 CALL FOR PAPERS ======================================================================== DEADLINE EXTENDED...DEADLINE EXTENDED...DEADLINE EXTENDED...DEADLINE EXT ======================================================================== Abstract (300 words) 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 Reply to: 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 or post to: Dr. B. Garner, Division of Computing and Mathematics, Deakin University, Victoria 3217, Australia. NEW DEADLINES: All submissions by May 31, 1986. Notification by July 14. ^^^ ^^^^^^ ^^^^^^^ ||| |||||| ||||||| Inquiries: Stephen Moore, Director, 1AAIC86, tel: (02)439-5133. Eric Tsui eric@aragorn.oz ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue Apr 29 06:41:34 1986 Date: Tue, 29 Apr 86 06:41:26 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #105 Status: RO AIList Digest Tuesday, 29 Apr 1986 Volume 4 : Issue 105 Today's Topics: Queries - Rapid Prototyping and Exploratory Programming & Animal Behavior Simulation & Expert System in Simulation & Prolog from Simtel20 & Survey of IBM-PC Expert Systems, AI Tools - Expert System Software for MS-DOS, Conference - Long Beach AI Conference, Reports - Sources, Networks - New Net Address Syntax, Law & Linguistics - Trademarks ---------------------------------------------------------------------- Date: 24 Apr 86 13:29:29 GMT From: ucdavis!lll-lcc!lll-crg!caip!seismo!umcp-cs!aplcen!jhunix!ins_amrh @ucbvax.berkeley.edu (Martin R. Hall) Subject: Rapid Prototyping & Exploratory Programming The division here is building a Software Engineering Practices Manual, and has been debating how to relate standards for conventional software to Knowledge Based and other AI systems. Could anyone point us to some articles that directly reference the ideas of rapid prototyping and exploratory programming; pre-design and mid-design experimental programming as a methodology in building applied AI systems. Thanks! -Marty Hall Arpa (preferred) hall@hopkins CSnet hall.hopkins@csnet-relay UUCP seismo!umcp-cs!jhunix!ins_amrh allegra!hopkins!jhunix!ins_amrh AT&T (301) 682-0917 ------------------------------ Date: 24 Apr 86 21:50:09 GMT From: ucdavis!lll-lcc!lll-crg!seismo!ll-xn!mit-amt!bc@ucbvax.berkeley.edu (William H Coderre) Subject: Query: Animal Behavior Simulation using rules I am doing my bachelor's thesis here at MIT on simulating animal behavior using rule-driven systems. The aim is to develop a package that grade- and high-school students will use to investigate behavior, similar to the commercial packages RobotWars, ChipWits, and Rocky's Boots. Does anyone care to recommend references that might be helpful? Please reply direct to me and I will post a complete list as the demand warrants. "Biology of purpose keeps my nose above the surface"....................bc ------------------------------ Date: Sun, 27 Apr 86 14:20:45 est From: munnari!csadfa.cs.adfa.oz!gyp@seismo.CSS.GOV (Patrick Tang) Subject: Expert System in Simulation Model Does anyone out there ever come across literature which discribe the design and implementation of "Artificial Intelligence" or "Expert System" in military simulation model, in particular Army Wargaming Simulation. I would appreciate it very much if you could let me know where I could get hold of those material. (Unclassified one, Of Course !!). Thanks a million. 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: 24 Apr 86 20:26:27 GMT From: cbosgd!oucs!joe@ucbvax.berkeley.edu (Joseph Judge) Subject: Prolog from Simtel20 I remember seeing a posting recently about prolog available from Simtel20 thru an FTP. As I cannot FTP, is it possible to get this prolog from a kind soul out there in NetLandia ?? From the friendly systems administrator, Joseph Judge ihnp4!{amc1,cbdkc1,cbosgd,cuuxb,}!oucs!joe Nur mit dir. ------------------------------ Date: Thu, 24 Apr 86 17:42:01+0900 From: Sangki Han Subject: Survey of IBM-PC Expert Systems We are searching for the commercial expert systems on IBM-PCs. We want to know the application areas, prices, and vendors. If you send responses, I'll accumulate and repost them on net. Thanks in advance. Sangki Han Department of Computer Science KAIST, P. O. Box, 150 Chongryang, Seoul 131 Korea skhan%cskaist@kaist (Csnet) ..!seismo!kaist!cskaist!skhan (uucp) ------------------------------ Date: Fri, 25 Apr 86 05:08:15 EST From: ihnp4!lzaz!psc@seismo.CSS.GOV Subject: Expert system software for MS-DOS [Forwarded from the IBMPC bboard by Paul Fishwick and Tim Finin ] Here's the promised list of expert systems for MS-DOS based personal computers. The language name in brackets usually indicates what languages you can can use for special purpose routines that work with the system. (Sometimes, it may just be the language the expert system was written in.) I threw in Prolog processors for grins (I suspect Borland's going to make that a much bigger field!) The names, addresses, phone numbers, and especially prices are not guaranteed to be free from typos, line noise, or obsolecence. I have no experience or further information on any of these packages; don't call me, call the company. On the other hand, if *you* have used any of these systems, please drop me a line; I'll be happy to summarize and repost. I'd also like to hear of any products I'd forgotten, or any errata to my list. Aion Development System: expert system, $7000 Aion 101 University Ave., 4th floor Palo Alto, CA 94301 415-328-9595 Arity Expert System Development Package: expert system, $295 Arity Standard Prolog: AI language, $95 Arity Prolog Interpreter V4: AI language, $350 Arity Prolog Compiler & Interpreter V4: AI language, $795 Arity Corp 358 Baker Ave. Concord, MA 01742 617-371-1243 OPS5+: expert system [C] Artelligence, Inc. 14902 Preston Rd., suite 212-252 Dallas, TX 75240 214-437-0361 A.D.A Educational Prolog: AI language, $29.95 VML Prolog: AI language, $300 Automata Design Associates 1570 Arran Way Dresher, PA 19025 215-646-4894 Turbo Prolog: AI language, $99.95 Borland International 4585 Scotts Valley Dr. Scotts Valley, CA 95066 408-438-8400 Xsys: expert system [Lisp], $995 California Intelligence 912 Powell St. #8 San Fransisco, CA 94108 415-391-4846 Prolog V: AI language, $69.95/$99.95 Chalcedony Software, Inc. 5580 La Jolla Blvd, Suite 126B La Jolla, CA 92037 617-483-8513 ES/P Advisor: expert system [Prolog], $895 Prolog-1: AI language, $395 Prolog-2 Interpreter and Compiler: AI Language, $1895 Expert Systems International 1150 First Ave. King of Prussia, PA 19406 215-337-2300 Xi: expert system, $795 Expertech Expertech House, 172 Bath Rd. Slough, Berks SLI 3XE, ENGLAND 0753-821321; USA, 415-367-6264 or 617-470-2267 Exsys 3.0: expert system [C], $395 Exsys Inc. PO Box 75158, Contract Sta. 14 Albuquerque, NM 87194 505-836-6676 TIMM-PC: expert system [Fortran 77], $9500 General Research 7655 Old Spring House Rd. McLean, VA 22102 703-893-5900 Expert Ease: expert system [UCSD Pascal], $695 Expert Edge: expert system, $795 Human Edge Software 2445 Faber Pl. Palo Alto, CA 94303 CA: 800-824-7325, elsewhere: 800-624-5227 Knowol: expert system, $39.95 Intelligent Machines Co. 3813 N. 14th St. Arlington, VA 22201 703-528-9136 KEE: expert system IntelliCorp 1975 El Camino Real W. Mountain View, CA 94040 415-965-5500 Experteach: expert system [Lisp, Prolog, Pascal, dBase II], $475 Intelliware, Inc. 4676 Admiralty Way, Suite 401 Marina del Rey, CA 90291 213-305-9391 Ex-Tran: expert system, $3000 Jeffrey Perrone & Associates 415-431-9562 KDS: expert system [assembler], $795 (development), $150 (playback) KDS II: expert system, $945 KDS Corp. 934 Hunter Rd. Wilmette, IL 60091 312-251-2621 Trouble Shooter: expert system, $250 Kepner-Tregoe 609-921-2806 Insight: expert system [Turbo Pascal], $95/$485 Level 5 Research 4980 S A1A Melbourne Beach, FL 32751 (moved to 503 Fifth Ave., Suite 201, Indiatlantic, FL 32903?) 305-729-9046 Daisy: expert system [muLisp-85] Lithp Systems BV Meervalweg 72 1121 JP Landsmeer The Netherlands Micro-Prolog: AI language, $395 Logic Programming Associates 31 Crescent Drive Milford, CT 06460 203-872-7988 MProlog: AI language, $725 Logicware, Inc. 5000 Birch St., West Tower, suite 3000 Newport Beach, CA 92660 416-665-0022 (70 Walnut St. Wellesley, MA 02181 617-237-2254?) Reveal: expert system McDonnell Douglas Knowledge Engineering Products Division 20705 Valley Green Dr. Cupertino, CA 95014 408-446-7406 MicroExpert: expert system [Turbo Pascal/Apple Pascal], $49.95 McGraw-Hill PO Box 400 Hightstown, NJ 08520 or 1221 Avenue of the Americas New York, NY 10020 NY: 212-512-2999, elsewhere 800-628-0004 Guru: integrated software with expert system, $3000 Micro Data Base Systems PO Box 248 Lafayette, IN 47902 317-463-2581 Expert: expert system [Forth], $100 Mountain View Press PO Box 4656 Mountain View, CA 94040 415-961-4103 XLISP: AI language, $6 (disk 148) Expert System of Steel: expert system, $6 (disk 268) Esie: expert system, $6 (disk 398) Prolog: AI language, $6 (disk 405) PC-SIG 1030 E. Duane Ave, Suite J Sunnyvale, CA 94086 408-730-9291; CA 800-235-6647, elsewhere 800-235-6646 OPS83: expert system [C] Production Systems Technologies, Inc. 642 Gettysburg St. Pittsburgh, PA 15206 412-362-3117 Micro-Prolog Professional: AI Language?, $395 Programming Logic Systems 203-877-7988 1st-Class: expert system, $20/$495 Programs in Motion, Inc. 10 Sycamore Rd. Wayland, MA 01778 617-653-5093 Rulemaster: expert system, $995 Radian Corp. 8501 Mo-Pac Blvd. PO Box 9948 Austin, TX 78766 512-454-4797 Small-X: expert system, $125/$225 RK Software PO Box 2085 West Chester, PA 19380 215-436-4570 Savvy PC: expert system, $139 Savvy 505-265-1273 Knowledge Engineering System II: expert system [C], $4000 Software Achitecture & Engineering 1500 Wilson Blvd., suite 800 Arlington, VA 22209 (703)276-7910 Wizdom: expert system, $1250/$2050 Software Intelligence Lab 1593 Locust Ave. Bohemia, NY 11716 212-747-9066/516-589-1676 Xper: expert system, $95 Softway 415-397-4666 Prolog-86: AI language, $125 Solution Systems 335-P Washington St. Norwell, MA 02061 617-659-1571 Microdyn: expert system, $300 Stochos 518-372-5426 M1: expert system [Prolog], $5000 KS-300: expert system Teknowledge Inc. 525 University Ave. Palo Alto, CA 94301 415-327-6640 Personal Consultant: expert systems [IQ Lisp], $950 Personal Consultant Plus: expert systems [IQ Lisp], $2950 Texas Instruments PO Box 80963 Dallas, TX 75380-9063 800-527-3500 Class Texpert Systems, Inc. 12607 Aste Houston, TX 77065 713-469-4068 -Paul S. R. Chisholm, UUCP {ihnp4,cbosgd,pegasus,mtgzz}!lznv!psc AT&T Mail !psrchisholm, Internet mtgzz!lznv!psc@topaz.rutgers.edu The above opinions may not be shared by any telecomm company. ------------------------------ Date: Thu 24 Apr 86 17:09:32-CST From: CMP.BARC@R20.UTEXAS.EDU Subject: Re: Long Beach AI Conference The conference to which Girish Kumthekar alluded is presumably AI 1986 AI & Advanced Computer Tecnology Conference & Exhibition April 29 - May 1, 1986 Long Beach Convention Center Long Beach, CA There are sessions on Strategic Defense, Medicine, Office Automation, Printing/ Publishing, Expert Systems, Image Processing, Automated Guided Vehicles, Knowledge Information Processing Systems, Microcomputers, Machine Translation, The Investment Community, Engineering Design, Automated Manufacturing Systems, Banking/Finance, Cognitive Modeling, Business, Aerospace, Speech Processing, AI Languages, Graphics and User Interface, Expert System Development Systems, Natural Language Interfaces and Training. There are three tutorials, *An Executive Primer to AI*, *Understanding Expert Systems* and *Understanding Natural Languages* (the first of which is on April 28). Finally, there is a workshop on expert systems for manufacturing and process engineers, and about 75 exhibitors. It's too late for pre-registration, of course, but additional information can be obtained from Tower Conference Management Co. 331 W. Wesley St. Wheaton, IL 60187 (312) 668-8100 Telex: 350427 I have no connection with this conference, other than being on their mailing list. Dallas Webster Burroughs Austin Research Center ------------------------------ Date: 25 Apr 86 10:11:14 +1000 (Fri) From: "ERIC Y.H. TSUI" Subject: Reply to Daniel Davison In article <12199933765.28.DAVISON@SUMEX-AIM.ARPA> DAVISON@SUMEX-AIM.ARPA (Daniel Davison) writes: > >There were several technical reports mentioned in a recent AIlist that I'd >like to get...but I don't know how. Would some kind soul send me a note To Louisiana State University (LSU): cindy@lsu.csnet decvax!ihnp4!cmucspt!avie I have received quite a few reports from LSU (by post) using the above address. Eric Tsui eric@aragorn.oz [AIList ran an extensive list of report sources during the first year, mostly taken from the SIGART Newsletter. I can send reprints on request, but see the next message. -- KIL] ------------------------------ Date: WED, 20 apr 86 17:02:23 CDT From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU Subject: Sources for Technical Reports Here are the report sources Daniel Davison requested: LSU Requests for copies should be addressed to cindy hathaway, technical reports secretary, computer science department, louisiana state university, baton rouge, louisiana 70803; or cindy@lsu on csnet. CMU Technical reports are available from Information Services The Robotics Institute Carnegie-Mellon University Pittsburgh, PA 15213. or Serviou@H.CS.CMU.EDU Please direct such requests to me instead of AILIST. [Lawrence Leff maintains a distribution service for abstracts and reports. He is also the source of the BIB-formatted bibliographies AIList carried a few weeks ago. -- KIL] ------------------------------ Date: Thu 24 Apr 86 09:12:47-PST From: Mark Richer Subject: Net addresses Eswaran, [AIList, AI-ED] : A lot of us on the arpanet now seem to have at least two equivalent addresses, either ending in .arpa or .edu. The latter form, .edu, is the newer one. In your message to AIList you listed your address as eswaran@h.cs.cmu.edu.arpa. [It is improper and ineffective to use both, and any mailer which constructs such a path name should be fixed. I believe the CMU mailer that had this problem was fixed a couple of months ago. -- KIL] Without thinking, I typed the address in like that in the TO field of my mail program which rejected the host name. It wasn't immediately obvious to me what was wrong, so I thought I'd bring this type of problem to everyone's attention because it's bound to come up again. mark ------------------------------ Date: 24 Apr 1986 15:06:36-EST From: kushnier@NADC Subject: Re: Compuscan Dear John, With reference to the verb "to XEROX", I will remain forever humbled under the mighty name of your company, and will never again be so bold as to use it as a part of speech. By the way, the typed originals were COPIED once on a XEROX Model 1048. Would you like to comment on why the Compuscan Page Reader had so much trouble? Ron Kushnier kushnier@nadc.arpa ------------------------------ Date: 24 APR 86 15:07-N From: DESMEDT%HNYKUN52.BITNET@WISCVM.WISC.EDU Subject: do not "xerox" this message Reply to the person from Xerox objecting to the use of the verb "xerox": In your recent contribution to Ailist-Digest, you object to the use of the word "xerox" as a verb (and in lowercase). Your argument seems to be that Xerox Corp. makes more office equipment than just copiers, and that the verb "xerox" could therefore be ambiguous. Moreover, if "xerox" stands for copying on just any copier, the word doesn't quite cover its original meaning. Although I tend to avoid the use of trade marks for generic concepts, I would like to point out that one can take different stands with respect to linguistic rules vs. linguistic creativity, and you might be arguing from the wrong stand. One view of language is "prescriptive linguistics": to see the rules as laws that one individual or group of individuals tries to impose on others. Another view is "descriptive linguistics": to see the rules as something that defines what is generally agreed upon by a linguistic community. As an individual, you seem to defend a rule that from the original meaning of "photocopy on Xerox equipment", the verb "xerox" can be extended only to "process on any Xerox equipment". You're taking a prescriptive viewpoint there, and it's not going to work, because the linguistic community has already decided long ago that "xerox" means "photocopy on any copier". Once the majority of a linguistic community has agreed upon a change, it is usually hard or impossible to undo that change, even if your arguments against it are well motivated. Therefore I want to discourage you from taking a prescriptive viewpoint, and advise you to go by the majority, or at least, not to pretend you don't understand what "xerox" means for the majority. The use of the word "xerox" is not an isolated case. Some more examples? In Belgium, most people use the word "bic" to mean "any ballpoint pen". The fact that Bic now also makes disposable rasors and lighters does not affect this use at all. If I ask any Belgian "do you have a bic I can use?" nobody will think I mean a rasor or a lighter. Same holds for "kodak", which means "any camera". If I ask any Belgian whether he owns a kodak and he doesn't own a camera, he will probably answer "no" even if he has a Kodak copier back in his office (on which his secretary is xeroxing his documents). The use of a trade name for a more generic concept is a particular case of metonymy, and instead of crusading against it, the subscribers of this newsletter would probably be more interested in a computer simulation of metonymic processes to see whether it is able to come up with "xerox" in the way criticized by you. Koenraad De Smedt Psychological Lab. University of Nijmegen The Netherlands [Personal preferences and customary usage aside, the laws relating to trademark usage are fairly clear; Xerox must insist on proper use of their name or they will lose the right to use it. -- KIL] ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue Apr 29 18:42:44 1986 Date: Tue, 29 Apr 86 18:42:33 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #106 Status: RO AIList Digest Tuesday, 29 Apr 1986 Volume 4 : Issue 106 Today's Topics: AI Tools - Common LISP Coding Standards & String Reduction & PARLOG for Unix, Representation - Shape, Philosophy - Computer Consciousness ---------------------------------------------------------------------- Date: Thu 24 Apr 86 07:50:46-PST From: George Cole Subject: Hooks, Rings, Shapes & Background Processes The knowledge about the individual items and their interactions must contain the knowledge about their common environment, either as an unstated assumption or perhaps has common knowledge. A hook and ring will not hold together (even if they start together) unless the ring is "hanging" from the hook, because of gravity or magnetism or a strong wind blowing past in the correct direction. Nor will it stay hanging if the balance of forces (gravity down, wind blowing past the plastic hook up) is upset beyond the stable limit. (If gravity is increased 100-fold, will the tensile strength of the hook suffice to support the ring?) And for a last concern, is there any motion of the hook or ring that will cause the degradation of either, such as friction wearing away at the material and thus lowering the tensile capacity? These environmental and process contextual aspects do not seem to yield easily to expression in a stable or fixed-point language. George S. Cole GCole@SU-SUSHI.ARPA ------------------------------ Date: Fri, 25 Apr 86 12:37:52 EST From: mcguire@harvard.HARVARD.EDU (Hugh McGuire) Subject: Re: Common LISP coding standards Perhaps Marty Hall was seeking some guide to LISP style, similar to Ledgard's (et al.'s) *Pascal with Style*; I certainly would find such useful, and perhaps others would also. Steele's (et al.'s) *Common LISP*, while it completely specifies the language, mentions style only occasionally. For example, consider the following simple questions: Under Lexical Scoping, how much should a programmer use variables with identical names? Should one use "#'" (the abbreviation for special form FUNCTION) whenever possible? When is a short COND-construct more appropriate than an IF-construct? How should one decide between iteration and recursion? Will asterisked global variables or constants (e.g. "*visible-windows*") be confused with the system's asterisked symbols? --Hugh (mcguire@harvard.HARVARD.EDU) ------------------------------ Date: 24 Apr 86 16:03:06 GMT From: hplabs!hao!noao!terak!doug@ucbvax.berkeley.edu (Doug Pardee) Subject: Re: String reduction > TRAC is pretty easy to implement; I have an incomplete version written in > C that I did some years back. I also have a paper on TRAC which is probably > long out of print by now. If anyone cares, TRAC stands for Text Reckoner And Compiler, and is trademarked. It is discussed at some length in Peter Wegner's book, "Data Structures, Information Processing and Machine Organization" (the title may be off a bit, the book is at home and it's hard to remember such a lengthy title :-) Stanford used to have a version they called WYMPI. The main differences were the use of "*" instead of "#" and -- more significantly -- they permitted string (macro) names to be specified as the operator, rather than requiring as TRAC does that strings be specifically called with the "cl" operator. In other words, you could say *(macro,...) instead of #(cl,macro,...). Wegner leaves it as an exercise to the reader to show why the "cl" was an important architectural feature of TRAC which shouldn't have been tampered with. Something about trying to make #(cl,macro,...) == #(macro,...) and at the same time making ##(cl,macro,...) == ##(macro,...) -- Doug Pardee -- CalComp -- {elrond,seismo,decvax,ihnp4}!terak!doug ------------------------------ Date: 24 Apr 86 12:32:50 GMT From: ucdavis!lll-lcc!lll-crg!seismo!mcvax!ukc!ptb@ucbvax.berkeley.edu (P.T.Breuer) Subject: Re: String reduction In article <1031@eagle.ukc.ac.uk> sjl@ukc.ac.uk (S.J.Leviseur) writes: >Does anybody have any references to articles on string reduction >as a reduction technique for applicative languages (or anything >else)? They seem to be almost impossible to find! Anything welcome. John Horton Conway (the Prince of Games, memorably Life) of Cambridge University (UK) Pure Maths. Dept. some years ago invented a computing language that seems to me to proceed by Markovian string reduction. It is extremely sneaky at recognising substrings for substitution - obviously the major cost in any such approach - and does this task efficiently. The trick is to make up your strings as the product of integer primes instead of by alphanumeric concatenation. The production rules of a program script consist of single fractions. To apply the rules to an incoming 'string' you choose the first fraction in the script that gives an integer result on multiplication with the integer 'string' and take the result as the outgoing string, then go to the top of the script with the new string and start again. The indices of prime powers in the string serve as memory cells 'x'. The denominator of the fractions serve as 'if x> ..' statements, with the numerators as 'then x=x+-..' components. J.H.C.'s (the middle initial is to help him remain incognito) interest was in the fact that the Godel numbers of programs written in this language are easily calculable. Conway has written out on a single sheet of paper the Godel number of the program that simulates any given program from its Godel number. The G-No. of the prime number program is relatively short. I will intervene with J.C. to obtain more info, if requested. U.No.Hoo advises generic statement here. ------------------------------ Date: 23 Apr 86 18:08:55 GMT From: ucdavis!lll-lcc!lll-crg!caip!seismo!mcvax!ukc!icdoc!sg@ucbvax. berkeley.edu (Steve Gregory) Subject: PARLOG for Unix SEQUENTIAL PARLOG MACHINE We are now distributing the first release of our sequential PARLOG system, to run on Unix machines. This system is based on an abstract instruction set -- the SPM (Sequential PARLOG Machine) -- designed for the sequential implementation of PARLOG. The system comprises an SPM emulator, written in C; a PARLOG-SPM compiler, written in PARLOG; and a query interpreter also written in PARLOG. An environment allows users to create, compile, edit and run programs. The system is a fairly complete implementation of the PARLOG language. Unlike previous implementations of PARLOG, and of other parallel logic programming languages, there is no "flat" requirement for guards; guards may contain any "safe" PARLOG conjunction. A powerful metacall facility is provided. The SPM instruction set was designed by Steve Gregory. The system has been implemented by Alastair Burt, Ian Foster, Graem Ringwood and Ken Satoh, with contributions by Tony Kusalik. The work has been supported by the SERC, ICL and Fujitsu. The SPM system is currently available, in object form, for the Sun and Vax under Unix 4.2; it is distributed on a tar format tape, which includes all documentation. Anyone interested in obtaining a copy should first contact me at the following address, to request a copy of the licence agreement. The software will then be shipped on receipt of the completed licence and prepayment of the handling fee. Steve Gregory Telephone: +44 1 589 5111 Dept. of Computing Telex: 261503 IMPCOL G Imperial College JANET: sg@uk.ac.ic.doc London SW7 2BZ ARPANET: sg%icdoc@ucl-cs.arpa England uucp: ...!mcvax!ukc!icdoc!sg ------------------------------ Date: Thu, 24 Apr 86 12:20:50 gmt From: gcj%qmc-ori.uucp@cs.ucl.ac.uk Subject: Re: Lucas on AI & Computer Consciousness Tom Schutz says in Vol 4 # 80 :- > But I hope that these researchers and their fans do not delude themselves > into thinking that the only aspect of the universe which exists is the > aspect that science can deal with. One aspect of human behavior is "politics". Can there really ever be political *science*? How would you *model* many minds acting as one? Tom also says :- > 2) There is a dualism of the mental and the physical with > mysterious interactions between the two realms, and Mysterious indeed! Consider "I *feel* ill", and the interactions between mind and body, such as "butterflies in the stomach". He adds :- > 3) Other possibilities which no one has thought of yet. of which there are an infinity? Is there of a *real* example of the result that "sigma 2**(-n)" is 2? We bootstrap our consciousness from the cradle, 0, to awareness, 1. Do we "multiply by infinity" to get there? Gordon Joly ARPA: gcj%uk.ac.qmc.maths%uk.ac.qmc.cs@ucl-cs.arpa UUCP: ...!seismo!mcvax!ukc!qmc-cs!qmc-ori!gcj "I have a pain in the diodes, all the way down my left side." -- Marvin the Paranoid Android. ------------------------------ Date: Thu 24 Apr 86 01:08:46-PST From: Lee Altenberg Subject: Machine emotion, cat emotion? My perspective on the possibilities of machines having emotion stems from my experience with animals and other life. I am concerned about whether animals suffer from slaughtering them, because eating meat is morally unacceptable if they do. But there is no a priori reason to exclude plants from the question, too. How does one know if another is suffering? I think we "know" in the case of people because they act in ways that we would only act if WE were suffering. When I've accidentally stepped on a cat's foot, it has made a noise that sounds horrible to me, and run out of the way. This is close enough to what I would do, were I in pain, so that I feel "oh no, I hurt the cat." But sometimes I have accidentally stepped on a dog's foot and it didn't make such sounds, and I don't know what it felt. I can't imagine that it didn't hurt (based on what I would feel if that had been my foot) but who knows? Now, when we get to plants, there is nothing they could do that would resemble what I would do were I in pain. Cartoons with anthropomorphised plants show them doing such things as wilting or erecting in response to events. Here there is a fourtuitous parallelel between human body language the health of the plant's water balance. But in general? My point is that the question of emotion separates into two issues, the question of one's own emotions, and the question of others'. I am claiming that operationally, the question of emotions in other people, animals, plants, and machines are equal in this latter category. Consider the dynamics of how people perceive each other's emotions from an evolutionary standpoint. The display of emotion to others, and the recognition of emotion in others, plays a central role in human relations, which strongly impact human Darwinian fitness. Now, machines can be designed to mimic human expression of emotions, through icons and the use of emotion expressing language or sounds. So the question regarding machine emotions I would emphasize is, what sort of emotional relationships do we WANT between the human user and the machine? I would guess that there is some stuff of practical relevance in this question, to the extent that a computer user's performance is affected by his or her emotional reactions to what happens during their sessions. Suppose after five consecutive run-time errors, the machine posted the message, "I'm sorry to say, but we've hit a run-time error AGAIN! Keep working on trying to figure out the problem, though. There's got to be a solution!" Well, it's a bit contrived, but you get my point. It could be an area to develop. -Lee Altenberg ------------------------------ Date: 25 Apr 86 09:47:00 EST From: "CUGINI, JOHN" Reply-to: "CUGINI, JOHN" Subject: Some replies on computer consciousness > ...consciousness is an emergent phenomenon. The more > complex the nervous system of an organism, the more likely one is to > ascribe consciousness to it. Computers, at present, are too simple, > regardless of performance. I would have no problem believing a > massively parallel system with size and connectivity of biological > proportions to be conscious, provided it did interesting things. 1. Note that we've gone from a purely external criterion to an combined one which asks about both performance and internal structure. I quite agree that both these are relevant. 2. The assumption is that it's the connectivity per se (ie structure), that consciousness emerges from. This may be true, but it's not a given. Eg suppose we had a "massively parallel system with size [I assume "logical size" is meant here] and connectivity of biological proportions" which was implemented in wooden parts of normal macroscopic physical size, with a switching speed of about 1 second. It's not just obvious to me that such a (large, slow, wooden) thing, though structurally identical to a brain, would generate consciousness (nor that it wouldn't). > From: Mark Ellison > > Mechanism M [brain] causes C [consciousness] ? You know many > people who (may) have brains, and you have no DIRECT evidence > that they are conscious. Right, but I have strong circumstantial evidence - eg they have a brain, (like me) and they can do long division (like me). > You only have direct evidence of one > case of C (barring ESP, etc.), and no DIRECT evidence of that > person's brain. Except for the performances in each case. Huh? Surely I have other grounds for believing that I, and other people, have brains besides their performance. Like analogy, biology, etc. > We only know of their ability to feel pain, experience shapes, colors, > sounds, etc., by their reactions to those stimuli. In other words, > by their performance. But on the other hand their performance might > not involve abstract statements. ....I would argue that "raw > feelings" in others are known only by their performance. Well, I think this simply isn't so - do you mean to deny that the fact that they have brains in no way supports the hypothesis of their ability to feel pain, etc??? Especially given the neurological evidence we have that brain activity seems to directly cause experiences (like the neurosurgeon pokes your cortex and you say "I see a red flash")? It seems just obvious to me that we rationally attribute consciousness to others because of both criteria, ie performance and brains. > One criterion that I have not seen yet proposed is the following. > It is more useful to pretend that people are conscious than not. > They tend to cause you less pain, and are more likely to do what you want. > So I'll believe someone's 8600 or Cray is conscious if it works better, > according to whatever criteria I have for that at the moment, when I so > believe. Well, I was speaking of Truth, not pragmatics. It may be that I play a better game of chess against a metallic opponent if I attribute to it motives of greed, revenge, etc. That hardly seems to settle the question of whether it really has these features. BTW, I think most of these claims about computer consciousness are mis-spoken - I think what people mean to say (or should) is that the Wonderful Futuristic computer would be really *intelligent.* Since the concept of intelligence is essentially one of performance, I agree with such claims. A computer that could hold a general, intelligent, English conversation is, ipso facto, intelligent. It does *not* follow, either conceptually or practically, that such a machine would be conscious (nor that it wouldn't, of course), in the normal "seeing-yellow, feeling-pain" sense of the word, although everyone seems just to assume this. To put it another way, just because intelligent behavior in a human is decisive evidence for consciousness (where we have the underlying fact of brain-hood), it does not follow that it is decisive evidence in the case of a computer. John Cugini ------------------------------ Date: Fri, 25 Apr 86 10:51:56 mst From: crs%f@LANL.ARPA (Charlie Sorsby) Subject: Re: performance considered insufficient References: > Are viruses conscious? How about protozoa, mollusks, insects, fish, > reptiles, and birds? Certainly some mammals are conscious. How about > cats, dogs, and chimpanzees? Does anyone maintain that homo sapiens > is the only species with consciousness? > > My point is that consciousness is an emergent phenomenon. The more > complex the nervous system of an organism, the more likely one is to > ascribe consciousness to it. Computers, at present, are too simple, > regardless of performance. I would have no problem believing a > massively parallel system with size and connectivity of biological > proportions to be conscious, provided it did interesting things. I've been following, with interest, the debate about the possibility of machine consciousness. I have a question: Do you consider (each of you) consciousness a binary phenomenon? Does one (or something) either have, or not have, consciousness? Or, is there a continuum of consciousness, with some entities in possession of just a *little* consciousness while others have more? I suspect, based on what I have read here, that there is no consensus opinion, that some believe it is binary while others subscribe to the continuum idea (with, perhaps, others believing some intermediate theory). Is there a prevailing view among AI researchers? Use your own judgment as to whether to post or mail your reply. If I receive many mail replies, I'll try to summarize and post. Charlie Sorsby ...{cmcl2, ihnp4, ..}!lanl!crs crs@lanl.arpa ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 2 00:42:17 1986 Date: Fri, 2 May 86 00:42:10 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #107 Status: R AIList Digest Thursday, 1 May 1986 Volume 4 : Issue 107 Today's Topics: Seminars - Multivalued Logics (UPenn) & Mechanisms of Analogy (UCB) & Recursive Self-Control for Rational Action (SU) & Reasoning about Multiple Faults (SU) & Knowledge in Shape Representation (MIT) & GRAPHOIDS: A Logical Basis for Dependency Nets (SU) & Decentralized Naming in Distributed Computer Systems (SU) & Learning in Time (Northeastern) & Characterization and Structure of Events (SRI) ---------------------------------------------------------------------- Date: Mon, 28 Apr 86 14:29 EDT From: Tim Finin Subject: Seminar - Multivalued Logics (UPenn) Colloquium - University of Pennsylvania 3:00 pm 4/29 - 216 Moore School MULTI-VALUED LOGICS Matt Ginsberg - Stanford University A great deal of recent theoretical work in inference has involved extending classical logic in some way. I argue that these extensions share two properties: firstly, the formal addition of truth values encoding intermediate levels of validity between true (i.e., valid) and false (i.e., invalid) and, secondly, the addition of truth values encoding intermediate levels of certainty between true or false on the one hand (complete information) and unknown (no information) on the other. Each of these properties can be described by associating lattice structures to the collection of truth values involved; this observation lead us to describe a general framework of which both default logics and truth maintenance systems are special cases. ------------------------------ Date: Tue, 29 Apr 86 08:46:36 PDT From: admin%cogsci@berkeley.edu (Cognitive Science Program) Subject: Seminar - Mechanisms of Analogy (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Spring 1986 Cognitive Science Seminar - IDS 237B Tuesday, April 29, 11:00 - 12:30 2515 Tolman Hall Discussion: 12:30 - 1:30 3105 Tolman (Beach Room) ``Mechanisms of Analogy'' Dedre Gentner Psychology, University of Illinois at Champaign-Urbana Analogy is a key process in learning and reasoning. This research decomposes analogy into separable subprocesses and charts dependencies. Evidence is presented that (1) once an analogy is given, people map predicates and judge soundness chiefly on the basis of common relational structure, as predicted by the structure-mapping theory; (2) in contrast, access to potential analogue depends heavily on common surface features. Accessibility and inferential power appear to be governed by different kinds of similarity. This finer-grained analysis of similarity helps resolve conflicting evidence concerning the role of similarity in transfer. ------------------------------ Date: Mon 28 Apr 86 14:31:52-PDT From: Anne Richardson Subject: Seminar - Recursive Self-Control for Rational Action (SU) DAY: May 5 EVENT: AI Seminar PLACE: Jordan 050 TIME: 4:15 TITLE: Recursive Self-Control: A Computational Groundwork for Rational Action PERSON: John Batali FROM: MIT AI Lab Human activity must be understood in terms of agents interacting with the world, those interactions subject to the details of the situation and the limited abilities of the agents. Rationality involves an agent's deliberating about and choosing actions to perform. I suggest that deliberation and choice are themselves best viewed as activities of the agent. This leads to a view of rationality based on "recursive self-control" wherein the agent controls the activity of its body in much the same way as a programmer controls a computational mechanism. To prove that this view is really recursive, rather than just meaninglessly circular, I describe a computer program whose architecture illustrates how recursive self-control could work. ------------------------------ Date: Tue 29 Apr 86 13:12:59-PDT From: Christine Pasley Subject: Seminar - Reasoning about Multiple Faults (SU) CS529 - AI In Design & Manufacturing Stanford University Instructor: Dr. J. M. Tenenbaum Title: Reasoning About Multiple Faults Speaker: Johan de Kleer From: XEROX Palo Alto Research Center Date: Wednesday, April 30, 1986 Time: 4:00 - 5:30 Place: Terman 556 Diagnostic tasks require determining the differences between a model of an artifact and the artifact itself. The differences between the manifested behavior of the artifact and the predicted behavior of the model guide the search for the differences between the artifact and its model. The diagnostic procedure presented in this paper reasons from first principles, inferring the behavior of the composite device from knowledge of the structure and function of the individual components comprising the device. The system has been implemented and tested on examples in the domain of troubleshooting digital circuits. This research makes several novel contributions: First, the system diagnoses failures due to multiple faults. Second, failure candidates are represented and manipulated in terms of minimal sets of violated assumptions, resulting in an efficient diagnostic procedure. Third, the diagnostic procedure is incremental, reflecting the interactive nature of diagnosis. Finally, a clear separation is drawn between diagnosis and behavior prediction, resulting in a domain (and inference) independent diagnostic procedure which can be incorporated into a wide range of inference procedures. Visitors welcome! ------------------------------ Date: Tue, 29 Apr 86 19:13 EDT From: Eric Saund Subject: Seminar - Knowledge in Shape Representation (MIT) Thursday, 1 May 4:00pm Room: NE43-8th floor playroom --- AI Revolving Seminar --- KNOWLEDGE, ABSTRACTION, AND CONSTRAINT IN SHAPE REPRESENTATION Eric Saund MIT AI Lab What can make a profile look like an apple? Early Vision teaches that you must know something if you are going to see. The physics of light, the geometry of the eyes, the smoothness of surfaces, all impose >constraint< on images. It is only through the application of >knowledge< about this structure in the visual world that early vision may invert the imaging process and recover surface orientations, light sources, and reflectance properties. We should take this lesson seriously in attempting intermediate and later vision such as shape understanding. Key to using knowledge in vision is building representations to reflect the structure of the visual world. The mathematically expressed laws of early vision do not help for later vision. How is one to express the constraint on a profile that might qualify it as an apple? In this talk I will discuss steps toward construction of a vocabulary for shape representation rich enough to express the complex and subtle relationships between locations and sizes of boundaries and regions that give rise to object parts and shape categories. I will describe three computational tools, "scale-space", "dimensionality- reduction", and "functional role abstraction", for building symbolic descriptors to capture constraint in shape information. Examples of their use will be shown in a one-dimensional, model, shape domain. ------------------------------ Date: Tue 29 Apr 86 15:51:12-PDT From: Benjamin N. Grosof Subject: Seminar - GRAPHOIDS: A Logical Basis for Dependency Nets (SU) JUDEA PEARL of the UCLA Computer Science Department will be speaking on probabilistic reasoning FRIDAY MAY 2 2:15pm JORDAN 040 GRAPHOIDS: A Logical Basis for Dependency Nets or When would x tell you more about y if you already know z ABSTRACT: We consider statements of the type: I(x,z,y) = "Knowing z renders x independent of y", where x and y and z are three sets of propositions. We give sufficient conditions on I for the existence of a (minimal) graph G such that I(x,z,y) can be validated by testing whether z separates x from y in G. These conditions define a GRAPHOID. The theory of graphoids uncovers the axiomatic basis of probabilistic dependencies and extends it as a formal definition of informational dependencies. Given an initial set of dependency relations, the axioms established permit us to infer new dependencies by non-numeric, logical manipulations, thus identifying which propositions are relevant to each other in a given state of knowledge. Additionally, the axioms may be used to test the legitimacy of using networks to represent various types of data dependency, not necessarily probabilistic. ------------------------------ Date: 29 Apr 1986 1915-PDT (Tuesday) From: Tim Mann Subject: Seminar - Decentralized Naming in Distributed Computer Systems (SU) This is to announce my PhD oral, scheduled for Tuesday May 6, 2:15 pm, building 160, room 163B. Decentralized Naming in Distributed Computer Systems Timothy P. Mann A key component in distributed computer systems is the naming facility: the means by which global, user-assignable names are bound to objects, and by which objects are located given only their names. This work proposes a new approach to the construction of such a naming facility, called \decentralized naming/. In systems that follow this approach, the global name space and name mapping mechanism are implemented by the managers of named objects, cooperating as peers with no central authority. I develop the decentralized naming model in detail and characterize its fault tolerance, efficiency, and security. I also describe the design, implementation, and measured performance of a decentralized naming facility that I have constructed as a part of the V distributed operating system. ------------------------------ Date: Wed, 30 Apr 86 16:30 EST From: SIG%northeastern.edu@CSNET-RELAY.ARPA Subject: Seminar - Learning in Time (Northeastern) Learning in Time Richard Sutton (rich@gte-labs.csnet) GTE Labs, Waltham, Ma. Most machine learning procedures apply to learning problems in which time does not play a role. Typically, training consists of the presentation of a sequence of pairs of the form (Pattern, Category), where each pattern is supposed to be mapped to the associated category, and the ordering of the pairs is incidental. In real human learning, of course, the situation is very different: successive input patterns are causally related to each other, and only gradually do we become sure of how to categorize past patterns. In recognizing spoken words, for example, we may be sure of the word half way through it, after it has all been heard, or not until several words later; our certainty of the correct classification changes and becomes more certain over time. In learning to make such classifications, is it sufficient to just correlate pattern and category, and ignore the role of time? In this talk, I claim that the answer is NO. A new kind of learning is introduced, called Bootstrap Learning, which can take advantage of temporal structure in learning problems. Examples and results are presented showing that bootstrap learning methods require significantly less memory and communication, and yet make better use of their experience than conventional learning procedures. Surprisingly, this seems to be a case where consideration of an additional complication -- the temporal nature of most real-world problems -- results in BOTH better performance AND better implementations. These advantages appear to make bootstrap learning the method of choice for a wide range of learning problems, from predicting the weather to learning evaluation functions for heuristic search, from understanding classical conditioning to constructing internal models of the world, and, yes, even to routing telephone calls. Wednesday, May 14, 12:00 noon 161 Cullinane Hall Sponsored by: College of Computer Science Northeastern University 360 Huntington Ave. Boston, Ma Host: Steve Gallant (sig@northeastern.csnet) ------------------------------ Date: Wed 30 Apr 86 17:08:07-PDT From: LANSKY@SRI-AI.ARPA Subject: Seminar - Characterization and Structure of Events (SRI) THE CHARACTERIZATION AND STRUCTURE OF EVENTS Douglas D. Edwards (EDWARDS@SRI-AI) SRI International, Artificial Intelligence Center 11:00 AM, MONDAY, May 5 SRI International, Building E, Room EJ228 (new conference room) Events were raised to prominence as a basic ontological category in philosophy by Davidson, who used quantified variables ranging over events in the logical analysis of assertions about causality and action, and of sentences with adverbial modifiers. Drew McDermott used the category of events in AI planning research to model changes more complex than state transformations. Despite the common use of events as an ontological category in philosophy, linguistics, planning research, and ordinary language, there is no standard characterization of events. Sometimes, as in Davidson, they are taken to be concrete individuals. Other authors think of them as types or abstract entities akin to facts, propositions, or conditions; as such they are often subjected to truth-functional logical operations, which Davidson considers to be inapplicable. McDermott, following Montague in broad outline, thinks of them as classes of time intervals selected from various possible histories of the world. Other authors emphasize individuation of events not just by time but also by spatial location, by the objects or persons participating, or (Davidson) by their location in a web of causes and effects. In this talk I sketch a scheme for characterizing types of events which illuminates the relationship between type and token events, the internal structure and criteria of individuation of events, and the relationship of events to other categories of entities such as objects, facts, and propositions. Events turn out to be structured entities like complex objects, not simple temporal or spatiotemporal regions or classes of such. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 2 00:42:26 1986 Date: Fri, 2 May 86 00:42:19 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #108 Status: R AIList Digest Thursday, 1 May 1986 Volume 4 : Issue 108 Today's Topics: Queries - Connection Machine Articles, Project Description - Personality Modeling, Techniques - String Reduction, Expert Systems - SeRIES-PC for MS-DOS, Representation - Shape Simulation and Recognition, Linguistics - Xerox vs. xerox ---------------------------------------------------------------------- Date: 29 Apr 86 01:24:43 GMT From: hplabs!sdcrdcf!usc-oberon!bacall!iketani@ucbvax.berkeley.edu (Dana Todd Iketani) Subject: connection machine articles I am looking for some information about the Connection Machine from MIT/Thinking Machines Inc. Could someone send me some pointers for some real articles? Or an article with a good bibliography? I've found plenty of popular literature articles, but the only technical paper I've found is the MIT memo by Hillis. Thanks in advance. d. todd Iketani USENET: usc-cse!iketani ARPANET: IKETANI@USC-ECL ------------------------------ Date: 29 APR 86 1404 UT From: MCLOUH85%IRLEARN.BITNET@WISCVM.WISC.EDU Subject: RESEARCH IN PROGRESS AT UCD IRELAND I am doing research in AI at University College Dublin in Ireland. In the research project we are working on we have set ourselves the goal of developing a system which will play the part of a telephone receptionist in "typed" telephone conversations. In our research we have had to address ourselves to a number of problems in the areas of planning and user modelling. In this note I would like to say something about our work on user modelling. It became clear to us that in the live data which we collected as part of the research that the receptionist seemed to have a very rich model of the people she spoke to. These models were much richer than any we have read about in the AI literature. We discussed a number of the transcripts of conversations with the receptionist and she confirmed that she was using quite detailed models of the people she spoke to. In the vast majority of the cases she had never met these people or spoken to them before the conversations. It appears that quite early on in the conversation she would classify the caller as being of a particular "type" and thereafter she would apply any knowledge she had about that "type" of person to build a basic model of the caller. We have been working on applying this knowledge about stereotypes to the system we are building and we have developed a knowledge structure which we call a Persona. A Persona can contain knowledge about the goals, plans, obligations, beliefs, and props which we associate with a typical member of a class of people. It can also contain knowledge about the types of situations in which we would normally find such people, and the props which we might associate with them. So far we have been working on delevoping Personae which model common occupations, such as , the Salesman, the receptionist, the telephone operator. However, it is our intention in the future to try and develop Personae which model particular attributes such as Friendly, Aggressive etc and to see if we can develop ways of combining these to produce personality models. Well, having given an overview of the work we are doing, I would be grateful if there are any readers who share our interest in Personality modelling and stereotypes who might have any comments to make or who might be able to reccommend particular papers in the area which might be of interest to us. Henry B McLoughlin. Department of Computer Science University College Dublin MCLOUH85@IRLEARN ------------------------------ Date: 24 Apr 86 13:26:37 GMT From: uwvax!harvard!cmcl2!philabs!linus!security!jkm@ucbvax.berkeley.edu (Jonathan K.Millen) Subject: Re: String reduction If you are interested in an applicative Lisp-like language based on string substitution and reduction, you might want to look at "TRAC, A Procedure-Describing Language for the Reactive Typewriter", by Calvin N. Mooers, Comm ACM, Vol. 9, No. 3, March, 1966. Jon Millen ------------------------------ Date: Tue 29 Apr 86 09:41:32-PDT From: Lou Fried Subject: Expert Systems for MS-DOS Please include: SeRIES-PC, language IQLISP, $5,000 SRI International 333 Ravenswood Avenue Menlo Park, CA 94025 Contact: Bob Wohlsen, x 4408 ------------------------------ Date: Tue, 29 Apr 86 15:47 EDT From: Seth Steinberg Subject: Shape -- Simulation and Recognition This hooks, rings and shapes discussion points at that AI contains a lot of simulation. One useful model of AI programming is to view a program as an intertwining of simulation and recognition, especially if you are willing to think of these concepts a bit more generally than ordinarily. - A game playing program will play the game forwards (simulation) and then choose a course of play to follow (recognition). - A logic programming system will follow the ramifications of an assertion by forward chaining (simulation) and then seek a particular fact in the rule base (recognition). - A robotics program will examine its goals and its model of the world (recognition) and then test if a pariticular motion is useful or possible (simulation). (Who was it who wrote in saying that all he needed was an AT function and everything else would be easy?) [That was a quote from Peter Cheeseman's early days. -- KIL] This is not a strict breakdown, but rather a useful insight which explains why certain problems are solved in certain ways. Thinking of part of the program as the simulator and part as the recognizer can reveal two of the conflicting forces in the resolution of the problem. No matter how they are described, there are two fundamental dynamic elements which force the tradeoffs required to engineer a working program. - Anoop Gupta who is working on implementing OPS5-like rule resolution systems on parallel machines noted that programs broke into Problem Space Search which grows exponentially (simulation) which is where the parallelism comes from and Knowledge Space Search which applies the programs knowledge of the domain to restrict the growth rate of parallelism (recognition). - A number of other researchers have broken problem solving into the marshalling of alternatives (simulation) followed by the focussing of attention on the most promising (recognition). Phil Agre argues that one purpose of consciousness is to control the direction of attention to the alternatives. My personal feeling is that AI isn't going to tackled everyday knowledge until it starts simulating everyday things. Steamer, the large steam engine expert contained a gigantic Fortran program (rewritten in Lisp) to simulate the engine. I don't know of any programs that simulate a kitchen. AI has already borrowed a lot of object oriented programming from Simula which is a simulation language. Maybe AI programmers, being forced to deal with the problems of simulation will find other as yet neglected tools. Seth Steinberg ------------------------------ Date: Tue, 29 Apr 86 11:12:48 cdt From: bulko@SALLY.UTEXAS.EDU (Bill Bulko) Reply-to: bulko@sally.UUCP (Bill Bulko) Subject: Re: do not "xerox" this message I don't see what the big deal is about using "xerox" as a verb. I often hear "Coke" used to mean "[virtually any] carbonated soft drink". How often do you order a Coke at a fast-food place and get Pepsi or RC? If anything, the use of "xerox" as a verb is a tribute to the contribution Xerox has made to photocopying. Bill _______________________________________________________________________________ "In the knowledge lies the power." -- Edward A. Feigenbaum "Knowledge is good." -- Emil Faber Bill Bulko The University of Texas bulko@sally.UTEXAS.EDU Department of Computer Sciences ------------------------------ Date: Tue 29 Apr 86 11:40:41-PDT From: Pat Hayes Subject: Trademarks Laws concerning trademark usage aside, De Smedt is perfectly correct in pointing out that the verb 'to xerox', meaning to copy on a dry-xerographic copier, and associated constructions ( a xerox copy, etc. ), are now in fact part of the language. The distinction between 'xerox' and 'Xerox' seems quite clear, and it might be more sensible for the company to insist on 'correct' usage of the latter rather than the former. Its no use, guys, you can't stop people using the word in the way they want to. A dictionary which omitted 'to xerox' would not be accurate. Its an inevitable consequence of the fact that for many years, all the copiers WERE Xerox machines, just like Bics and Kodaks. One can't have no competitors while a new technology is entering the marketplace, and expect not to be identified with it. Especially if one has also invented a neat, original, snappy name for it ( like Bic and Kodak ). Its the price of success. Pat Hayes Schlumberger ( a word which will never enter the language ) ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon May 5 13:37:01 1986 Date: Mon, 5 May 86 13:36:49 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #109 Status: R AIList Digest Friday, 2 May 1986 Volume 4 : Issue 109 Today's Topics: Bibliography - References #4 ---------------------------------------------------------------------- Date: 9 Apr 86 13:21:26 GMT From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs! abc@ucbvax.berkeley.edu (Andy Cheese) Subject: Bibliography - References #4 IDA83a * Ida T. & Sato M. & Hayashi S. & Hagiya M. & Kurokawa T. & Hikita T. & Futatsugi K. & Sakai K. & Toyama Y. & Matsuda T. Higher Order: Its Implications to Programming Languages and Computational Models ICOT Research Center, Technical Memorandum TM-0029 October 1983 IDA84a * Ida T. & Konagaya A. Comparison of Closure Reduction and Combinatory Reduction Schemes. ICOT Technical Report TR-072 August 1984 INGA78a Ingalls D. The Smalltalk-76 Programming System Design and Implementation Proc. SIGPLAN Conf. on Princ. of Prog. Langs., pp 9-15 1978 INMO84a INMOS IMS T424 Transputer Data Card INMOS , Jan 1984 INMO84b INMOS OCCAM Data Card INMOS , June 1984 INMO84c INMOS OCCAM User Group Newsletter No.1 INMOS , Summer 1984 INMO84d INMOS IMS T424 Transputer : Preliminary Data INMOS , August 1984 INMO84e INMOS ltd Occam Programming Manual Prentice Hall International Series in Computer Science January 1984 ISL81a Islam N. & Myers T.J. & Broome P. A Simple Optimiser for FP-like Languages Proc. ACM Conf. on Functional Programming Languages and Computer Architecture, New Hampshire, pp 33-40 october 1981 ITO83a * Ito N. & Masuda K. Parallel Inference machine Based on the Data Flow Model ( Also in "Proceedings of Int'l Workshop on High-Level Computer Architecture", Los Angeles, 1984 ) ICOT Research Center, Technical Report TR-033 December 1983 ITO83b Ito N. & Masuda K. & Shimizu H. Parallel Prolog Machine Based on the Data Flow Model ICOT Research Center, Technical report TR-035 September 1983 ITO83c * Ito N. & Onai R. & Masuda K. & Shimizu H. Prolog Machine Based on the Data Flow Mechanism ICOT Research Center, Technical Memorandum TM-0007 May 1983 IWAT84a Iwata K. & Kamiya S. & Sakai H. & Matsuda S. & Shibayama S. & Murukami K. Design and Implementation of a Two-Way Merge Sorter and its Application to Relational Database Processing ICOT Research Center, Technical Report TR-066 May 1986 JARO86a * Jarosz J. & Jawarowski J.R. Computer Tree - The Power of Parallel Computations Computer Journal, Vol 29, No 2, pp 103-108 April 1986 JAYA80a Jayaraman B. & Keller R.M. Resource Control in a Demand-Driven Data-Flow Model In Proc. International Conf. on Parallel Processing, IEEE 1980 JAYA82a Jayaraman B. & Keller R.M. Resource Expressions For Applicative Languages International Conf. on Parallel Processing, IEEE August 1982 JEFF85a * Jeffrey T. The "mu"PD7281 Processor Byte Magazine, Vol 10, no 12, November 1985 JESS86a * Jesshope C. VLSI and Beyond in BCS86a 1986 JESS86b * Jesshope C. The Transputer - Microprocessor or Systems Building Block in BCS86a 1986 JOHN77a Johnson S.D. An Interpretive Model For A Language Based On Suspended Construction M.S. Thesis, Indiana Univ, Bloomington, In. 1977 JOHN81a Johnsson T. Detecting When Call By Value can be Used Instead of Call By Need LPM Memo 14, Chalmers Inst., Sweden October 1981 JOHN83a Johnsson T. The G-Machine. An Abstract Machine for Graph Reduction Declarative Programming Workshop , University College London, April 1983 JOHN86a * Johnsson T. Attribute Grammars and Functional Programming 86-02-20 JONE82a * Jones N.D. & Muchnick S.S. A Fixed-Program Machine for Combinator Expression Evaluation Proc. of ACM LISP Conf 1982 p11-20 JONE83a * Jones S.B. Abstract Machine Support For Purely Functional Operating Systems Technical Monograph PRG-34, Programming Research Group, Oxford Univ. August 1983 JONK81a * Jonkers H.B.M. Abstract Storage Structures Mathematisch Centrum iw 158/81 1981 KAHN77a * Kahn G. & MacQueen D.B. Coroutines and Networks of Parallel Processes IFIP 77, ed. Gilchrist B. , pp 993-998 North Holland 1977 KAMI84a * Kamimura T. & Tang A. Total Objects of Domains Theoretical Computer Science, pp 275-288 1984 KARI84a * Karia R.J. Compiling a Functional Language into Combinators for a Reduction Machine Computer Science Research Memo no 111 G.E.C. Hirst Research Centre, Computer Science Research Group 6th March 1984 KARP66a * Karp R.M. & Miller R.E. Properties of a Model for Parallel Computations : Determinacy, Termination, Queueing SIAM Journal on Applied Mathematics, Vol 14, no 6 pp 1390-1411 November 1966 KATE84a Katevenis M.G.H. & Sherburne R.W. & Patterson D.A. & Sequin C.H. The RISC II Micro-Architecture Journal of VLSI and Computer Systems, 1(2) 1984 KATU83a Katuta T. & Miyazaki N. & Shibayama S. & Yokota H. & Murukami K. A Relational Database Machine "Delta" - IPSJ Translation ICOT Research Center, Technical Memorandum TM-0008 May 1983 KAUB82a Kaubisch W.H. & Hoare C.A.R. Discrete Event Simulation Based on Communicating Sequential Processes in BROY82a, pp 625-642 1982 KELL79a Keller R.M. & Lindstrom G. & Patil S. A Loosely Coupled Applicative Multi-Processing System AFIPS Conference Proceedings June 1979 KELL80a Keller R.M. & Lindstrom G. & Patil S. Data-Flow Concepts for Hardware Design In IEEE Compcon (VLSI - New Architectural Horizons) February 1980 KELL80b Keller R.M. & Lindstrom G. Hierarchical Analysis of a Distributed Evaluator 1980 Int. Conf. on Parallel Processing, IEEE August 1980 KELL80c Keller R.M. Some Theoretical Aspects of Applicative Multiprocessing In LNCS Proc. Mathematical Foundations of Computer Science 1980 KELL80d Keller R.M. & Lindstrom G. Parallelism in Functional Programming Through Applicative Loops Document 1980 KELL80e Keller R.M. Data Structuring in Applicative Multiprocessing Systems Proc. 1980 LISP Conf. p196-202 KELL81a Keller R.M. & Yen W.J. A Graphical Approach to Software Development Using Function Graphs Proc. Compcon 1981, IEEE 1981 KELL81b Keller R.M. & Lindstrom G. Applications of Feedback in Functional Programming Symp. on Functional Langs. and Computer Arch., Chalmers Univ. June 1981 KELL82a * Keller R.M. & Sleep R.S. Applicative Caching Document, Dept. of Computer Science, University of Utah,July 1982 KELL84a Keller R.M. & Lin F.C.H. Simulated Performance of a Reduction-Based Multiprocessor Computer 17(7), July 1984 KELL85a Keller R.M. FEL (Function-Equation Language) Programmers Guide AMPS Technical Memorandum No 7, April 1985 KELL85b Keller R.M. & Lin F.C.H. & Badovinatz The Rediflow Simulator Internal Memorandum, April 1985 KELL85c Keller R.M. & Lindstrom G. Approaching Distributed Database Implementations Through Functional Programming Concepts Proc. 5th Int. Conf. on Distributed Computing Systems, IEEE, Denver May 1985 KELL85d Keller R.M. Distributed Computation by Graph Reduction Systems Research Pergammon Press March 1985 KENN82a * Kennaway J.R. & Sleep M.R. Expressions as Processes Proc. of ACM LISP Conf 1982 p21-28 1982 KENN82b * Kennaway J.R. & Sleep M.R. Applicative Objects as Processes 3rd Int. Conf. on Distributed Computing Systems, Miami, Oct 1982 KENN82c * Kennaway J.R. & Sleep M.R. Director Strings as Combinators Document, Computer Studies Centre, University of East Anglia,July 1982 KENN82d * Kennaway J.R. The Complexity of a Translation of Lambda-Calculus to Combinators Document, Computer Studies Centre, University of East Anglia,June 1982 KENN83a * Kennaway J.R. & Sleep M.R. Novel Architectures for Declarative Languages Software & MicroSystems Vol 2 No 3 p59-70 June 1983 KENN83b * Kennaway J.R. & Sleep M.R. Syntax and Informal Semantics of DyNe, a Parallel Language Document, Computer Studies Centre, University of East Anglia, Nov 1983 KENN84a Kennaway J.R. An Outline of Some Results of Staples on Optimal Reduction orders in Replacement Systems Internal Report CSA/19/1984 Declarative Systems Architecture Group-4 Univ. of East Anglia 20 March 1984 KENN84b Kennaway J.R. & Sleep M.R. Efficiency of Counting Director Strings Internal Report CSA/14/1984 Declarative Systems Architecture Group-2 Univ of East Anglia May 17 1983 1984 KENN84c Kennaway J.R. & Sleep M.R. Counting Director Strings (Draft) unpublished Univ of East Anglia October 31, 1984 KENN85a Kennaway J.R. & Sleep M.R. A Denotational Semantics for First-Class Processes (Draft) Univ of East Anglia Submitted for publication August 1985 KENN86a * Kennaway J.R. Recursive Normalising L-Strategies For Combinatory Reduction Systems School of Information Systems, University of East Anglia March 21, 1986 KIEB81a Kieburtz R.B. & Shultis J. Transformations of FP Program Schemes Proc. ACM Conf. on Functional Programming Languages and Computer Architecture, New Hampshire, pp 41-48 October 1981 KIEB85a Kieburtz R.B. The G-Machine: A Fast Graph-Reduction Evaluator Oregon Graduate Center Technical Report CS/E-85-002 1985 KITA83a Kitakami H. & Furukawa K. & Takeuchi A. & Yokota H. & Miyachi T. & Kunifuji S. A Knowledge Assimilation Method for Logic Databases ( Also in "Proceedings of International Symposium on Logic Programming", Atlantic City, U.S.A., 1984, IEEE Computer Society Press ) ( Also in New Generation Computing, Vol 2, No 4, 1984 ) ICOT Research Center, Technical Report TR-025 September 1985 KITA83b Kitakami H. & Kunifuji S. & Miyachi T. & Furukawa K. A Methodology for Implementation of a Knowledge Acquisition System ( Also in "Proceedings of International Symposium on Logic Programming", Atlantic City, U.S.A., 1984, IEEE Computer Society Press ) ICOT Research Center, Technical Report TR-037 December 1983 KITA83c Kitakami H. & Kunifuji S. & Miyachi T. & Furukawa K. A Methodology for Implementation of a Knowledge Acquisition System ICOT Research Center, Technical Memorandum TM-0024 August 1983 KITS84a Kitsuregawa M. & Tanaka H. & Moto-oka T. Relational Algebra Machine GRACE Faculty of Eng, Dept of Information Eng, Univ of Tokyo KLEE50a Kleene S.C. Introduction to Metamathematics Von Nostrand, Princeton, 1950 KLUG79a Kluge W.E. The Architecture of A Reduction Machine Hardware Model Gesellschaft Fur Mathematik und Datenverarbeitung MBH Bonn Tech Rep ISF-Report 79.03, August 1979 KLUG83a * Kluge W.E. Cooperating Reduction Machines IEEE Transactions on Computers, vol c-32, no 11 pp 1002-1012 November 1983 KNUT70a Knuth D.E. & Bendix P.B. Simple Word Problems in Universal Algebra in "Computational Problems in Abstract Algebra" (ed. Leech J.) pp 263-297 Pergamon Press 1970 KOND84a Kondou H. Plan for Constructing Knowledge Architecture ICOT Research Center, Technical Report TR-078 September 1984 KOTT75a Kott L. About a Transformation System - A Theoretical Study Proc. 3rd Symposium on Programming, Paris 1975 KOWA74a Kowalski R. Predicate logic as a Programming Language Proc. IFIP, pp 569-574 1974 North Holland KOWA79a Kowalski R. Logic for Problem Solving North Holland 1979 KOWA79b Kowalski R. Algorithm=Logic+Control CACM Vol 22 No 7 p424-436 July 1979 KOWA80a Logic as A Computer Language Infotech State of the Art Conference on Software Development Techniques 1980 KOWA82a Kowalski R. Logic Programming Department of Computing, Imperial College (Later Presented at IFIP 83, pp 133- 145, North Holland) KOWA85a Kowalski R. The Relationship Between Logic Programming and Logic Specification in HOA85a 1985 KUCH84a * Kucherov G.A. An Algorithm To Recognize Sufficient Completeness Of Algebraic Specification Of An Abstract Data Type Programming and Computer Software, 10, pp 161-168 1984 KULK86a * Kulkarni K.G. & Atkinson M.P. EFDM: Extended Functional Data Model Computer Journal, Vol 29, no 1, pp 38-46 1986 KUNI82a Kunifuji S. & Yokota H. PROLOG and Relational Data Bases For Fifth Generation Computer Systems ( Also in "Proceedings of CERT Workshop on Logical Bases for Databases", France, 1982 ) ICOT Research Center, Technical Report TR-002 September 1982 KUNI83a Kunifuji S. & Enomoto H. & Yonezaki N. & Saeki M. Paradigms of Knowledge Based Software System and Its Service Image ( Also in Third Seminar on Software Engineering, Florence, 1983 ) ICOT Research Center, Technical Report TR-030 November 1983 KUNI84a ed. Kunii T.L. VLSI Engineering Springer Verlag 1984 KURO84a Kurokawa T. & Tojyo S. Coordinator - the Kernel of the Programming System for the Personal Sequential Inference Machine (PSI) ICOT Research Center, Technical report TR-061 April 1984 KUSA84a * Kusalik A.J. Serialization of Process Reduction In Concurrent Prolog New Generation Computing 2, pp 289-298 Springer-Verlag 1984 LAMP81a Lampson B.W. & Pier K.A. A Processor for a High-Performance Personal Computer CSL-81-1 , Xerox PARC, Jan 1981 LAMP81b Lampson B.W. & McDaniel G.A. & Ornstein S.M. An Instruction Fetch Unit for a High-Performance Personal Computer CSL-81-1 , Xerox PARC, Jan 1981 LAND63 Landin P.J. The Mechanical Evaluation of Expressions Computer Journal 6(4), pp 308-320 (also see A Lambda Calculus Approach in "Advances in Programming and Non-Numerical Computation" ed. Fox L., p 67, Pergammon Press, Oxford, 1966) 1963 LAND65 Landin P.J. A Correspondence Between Algol 60 and Church's Notation CACM 8, p89 1965 LAND66 Landin P.J. The Next 700 Programming Languages CACM Vol 9, no 3, pp 157-166, march 1966 LASS85a * Lassez J. -L. & Maher M.J. Optimal Fixedpoints of Logic Programs Theoretical Computer Science 39, pp 15-25 1985 LEHM81 Lehman M.M. The Environment of Program Development and Maintenance- Programs, Programming and Programming Support Report 81/2 Dept of Computing, Imperial College 1981 LESC83a * Lescanne P. Behavioural Categoricity of Abstract Data Type Specifications Computer Journal, Vol 26, no 4, pp 289-292 1983 LI84a Li Deyi J. A Prolog Database System New York : John Wiley and Sons 1984 LIEB80 Lieberman H. & Hewitt C.E. A Real Time Garbage Collector That Can Recover Temporary Storage Quickly AI Memo 569, MIT Lab, Cambridge, 1980 LIEB83 Lieberman H. & Hewitt C. A Real-Time Garbage Collector Based on the Lifetimes of Objects CACM Vol 26 No. 6 p419-429 ,June 1983 LIND81 Lindstrom G. & Wagner R. Incremental Recomputation on Data-Flow Graphs Symposium on Functional Langs and Comp. Arch., Goteborg Univ. 1981 LIND83 Lindstrom G. & Hunt F.E. Consistency and Currency in Functional Databases Proc. Infocom 83, IEEE, San Diego April 1983 LIND84a Lindstrom G. OR-Parallelism on Applicative Architectures In Proc. 2nd International Logic Programming Conf., Uppsala Univ. July 1984 LIND84b Lindstrom G. & Panangaden P. Stream-Based Execution of Logic Programs Proc. 1984 Int'l Symp. on Logic Programming February 1984 LIND85a Lindstrom G. Functional Programming and The Logical Variable In Symposium on Principles of Programming Languages, ACM January 1985 LIND85b Lindstrom G. Rule-Based Programming on Fifth Generation Computers Proc. A.I. and Advanced Computer Technology Conf., Long Beach June 1985 LINS85a * Lins R.D. The Complexity of a Translation of Lambda-Calculus to Categorical Combinators University of Kent Computing Laboratory Report No 27 April 1985 LINS85b * Lins R.D. A New Formula For The Execution of Categorical Combinators University of Kent Computing Laboratory Report No 33 November 1985 LINS85c * Lins R.D. On The Efficiency of Categorical Combinators as a Rewriting System University of Kent Computing Laboratory No 34 November 1985 LINS85d Lins R.D. A New Way of Introducing Constants in Categorical Combinators Privately Circulated Computer Laboratory, Univ of Kent 1985 LOEC84a * Loeckx J. & Sieber K. The Foundations of Program Verification Wiley-Teubner Series in Computer Science John Wiley and Sons 1984 LONG76a * Longo G. & Venturini Zilli M. A Theory of Computation With an Identity Discriminator Proceedings 3rd International Colloquium on Automata Languages and Programming pp 147-167 Edinburgh University Press, 1976 MACQ84a * MacQueen D. Modules for Standard ML Proceedings of 1984 ACM Symposium on Lisp and Functional Programming Austin, Texas pp 198-207 1984 MAGO79a Mago G.A. A Network of R Microprocessors To Execute Reduction Languages Int. Journal of Computer and Information Sciences Vol 8 no 5 and Vol 8 no 6 1979 MAGO80a Mago G.A. A Cellular Computer Architecture For Functional Programming Proc. IEEE Compcon , pp 179-187 1980 MAIB85a * Maibaum T.S.E. Database Instances, Abstract Data Types and Database Specification Computer Journal, Vol 28, no 2, pp 154-161 1985 MAL84a Malpas John & O'Leary Kathy Declarative Languages Under Unix Microsystems, August 1984, page 94 MAL85a Malpas John Prolog as a unix system tool unix/world vol II no 6 july '85 pp 48-53 MANNA73a Manna Z. & Ness S. & Vuillemin J. Inductive Methods For Proving Properties Of Programs CACM , August, 1973 MANNA82a Manna Z. Verification of Sequential Programs: Temporal Axiomatization in BROY82a, pp 53-101 1982 MANNI85a * Mannila H. & Mehlhorn K. A Fast Algorithm For Renaming a Set of Clauses as a Horn Set Information Processing Letters, Vol 21, No 5, pp 269-272 November 1985 MANU83a * Manuel T. & Evanczuk S. Commercial Products Begin to Emerge From Decades of Research Electronics, November 3, 1983, pp 127-131 1983 MANU83b * Manuel T. Lisp and Prolog Machines are Proliferating Electronics, November 3, 1983, pp 132-137 1983 MARK77a Markusz Z. How to Design Variants of Flats Using Programming Logic-PROLOG based on Mathematical Logic Information Processing 77, North Holland 1977 MARK85a * Markusz Z. & Kaposi A.A. Complexity Control in Logic-Based Programming Computer Journal, Vol 28, no 5, pp 487-495 1985 MART85 Martin-Lof P. Constructive Mathematics and Computer Programming in HOA85a 1985 MARU84a Maruyama F. & Mano I. & Hayashi K. & Kakuta T. & Kawado N. & Uehara T. Prolog-Based Expert System For Logic Design ICOT Research Center, Technical Report TR-058 April 1984 MATT70 Mattson R.L. & Gecsei J. & Slutz D.R. & Traiger I.L. Evaluation Techniques for Storage Heirarchies IBM Syst. J. Vol9 1970 p78-117 MAY83a May D. & Taylor R. OCCAM INMOS Limited, 1983 MAY83b May D. OCCAM ACM Sigplan Notices Vol 18 no 4, pp 69-79 1983 McCAB83 McCabe F.G. Abstract PROLOG Machine- a Specification Document Jan. 1983 McCAB85a McCabe F.G. Lambda PRLOG Internal Report, Department of Computing, Imperial College 1985 McCAR60 McCarthy J. Recursive Functions Of Symbolic Expressions And Their Computation By Machine, Part 1 CACM, April, 1960 McCAR62 McCarthy J. et al LISP 1.5 Programmers Manual MIT Press, 1962 McCAR63 McCarthy J. A Basis For A Mathematical Theory of Computation In Computer Programming and Formal Systems (eds. Brafford P. & Hirschuerg D.) North Holland 1963 McCAR78 McCarthy J. The History of LISP Proceedings of SIGPLAN History of Programming Languages Conference, 1978 MEIR82a * Meira S.L. Sorting Algorithms in KRC Implemented in a Functional Programming System University of Kent Computing Laboratory Report No 14 August 1982 MEIR83 Meira S.R.L. Sorting Algorithms in KRC: Implementation, Proof and Performance Computing Laboratory Rep no. 14, Univ. of Kent at Canterbury, 1983 MEIR84a Meira S.R.L. A Linear Applicative Solution To The Set Union Problem Computing Laboratory Tech Rep. no 23, Univ. of Kent at Canterbury 1984 MEIR84b * Meira S.R.L. Optimized Combinatoric Code for Applicative Language Implementation Computing Laboratory Tech Rep. no 20, Univ. of Kent at Canterbury April 1984 MEIR85a * Meira S.R.L. On the Efficiency of Applicative Algorithms Phd Thesis Univ. of Kent at Canterbury March 1985 MEIR85b * Meira S.L. A Linear Applicative Solution for The Set Union Problem University of Kent Computing Laboratory Report No 28 May 1985 MEIR85c * Meira S.L. A Linear Applicative Solution for the Set Union Problem Information Processing Letters 20, pp 43-45 2 January 1985 MESE85a * Meseguer J. & Goguen J.A. Deduction with Many-Sorted Rewrite Center for the Study of Language and Information, Stanford University Report No CSLI-85-42 December 1985 MILN78 Milner R. A Theory of Type Polymorphism in Programming J. Computer System Sci 17, pp 348-375 1978 MILN84a * Milner R. A Proposal For Standard ML Proceedings of 1984 ACM Symposium on Lisp and Functional Programming Austin, Texas pp 184-197 1984 MILN85a Milner R. The Use of Machines to Assist in Rigorous Proof in HOA85a 1985 MISH84a Mishra P. & Reddy U.S. Static Inference of Properties of Applicative Programs In 11th Annual Symp. on Principles of Programming Languages, ACM January 1984 MISH85a Mishra P. & Reddy U.S. Declaration-Free Type Checking In Symp. on Principles of Programminmg Languages, ACM January 1985 MIYA82a Miyazaki N. A Data Sublanguage Approach to Interfacing Predicate Logic Languages and Relational Databases ICOT TM-001 MIYA84a Miyazaki N. & Kakuta T. & Shibayama S. & Yokota H. & Murukami K. An Overview of Relational Database Machine Delta ICOT Research Center, Technical Report TR-074 August 1984 MIZO85a Mizoguchi F. & Furukawa K. Guest Editors' Preface New Generation Computing Vol 3 No 4, pp 341-344 1985 MOIT85a * Moitra A. Automatic Construction of CSP Programs From Sequential Non-Deterministic Programs Science of Computer Programming 5 , p277-307 1985 MOKH84a Mokhoff N. Parallelism Makes a Strong Bid for Next Generation Computers Computer Design Vol 23 No 10 Sept 1984 MOON84a * Moon D. A. Garbage Collection in a Large LISP System Proc. of 1984 ACM Conf. on Lisp and Functional Programming Austin, Texas pp 235-246 1984 MOOR80a Moor I. & Darlington J. A Formal Synthesis Of An Efficient Implementaion For An Abstract Data Type Internal Report, Dept of Computing, Imperial College 1980 MOOR85a * Moore R.C. Possible-World Semantics for Autoepistemic Logic Center for the Study of Language and Information, Stanford University Report No CSLI-85-41 December 1985 MORR73 Morris J.H. Types are not Sets Proc. ACM Symp. on Princ. of Prog. Langs., pp 120-124, october 1973 MORR80a Morris J.H. & Schmidt E. & Wadler P. Experience with an Applicative String Processing Language Proc. 7th Annual SIGACT-SIGSOFT Symp. on Princ. of Prog. Langs, Las Vegas, Nevada, 1980 1980 MORR80b Morris F.L. & Schwarz J.S. Computing Cyclic List Structures Proc. of 1980 LISP Conf. p144-153 MORR82a Morris J.H. Real Programming in Functional Languages in DARL82a 1982 MORR82b Morris J.M. A General Axiom of Assignment in BROY82a, pp 25-34 1982 MORR82c Morris J.M. Assignment and Linked Data Structures in BROY82a, pp 35-41 1982 MORR82d Morris J.M. A Proof of the Schorr-Waite Algorithm in BROY82a, pp 43-51 1982 MOTO83a Moto-oka T. Overview of the Fifth Generation Computer System Project Proc. 10th Annual International Symposium on Computer Architecture, SIGARCH 11(3) ,p417-422 1983 MUKA83a Mukai K. & Furukawa K. An Ordered Linear Resolution Theorem Proving Program in Prolog ( Also in "Proceedings of IJPS National Conference", 1983 ) ICOT Research Center, Technical Memorandum TM-0027 September 1983 MUKA85a Mukai K. & Yasukawa H. Complex Indeterminates in Prolog and its Application to Discourse Models New Generation Computing, Vol 3, No 4, pp 441-466 1985 MURA83 Murakami K. A Relational Data Base Machine: First Step to Knowledge Base Machine Proc. 10th Annual International Symposium on Computer Architecture, SIGARCH 11(3) ,p423-425, Sweden 1983 Also ICOT Research Center, Technical Report TR-012 ( co authors cited here : Katuta T. & Miyazaki N. & Shibayama S. & Yokota H. ) May 1985 MUSS77 Musser D.R. A Data Type Verification System based on Rewrite Rules Proc. of 6th Texas Conference on Computing Systems, Austin, Texas, November 1977 MYCR81a * Mycroft A. Abstract Interpretation and Optimising Transformations for Applicative Programs PhD Thesis, Univ of Edinburgh 1981 MYCR83 Mycroft A. & Nielson F. Strong Abstract Interpretation Using Power Domains (Extended Abstract) Proc 10th Int. Colloq. on Automata, Languages and Programming Barcelona, Spain, 18-22 July, 1983, pp 536-547 Springer Verlag LNCS no 154 (ed. Diaz J.) 1983 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon May 5 13:37:13 1986 Date: Mon, 5 May 86 13:37:04 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #110 Status: R AIList Digest Friday, 2 May 1986 Volume 4 : Issue 110 Today's Topics: Queries - Common LISP Coding Standards & Neural Networks, Literature - Connection Machine Article, AI Tools - Expert Systems Software for MS-DOS, Anthology - Genetic Algorithms and Simulated Annealing, Linguistics - OpEd & Italo Calvino AI Project & Trademarks ---------------------------------------------------------------------- Date: Thu, 1 May 86 8:49:14 EDT From: Marty Hall Subject: RE: Common LISP coding standards Hugh Mcguire writes: > Perhaps Marty Hall was seeking some guide to LISP style, similar to > Legard's (et al.'s) *Pascal with Style*; I certainly would find such > useful, and perhaps others would also... Yes! That is exactly what I am looking for, and so far have recieved only meager replies. The type of points Hugh mentioned are exactly the types of questions we want to have standards on. Anyone have anything? -Marty Hall Arpa: hall@hopkins uucp ...seismo!umcp-cs!jhunix!ins_amrh ------------------------------ Date: 29 Apr 86 23:59:35 GMT From: ihnp4!mhuxt!js2j@ucbvax.berkeley.edu (sonntag) Subject: neural networks A recent issue of 'Science' had an article on 'neural networks', which, apparently consist of a highly interconnected repetition of some sort of simple 'nodes' with an overall positive feedback and some sort of randomness thrown in for good measure. When these networks are 'powered up', the positive feedback quickly forces the system into a stable state, with each node either 'on' or 'off'. The article claimed that some simulations of moderate sized (10K nodes?) networks had been done, and reported some rather amazing results. For one thing, it was discovered that if just 50 out of 10k nodes are preset to a particular value, the network has just ~100 very similar stable states, out of 10**1000 possibilities. They also claimed that one such system was able to arrive at a 'very good' solution to arbitrary 'traveling salesman' problems! And that another network (hooked to a piece of equipment which could produce phonemes, and presumably some kind of feedback) had been 'trained' to read english text reasonably well. They said incredibly little about the actual details of how each node operates, unfortunately. So how about it? Has anybody else heard of these things? Is this really a way of going about AI in a way which *may* be similar to what brains do? Just exactly what algorithms are the nodes implementing, and how do you provide input and get output from them? Does anyone know where I could get more information about them? Jeff Sonntag ihnp4!mhuxt!js2j -- Jeff Sonntag ihnp4!mhuxt!js2j [I will send Jeff a copy of our January discussion on the connectionist speech learning project. -- KIL ] ------------------------------ Date: Thu 1 May 86 14:29:06-CDT From: Jonathan Slocum Subject: Connection Machine article Hillis has written a book entitled "The Connection Machine." It's generally available: I purchased a copy recently. ------------------------------ Date: Thu 1 May 86 14:49:50-CDT From: CMP.BARC@R20.UTEXAS.EDU Subject: Re: Expert systems software for MS-DOS I hope my Macintosh forgives me for this, but here goes! I have a few additions to Paul Chisholm's list of expert systems products for IBM PC's. Since there were so many items, I decided to send them directly to AIList, as well as to Mr. Chisholm. I have included a number of AI language implementations, including Lisp's since he isolated xlisp for some reason. Also I've included a few decision support systems, which aren't really AI or expert system by-products. But they often do just as much as expert system shells, and some of the vendor's are even marketing them as AI, so what the heck. I haven't read Mr. Chisholm's list all that carefully, but I did notice some minor errors: Personal Consultant Plus is written in PC Scheme (not in IQLisp); Mountain View Press's Expert is now known as Expert-2; what he refers to as expert systems are in fact expert system shells or development tools. Some specific expert systems are being marketed, however (a couple of which are on my list below). The names, addresses, phone numbers, and especially prices are not guaranteed to be free from typos, line noise, or obsolecence. I have litlle experience or further information on any of these packages. So please don't address questions to -- call the companies. Now, what you've all been waiting for: AL/X: Expert system shell ALCS: Expert system shell Inference Manager: Expert system shell, 500 pounds Intelligent Terminals Ltd 15 Canal St. Oxford, UK OX26BH Also: George House 36 North Hanover St. Glasgow, Scotland G1 2AD 041-552-1353 (These might be available from Jeffrey Perrone & Associates) apes: Expert system shell [micro-Prolog], $250 Programming Logic Systems 312 Crescent Dr. Milford, CT 06460 (203) 877-7988 ERS: Expert system shell PAR Technology Corp. 220 Seneca Turnpike New Hartford, NY 13413 GEN-X: Expert system shell General Electric Research and Development Center Schenectady, NY 12345 K:base: Expert system shell GCLisp (Golden Common Lisp), $495 Gold Hill Computers 163 Havard St. Cambridge, MA 02139 (404) 565-0771 M.1A: Expert system shell, $2000 Teknowledge Inc. 525 University Ave. Palo Alto, CA 94301 415-327-6640 Savior: Expert System Shell, 3000 pounds ISI Limited 11 Oakdene Road Redhill, Surrey, UK RH16BT (0737)71327 SeRIes PC: Expert system shell, $15,000 SRI International Advanced Computer Systems Division 333 Ravenswood Avenue Menlo Park, CA 94025 (415) 859-2859 TOPSCI: Expert system shell, $75/$175 Dynamic Master Systyems Inc. PO Box 566456 Atlanta, GA 30356 (404) 565-0771 Micro In-Ate: Expert system shell for fault diagnosis, $5000 Automated Reasoning Corporation 290 West 12th St., Suite 212-252 New York, NY 10014 (212) 206-6331 TK!Solver: Symbolic math expert, $399 Lotus/Software Arts 27 Mica Lane Wellesley, MA 02181 (617) 237-4000 Comprehension: Expert system for thought analysis, $75 Thunderstone Corp. PO Box 839 Chesterland, OH 44026 (216) 729-1132 Arborist: Decision support, $595 PC Scheme: Lisp, $95 Texas Instruments PO Box 809063 Dallas, TX 75380-9063 (800) 527-3500 Expert Choice: Decision support, $495 Decision Support Software Inc. 1300 Vincent Place McLean, VA 22101 (703) 442-7900 Lightyear: Decision support, $495 Lightyear, Inc. 1333 Lawrence Expwy., Bldg. 210 Santa Clara, CA 95051 (408) 985-8811 Byso Lisp, $125 Levien Instrument Co. Sittlington Hill PO Box 31 McDowell, VA 24458 (703) 396-3345 Q'NIAL: Nested Interactive Array Language, $395/$995 Starwood Corporation PO Box 160849 San Antonio, TX 78280 (512) 496-8037 Methods: SmallTalk, $250 Digitalk Inc. 5200 West Century Blvd. Los Angeles, CA 90045 (213) 645-1082 IQLisp, $175 Integral Quality 6265 Twentieth Avenue (or POB 31970) Seattle, WA 98115 (206) 527-2918 LISP/80, $40 Software Toolworks 15233 Ventura Blvd., Suite 1118 Sherman Oaks, CA 91403 (818) 986-4885 LISP/88, $50 Norell Data Systems PO Box 70127 3400 Wilshire Blvd Los Angeles, CA 90010 (213) 748-5978 muLisp-85, $250 Microsoft Corp. 10700 Northup Way Box 97200 Bellevue, WA 98004 (206) 828-8080 PSL (Portable Standard Lisp), Distribution costs ($75?) The Utah Symbolic Computation Group Department of Computer Science University of Utah Salt Lake City, UT 84112 TLC-Lisp, $250 The Lisp Co. PO Box 487 Redwood Estates, CA 95044 (408) 426-9400 UO-Lisp, $150 Northwest Computer Algorithms PO Box 90995 Long Beach, CA 90809 (213) 426-1893 Waltz Lisp, $169 ProCode International 15930 SW Colony Place Portland, OR 97224 (503) 684-3000 There are some reasonable reviews of AI tools and languages for the IBM PC in "Computer Language", July and August, 1985. The October 1985 issue of "Expert Systems" contains surveys and descriptions of expert system shells and languages on micros. The books "Understanding AI" (H.C. Mishkoff) and "Expert Systems: AI in Business" (P. Harmon and D. King) also have useful information about expert system products on the IBM PC. Dallas Webster CMP.BARC@R20.UTexas.Edu {ihnp4 | seismo | ctvax}!ut-sally!batman!dallas ------------------------------ Date: Thu 1 May 86 11:54:01-PDT From: Matt Heffron Subject: Another PC Expert System Application SpinPro (tm) $2500 written in GCLISP Plans Ultracentrifugation experiments for bio-tech lab Beckman Instruments, Inc. Spinco Division (415)-857-1150 (sales info) (714)-961-3728 (technical info) Matt Heffron ------------------------------ Date: Thu 1 May 86 15:50:52-EDT From: DDAVIS@G.BBN.COM Subject: Anthology - Genetic Algorithms and Simulated Annealing GENETIC ALGORITHMS AND SIMULATED ANNEALING, Call For Papers The Pitman Series of Research Notes in Artificial Intelligence (Derek Sleeman and N.S. Sridharan, Senior Editors) will publish a volume of papers entitled "Genetic Algorithms and Simulated Annealing" early in 1987. The volume will be edited by David Davis of Bolt Beranek and Newman and will be refereed by experts in the fields of genetic algorithms and simulated annealing. Submissions to the volume are invited. Papers should be no more than 20 pages in length, should be primarily concerned with one or both of the two fields of research, and should conform to accepted editorial standards. In order to submit a paper, mail four copies to (Lawrence) David Davis BBN Laboratories Incorporated 10 Moulton Street Cambridge, MA 02238. In order to prepare and publish the volume on time, we will not be able to consider papers postmarked after September 30, 1986. For further information, contact David Davis at (617) 497-3120, or send electronic mail to ddavis@bbng. ------------------------------ Date: Thu, 1 May 86 08:30:38 cdt From: porter@fall.cs.UTEXAS.EDU Subject: Colloq at UTexas It appears to be necessary to present an alternate opinion of the colloquium presented by Sergio Alvarado at UTexas on April 22. We do NOT agree with the evaluation written by Aaron Temin and posted to this bulletin board on April 24. Mr. Temin is a graduate student in the computer sciences department. We believe that his critical review was inaccurate. Alvarado's colloquium reviewed his PhD dissertation research at UCLA (under Michael Dyer). His research presents a computational model for comprehension of arguments, such as those in letters to the editor of a newspaper. Alvarado's system, called OpEd, recognizes the structure of arguments as a critical first step in their comprehension. For example, Alvarado reviewed an example of an editorial by Milton Friedman which argues that restriction of foreign imports will have negative consequences for employment. From natural language input, OpEd recognizes this editorial as an instance of the "plan achieves the opposite of the desired effect" argument structure. OpEd uses bottom-up processing to instantiate argument structures and top-down processing to disambiguate interpretation using a (partially) instantiated structure. The important contributions of Alvarado's research thus far include a collection of general argument structures and a computational model for recognition of a particular argument structure in text. Alvarado is investigating the extension of this research to include argument evaluation and teaching of argumentation skills. In summary, Alvarado's research is an extension of "knowledge-rich" NLP into a challenging domain. Significant results were obtained and promising research directions illuminated. Robert Simmons Ben Kuipers Bruce Porter ------------------------------ Date: 2 May 86 04:44:05 GMT From: brahms!gsmith@ucbvax.berkeley.edu (Gene Ward Smith) Subject: Italo Calvino AI project I must apologize to Bandy for posting a genuine rumor to net.rumor, but this is a real rumor I found on net.followup: >I have it on good authority (although second-hand) that an entire >*novel* was generated by computer. It was the result of a research >project which aimed to "parameterize" an author's writing style. The >study concentrated primarily on one author, Italo Calvino, and I have >heard that the novel, "If on a winter's night a traveller", was actually >published and marketed with Calvino's blessing. [Jack Orenstein] ucbvax!brahms!gsmith Gene Ward Smith/UCB Math Dept/Berkeley CA 94720 ucbvax!weyl!gsmith The Josh McDowell of the Net ------------------------------ Date: Thu, 1 May 86 12:10 EDT From: Seth Steinberg Subject: Trademarks Under trademark law Xerox is obligated to point out misuses of their company name or they stand the chance of it legally falling into the public domain. If this happens Cannon will be able to advertise their copier as the Cannon(TM) Xerox Machine. I have been corrected at restaurants when I order a Coke and they only have Pepsi or RC. There was a particular consent agreement with Brigham's a little while ago. Trademarks, as Shakespeare pointed out in Othello, have an intrinsic worth and the value of something like Xerox runs in the hundreds of millions. How much did Standard Oil spend on ads to tell you about Exxon? Some trademarks such as zipper and aspirin have fallen into common usage. When Aspirin fell into the common usage the company (Sterling?) was given the trademark Bayer which originally belonged to Bayer AG but had been seized during World War I as enemy property. Seth I would have signed this Bill Bulko but I know how people feel about names. ------------------------------ Date: Thu 1 May 86 12:23:50-PDT From: Rich Alderson Subject: "Xerox" vs. "xerox"? Laws concerning trademark usage aside, De Smedt is perfectly correct in pointing out that the verb 'to xerox', meaning to copy on a dry-xerographic copier, and associated constructions ( a xerox copy, etc.), are now in fact part of the language. [...] Its no use, guys, you can't stop people using the word in the way they want to. A dictionary which omitted 'to xerox' would not be accurate. It's interesting to note that at one time, "frigidaire" (no caps) was considered to be a synonym for "refrigerator." Frigidaire, the company, fought this in order not to lose trademark status. How often does one hear this usage these days? (Not to mention those not in the various computer-related fields who STILL use "IBM" to mean "computer"...) Rich Alderson Alderson@Score.Stanford.EDU (=SU-SCORE.ARPA) ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon May 5 13:38:03 1986 Date: Mon, 5 May 86 13:37:49 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #111 Status: RO AIList Digest Sunday, 4 May 1986 Volume 4 : Issue 111 Today's Topics: Bibliography - References #5 ---------------------------------------------------------------------- Date: 9 Apr 86 13:23:16 GMT From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs! abc@ucbvax.berkeley.edu (Andy Cheese) Subject: Bibliography - References #5 NAKA85a Nakamura K. Book Review "Introduction to Logic Programming" by C.J. Hogger, Academic Press, 290 pages, 1984 New Generation Computing, Vol 3, No 4, pp 487 1985 NAKA85b Nakashima H. & DeGroot D. Conference Report A Report on 1985 International Symposium on Logic Programming New Generation Computing, Vol 3, No 4, pp 488-489 1985 NATA86a* Natarajan N. A Distributed Synchronisation Scheme for Communicating Processes Computer Journal, Vol 29, No 2, pp 109-117 April 1986 NIEL84a * Nielson F. Abstract Interpretation Using Domain Theory Department of Computer Science, University of Edinburgh Phd Thesis, CST-31-84 October 1984 NIEL * Nielson F. A Bibliography On Abstract Interpretation NIPK85a * Nipkow T. Non-Deterministic Data Types: Models and Implementations Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-10-1 October 1985 NISH83a Nishikawa H. & Yokota M. & Yamamoto A. & Taki K. & Uchida S. The Personal Inference Machine (PSI) : Its design Philosophy and Machine Architecture ( Also in "Proceedings of Logic Programming Workshop, '83", Portugal 1983 ) ICOT Research center, Technical report TR-013 June 1983 NIVA82a Nivat M. Behaviours of Processes and Synchronised Systems of Processes in BROY82a, pp 473-550 1982 NORM80a Norman A. et al SKIM- The S,K,I Reduction Machine Proc. LISP Conf. 1980 OHSU85a Ohsuga S. & Yamauchi H. Multi-Layer Logic - A Predicate Logic Including Data Structure as Knowledge Representation Language New Generation Computing, Vol 3, No 4, pp 403-439 1985 ONAI84a Onai R. & Aso M. & Takeuchi A. An Approach to a Parallel Inference Machine Based on Control-Driven and Data-Driven Mechanisms ICOT Research Center, Technical Report TR-042 January 1984 OSH84 ed. O'Shea T. & Eisenstadt M. Artificial Intelligence Tools, Techniques and Applications Harper & Row, Publishers, New York 1984 PATT81a * Patterson D.A. & Sequin C.H. RISC 1 : A Reduced Instruction Set VLSI Computer Proc 8th International Symposium on Computer Architecture SIGARCH News vol 9, no 3 pp 443-457 1981 PATT82a Patterson D.A. & Sequin C.H. A VLSI RISC Computer Vol 15 No 9, pp 8-21, Sept 1982 PATT84a Patterson D.A. VLSI Systems Building: A Berkeley Perspective Proc. Conf. on Advanced Research in VLSI, MIT January 1984 PATT85 Patterson D.A. Reduced Instruction Set Computers CACM Vol 28, No 1 January 1985 PAUL84a * Paulson L.C. Constructing Recursion Operators in Intuitionistic Type Theory Computing Laboratory, University of Cambridge Technical Report no 57 October 1984 PAUL85a * Paulson L.C. Lessons Learned From LCF: A Survey of Natural Deduction Proofs Computer Journal, Vol 28, no 5, pp 474-479 1985 PERE79a * Pereira L.M. & Porto A. Intelligent Backtracking and Sidetracking in Horn Clause Programs - The Theory Universidade Nova de Lisboa, Report no 2/79 1979 PERE79b * Pereira L.M. Backtracking Intelligently in AND/OR Trees Universidade Nova de Lisboa, report no 1/79 1979 PEYT82 Peyton Jones S.L. An Investigation of the Relative Efficiencies of Combinators and Lambda Expressions Proc. of ACM LISP Conf 1982 p150-158 PEYT84 Peyton Jones S.L. Directions in Functional Programming Research in DUCE84 1984 PEYT85a Peyton Jones S.L. GRIP-a parallel graph reduction machine Dept. of Computer Science, Internal Note 1665, grm.design v1.0, Jan 1985 PEYT85b * Peyton Jones S.L. Functional Programming Languages as a Software Engineering Tool 2nd December 1985 PEYT86a * Peyton Jones S.L. Parsing Distfix Operators CACM, Vol 29, no 2, pp 118-122 February 1986 PEIR83 Pier K.A. A Retrospective on the Dorado, A High Performance Personal Computer ISL-83-1, Xerox PARC, 1983 PELE84a * Peleg D. Communication in Concurrent Dynamic Logic CS84-15 Dept of Applied Mathematics, Weizmann Institute of Science, Israel July 1984 PELE84b * Peleg D. Concurrent Dynamic Logic CS84-14 Dept of Applied Mathematics, Weizmann Institute of Science, Israel July 1984 PING84a Pingali K. & Arvind Efficient Demand-Driven Evaluation (I) Lab. For Computer Science Technical Memo 242 September 1984 PING84b Pingali K. & Arvind Efficient Demand-Driven Evaluation (II) Lab For Computer Science Technical Memo 243 November 1984 PLAI85a * Plaisted D.A. The Undecidability of Self-Embedding For Term Rewritng Systems Information Processing Letters 20, pp 61-64 15 February 1985 PLES85a * Pless E. Die Ubersetzung von LISP in die reduktionsprache BRL GMD 142 March 1985 PLOT76 Plotkin G.D. A Powerdomain Construction SIAM J. Comput. 5 3 pp 452-487 September 1976 PLOT82 Plotkin G.D. A Power Domain For Countable Non-Determinism (Extended Abstract) Proc 9th Int. Colloq. on Automata, Languages and Programming Springer Verlag LNCS no 140, pp 418-428 (ed. Nielson M. & Schmidt E.M.) 1982 POON85 Poon E.K. & Peyton Jones S.L. Cache Memories in a Functional Programming Environment Dept. of Computer Science, Univ. College London, Internal Note 1680, Jan 1985 PPRG9 Persistent Programming Research Group Procedures as Persistent Data Objects Persistent Programming Research Report 9 PPRG11 Persistent Programming Research Group PS-Algol Abstract Machine Manual Persistent Programming Research Report 11 PPRG12 Persistent Programming Research Group PS-Algol Reference Manual Second Edition Persistent Programming Research Report 12 PRAM85a * Pramanik S. & King C-T Computer Journal, Vol 28, no 3, pp 264-269 1985 PRO84a Prolog: A Tutorial/Review Microsystems, January 1984, page 104 1984 PULL84a Pull H. A HOPE in HOPE Interpreter BSc. Undergraduate Thesis, Department of Computing, Imperial College 1984 PYKA85a * Pyka C. Syntactic Analysis Forschungstelle fur Informationswissenschaft und Intelligenz, Universitat Hanburg LOKI Report NLI - 4.1 November 1985 QUI60a Quine W.V.O. Word and Object MIT Press, Cambridge, 1960 REDD84a Reddy U.S. Transformation of Logic Programs into Functional Programs Proc. 1984 Int'l Symp. on Logic Programming Feb 1984 REDD85 Reddy U.S. On The Relationship between Logic and Functional Languages In "Functional and Logic Programming" (eds. DeGroot D. & Lindstrom G.) Prentice-Hall 1985 REEV81a Reeve M. The ALICE Compiler Target Language Document, Dept of Computing, Imperial College, May 1981 REEV81b Reeve M. An Introduction to the ALICE Compiler Target Language Research Report, Dept of Computing, Imperial College ,July 1981 REEV85a * Reeve M. A BNF Description Of The Alice Compiler Target Language 1985 REYN72 Reynolds J.C. Definitional Interpreters For Higher Order Programming Languages Proc 25th ACM National Conf, pp 717-740 1972 RICH82 Richmond G. A Dataflow Implementation of SASL Msc Thesis, Dept of Comp Sci, Univ. of Manchester, October 1982. ROBI65a Robinson J.A. A Machine Oriented Logic Based on The Resolution Principle J. Ass. Comput. Mach. 12, pp 23-41 1965 ROBI77 Robinson J.A. Logic: Form and Function Edinburgh University Press 1979 ROBI83a * Robinson J.A. Logic Programming - Past, Present and Future ( Also in New Generation Computing, Vol 1, No 2, 1983 ) ICOT Research Center, Technical report TR-015 June 1983 ROSE85a Rosenschein S.J. Formal Theories of Knowledge in AI and Robotics New Generation Computing, Vol 3, No 4, pp 345-357 1985 RUSS10,RUSS25a Russell B. & Whitehead A.N. Principia Mathematica Cambridge University Press, 1910 & 1925 RYDE81a * Rydeheard D.E. Applications of Category Theory to Programming and Program Specification Department of Computer Science, University of Edinburgh Phd Thesis, CST-14-81 December 1981 RYDE85a * Rydeheard D.E. & Burstall R.M. The Unification of Terms: A Category-Theoretic Algorithm Dept of Comp Sci, Univ of Manchester, Technical Report UMCS-85-8-1 August 1985 SAIN84a * Saint-James E. Recursion is More Efficient than Iteration Proceedings of 1984 ACM Symposium on Lisp and Functional Programming Austin, Texas pp 228-234 1984 SAKA83a * Sakai K. & Miyachi T. Incorporating Native Negation into PROLOG ( Also in "Proceedings of RIMS Symposia on Software Science and Engineering", 1984, Springer-Verlag ) ( Also in "Proceedings of Logic and Conferecne", Monash Univ., 1984 ) ICOT Research center, Technical Report TR-028 October 1983 SAKA84a Sakai K. An Ordering for Term Rewriting System ICOT Research Center, Technical Report TR-062 April 1984 SAKA84b Sakai H. & Iwata K. & Kamiya S. & Abe K. & Tanaka T. & Shibayama S & Murukami K. Design and Implementation of the Relational Database Engine ( Also in "Proceedings of FGCS 84", Tokyo, 1984 ) ICOT Research Center, Technical Report TR-063 April 1984 SAKA85a Sakai T. Intelligent Sensor Preface for New Generation Computing Vol 3 No 4, 1985, pp 339-340 1985 SAME84a Samet H. The Quadtree and Related Hierarchial Data Structures ACM Comp. Surveys Vol16, No 2, June 1984,p187-260 SAR82a Sargeant J. Implementation of Structured LUCID on a Data Flow Computer MSc Thesis, Dept of Comp Sci, Univ. of Manchester, October 1982 SATO83a * Sato M. & Sakurai T. Qute: A Prolog/Lisp Type Language for Logic Programming ( Also in "Proceedings of 8th IJCAI", Karlsluhe, 1983 ) ICOT Research center, Technical Report TR-016 August 1983 SATO84a Sato M. & Sakurai T. Qute Users Manual Dept. of Information Science, Faculty of Science, University of Tokyo SATO84b * Sato T. & Tamaki H. Enumeration of Success Patterns In Logic Programs Theoretical Computer Science, pp 227-240 1984 SCHM78a Schmitz L. An Exercise in Program Synthesis: Algorithms For Computing The Transitive Closure of A Relation Internal Report, Hochschule der Bundeswehr, Munich 1978 SCHM85a * Scmittgen C. & Gerdts A. & Haumann & Kluge W. & Woitass A System-Supported Workload Balancing Scheme for Cooperating Reduction Machines GMD Tech Rep June 1985 SCHM85b * Schmittgen C. A Data Type Architecture for Reduction Machines GMD 152 May 1985 SCHM85c * Schmidt D.A. Detecting Global Variables in Denotational Specifications ACM Transactions on Programming Languages and Systems, Vol 7, no 2 pp 299-310 April 1985 SCHWA76a * Scwartz J. Event Based Reasoning - A System For Proving Correct Termination of Prorgams Proceedings 3rd International Colloquium on Automata Languages and Programming pp 131-146 Edinburgh University Press, 1976 SCHWA77a Schwartz J. Using Annotations To Make Recursion Equations Behave Report No 43, Dept of A.I., Univ of Edinburgh 1977 SCHWE84a Schweppe H. Some Comments on Sequential Disk Cache Management for Knowledge Base Systems ICOT Research Center, Technical Report TR-040 January 1984 SCOT70a Scott D.S. Outline of Mathematical Theory of Computation Oxford University Programming Research Group Tech Monograph no 2 1970 SCOT71a Scott D. & Strachey C. Towards a Mathematical Semantics for Computer Languages 1971 Symposium on Computers and Automata Microwave Research Institute Proceedings, Vol 21 Polytechnic Institute of Brooklyn 1972 SCOT76 Scott D.S. Data Types as Lattices SIAM J.L. Computing 5, pp 522-587 1976 SCOT81 Scott D. Lectures on a Mathematical Theory of Computation Tech. Monograph PRG-19 Oxford Univ, Computing Lab, Programming Research Group 1981 SCOT82a Scott D. Domains for Denotational Semantics Automata, Languages and Programming, Proc 10th Int. Colloq. (ed. Nielsen M. & Schmidt E.M.) Springer Verlag LNCS no 140, pp 577-613 1982 SCOT82b Scott D.S. Lectures on a Mathematical Theory of Computation in BROY82a, pp 145-292 1982 SEIT85 Seitz C.L. The Cosmic Cube CACM Vol 28, no 1, January 1985 SERG82 Sergot M. A Query-the-User Facility for Logic Programming Proc. ECICS, Stresa, Italy, (eds. P. Degano & E. Sandwall) pp 27-41, 1982 North Holland SHAN85a * Shanahan M. The Execution of Logic Programs Considered as the Reduction of Set Expressions Computer Laboratory, University of Cambridge October 1985 SHAR85a Sharp J.A. Data Flow Computing Ellis Horwood, March 1985 SHAP83a * Shapiro E.Y. A Subset Concurrent Prolog and its Interpreter, 2nd Version ICOT Research center, technical Report TR-003 January 1983 SHAP83b * Shapiro E.Y. & Takeuchi A. Object Oriented Programming in Concurrent Prolog ( Also in New Generation Computing, Springer Verlag, Vol 1, No 1, 1983 ) ICOT Research Center, Technical Report TR-004 April 1983 SHAP83c * Systems Progamming in Concurrent Prolog ( Also in "Proceedings of the 11th Annual ACM Symposium on Principles of Programming Languages" ) ICOT Research Center, Technical Report TR-034 November 1983 SHAP84a * Shapiro E. & Mierowsky C. Fair, Biased, and Self-Balancing Merge Operators : Their Specification and Implementation in Concurrent Prolog CS84-07 Dept of Applied Mathematics, Weizmann Institute of Science, Israel 1984 SHAP84b * Shapiro E.Y. Alternation and the Computational Complexity of Logic Programs CS84-06 Dept of Applied Mathematics, Weizmann Institute of Science, Israel January 1984 SHAW85a * Shaw D.E. & Sabety T.M. The Multiple-Processor PPS Chip of the NON-VON 3 Supercomputer Integration, the VLSI Journal, 3, pp 161-174 1985 SHEI83a * Sheil B. Family of Personal Lisp Machines Speeds AI Program Development Electronics, November 3, 1983, pp 153-156 1983 SHIB82a Shibayama S. & Kakuta T. & Miyazaki N. & Yokota H. & Murukami K. A Relational Database Machine "Delta" ICOT Research Center, Technical Memorandum TM-0002 November 1982 SHIB84a Shibayama S. & Kakuta T. & Miyazaki N. & Yokota H. & Murakami K. A Relational Database Machine with Large Semiconductor Disk and Hardware Relational Algebra Processor ( Also in New Generation Computing, Vol 2, No 2, 1984 ) ICOT Research Center, Technical Report TR-053 March 1984 SHIB84b Shibayama S. & Kakuta T. & Miyazaki N. & Yokota H. & Murukami K. Query Processing Flow on RDBM Delta's Functionally - Distributed Architecture ICOT Research Center, Technical Report TR-064 April 1984 SHIE85a * Shields M.W. Concurrent Machines Computer Journal, Vol 28, no 5, pp 449-465 1985 SHIM83a Shimizu H. GP-PRO Graphic Display Control Library Written in Prolog ICOT Research Center, Technical Memorandum TM-0025 August 1985 SHIP81a Shipman D.W. The functional data model and the data language DAPLEX ACM TODS 6(1) p140-173 1981 SHOH85a Shoham Y. Ten Requirements for a Theory of Change New Generation Computing, Vol 3, No 4, pp 467-477 1985 SICK82a Sickel S. Specification and Derivation of Programs in BROY82a, pp 103-132 1982 SIVI85a * Sivilotti M. & Emerling M. & Mead C. A Novel Associative Memory Implemented Using Collective Computation 1985 Chapel Hill Conference on VLSI, pp 329-342 1985 SLEE80 Sleep M.R. Applicative Languages, Dataflow and Pure Combinatory Code Proc IEEE Compcon 80, pp 112-115 February 1980 SLEE82 Sleep M.R. & Holmstrom S. A Short Concerning Lazy Reduction Rules of Append Document, Computer Studies Centre, University of East Anglia,May 1982 SLEE83 Sleep M.R. Novel Architectures Distributed Computing- A Review for Industry, SERC, Manchester 1983 SLEE84 Sleep M.R. and Kennaway J.R. The Zero Assignment Parallel Processor (ZAPP) Project in DUCE84 1984 SLEE86a * Sleep M.R. Directions in Parallel Architecture in BCS86a 1986 SLOM83a * Sloman A. & Hardy S. Poplog : A Multi-Purpose Multi-Language Program Development Environment AISB Quarterly, vol 47, pp 26-34 1983 SMYT78a * Smyth M.B. Power Domains Journal of Computer and System Sciences, Vol 16, pp 23-36 1978 SNYD79 Snyder A. A Machine Architecture to Support an Object-Oriented Language MIT Laboratory for Computer Science, MIT/LCS/TR-209, March 1979 SOLE85 Soley M.S. Generic Software for Emulating Multiprocessor Architectures Draft of MSc Thesis to be submitted May 1985 SPIV84 Spivey Mike University of York Portable Prolog System Users Guide University of York 1984 SRIN86a * Srini V.P. An Architectural Comparison of Dataflow Systems IEEE Computer, March 1986, pp 68-88 1986 STAL85a * Stallard R.P. Occam - A Brief Introduction Occam - The Loughborough Implmentation Computer Studies Laboratory Report Dept of Computer Studies, Loughborough University of Technology. November 1985 STAM85a* Stammers R.A. Report to the Alvey Directorate on a Short Survey of The Industrial Applications of Logic and Functional Programming in the United Kingdom and United States 27 August 1985 STAP77a * Staples J. A Class of Replacement Systems With Simple Optimality Theory Bull. Aust. Math. Soc., Vol 17, pp335-350 1977 STAP80a Staples J. Computation on Graph-Like Expressions Th. Comp. Sci., Vol 10, pp 171-185 1980 STAP80b Staples J. Optimal Evaluations Of Graph-Like Expressions Th. Comp. Sci., Vol 10, pp 297-316 1980 STAR84a * Stark W.R. A Glimpse Into The Paradise of Combinatory Algebra International Journal of Computer and Information Sciences Vol 13, No 3, pp 219-236 1984 STEE76 Steele G.L.Jr. & Sussman G.J. LAMBDA: The Ultimate Imperative AI Memo no 353 Artificial Intelligence Laboratory, MIT 1976 STEE77a Steele G.L.Jr. Compiler Optimization Based on Viewing LAMBDA as Rename Plus Goto S.M. Thesis, MIT EE&CS, Cambridge. Published as RABBIT: A Compiler for SCHEME (A Study in Compiler Optimization), AI TR 474, MIT Lab, Cambridge STEE77b Steele G.L.Jr. Debunking The 'Expensive Procedure Call' Myth Proc. ACM National Conference, pp 153-162, 1962 Also revised as AI Memo 443, MIT Lab, Cambridge STEE78 Steele G.L.Jr. & Sussman G.J. The Art Of The Interpreter; or, The Modularity Complex (parts zero,one and two) AI Memo 453, MIT AI Lab, Cambridge, 1978 STEE79a Steele G.L.Jr. & Sussman G.J. Design of LISP-Based Processors; or, SCHEME: A Dielectric LISP; or, Finite Memories Considered Harmful; or, LAMBDA The Ultimate Opcode AI Memo 514, MIT AI Lab, Cambridge, 1979 Summarized in CACM 23 no 11, pp 629-645 STEE79b Steele G.L.Jr. & Sussman G.J. The Dream Of A Lifetime: A Lazy Scoping Mechanism AI Memo 527, MIT Lab, Cambridge, 1979 STEP86a * Stephenson B.K. Computer Architectures for Image Processing in BCS86a 1986 STIR85a * Stirling C. Modal Logics for Communicating Systems Internal report, CSR-193-85 Department of Computer Science, University of Edinburgh October 1985 STIR86a * A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic For A Concurrent While Language To appear in ICALP 1986 1986 STOY77a Stoy J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory MIT Press, Cambridge Massachusetts 1977 STOY82a Stoy J. Some Mathematical Aspects Of Functional Programming in DARL82a 1982 STOY82b Stoy J.E. Semantic Models in BROY82a, pp 293-324 1982 STOY83a * Stoye W. The SKIM Microprogrammer's Guide Computer Laboratory, University of Cambridge Technical Report no 40 October 1983 STOYE84a * Stoye W. A New Scheme for Writing Functional Operating Systems Computer Laboratory, University of Cambridge Technical Report no 56 1984 STOYE84b * Stoye W.R. & Clarke T.J.W. & Norman A.C. Some Practical Methods for Rapid Combinator Reduction Proceedings of 1984 ACM Symposium on Lisp and Functional Programming Austin, Texas pp 159-166 1984 SUGI83a Sugiyama K. & Kameda M. & Akiyama K. & Makinouchi A. A Knowledge Representation System in Prolog ICOT Research Center, Technical Report TR-024 August 1983 SUGI84a Sugimoto M. & Kato H. & Yoshida H. Design Concept for a Software Development Consultation System ( Also in Second Japanese Swedish Workshop on Logic Programming and Functional Programming, Uppsala, 1984 ) ICOT Research Center, Technical Report TR-071 August 1984 SUSS75a Sussman G.J. & Steele G.L.Jr. SCHEME: An Interpreter for Extended Lambda Calculus AI Memo 349, MIT AI Lab, Cambridge, 1975 SUSS82a Sussman G.J. LISP, Programming and Implementation in DARL82a 1982 SUZU82a Suzuki N. & Kurihara K. & Tanaka H. & Moto-oka T. Procedure Level Data Flow Processing on Dynamic Structure Multimicroprocessors Journal of Information Processing Vol 5, No. 1 p11-16 March, 1982 SUZU82b Suzuki N. Experience with Specification and Verification of Hardware using PROLOG Document, Presented at Working Conference on VLSI Engineering, Oct 1982 SYRE77a Syre J.C. et al Pipelining, Parallelism and Asynchronism in The LAU System Proc. 1977 Int. Conf. on Parallel Processing, pp 87-92 August 1977 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon May 5 13:37:38 1986 Date: Mon, 5 May 86 13:37:30 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #112 Status: RO AIList Digest Sunday, 4 May 1986 Volume 4 : Issue 112 Today's Topics: Bibliography - References #6 ---------------------------------------------------------------------- Date: 9 Apr 86 13:24:10 GMT From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs! abc@ucbvax.berkeley.edu (Andy Cheese) Subject: Bibliography - References #6 TAKA84a Takagi S. & Chikayama T. & Hattori T. & Tsuji J. & Yokoi T. & Uchida S. & Kurokawa T. & Sakai K. Overall Design of SIMPOS ( Also in "Proceedings of 2nd Int'l Conference of Logic Programming", Uppsala, 1984 ) ICOT Research Center, Technical Report TR-057 April 1984 TAKE82a Takeuchi A. & Shapiro E.Y. Object Oriented Programming in Relational Language ICOT Document TAKE82b Takeuchi A. Let's Talk Concurrent Prolog ICOT Research Center, Technical Memorandum TM-0003 December 1982 TAKE83a * Interprocess Communication in Concurrent Prolog ( Also in "Proceedings of Logic Programming Workshop '83", Portugal ) ICOT Research Center, technical Report TR-006 May 1983 TAKI84a Hardware Design and Implementation of the Personal Sequential Inference Machine (PSI) ( Also in "Proceedings of FGCS 84", Tokyo, 1984 ) ICOT Research Center, Technical Report TR-075 August 1984 TAMA83a * Tamaki M. A Transformation System for Logic Programs Which Preserves Equivalence ICOT research Center, Technical report TR-018 August 1983 TANA82a Tanaka J. & Keller R.M. Code Optimisation in a Functional Language In Workshop on Functional Programming, Japan Inf. Processing Soc. December 1982 TANI81a * Tanimoto S.L. Towards Hierarchical Cellular Logic: Design Considerations for Pyramid Machines Dept of Comp Sci, Univ of Washington, Technical Report #81-02-01 February 1981 TARJ72 Tarjan R. Depth-First Search & Linear Graph Algorithms SIAM Journal of Computing Vol 1 Part 2 p146-60 1972 TARN77a * Tarnlund S.-A. Horn Clause Computability BIT 17, 1977, pp 215-226 1977 THOM85a * Thompson S.J. Laws in Miranda University of Kent Computing Laboratory Report No 35 December 1985 TIB84 ed. Tiberghien J. New Computer Architectures International Series in Computer Science Academic Press 1984 TICK84 Tick E. & Warren D.H.D. Towards a Pipelined Prolog Processor Proc. 1984 Int. Symp. on Logic Programming pp 29-40 1984 TILL85a * Tillotson M. Introduction to the Functional Programming Language "Ponder" Computer Laboratory, University of Cambridge, Tech Rep no 65 1985 TOGG86a * Toaggi M. & Watanabe H. An Inference Engine For Real-Time Fuzzy Control: VLSI Design and Implementation To appear in Proc. of Japan-USA Symp. on flexible Automation, July 14-15, 1986, Osaka, Japan 1986 TREL78 Treleaven P.C. Principle Components of Data Flow Computer Proc. 1978 Euromicro Symp. , pp 366-374 October 1978 TREL80a Treleaven P.C. & Mole G.F. A Multi-Processor Reduction Machine For User-Defined Reduction Languages Proc. 7th Int. Symp. on Comp. Arch., pp 121-129 April 1980 TREL80b ed. Treleaven P.C. VLSI: Macine Architecture and Very High Level Languages Proc of the joint SRC/Univ of Newcastle upon Tyne Workshop, Computing Laboratory, Univ. of Newcastle Upon Tyne, Tech Rep 156 December 1980 TREL81a Treleaven P.C. & Hopkins R.P. Decentralised Computation Proc 8th Int Symp on Comp Arch, pp 279-290 May 1981 TREL81b Treleaven P.C. & Hopkins R.P. A Recursive (VLSI) Computer Architecture Computing Laboratory, Univ of Newcastle Upon Tyne Tech Rep 161 March 1981 TREL81 Treleaven P.C. et al Data Driven and Demand Driven Computer Architecture Computer Lab, Univ of Newcastle Upon Tyne Tech Rep 168, July 1981 TREL82a Treleaven P.C. Computer Architecture For Functional Programming in DARL82a 1982 TREL82b Treleaven P.C. Brownbridge D.R. & Hopkins R.P. Data Driven and Demand Driven Computer Architecture ACM Computing Surveys Vol 14 No. 1 Jan 1982 TSUJ84a Tsuji J. & Kurokawa T. & Tojyo S. & Iima Y. & Nakazawa O. & Enomoto S. Dialog Management in the Personal Sequential Inference Machine (PSI) ( Also in "Proceedings of ACM 84", San Francisco, 1984 ) ICOT Research Center, Technical report TR-046 March 1984 TURN76 Turner D.A. SASL Language Manual CS/79/3 Dept. of Computational Science, University of St. Andrews ,1976 (CS/75/1) TURN79a Turner D.A. A New Implementation Technique for Applicative Languages Software Practice & Experience Vol 9 p31-49 ,1979 TURN79b Another Algorithm for Bracket Abstraction Journal of Symbolic Logic, Vol 44, no. 2, June 1979 TURN80 Turner D.A. Programming Languages- Current and Future Developments Infotech State of the Art Conference on Software Development Techniques 1980 TURN81a Turner D.A. The Semantic Elegance of Applicative Languages Proc. 1981 ACM Conf on Functional Programming Languages & Computer Architecture p85-92 TURN81b Turner D.A. Aspects of the Implementaion of Programming Languages D.Phil Thesis, Oxford University 1981 TURN82a Turner D.A. Recursion Equations As A Programming Language in DARL82a 1982 TURN82b Turner D.A. Functional Programming and Proofs of Program Correctness In "Tools and Notions For Program Correctness" (ed. D. Neel), pp 187-209 Cambridge University Press 1982 TURN85a Turner D.A. Functional Programs as Executable Specifications in HOA85a 1985 TURN85b * Turner R. & Lowden B.G.T. An Introduction to the Formal Specification of Relational Query Languages Computer Journal, vol 28, no 2, pp 162-169 1985 UCHI82a Uchida S. & Yokota M. & Yamamoto A. & Taki K. & Nishikawa H. & Chikayama T. & Hattori T. The Personal Sequential Inference Machine, Outline Its Architecture and Hardware System ICOT Research Center, Technical Memorandum TM-0001 November 1982 UCHI82b Uchida S. Towards A New Generation Computer Architecture ( Also in "VLSI Architecture", Prentice Hall, 1984 ) ICOT research center Technical Report TR-001 July 1982 UCHI83a Uchida S. Inference Machine: From Sequential to Parallel ( Also in "Proceedings of 10th International Symposium on Computer Architecture", Sweden, 1983, IEEE Computer Society Press ) ICOT Research Center, Technical report TR-011 may 1983 UCHI83b Uchida S. & Yokota M. & Yamamoto A. & Taki K. & Nishikawa H. Outline of the Personal Sequential Inference Machine:PSI ( Also in New Generation Computing, Vol 1, No 1, 1983 ) ICOT Research Center, Technical Memorandum TM-0005 April 1983 UEDA84a Ueda K. & Chikayama T. Efficient Stream/Array Processing in Logic Programming LAnguage ( Also in "Proceedings of FGCS 84", Tokyo, 1984 ) ICOT Research Center, Technical Report TR-065 April 1984 ULLM85a * Ullmann J.R. & Haralick R.M. & Shapiro L.G. Computer Architecture for Solving Consistent Labelling Problems Computer Journal, Vol 28, no 2, pp 105-111 1985 UMEY84a Umeyama S. & Tamura K. Parallel Execution of Logic Programs Electrotechnical Lab., MITI Ibakaraki, Japan UNGA82 Ungar D.M. & Patterson D.A. Berkeley Smalltalk: Who Knows Where the Time Goes ? In Smalltalk-80, Bits of History, Words of Advice, Glenn Krasner 1982 UNGA84 Ungar D. & Blau R. & Foley P. & Samples D. & Patterson D.A. Architecture of SOAR: Smalltalk on a RISC 11th Symp. on Comp. Arch., Ann Arbor June 1984 VALI85 Valiant L.G. Deductive Learning in HOA85a 1985 VANE76a * Van Emden M. Verification Conditions As Programs Proceedings 3rd International Colloquium on Automata Languages and Programming pp 99-119 Edinburgh University Press, 1976 VASS85a * Access to Specific Declarative Knowledge by Expert Systems : The Impact of Logic Programming Decision Support Systems 1, pp 123-141 April 1985 VEGD84 Vegdahl S.R. A Survey of Proposed Architectures for the Execution of Functional Languages IEEE TOC C-33 No12, Dec 1984, p1050-1071 VUIL74a * Vuillemin J. Correct and Optimal Implementation of Recursion In A Simple Programming Language J. Comp. Sys., 9, no 3, pp 332-354 1974 WADG85 Wadge W.W. & Ashcroft E.A. Lucid, The Dataflow Programming Language Apic Studies in Data Processing no. 22 Academic Press, 1985 WADL76a Wadler P.L. Analysis of an Algorithm for Real Time Garbage Collection Comm ACM Vol 19 No 9 p491-500 Sept 1976 WADL84a * Wadler P. Listlessness is Better Than Laziness: Lazy Evaluation and Garbage Collection at Compile-Time Proceedings ACM Symposium on LISP and Functional Programming, Austin, Texas August 1984 WADL84b * Wadler P. Listlessness is Better Than Laziness PhD Dissertation, Carnegie-Mellon University August 1984 WADL85a * Wadler P. A Splitting Headache : Strict vs Lazy Semantics for Pattern Matching in Lazy Languages Oxford University, Computing Laboratory January 1985 Addenda November 1985 WADL85b * Wadler P. An Introduction to Orwell (DRAFT) Oxford University, Computing Laboratory 1 April 1985 revised December 1985 WADL85c Wadler P. Listlessness is Better Than Laziness II: Composing Listless Functions Workshop on Programs as Data Objects, Copenhagen October 1985 ( To be published as LNCS by Springer-Verlag ) WADL86a * Plumbers and dustmen: Fixing a space leak with a garbage collector posted to fp@uea.sp 1986 WADS71a Wadsworth C.P. Semantics and Pragmatics of The Lambda Calculus D.Phil Thesis, Univ. of Oxford 1971 WADS84a * Wadsworth C.P. Report on the IOTA Programming System and other Japanese Advanced Research Rutherford Appleton Laboratory, RAL-84-090, August 1984 WARR77a Warren D.H.D. & Pereira L.M. Pereira F. PROLOG-The Language and its Implementation Compared to LISP Proc. Symp. on AI and Programming Languages, 1977 Sigplan 8(12) or Sigart 64 pp 109-115 WARR77b Warren D.H.D. Applied Logic - Its Use and Implementation as a Programming Tool Phd Dissertation Dept of AI, Univ of Edinburgh 1977 WARR82a* Warren D.H.D. Higher Order Extensions to PROLOG: Are They Needed ? in Machine Intelligence 10 (eds Hayes J.E. & Michie D. & Pao Y-H ) pp 441-454 Ellis Horwood Ltd 1982 WARR83a * Warren D.H.D. An Abstract Prolog Instruction set Technical Note 309, SRI International 31 August 1983 WATP84 Watson P. A Functional Language Computer Conversion Report Univ. of Manchester Sept 1984 WATP85a * Watson P. A Reference Count Garbage Collection Scheme For Distributed Computers Draft Document, Dept of Computer Science, Univ. of Manchester, March 1985 WATP85b * Watson P. Report on Visit to the U.S.A. Document, Dept of Computer Science, Univ of Manchester, April 1985 WATP85c * Watson P. Higher Order Functions in EFL Document, Dept of Computer science, Univ. of Manchester, 24 May 1985 WATS79 Watson I. & Gurd J. A Prototype Data Flow Computer With Token Labeling Proc. Nat. Comp. Conf., Vol 48, pp 623-628 1979 WATS83a * Watson I. Functional Logic Programming Document, Dept of Computer Science, Univ. of Manchester, April 1983 WATS84a * Watson I. (& Ashcroft A.) A Demand Driven Dataflow Machine/Tagged Data-Driven Reduction Machine Document, Dept of Computer Science, Univ. of Manchester ,March 1984 WATS84b * Watson I. Another Model (And Machine) Document, Dept of Computer Science, Univ. of Manchester ,May 1983 WATS84c * Watson I. Higher Order Functions Document, Dept of Computer Science, Univ. of Manchester ,Aug 1984 WATS85a * Watson I. A Parallel SKI(BC) Combinators Model Document, PMP/MU/IW/00005, Dept of Computer Science, Univ. of Manchester, March 1985 WATS85b * Watson Ian & Watson Paul & Woods Viv Parallel Data-Driven Graph Reduction Document, Dept. of Computer Science, Univ. of Manchester WEIH85a * Weihrauch K. Type 2 Recursion Theory Theoretical Computer Science 38, pp 17-33 May 1985 WHIT80a White J.L. Address/Memory Management for a Gigantic LISP Environment or, GC Considered Harmful Proc. 1980 LISP Conf. p119-127 WHITE78 Whitelock P.J. A Conventional Language for Data Flow Computing MSc Dissertation, Dept of Comp Sci, Univ. of Manchester, October 1978 WILL80 Williams J.H. On The Development Of The Algebra Of Functional Programs Report No RJ2983, IBM Research Laboratory, San Jose, California, October 1980 WILL81 Williams J.H. Formal Representations For Recursively Defined Functional Programs in "Formalization Of Programmming Concepts", Lecture Notes in Computer Science, no 107, Springer Verlag, April 1981 WILL82 Williams J.H. Notes on The FP Style Of Functional Programming in DARL82a 1982 WILN80 Wilner W. Recursive Machines Xerox Parc Internal Report 1980 WINS84 Winston P. & Horn K.P. Lisp Second Edition Addison Wesley Publishing Company 1984 WINS? * Winskel G. Categories of Models for Concurrency Computer Laboratory, University of Cambridge Technical Report no 58 WINT80 WinterStein G. & Dausmann M. & Persch G. Deriving Different Unification Algorithms From a Specification in Logic Proc. of Logic Programming workshop, Debrecen, Hungary (ed S. -A. Tarnlund), pp 274-285 1980 WIRS82a Wirsing M. & Broy M. An Analysis of Semantic Models For Algebraic Specifications in BROY82a, pp 351-412 1982 WISE79a Wise D.S. Morris's Garbage Compaction Algorithm Restores Reference Counts ACM Trans. on Programming Languages and Systems, 1, no 1, pp 115-122 1979 WISE82a Wise D.S. Interpreters For Functional Programming in DARL82a 1982 WORL85a Worley J. & Arabe J. & Tu K.G. The Architecture and Design of the Functional Programming Machine Document, Computer Sci. Dept. , Univ. of California, Los Angeles YAO82 Yao S.B. Waddle V.E. & Housel B.C. View Modeling and Integration Using the Functional Data Model IEEE TOSE Vol SE-8 No.6 p544-553 ,Nov 1982 YASU83a * Yasukawa H. LFG in Prolog - Toward A Formal System for Representing Grammatical Relations ICOT Research Center, technical report TR-019 August 1983 YASU83b * Yasuura H. On The Parallel Computational Complexity of Unification ICOT Research Center, Technical report TR-027 October 1983 YOKOI83a Yokoi T. A Perspective of the Japanese FGCS Project ( Presented to IJCAI, F.R.G., 1983 ) ICOT Research Center, Technical Memorandum TM-0026 September 1983 YOKOM84a * Yokomori T. A Note on the Set Abstraction in Logic Programming Language ( Also in "Proceedings of FGCS 84", Tokyo, 1984 ) ICOT Research Center, Technical Report TR-060 April 1984 YOKOT83a Yokota H. & Kunifuji S. & Kakuta T. & Miyazaki N. & Shibayama S. & Murakami K. An Enhanced Inference Mechanism for Generating Relational Algebra Queries ( Also in "Proceedings of Third ACM SIGACT-SIGMOD Symp. on Principles of Database Systems", Waterloo, Canada, 1984 ) ICOT Research Center, Technical Report TR-026 October 1983 YOKOT84a Yokota M. & Yamamoto A. & Taki K. & Nishikawa H. & Uchida S. The Design and Implementation of a Personal Sequential Inference Machine: PSI ( Also in New Generation Computing, Vol 1, No 2, 1984 ) ICOT Research Center, Technical Report TR-045 February 1984 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Mon May 5 13:38:20 1986 Date: Mon, 5 May 86 13:38:11 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #113 Status: RO AIList Digest Monday, 5 May 1986 Volume 4 : Issue 113 Today's Topics: Seminars - Use of AI in Project Management and Scheduling (Ames) & Procedural Abstraction in Soar (UCB) & Artificial Organisms (CMU) & Multisensor Robot Systems (MIT), Conference - 3rd. Int. Logic Programming ---------------------------------------------------------------------- Date: Thu, 1 May 86 09:50:21 pdt From: eugene@AMES-NAS.ARPA (Eugene Miya) Subject: Seminar - Use of AI in Project Management and Scheduling (Ames) National Aeronautics and Space Administration Ames Research Center AMES AI FORUM SEMINAR ANNOUNCEMENT The Use of AI in Project Management and Scheduling John C. Kunz, Ph.D IntelliCorp Corporate Offices Tuesday, May 13, 1986 10:00 - 11:00 am (NOTE TIME) N245 Space Sciences Auditorium NASA Ames Research Center The discipline of Project Management can potentially contribute both to the planning and the control of large projects. Knowledge-based systems can be used to help project and operations managers to identify the problems they must solve and to consider various alternative approaches to their problems. This talk will discuss results of using some prototype systems that support project management and scheduling. The discussion will consider both some of the management issues and design of the AI analysis systems. point of contact: Alison Andrews (415)694-6741 mer.andrews@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: Thu, 1 May 86 04:44:11 PDT From: admin%cogsci@berkeley.edu (Cognitive Science Program) Subject: Seminar - Procedural Abstraction in Soar (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Spring 1986 Cognitive Science Seminar - IDS 237B Tuesday, May 6, 11:00 - 12:30 2515 Tolman Hall Discussion: 12:30 - 1:30 3105 Tolman (Beach Room) ``Procedural Abstraction in the Soar Cognitive Architecture'' Paul S. Rosenbloom Departments of Computer Science and Psychology, Stanford University The Soar project is an attempt to build a system capable of general intelligent behavior -- a cognitive architecture. It is to be capable of working on the full range of tasks, from highly routine to extremely difficult open-ended problems; capable of employing the full range of problem solving methods and representations required for these tasks; and capable of learning about all aspects of the tasks and its performance on them. In this talk I will present an overview of the current system, which is an approximation to this ideal, and some new results on the integration of abstraction planning capabilities into R1-Soar -- the implementation in Soar of an expert system for computer configuration. Abstraction planning in R1-Soar is based on the partial execution of procedurally encoded opera- tors and on Soar's general problem solving and learning capa- bilities. ------------------------------ Date: 1 May 86 15:56:44 EDT From: Gregory.Hood@ML.RI.CMU.EDU Subject: Seminar - Artificial Organisms (CMU) I will be presenting the last thesis proposal of this semester on Friday, May 9, at 10:30am (yes, that's Black Friday) in Wean 5409. A copy of the proposal is in the lounge; I have additional copies available in my office (8126) for anyone who wants one. Title: Artificial Organisms: A Neural Modeling Approach Abstract: The proposed thesis will investigate autonomous goal-based learning at the neural modeling level. To support this study, a series of artificial organisms will be developed within the context of the World Modeling System, which is a realistic simulated environment. Each organism will be controlled by an artificially designed nervous system based on organizational principles found in simple natural organisms such as the marine snail. The organisms will exhibit several simple forms of learning such as habituation, sensitization, classical conditioning, and operant conditioning. Emphasis will be placed on the development of robust organisms which are capable of prolonged existence within the environment rather than isolated neural networks which are only capable of single one-shot learning tasks. It is expected that insights into the relationship of machine learning to learning in natural organisms will emerge from the study of these artificial organisms. ------------------------------ Date: 2 May 1986 15:19 EDT (Fri) From: Claudia Smith Subject: Seminar - Multisensor Robot Systems (MIT) INTEGRATION AND COORDINATION OF MULTI-SENSOR ROBOT SYSTEMS Hugh F. Durrant-Whyte University of Pennsylvania Philadelphia A multi-sensor robot system comprises many diverse non-homogeneous sources of information. The sensors of these systems take a variety of disparate observations of features in the robot environment. The measurements supplied by the sensor systems are uncertain, partial, occasionally spurious or incorrect and often incomparable with other sensors views. It is the goal of the robot system to coordinate and integrate sensor observations into a consensus best view of the environment which can be used to plan and guide the execution of tasks. We will present a methodology for the integration of uncertain sensor information and the coordination of multi-sensor observation strategies. We first build a probabilistic model of a sensor's information gathering characteristics and show how it's views can be extracted from a Gaussian (stochastic) environment. A methodology is developed for the consistent integration of disparate sensor views in to a consensus world model. We show how the information model can be used to obtain maximal-information sensing strategies and to coordinate the actions of multiple sensor agents. We demonstrate the utility of these techniques by application to a robot-mounted tactile array and an active stereo vision system. Date: Wednesday, May 7th Time: 4pm Place: NE43-8th floor playroom ------------------------------ Date: 23 Apr 86 14:55:07 GMT From: ucdavis!lll-lcc!lll-crg!caip!seismo!mcvax!ukc!icdoc!csa@ucbvax. berkeley.edu (Cheryl S Anderson) Subject: Conference - 3rd. Int. Logic Programming THIRD INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING July 14-18, 1986 FINAL PROGRAM Monday, July 14 All Day Tutorial: Logic programming and its applications by Robert Kowalski and Frank Kriwaczek. Half Day Tutorials: A.M. Prolog implementation and architecture. David Warren or Techniques for natural language processing in Prolog. Michael McCord P.M. Parallel logic programming. Keith Clark and Steve Gregory or Japanese Fifth Generation Applications Research. Koichi Furukawa Tuesday, July 15 KEYNOTE ADDRESS: K. Fuchi, ICOT 1a. Parallel implementations An abstract machine for restricted AND-parallel execution of logic programs. Manuel V. Hermenegildo, University of Texas at Austin. Efficient management of backtracking in AND-Parallelism. Manuel V. Hermenegildo, University of Texas at Austin & Roger I. Nasr, MCC. An intelligent backtracking algorithm for parallel execution of logic programs. Vipin Kumar, University of Texas at Austin. Delta Prolog: a distributed backtracking extension with events. Luis Moniz Pereira, Luis Monteiro, Jose Cunha & Joaquim N. Aparicio, Universidade Nova de Lisboa. 1b. Theory and complexity OLD resolution with tabulation. Hasao Tamaki, Ibaraki University. Logic programs and alternation. P. Stepanek & O. Stepankova, MFF Prague. Intractable unifiability problems and backtracking. D.A. Wolfram, Syracuse University. On the complexity of unification sequences. Heikki Mannila & Esko Ukkonen, University of Helsinki. 2a. Implementations and architectures How to invent a Prolog machine. Peter Kursawe, GMD & University of Karlsruhe. A sequential implementation of Parlog. Ian Foster, Steve Gregory, Graem Ringwood, Imperial College & Ken Satoh, Fujitsu Limited. A GHC abstract machine and instruction set. Jacob Levy, Weizmann Institute. A Prolog processor based on a pattern matching memory device. Ian Robinson, Schlumberger Palo Alto Research. 2b. Inductive inference and debugging An improved version of Shapiro's model inference system. Matthew Huntbach, University of Sussex. A framework for ICAI systems based on inductive inference and logic programming. Kazuhisa Kawai, Riichiro Mizoguchi, Osamu Kakusho & Jun'ichi Toyoda, Osaka University. Rational debugging in logic programming. Luis Moniz Pereira, Universidade Nova de Lisboa. Using definite clauses and integrity constraints as the basis for a theory formation approach to diagnostic reasoning. Randy Goebel, University of Waterloo, Koichi Furukawa, ICOT & David Poole, University of Waterloo. INVITED TALK: Theory of logic programming. Jean-Luis Lassez, IBM Wednesday, July 16 INVITED TALK: Concurrent logic programming languages. Akikazu Takeuchi ICOT. 3a. Concurrent logic languages P-Prolog: a parallel language based on exclusive relation. Rong Yang & Hideo Aiso, Keio University. Making exhaustive search programs deterministic. Kazunori Ueda, ICOT. Compiling OR-parallelism into AND-parallelism. Michael Codish & Ehud Shapiro, Weizmann Institute. A framework for the implementation of Or-parallel languages. Jacob Levy, Weizmann Institute. 3b. Theory and semantics Logic program semantics for programming with equations. Joxan Jaffar & Peter J. Stuckey, Monash University. On the semantics of logic programmming languages. Alberto Martelli & Gianfranco Rossi, Universita di Torino. Towards a formal semantics for concurrent logic programming languages. Lennart Beckmann, Uppsala University. Thursday, July 17 INVITED TALK: Logic programming and natural language processing. Michael McCord, IBM. 4a. Parallel applications and implementations Parallel logic programming for numeric applications. Ralph Butler, Ewing Lusk, William McCune & Ross Overbeek, Argonne National Laboratory. Deterministic logic grammars. Harvey Abramson, University of British Columbia. A parallel parsing system for natural language analysis. Yuji Matsumoto, ICOT. 4b. Theory and higher-order functions Equivalence of logic programs. Michael J. Maher, University of Melbourne. Qualified answers and their application to transformation. Phil Vasey, Imperial College. Procedures in Horn-clause programming. M.A. Nait Abdallah, University of W. Ontario. Higher-order logic programming. Dale A. Miller & Gopalan Nadathur, University of Pennsylvania. 5a. Program analysis Abstract interpretation of Prolog programs. C.S. Mellish, University of Sussex. Verification of Prolog programs using an extension of execution. Tadashi Kanamori, Mitsubishi Electric Corporation & Hirohisa Seki, ICOT. Detection and optimization of functional computations in Prolog. Saumya K. Debray & David S. Warren, SUNY at Stony Brook. Control of logic program execution based on the functional relations. Katsuhiko Nakamura, Tokyo Denki University. 5b. Applications and teaching Declarative graphics. A. Richard Helm & Kim Marriott, University of Melbourne. Test-pattern generation for VLSI circuits in a Prolog environment. Rajiv Gupta, SUNY at Stony Brook. Using Prolog to represent and reason about protein structure. C.J. Rawlings, W.R. Taylor, J. Nyakairu, J. Fox & M.J.E. Sternberg, Imperial Cancer Research Fund & Birkbeck College. A New approach for introducing Prolog to naive users. Oded Maler, Zahava Scherz & Ehud Shapiro, Weizmann Institute. INVITED TALK: Prolog programming environments. Takashi Chikayama, ICOT. Friday, July 18 INVITED TALK: Logic programming and databases. Jeffery D. Ullman, Stanford University. 6a. Implementations and databases A superimposed codeword indexing scheme for very large Prolog databases. Kotagiri Ramamohanarao & John Shepherd, University of Melbourne. Interfacing Prolog to a persistent data store. D.S. Moffat & P.M.D. Gray, University of Aberdeen General model for implementing DIF and FREEZE. P. Boizumault, CNRS. Cyclic tree traversal. Martin Nilsson & Hidehiko Tanaka, University of Tokyo. 6b. Theory and negation Completeness of the SLDNF-resolution for a class of logic programs. R. Barbuti, Universita di Pisa. Choices in, and limitations of, logic programming. Paul J. Voda, University of British Columbia. Negation and quantifiers in NU-Prolog. Lee Naish, University of Melbourne. Gracefully adding negation and disjunction to Prolog. David L. Poole & Randy Goebel, University of Waterloo. 7a. Compilation Memory performance of Lisp and Prolog programs. Evan Tick, Stanford University. The design and implementation of a high-speed incremental portable Prolog compiler. Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli & Andrew Turk, Syracuse University. Compiler optimizations for the WAM. Andrew K. Turk, Syracuse University. Fast decompiling of compiled Prolog clauses. Kevin A. Buettner, Syracuse University. 7b. Models of computation and implementation Logic continuations. Christopher T. Haynes, Indiana University. Cut & Paste - defining the impure primitives of Prolog. Chris Moss, Imperial College. Tokio: logic programming language based on temporal logic and its compilation to Prolog. M. Fujita, Fujitsu Labs. Ltd., S. Kono, H. Tanaka & Moto-oka, University of Tokyo. The OR-woods description of the execution of logic programs. Sun Chengzheng & Tzu Yungui, Changsha Institute. PANEL DISCUSSION: Programming vs. uncovering parallelism. Chair: Keith Clark, Imperial College. GENERAL INFORMATION TIME AND VENUE Monday 14th to Friday 18th July. Imperial College of Science and Technology, South Kensington. Sherfield Building - Great Hall, Pippard and Read Lecture Theatres. Registration: Tutorials from 8.00 a.m. on Monday and Full Conference from 2.00 p.m. to 8.00 p.m. on Monday and from 8.15 p.m. on Tuesday, in the main reception area adjacent to the Great Hall. General information on facilities and entertainment in London will be available from the main reception desk. CONFERENCE SESSIONS The main conference runs from 9.30 a.m. on Tuesday, 15th July until 5.00 p.m. on Friday, 18th July. Technical sessions are divided into two parallel streams and each paper lasts for approximately 20 minutes. (Each day has plenary sessions addressed by invited speakers). Morning breaks are from 10.30-10.50, lunch breaks from 12.30-2.00, and afternoon breaks from 3.40-4.00. TUTORIALS The Tutorial Programme takes place on Monday, 18th July, from 9.30 a.m. Each tutorial session is priced separately. COMMERCIAL EXHIBITION There will be a commercial exhibition located in the Junior Common Room on the same level as the main conference facilities in the Sherfield Building from 1.00 p.m. on Monday until Thursday lunchtime. Companies taking part in the exhibition include software developers, hardware manufacturers and publishers. A reception will be held in the exhibition area at the end of the tutorial sessions on Monday. Refreshments will also be available in the exhibition area during session breaks. Anyone interested in taking space at the exhibition should contact the Conference Organizers at Imperial College Tel. 01-589 5111 ext. 5011. [If you've read this far, you may want to write to me for the social programme, housing data, and registration forms that were included in the original message. -- KIL] ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue May 6 00:42:01 1986 Date: Tue, 6 May 86 00:41:56 edt From: vtcs1::in% (LAWS@sri-ai.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #114 Status: RO AIList Digest Monday, 5 May 1986 Volume 4 : Issue 114 Today's Topics: Queries - Stella & Expert Systems for PCs & Boltzman Machine, AI Tools - Neural Networks & The Connection Machine & String Reduction, Linguistics - Italo Calvino AI Project ---------------------------------------------------------------------- Date: Fri, 2 May 86 11:12 EST From: "Steven H. Gutfreund" Subject: Stella Does anyone have any information on Stella (personal or journal articles)? I understand it is a program for the MacIntosh done at Dartmouth in the spirit of Rocky Boots. ------------------------------ Date: 2 May 86 13:07 PDT From: Stern.pasa@Xerox.COM Subject: Expert Systems for PCs In answer to a recent query for "expert systems on PCs" someone supplied a list of software. It seemed to me all the entries were for AI tools, and none of them were expert systems. Is this what was desired? Josh ------------------------------ Date: 1 May 86 19:44:52 GMT From: ihnp4!houxm!mtuxo!orsay@ucbvax.berkeley.edu (j.ratsaby) Subject: Boltzman Machine I am interested to know who did/does research about neural networks specifically those that are based on stochastic theory. I would like to the status of these researches. thanks in advance joel Ratsaby AT&T I.S.L Middletown N.J (201)957-2649 :wq ------------------------------ Date: 1 May 86 18:26:26 GMT From: ulysses!gamma!pyuxww!pyuxv!sr@ucbvax.berkeley.edu (S Radtke) Subject: Re: neural networks In article <837@mhuxt.UUCP> js2j@mhuxt.UUCP (sonntag) writes: >A recent issue of 'Science' had an article on 'neural networks', which, >apparently consist of ... etc. To set the facts straight. The name of the mag is Science 86 which is published by AAAS and is not to be confused with the journal Science, also published by AAAS. >They said incredibly little about the actual details of >how each node operates, unfortunately. Probably because its intended audience is rather broad - intelligent people with no particular expertise or training assumed. Kind of a Readers Digest for Yuppies with a high-tech inclinations. > So how about it? Has anybody else heard of these things? Is this >really a way of going about AI in a way which *may* be similar to what >brains do? Just exactly what algorithms are the nodes implementing, and >how do you provide input and get output from them? Does anyone know >where I could get more information about them? You might try turning to the back of the magazine, to a section listing articles for further, deeper reading. Or you can look in today's paper (if you happen to read the NY Times) and check the article on page D2 which announces the commercial availability of the Connection Machine from a start-up concern in Cambridge. Probably next week there will be ads on CBS during the evening news. Steve Radtke bellcore!u1100a!sr Bell Communications Research Piscataway, NJ ------------------------------ Date: 3 May 86 01:29:02 GMT From: dali.berkeley.edu!regier@ucbvax.berkeley.edu (Terrance P. Regier) Subject: Re: neural networks In article <175@sdics.UUCP> cottrell@sdics.UUCP (Gary Cottrell) writes: > >Hopfield is the one who did the traveling salesman problem. I'm not sure >where he is, tho. > J.J Hopfield is at the: Division of Chemistry and Biology California Institute of Technology Pasadena, CA 91125 -- Terry ------------------------------ Date: 1 May 86 15:54:19 GMT From: ucdavis!lll-lcc!lll-crg!caip!seismo!harvard!cmcl2!lanl!crs@ucbvax .berkeley.edu (Charlie Sorsby) Subject: Re: neural networks > A recent issue of 'Science' had an article on 'neural networks', which, > . > . > . In a related vein, the 7 April, 1986 issue of Electronic Engineering Times (an electronics engineering newspaper) featured the following articles in the Computer Engineering section: Hopfield's Nerve Nets Realize Biocomputing Neural Chips Emulate Brain Functions Brain-Emulating Circuits Need `Sleep' and `Dreams' Several other issues of this weekly paper have, over the past month or so, carried one or more related articles. -- The opinions expressed are not necessarily those of my employer, the government or your favorite deity. Charlie Sorsby ...!{cmcl2,ihnp4,...}!lanl!crs crs@lanl.arpa ------------------------------ Date: 2 May 86 15:48:10 GMT From: ucdavis!lll-lcc!lll-crg!seismo!rochester!goddard@ucbvax.berkeley.edu (Nigel Goddard) Subject: Re: neural networks Departments working in this area include, amongst others: C.S. University of Rochester Carnegie Mellon Cog Sci University of California, San Diego ?? University of Massachussets, Amherst There is a technical report "Rochester Connectionist Papers" available here which probably references a lot of other work as well. Nigel Goddard ------------------------------ Date: 4 May 86 04:16:08 GMT From: ucdavis!lll-lcc!lll-crg!topaz!harvard!bu-cs!jam@ucbvax.berkeley.edu (Jonathan A. Marshall) Subject: Re: neural networks Stephen Grossberg has been publishing on neural networks for 20 years. He pays special attention to designing adaptive neural networks that are self-organizing and mathematically stable. Some good recent references are: (Category Learning):---------- G.A. Carpenter and S. Grossberg, "A Massively Parallel Architecture for a Self-Organizing Neural Patttern Recognition Machine." Computer Vision, Graphics, and Image Processing. In Press. G.A. Carpenter and S. Grossberg, "Neural Dynamics of Category Learning and Recognition: Structural Invariants, Reinforcement, and Evoked Potentials." In M.L. Commons, S.M. Kosslyn, and R.J. Herrnstein (Eds), Pattern Recognition in Animals, People, and Machines. Hillsdale, NJ: Erlbaum, 1986. (Learning):------------------- S. Grossberg, "How Does a Brain Build a Cognitive Code?" Psychological Review, 1980 (87), p.1-51. S. Grossberg, Studies of Mind and Brain: Neural Principles of Learning, Perception, Development, Cognition, and Motor Control. Boston: Reidel Press, 1982. S. Grossberg, "Adaptive Pattern Classification and Universal Recoding: I. Parallel Development and Coding of Neural Feature Detectors." Biological Cybernetics, 1976 (23), p.121-134. S. Grossberg, The Adaptive Brain: I. Learning, Reinforcement, Motivation, and Rhythm. Amsterdam: North Holland, 1986. (Vision):--------------------- S. Grossberg, The Adaptive Brain: II. Vision, Speech, Language, and Motor Control. Amsterdam: North Holland, 1986. S. Grossberg and E. Mingolla, "Neural Dynamics of Perceptual Grouping: Textures, Boundaries, and Emergent Segmentations." Perception & Psychophysics, 1985 (38), p.141-171. S. Grossberg and E. Mingolla, "Neural Dynamics of Form Perception: Boundary Completion, Illusory Figures, and Neon Color Spreading." Psychological Review, 1985 (92), 173-211. (Motor Control):--------------- S. Grossberg and M. Kuperstein, Neural Dynamics of Adaptive Sensory- Motor Control: Ballistic Eye Movements. Amsterdam: North-Holland, 1985. If anyone's interested, I can supply more references. ------------------------------ Date: 1 May 86 14:40:02 GMT From: ihnp4!think!craig@ucbvax.berkeley.edu (Craig Stanfill) Subject: Re: connection machine articles The Connection Machine has now been officially announced as a commercial product. Requests for information relevant to AI should be directed to: David Waltz Knowledge Representation and Natural Language Group Thinking Machines Corporation 245 First Street Cambridge, MA 02142 Please use U.S. mail. When I get a chance, I will post some basic specs for the machine on this list. -Craig Stanfill ------------------------------ Date: 2 May 86 14:10:52 GMT From: decvax!wanginst!apollo!molson@ucbvax.berkeley.edu (Margaret Olson) Subject: Re: String Reduction >requiring as TRAC does that strings be specifically called with >the "cl" operator. In other words, you could say *(macro,...) instead >of #(cl,macro,...). Wegner leaves it as an exercise to the reader to In the version of TRAC that I worked with in 1983, you could say #(macro) and ##(macro). As I recall, these two cases were treated exactly like #(cl,macro) and ##(cl,macro). This version had a considerably larger set of primitives than those discussed in all the TRAC papers and documentation that I ever saw. String reduction has been used to solve real problems. A company called Data Concepts used TRAC to write an applications generator. The applications generator was used by insurance raters to write rating systems. Rating systems are hard because insurance rating rules change all the time (like every day as far as I could tell). Anyway, TRAC was used for a real product. I think that Allstate is still using this stuff for some kinds of commercial policies. TRAC trivia: It was developed and originally owned by Calvin Mooers, and then sold to Data Concepts Inc. Data Concepts has since gone bankrupt, so I believe that TRAC is now owned by some type of bankruptcy court entity. It is (presumably) for sale. Margaret Olson. molson@apollo ------------------------------ Date: 2 May 86 08:59:31 GMT From: brahms!weemba@ucbvax.berkeley.edu (Matthew P. Wiener) Subject: Re: Italo Calvino AI project I've directed followups to net.books. > I must apologize to Bandy for posting a genuine rumor to net.rumor, but >this is a real rumor I found on net.followup: > >>I have it on good authority (although second-hand) that an entire >>*novel* was generated by computer. It was the result of a research >>project which aimed to "parameterize" an author's writing style. The >>study concentrated primarily on one author, Italo Calvino, and I have >>heard that the novel, "If on a winter's night a traveller", was actually >>published and marketed with Calvino's blessing. >[Jack Orenstein] Now this is an interesting rumor. I suppose I should reread the book, but I'll go on memory. It's opening chapter struck me as one of the funniest things I have ever read. But it then wore down rather tiresomely. I doubt if a computer could have come up with the scheme of the book, the plot, or the opening chapter. But as for the rest? The plotting was more stilted than usual for Calvino--but I thought that was the point. The joke was dragged out longer than he usually does. And it was his first novel in a decade. Hmmm... Let's just say I'm very incredulous. Perhaps, more likely, the *rumor* was generated with Calvino's blessing. ucbvax!brahms!weemba Matthew P Wiener/UCB Math Dept/Berkeley CA 94720 ------------------------------ Date: Sat, 3 May 86 21:29 EDT From: ART@AQUINAS.THINK.COM Subject: Italo Calvino >I have it on good authority (although second-hand) that an entire >*novel* was generated by computer. It was the result of a research >project which aimed to "parameterize" an author's writing style. The >study concentrated primarily on one author, Italo Calvino, and I have >heard that the novel, "If on a winter's night a traveller", was actually >published and marketed with Calvino's blessing. [Jack Orenstein] If On A Winter's Night A Traveller has, as part of it's plot, the story of two people trying to read a novel called If On A Winter's Night a Traveller. Among their troubles is their inability to determine the authorship of the book. At one point, they discover that the book they are reading (or you are reading; fans of self-referentiality will have a ball) may have been written by a machine. Maybe this rumor's authority confused the novel with it's plot. On the other hand, maybe that was the point.... Art Medlar Thinking Machines Corp. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Thu May 8 00:53:28 1986 Date: Thu, 8 May 86 00:53:24 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #115 Status: RO AIList Digest Wednesday, 7 May 1986 Volume 4 : Issue 115 Today's Topics: Query - Computer Resources Management, Literature - Connection Machine Articles & U. Kansas Tech Reports, Philosophy - Consciousness, AI Approaches - Learning, Linguistics - Trademarks ---------------------------------------------------------------------- Date: Mon 5 May 86 09:48:03-PDT From: Jean-Pierre Dumas Subject: Computer resources management I post this for a friend. I will forward any mail. dumas@sumex I am interested in computer system performance analysis modelling. I am indeed developing a system, based on AI techniques, to deal with tuning and performance planning of computer system management. I would be delighted to be in touch with people concerned with this question. Address : Dr. Saddek BELAID CISI-TELEMATIQUE CEN-SACLAY BP 24 91190 GIF/YVETTE FRANCE Phone : (+33) 1 69 08 20 12 ------------------------------ Date: 1 May 86 18:46:00 GMT From: hplabs!hpfcdc!hpfcla!hpcnoe!jd@ucbvax.berkeley.edu Subject: Re: connection machine articles Daniel Hillis has written a book entitled "The Connection Machine". It is available through the Library of Computer and Informaiton Sciences (book club). I am sure that It can be found elsewhere.I just recieved the book and It seems very readable if not intriguing. Hope I have Helped, John Dye Hewlett Packard {inhp4|hplabs}!hpfcla!hpcnoa!jd Colorado Networks Division ------------------------------ Date: 4 May 86 05:51:56 GMT From: nike!topaz!harvard!think!bruce@ucbvax.berkeley.edu (Bruce J. Nemnich) Subject: Re: connection machine articles Also, if all you have read is the old AI memo, you should definitely read the book, |The Connection Machine|, by Danny Hillis, published last year by the MIT Press. -- --Bruce Nemnich, Thinking Machines Corporation, Cambridge, MA --bruce@think.com, ihnp4!think!bruce; +1 617 876 1111 ------------------------------ Date: Fri, 2 May 86 10:16:26 CDT From: Glenn Veach Subject: Tech reports - University of Kansas Following is a list of recent technical reports which have been issued by the department of Computer Science of the University of Kansas in conjunction with research done in the department's Artificial Intelligence Laboratory. %A Frank M. Brown %T Reasoning in a Hierarchy of Deontic Defaults %I Department of Computer Science, University of Kansas %R TR-86-2 %X A commonsense theory of reasoning is presented which models our intuitive ability of reason about defaults involving both deontic and doxastic logic. The concepts of this theory do not involve fixed points or Kripke semantics but instead are explicitly defined in a modal quantificational logic which captures the modal notion of logical truth. An example involving derivations of obligations from both a robot's beliefs and a hierarchy of deontic defaults is given. To be published in the proceedings of the 1986 Canadian Artificial Intelligence Conference. 11 pp. %A Frank M. Brown %T Toward a Commonsense Theory of Nonmonotonicity %I Department of Computer Science, University of Kansas %R TR-86-3 %X A logical theory of nonmonotonic reasoning is presented which permits a commonsense approach to defaults. The axioms and inference rules for a modal logic based on the concept of logical truth are described herein along with basic theorems about nonmonotonic reasoning. An application to the frame problem in robot plan formation is presented. To be published in the proceedings of the Eight International Conference on Automated Deduction. 12 pp. %A Frank M. Brown %T A Comparison of the Commonsense and Fixed Point Theories of Nonmonotonicity %I Department of Computer Science, University of Kansas %R TR-86-4 %X The mathematical fixed point theories of nonmonotonic reasoning are examined and compared to a commonsense theory of nonmonotonic reasoning which models our intuitive ability to reason about defaults. It is shown that all of the known problems of the fixed point theories are solved by the commonsense theory. The concepts of this commonsense theory do not involve mathematical fixed points, but instead are explicitly defined in a monotonic modal quantificational logic which captures the modal notion of logical truth. 12 pp. %A Frank M. Brown %T An Experimental Logic Based on the Fundamental Deduction Principle %I Department of Computer Science, University of Kansas %R TR-86-5 %X Experimental logic can be viewed as a branch of logic dealing with the actual construction of useful deductive systems and their application to various scientific disciplines. In this paper we describe an experimental deductive system called the SYMbolic EVALuator (i.e. SYMEVAL) which is based on a rather simple, yet startling principle about deduction, namely that deduction is fundamentally a process of replacing expressions by logically equivalent expressions. This principle applies both to logical and domain dependent axioms and rules. Unlike more well known logical inference systems which do not satisfy this principle, herein is described a system of logical axioms and rules called the SYMMETRIC LOGIC which is based on this principle. Evidence for this principle is given by proving theorems and performing deduction in the areas of set theory, logic programming, natural language analysis, program verification, automatic complexity analysis, and inductive reasoning. To be published in the international journal Artificial Intelligence. 120 pp. %A Frank M. Brown %T Automatic Deduction in Set Theory %I Department of Computer Science, University of Kansas %R TR-86-6 %X A proof of the definability of ordered pairs in set theory is described and discussed. This proof was obtained in an entirely automatic way using the SYMEVAL deduction system and the SYMMETRIC LOGIC axioms. The analogous point in this proof where other theorem proving methods and systems have failed to prove this theorem are described. The ability of this system to automatically derive one half of this theorem from the other half is also discussed, thus showing that this kind of deduction system can be used to produce answers other than just yes/no answers to mathematical questions. 24 pp. %A Frank M. Brown %T An Experimental Logic %I Department of Computer Science, University of Kansas %R TR-86-7 %X The fundamental deduction principle, SYMEVAL deductive system, and SYMMETRIC LOGIC are introduced. Theorems are proved in the area of set theory, complexity analysis and program verification. 17 pp. %A Frank M. Brown %T Logic Programming with an Experimental Logic %I Department of Computer Science, University of Kansas %R TR-86-8 %X In this paper we describe the experimental programming logic which uses the deductive system SYMEVAL which is based on the fundamental deduction principle. Theorems and deductions are performed in the area of logic programming and then discussed as they relate to the above principle. 18 pp. ------------------------------ Date: 29 Apr 86 16:19:45 GMT From: tektronix!uw-beaver!fluke!ssc-vax!bcsaic!michaelm@ucbvax.berkeley .edu (michael maxwell) Subject: Consciousness In light of the recent flurry of articles on consciousness (of computers, toasters, Endomoeba histolitica...), some readers may be interested in a recent book: "Animal Thinking", by Donald Griffin. I've just started reading it, so I can't say much; but the author is an ethologist (=student of animal behavior), and his contention is that many animals *are* concious. -- Mike Maxwell Boeing Artificial Intelligence Center ...uw-beaver!uw-june!bcsaic!michaelm ------------------------------ Date: 29 Apr 86 13:26:18 GMT From: ucdavis!lll-lcc!lll-crg!seismo!mcvax!ukc!warwick!gordon@ucbvax. berkeley.edu (Gordon Joly) Subject: Plan 5 for Inner Space - A Sense of Mind. The following project has been proposed. Design and implement an Intelligent System with the following characteristics. The system is to run in real time and be portable. Memory and processing units must be in the same enclosure, run on low power and not overheat. (a) Full colour binocular vision, with motion perception. (b) Speech processing and speech synthesis. (c) Natural language ability :- (1) Semantic ability (2) Translation. (3) Ability to summarise. (4) Humour (optional). (d) Learning ability. (e) Ability to control a large number of servo mechanisms, with strength and sensitivity. (f) Other tasks, as yet unspecified, but the system must be able to cope with extra requirements, as and when the need arises, using characteristic (d). Queries: Time to completion? Cost? ------------------------------ Date: 5 May 86 11:33:00 MST From: fritts@afotec Reply-to: Subject: Re: Science 86 Article on Neural Nets I N T E R O F F I C E M E M O R A N D U M Date: 5-May-1986 10:18 MDT From: STEVE E. FRITTS FRITTS Dept: 1859ISSS/SIP Tel: 505-846-2595 TO: Remote Addressee ( _MAILER!AILIST@SRI-AI ) Subject: Re: Science 86 Article on Neural Nets Most of what I've read on this list appears to place AI closer to the "Frankenstein" theory of assembling intelligence, fully formed and functioning, like any other computer program; just push the button and watch it go. Neural networks appear to be more natural in their approach. Terry Sejnowski's NETalk was equipped more with rules on how to learn to perform a task than rules on how to perform a task. I think that this is a crucial difference. If a computer is programmed only to perform a task, then the programmer must design for every possible eventuality which may affect the performance and for every possible consequence or outcome. The problem is that such a program, no matter how comprehensive, makes assumptions. These assumptions are fatal for intelligence. They doom the program as surely as evolution dooms some species of life on this planet, and for much the same reason. Human intelligence may have developed as the ultimate weapon against changing environments; better than adaptation because it allows for greater variety of response. So, if "intelligence" is developed in a computer through learning mechanisms rather than assembled by means of cunning rules and algorithms, perhaps it stands a better chance of achieving sufficient universality that it may compete with the human mind. Odd that we would dream of building our own competition. I vaguely recall that a long time ago there were machines called analog computers which worked on a principle of varying voltages and resistances rather than the digital machine's method of detecting the polarity (the "on" or "off" state) of a particular circuit junction. Hopfield and Tank's neural net appears to perform in some ways similar to an analog computer. The article is too general on the technicals of a "neural net" machine and I add my request to others on this list for a little better technical description. Also, perhaps someone will enlighten me about the possible relevance or irrelevance of analog computers to neural nets. DISCLAIMER: My opinions are my own alone and do not represent any official position by my employer. Steve Fritts FRITTS@AFOTEC.ARPA ------------------------------ Date: Fri 2 May 86 11:33:51-CDT From: Gordon Novak Jr. Subject: Xerox as a verb I think it was William Safire who stated the metarule: You can verb anything. At least in Washington. ------------------------------ Date: 2 May 86 13:30 PDT From: Stern.pasa@Xerox.COM Subject: Trademarks There's language and language. Yes, there is a lexical distinction between xerox and Xerox, but does the law recognize lexical vs other discriminations between usages? Yes, sort of, maybe. One might use syntactic or semantic analysis of usages to determine whether it is acceptable to use a trademarked word, but NL workers know how difficult it is to produce an absolute semantic analysis of unrestricted language. So instead, companies protecting trademarks work at a higher level of abstraction, the real-world script. They know that any unrestricted use of a word leads to bad consequences, so their heuristic for when to complain is based on factors exogenous to the apparent linguistic content in which the reference appears. In conclusion it is fascinating that the legal protection of trademarks should involve such a wide variety of linguistic considerations. There are no easy answers to the theoretical questions involved, but as KIL points out, there are laws. P.S. None of the above is to be taken as the position of my employer. Josh ------------------------------ Date: Fri 2 May 86 17:24:26-PDT From: Pat Hayes Subject: Re: Names and Trademarks Of course, I understand that the company is legally obliged to correct uses of its name in order to retain trademark status. My point was that as a matter of fact, like it or not, to xerox is now a verb in common usage, and is going to stay that way. I have a dictionary ( Random House ) in which Xerox(TM) is both a noun and a verb, and xerography ( no capitalisation or trademark ) is another noun. Clearly, the company insisted that the publishers gave trademark acknowledgement: equally clearly, both the publishers and the company acknowledge that the word is part of the language. There are important differences between xerox and asprin on one hand, and exxon and frigidaire and IBM on the other. In these latter cases, identification was due to the company having a dominating position in the market, and nothing else. In the former cases, it was the only owner and supplier of a vital piece of technology, during the period in which it became a commonplace of everyday life, and indeed transformed everyday life. And finally, a last difference is that in both the former cases there was and is no alternative way of referring to the things available. What is a Canon xerox machine if it isnt that? It has to be some awkward neologism like a dry copier, or a copier using the xerographic process. What would we call an asprin if we couldnt call it an asprin? Like Bayer, you guys have been too successful: not only did you invent the process, you also invented the way of talking about it. Patrick J. Hayes (TM) PS> I am told that in the oil business, to schlumberger is a common verb. ------------------------------ Date: Sat 3 May 86 02:20:42-PDT From: Lee Altenberg Subject: "Exxon" vs. "exon" . I remember reading in Time Magazine around 1970 when ENCO/ESSO Oil Corp. unveiled its new name, "Exxon". They had looked through all the major languages of the world to find one word that didn't mean anything in any of them. "Exxon" was what they found. Alas. In 1978, Walter Gilbert of Harvard came up with new words for the newly discovered pieces that eukaryotic genes are made of: "intron" for the spliced out sequences, and "exon" for the expressed sequences. I wonder what went through the minds of the CEOs of Exxon when they caught wind of this? I should mention a sign I saw in the Bioengineering Dept. at UC Berkeley: --AXXON-- MOTOR NEURON SERVICE -Lee Altenberg ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 9 19:07:48 1986 Date: Fri, 9 May 86 19:07:41 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #116 Status: R AIList Digest Thursday, 8 May 1986 Volume 4 : Issue 116 Today's Topics: Seminars - Planning, Knowledge, and Action (UPenn) & Knowledge Engineering as Ontological Analysis (SU) & Default Theories and Autoepistemic Logic (CSLI) & NL Database Query Systems (UPenn) & Sequential and Parallel Inference Machines (Edinburgh) & Ulysses Expert-System VLSI Design Environment (UPenn) & Granularity (SRI) & Eazyflow: an Effective Alternative to Dataflow (CMU), Conference - Workshop on Intelligent Interfaces at AAAI-86 ---------------------------------------------------------------------- Date: Mon, 5 May 86 13:56 EDT From: Tim Finin Subject: Seminar - Planning, Knowledge, and Action (UPenn) Colloquium - University of Pennsylvania 3:00pm May 6, 1986 216 Moore School A FIRST ORDER THEORY OF PLANNING, KNOWLEDGE, AND ACTION LEORA MORGENSTERN - NEW YORK UNIVERSITY Most AI planners work on the assumption that they have complete knowledge of their problem domain and situation, so that formulating a plan consists of searching through some pre-packaged list of action operators for an action sequence that achieves some desired goal. Real life planning rarely works this way, because we usually don't have enough information to map out a detailed plan of action when we start out. Instead, we initially draw up a sketchy plan and fill in details as we proceed and gain more exact information about the world. This talk will present a formalism that is expressive enough to describe this flexible planning process. We begin by discussing the various requirements that such a formalism must meet, and present a syntactic theory of knowledge that meets these requirements. Next, we discuss the paradoxes, such as the Knower Paradox, that arise from syntactic treatments of knowledge, and propose a solution to these paradoxes based on Kripke's solution to the Liar Paradox. Finally, we give solutions to the Knowledge Preconditions and Ignorant Agent Problems as part of an integrated theory of planning. The talk will include comparisons of our theory with other syntactic and modal theories such as Konolige's and Moore's. We will demonstrate that our theory is powerful enough to solve classes of problems that these theories cannot handle. ------------------------------ Date: Mon 5 May 86 17:20:08-PDT From: Christine Pasley Subject: Seminar - Knowledge Engineering as Ontological Analysis (SU) CS529 - AI In Design & Manufacturing Instructor: Dr. J. M. Tenenbaum Title: Knowledge Engineering as Ontological Analysis Speaker: Patrick Hayes From: Schlumberger Palo Alto Research Date: Wednesday, May 7, 1986 Time: 4:00 - 5:30 Place: Terman 556 When designing a knowledge-base for use by an AI system, it is important to bear in mind how utterly stupid computers are. We must provide them with a vocabulary in which to think about their world, and the scope of their thoughts is then limited by the expressiveness of this vocabulay: in particular, the kinds of object it is able to talk about. This talk will illustrate this point, and emphasise how important it is to choose the representational vocabulary to fit both the limitations and the range of the systems desired abilities. Ways of referring to times and events will be used as examples. Visitors welcome! ------------------------------ Date: 05 May 86 1625 PDT From: Vladimir Lifschitz Subject: Seminar - Default Theories and Autoepistemic Logic (CSLI) ON THE RELATION BETWEEN DEFAULT THEORIES AND AUTOEPISTEMIC LOGIC Kurt Konolige SRI International and CSLI Common Sense and Non-Monotonic Reasoning Seminar Thursday, May 8, 4pm MJH 252 Default theories are a formal means of reasoning about defaults: what normally is the case, in the absence of contradicting information. Autoepistemic theories, on the other hand, are meant to describe the consequences of reasoning about ignorance: what must be true if a certain fact is not known. Although the motivation and formal character of these systems are different, a closer analysis shows that they bear a common trait, which is the indexical nature of certain elements in the theory. In this talk I will show how default theories can be reanalyzed as a restricted type of indexical theory. The benefits of this analysis are that it gives a clear (and clearly intuitive) semantics to default theories, and combines the expressive power of default and autoepistemic logics in a single framework. ------------------------------ Date: Tue, 6 May 86 21:40 EDT From: Tim Finin Subject: Seminar - NL Database Query Systems (UPenn) Forwarded From: Naoki Abe on Tue 6 May 1986 at 18:18 A REMINDER OF A COLLOQUIUM Thursday 5/8, 3:00pm, 216 Moore School There will be an interesting talk on natural language database query systems by Dr. Stanley R. Petrick of I.B.M. Thomas J. Watson Research Center. Dr. Petrick is a former president of the Association for Computational Linguistics, and is known for developing the first parsing algorithm for transformational grammars, characterizing various parsing algorithms for context free grammars in terms of push down automata, as well as his earlier work on the minimal covering problem and its application on speech recognition. In this talk he will discuss more practical issues concerning natural language query systems. The following is the abstract of this talk. Natural Language Database Query Systems Dr. Stanley R. Petrick Thomas J. Watson Research Center, I.B.M. In recent years many computer systems have been developed with limited capabilities for understanding natural language requests for information from a given database and for responding appropriately. In this talk we shall attempt to characterize the theory underlying these systems and the level of performance that they have demonstrated. Special attention will be given to the problem of customizing such systems to handle new databases. Illustrative material will be drawn from the T.Q.A. (Transformational Question Answering) system, an experimental prototype being developed at I.B.M. Research. ------------------------------ Date: Tue, 6 May 86 10:18:52 -0100 From: Gideon Sahar Subject: Seminar - Sequential and Parallel Inference Machines (Edinburgh) EDINBURGH AI SEMINARS Date: Wednesday, 7th May l986 Time: 2.00 p.m. Place: Department of Artificial Intelligence Seminar Room - F10 80 South Bridge EDINBURGH. Professor David H.D. Warren, Department of Computer Science, University of Manchester will give a seminar entitled - "Sequential and Parallel Inference Machines". There is a growing interest, stimulated in large part by Japan's Fifth Generation project, in computer architectures where the basic machine language is a form of symbolic logic, and the basic machine operation is a form of logical inference. Prolog is the best known, but not the only, example of such a language. How fast can such machines run? I will consider both sequential machines, which perform only one logical inference at a time, and parallel machines, which can perform more than one logical inference at a time. First, I will describe my work with Evan Tick on the design of a Prolog instruction set and pipelined processor. This work suggests that a sequential Prolog machine can achieve a speed approaching one million logical inferences per second (IM LIPS) with current device technology. This estimate has been confirmed by experimental prototypes, produced at Berkeley and NEC. In the second part of the talk I will discuss various approaches to exploiting parallelism, including the Argonne approach to or-parallelism, and the approach of DeGroot and others to and-parallelism. ------------------------------ Date: Wed, 7 May 86 14:31 EDT From: Tim Finin Subject: Seminar - Ulysses Expert-System VLSI Design Environment (UPenn) Electrical Engineering Colloquium - University of Pennsylvania 11:00am May 9, 1986 - 129 Pender Lab Ulysses -- An Expert-System Based VLSI Design Environment Michael l. Bushnell Carnegie-Mellon University It has recently been observed that the initial engineering design cost for VLSI circuits is beginning to exceed the lifetime production cost. In order to reduce this prohibitive design cost, which is limiting the practical applications of VLSI technology, we need a real increase in the automation of design activities. Ulysses is a VLSI CAD environment which effectively addresses the problem of CAD tool integration and which also allows further automation of the VLSI design process. The goal of this environment is to raise the designer interface for CAD systems from the CAD tool level to the design task level. The environment is intended to be used in design synthesis, design-for-testability, analysis, verification and optimization activities at all levels of VLSI design. Specifically, Ulysses alleviates the problems caused by incompatible file formats for CAD tools, allows one to codify a design methodology, allows the methodology to be semi-automatically executed and allows the VLSI design space to be explicitly represented. The environment automatically executes existing CAD tools, according to instructions expressed in the codified design methodology, in order to accomplish design tasks. Ulysses keeps track of the progress of a design and lets the designer explore the design space. Ulysses uses Artificial Intelligence methods, functions as an interactive expert system, and interprtets language descriptions of design tasks, which are described in the Scripts language. Alternatively, the Scripts language may be viewed as an organization-structuring language for CAD applications in engineering. An example of an IC layout design task will be presented, in which a knowledge-based router, a layout synthesizer, and an interactive floor planner will be controlled by Ulysses in a non-deterministic and opportunistic fashion in order to produce a viable IC layout from a circuit description expressed in the logic element/transistor level in a hardware description language. ------------------------------ Date: Wed 7 May 86 14:51:37-PDT From: LANSKY@SRI-AI.ARPA Subject: Seminar - Granularity (SRI) GRANULARITY Jerry R. Hobbs (HOBBS@SRI-AI) Artificial Intelligence Center, SRI International CSLI, Stanford University 11:00 AM, MONDAY, May 12 SRI International, Building E, Room EJ228 (new conference room) We look at the world under various grain sizes and abstract from it only those things that serve our present interests. We can view a road,for example, as a line, a surface, or a volume. Such abstractions enable us to reason about situations without getting lost in irrelevant complexities. Knowledge-rich intelligent systems will have to have similar capabilities. In this talk I will present a framework in which we can understand such systems. In this framework, a knowledge base consists of a global theory together with a large number of relatively simple, idealized, grain-dependent local theories, interrelated by articulation axioms. In a complex situation, the crucial features are abstracted from the environment, determining a granularity, and the corresponding local theory is selected. This is the only computation done in the global theory. The local theory is then applied in the bulk of the problem-solving process. When shifts in perspective are required, articulation axioms are used to translate the problem and partial results from one local theory to another. In terms of this framework, I will discuss idealization, the concepts of supervenience and reducibility, prototype-deformation types of description, and the emergence of global properties from local phenomena, and the relationship of granularity to circumscription. Several examples of uses of this framework from a wide variety of applications will be given. VISITORS: Please arrive 5 minutes early so that you can be escorted up from the E-building receptionist's desk. Thanks! ------------------------------ Date: 6 May 1986 0754-EDT From: Theona Stefanis@A.CS.CMU.EDU Subject: Seminar - Eazyflow: an Effective Alternative to Dataflow (CMU) PS SEMINAR Edward Ashcroft, SRI Date: Monday, 12 May Time: 3:30 Place: WeH 5409 Title: "Eazyflow: an Effective Alternative to Dataflow" Eazyflow is a evaluation strategy for Operator Nets. Syntactically, operator nets are similar to dataflow graphs. Their semantics is expressed mathematically, and is more general and elegant than the semantics of dataflow networks. Various ways of specifying their operational semantics are possible, and eazyflow is one such way, that is a hybrid of demand-driven and data-driven evaluation. (Data-driven evaluation is what is normally called dataflow. Demand-driven evaluation avoids a lot of the problems that dataflow has. Eazyflow is basically demand-driven, with data-driven computation taking place when it can do so without causing too many problems.) This talk will describe operator nets and their mathematical semantics, indicate how they correspond exactly to programs in the language Lucid, show how eazyflow is often superior to dataflow, and briefly describe the architecture of the eazyflow engine that is soon to be built at SRI (the Eazyflow Architecture Project is currently part of the DARPA Strategic Computing Program). Also, some simulation results that have been obtained for the architecture will be described. ------------------------------ Date: 6 May 1986 12:02-PDT From: Neches@isi-vaxa.arpa (Robert Neches) Subject: Conference - Workshop on Intelligent Interfaces at AAAI-86 A workshop on Intelligent Interfaces is scheduled to be held on Thursday, August 13th, as part of the AAAI conference in Philadelphia. We would like to bring the call for abstracts to your attention, and would appreciate it if you would circulate it to anyone else who might find it of interest. -- Tom Kaczmarek (Kaczmarek@USC-ISIB.arpa) Bob Neches (Neches@ISI-Vaxa.arpa) Workshop Co-chairs. USC / Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 (213) 822-1511 Questions may be addressed to either chairman; abstracts should be sent to Tom Kaczmarek by June 15. The complete call for abstracts follows. ***************************************************************************** WORKSHOP ON INTELLIGENT INTERFACES AT AAAI-86 Many AI techniques are applicable to building better human-machine interfaces. The purpose of this workshop is to investigate intelligent interface techniques that can potentially span many interaction modalities. The workshop will discuss interfaces to knowledge-based systems as well conventional interactive systems. Past work in this area has been directed at using AI to provide either an "intelligent apprentice" or a collection of "power tools." The intelligent apprentice emphasizes assistance based on an understanding of the user's intentions and task domain. The power tool approach emphasizes a powerful command set, but leaves the responsibility for selecting and applying commands in the hands of the user. This workshop is concerned not just with the extremes of this dichotomy, but also with work that shows how to blend the two approaches effectively. Work on specific media and modalities, (e.g., natural language text or speech understanding) is also relevant in that it can provide abstractions of understanding and generation that will be potentailly useful across a wide range of interface media and modalities. Topics to be discussed: What are the fundamental interface problems that AI can help solve? What specific AI techniques can be useful in solving these problems? What abstractions of "understanding" and "generation" can come from work on natural language text and speech? What are the possibilities for symbiotic relationships between intelligent interfaces and intelligent systems? What does it take to create intelligent interfaces to conventional interactive systems? Are the power tools and intelligent assistance approaches at odds with one another? Are middle-of-the-road approaches motivated by pragmatism or principle? Organizers: The workshop organizers are Thomas Kaczmarek, Larry Miller, Robert Neches and Norman Sondheimer of the USC/Information Sciences Institute. Participation: The workshop will run for a full day on Thursday, August 13 at the University of Pennsylvania. The format will be a combination of short informal presentations and open discussions with the former being used to stimulate the latter. These will be organized in four sessions, the topics of which will be finalized after reviewing the declared interests of participants. Attendence will be by invitation only; there will be a maximum of 50 participants. Those wishing to participate should submit four copies of a 1000-word abstract describing either their work building intelligent interfaces or a position on a topic relevant to the goals of the workshop. Abstracts should provide contact information at the top, as they will be duplicated and distributed to the other workshop attendees. Participants with a willingness to make a short presentation (15-30 minutes) about either their research or a position on a relevant topic should indicate this desire in a cover letter sent with the abstract. If multiple members of a research group would like to attend, please indicate the number involved in the cover letter also. Abstracts should be sent to Thomas Kaczmarek, USC/ISI, 4676 Admiralty Way, Marina del Rey, CA. 90292-6695. They may also be transmitted electronically to Kaczmarek@USC-ISIB.arpa. The deadline for submission of abstracts is June 15, 1986. Invitations will be issued by July 15. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 9 19:08:29 1986 Date: Fri, 9 May 86 19:08:22 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #117 Status: R AIList Digest Friday, 9 May 1986 Volume 4 : Issue 117 Today's Topics: AI Tools - Common Lisp Support for Object-Oriented Programming ---------------------------------------------------------------------- Date: 29 Apr 86 11:26:00 PDT From: "Jennings, Richard" Reply-to: "Jennings, Richard" Subject: Summary: Common Lisp Support for Object Oriented Programming I posted a query to AILIST concerning available PUBLIC DOMAIN object oriented support within the Common Lisp programming environment. This article should serve to disseminate to the network the information I obtained. FIRST, my original query is reproduced. SECOND, is a summary of specific references (network addresses) to whom follow-up questions should be directed. THIRD is an edited summary of some of the responses I recieved. Finally, I am providing some further information about the project I am supporting, because of numerous requests. I. Original Query: Article 469 of mod.ai: Subject: Object Oriented Support For Common Lisp Date: 24 Apr 86 06:46:40 GMT I am working on a project trying to couple a good programming environment exploiting object oriented paradigms to a grid of INMOS Transputers. Rather than build up everything from the OCCAM development system, I would like to use the VAX LISP (a variant of Common Lisp) environment augmented with a public domain (preferably) object oriented package as a model for the system I intend to build for the Transputers. 1) I would like pointers to environments which are compatible (sit on top of) VAX LISP which directly support object oriented programming; 2) notes from those who may be working on (or interested in) such projects; and 3) responses sent directly to me since I do not have regular access to AILIST. I will summarize. II. Summary of Network Information Sources CORBIT => desmedt%hnykun52.BITNET@wisc.wisc.edu PD Common Lisp => fahlman@c.cs.cmu.edu Common Loops => gregor.pa@xerox.com REX => wells@sri-ai.arpa NCUBE => duke@mitre.arpa VAXLisp Flavors => beer%case.CSNET@csnet-relay.arpa III. Summary of Responses =============================================================================== [1] Subject: OOPS for Lisp and VAXLISP on Transputer Return-Path: The lisp sources that VAXLISP was built from are public domain ... These are the Spice Lisp sources from CMU, contact Fahlman@c.cs.cmu.edu. There are a few object programming standards emerging within the Common Lisp community. A partial list is: Xerox CommonLOOPS, New Flavors (Symbolics), Common Objects (HP Labs), and Object Lisp (LMI). Group Information Contact CommonLOOPS Gregor.pa@Xerox.Com New Flavors Moon@SRC.Symbolics.Com Common Objects Snyder@HPLabs.Com Object Lisp ? [anybody know about this? -rkj] [A message to Scott Fahlman obtained:] Subject: Public Domain VAX LISP Return-Path: What we could give you is Spice Lisp, developed here for the Perq computers and in the public domain. This is essentially Common Lisp written in Common Lisp and a Common Lisp compiler, written in Common Lisp, that produces a special Lisp-oriented byte code that is executed by custom microcode on the Perq. We also have an Emacs-like text editor written in Common Lisp, and some assorted utilities and demos. There's a design document describing the internal organization and defining the byte codes. What various manufacturers, including DEC, have done is to take our sources and modify the code generation modules of the compiler to produce native code for their machine. Most of the byte codes turn into a few native-code instructions on something like a Vax. The more complex ones turn into quick jumps to hand-coded subroutines, probably written in assembler: bignum arithmetic, building and taking apart stack frames, GC, lowest-level operating system interfaces, and so on. To build a system, you then run the modified compiler on some system that already has a Common Lisp, compile our whole body of Lisp code, link in the hand-coded stuff, and if you've done it all right the Lisp comes up in its full glory, ready to go. It is possible to get a reasonably fast implementation by this route, though it takes a good deal of thought and tuning to get the data formats and calling conventions just right. Veterans of our implementation effort have done this port to a new architecture in as little as six man-months ... under optimal conditions. A more realistic time scale for someone starting from scratch on this would be two good wizards working six months to get something turning over, and another six months or a year to get the thing up to full speed and product quality. That's for a straightforward port ... All of the sources add up to 3 or 4 megabytes... Since you ask about Vaxlisp, it is the result of the same process described above, and the work was done here at CMU by DEC employess and by me as a consultant to DEC. The result is owned by DEC and we can't give it to anyone. -- Scott =============================================================================== [2] Subject: CORBIT - an object-oriented programming system Return-Path: You may be interested in CORBIT, an object-oriented programming environment in Common LISP. I will summarize some aspects of the system. 1. History CORBIT stands for ORBIT in Common LISP. ORBIT was originally written in MACLISP by Luc Steels at Schlumberger, then rewritten in FRANZ LISP by Steels and myself, and finally rewritten in NIL Common LISP by myself at the University of Nijmegen. ORBIT and CORBIT are now used by a small number of people in the scientific community and are not commercially available. 2. What is it? CORBIT is basically an object-oriented extension of LISP. As such, it ranks among the Flavors package, Common Loops, etcetera. However, it has some features which make it stand out from the pack: - Inheritance is done by delegation rather than by copying down. See recent articles by Henry Lieberman for a discussion of this distinction. - Partly as a result of this, the system is much more flexible than most similar systems with respect to adding and changing information. For example, one can create instances of objects that don't exist yet. - There is no formal distinction between 'classes' and 'instances'. Everything is an 'object'. The only hard distinction is between named objects and anonymous objects. - Invocation of an object-oriented operation is performed by plain LISP function calling, not by message passing (as done in Common Loops). - There is no distinction between so-called 'instance variables' and 'methods'. Everything is accessed by means of a function. - There are a number of fancy extra features such as 'if-needed' methods and backpointers. 3. Applications Applications have been very much of a pre-prototypical nature so far. ORBIT has been used for VLSI-design, representation of geological knowledge, implementation of a (rather primitive) window system, natural language generation, and a small office environment. 4. Accessibility The only two papers related to CORBIT are really related to its predecessor ORBIT: (1) a manual (slightly outdated, published as an internal report, now out of print but still available on electronic medium) and (2) a forthcoming article which compares the ORBIT and Flavors systems. Koenraad De Smedt Bitnet address: DESMEDT@HNYKUN52 University of Nijmegen Psychological Lab Montessorilaan 3 6525 HR Nijmegen The Netherlands [Koenraad sent me a copy of the report, ~43p, which I am now reading -rkj] =============================================================================== [3] Subject: Portable CommonLoops Return-Path: Portable CommonLoops (PCL) is an implementation of CommonLoops written entirely in CommonLisp. Currently, PCL runs in the following Common Lisps: Xerox Symbolics Lucid Spice TI VAXLisp PCL is available to Arpanet sites by anonymous FTP (username "anonymous", password "anonymous"). For the time being we are restricting distribution to sites which can FTP PCL for themselves because we want to make it possible to have frequent new releases of PCL. The files are stored on PARCVAX.xerox.com. You can copy them using anonymous FTP. There are several directories which are of interest: /pub/pcl/ PCL sources and (some) documentation These following directories contain binary files for some of the machines PCL runs on, there will be more machine specific directories once we are set up to get more binaries. /pub/pcl/3600/ binaries for the 3600 (rel 6.1) /pub/pcl/lucid/sun/ binaries for Lucid Lisp on the SUN (rel 1.0) /pub/pcl/ti/ binaries for the TI Explorer ... In the directory /pub/pcl/ the files: notes.tx contains notes about the current state of PCL, and some instructions for installing PCL at your site. You should read this file whenever you get a new version of PCL. manual.tx is a VERY ROUGH [very rough -rkj] pass at "documentation". I hope there will be some better documentation soon. Send mailing list requests or other administrative stuff to: CommonLoops-Coordinator@Xerox.com [I obtained the VAXLisp sources, and am in the process of bringing them up. They seem to be written for VAXLisp 2.0 under Ultrix; we have version 1.1 running under VMS. I should know in a week or so if I can get CommonLoops up - rkj] =============================================================================== [4] Subject: VAXLisp Flavors Return-Path: Here at the Center for Automation and Intelligent Systems Research we have developed a number of tools and utilities for VAX LISP, one of which is an implementation of Flavors. The distribution details are a bit vague right now, but it looks like the object code will be public domain for a tape and a small handling fee ($5 or $10). The Flavors implementation is fairly complete except for a smaller number of method combination types. It also currently depends on a rather hacked up dynamic closure implementation for VAX LISP. However, we are currently working on a more complete and efficient implementation which is also closer to "New Flavors". This new implementation will not require dynamic closures. I will be releasing a report sometime in the coming month describing all of these facilities ... A number of other VAX LISP tools and utilities are also described, such as a pattern-based top-level history mechanism, a pattern-based apropro facility, an extensible top-level command facility, and an extensible DESCRIBE facility. I'll probably post a message about the availability of these facilities on AIList... Randall D. Beer Center for Automation and Intelligent Systems Research Case Western Reserve University Glennen Bldg. Room 312 Cleveland, OH 44106 (beer%case@CSNet-Relay.ARPA) =============================================================================== [5] Subject: Object Oriented Transputer Programming Return-Path: However, I question whether Common Loops, or probably any available package, is likely to aid your project. You state that you intend to use your object-oriented package (OOP) to model the system you intend to build for the transputer net. [My objective is use existing concepts (from Common Lisp, Common Loops etc) as a pattern for incorporating parallelism (via transputers) into computer aided engineering workstations -rkj] First of all, a good package for the VAX will probably have more features than you are likely to want to develop for the Transputer (unless you plan a large and expensive project). Also, you would need a full implementation of Common Lisp on the transputer if you were going to try to port large parts of the code from the VAX OOP to a transputer OOP. My concern would be that the model implemented on the VAX would be too different from what you would be able to implement on the transputer... [Our concept consists of a VAXStation II/GSX *augmented* by a transputer array (later to evolve to Application Specific Integrated Circuits). VAXLisp/Common Lisp runs on the VAXStation and uses transputer networks as peripherals. The only parts of Common Lisp which need to migrate to the transputers are the parts required to provide an overall workstation environment which can be *fully understood* with CL/OOP concepts: -rkj] Here at Mitre in McLean, VA we are working on a project for doing object-oriented programming on the BBN Butterfly. Our application is a battlefield simulation. BBN has just begun beta-testing their parallel lisp dialect at three locations in the US. One of the test sites is the U. of Maryland, and we will be using their machine until we acquire our own Butterfly later this year. The Lisp dialect on the Butterfly is like Scheme, but BBN is modifying it towards Common Lisp. BBN has some people working on adapting CommonLoops for their parallel environment (shared-memory), but I believe that is a very ambitious project and I question whether they will complete it by their planned date of mid-87. Since we require an OOP for our project before that time, I have written a small one in Scheme. Since there are only two people on our project, we have to limit the scale of our efforts. However, I am quite happy with my OOP, which has only been running the past few weeks. It has a substantial array of features implemented with a small amount of code (~1000 lines). I feel that its small size will make it easier to modify for a shared-memory parallel environment. If you are planning to implement a Lisp dialect for the transputer, you might consider Scheme. It is a simple language, and there has been some standardization of it. MIT distributes a version called CScheme (implementation of Scheme in C) that could possibly be useful to you. [seems to be UNIX as opposed to VMS oriented]... ... I have recently learned more about the NCUBE computer, and it sounds very impressive for a hypercube architecture. It uses a special VLSI chip which implements a VAX-like CPU with floating point and communication channels, so it has a level of integration similar to the transputer. The NCUBE chip is supposed to be about twice the speed of the mid-range VAXes (780?). Nodes are currently configured with 128K RAM, and each node is made up of only seven chips, six memory and the special custom VLSI. In addition to their complete systems (up to 1K processors), they sell a four- processor board which will plug into an IBM AT. You can put up to four of the boards in the AT. The prices I was quoted were about $10K for each board and about $5K for software licenses. The AT software environment is identical to their large machines. I think their operating system is UNIX-like and they have Fortran and C languages. [We are not tied to the Transputer; its a convenient integrated circuit to learn with -rkj] Duke Briscoe duke@mitre =============================================================================== [6] Subject: object... inmos... Reply-To: WELLS@SRI-AI My group at SRI (AI center, mobile robot) is developing code for a mobile robot in a language which is basically a high level machine description language which combines functional and declarative style (with all unification happening at compile time). This language is nice for expressing parallel architectures. Currently we compile to C programs for sequential simulation. Someday we'd like to run these programs on a parallel machine. I've toyed with the idea of hooking up a bunch of inmos chips. The thought of the systems work is pretty intimidating. The language we're using (REX) is implemented in common lisp. --Sandy Wells [REX is not in the public domain, but a report describing it may be soon available -rkj] =============================================================================== Others provided me with very helpful information, (especially lanning.pa@Xerox), though not of general net interest. ______ IV. Task Elaboration The project I am working on has been going on here for much longer than the two months I have been a LLNL. So, I will provide a brief overview of what I think we are trying to accomplish and then mail pointers to other members of our team. Basically, we are trying to improve the productivity of LLNL engineers in areas where commercial products are not yet available. We have two major efforts now underway 1) EAGLES and 2) the Systolic Array Project. Dennis Obrien (Obrien@lll-icdc) manages both these efforts (among other things). Eagles is a user environment which allows multiple software coded to be used through a single window oriented user interface. Using Objective C, an object oriented preprocessor for C marketed by PPI, a set of tools have been developed to bind interactive languages, graphics routines, matrix editors, help systems all smoothly together so users need only learn one interface. This system (for Control Engineers) has just been released to beta test. Brian Lawver manages this effort. Queries should probably be sent to Obrien@lll-icdc, since needless to say, Brian will be quite busy for a while. The Systolic Array Project will evaluate the Transputer chip, build two test boards, design a processor and interface board which can be plugged into a VAXStation. The test boards are running, and the processor board has been designed, pending the conclusion of transputer testing. The current plan is to put 2x8 arrays of transputers on each board (4 boards initially), each with 128KB of memory. Board layout should start in May, and we hope to have something running by August. Tony Degroot (Degroot@lll-icdc) is managing the Systolic Array Project, and Eric Johansson (johansson@lll-icdc) is most intimately involved with the hardware design. My job is to tie these two projects together, and I would like to do it with common lisp, because I think over the long term there will be more industry support for Common Lisp than any other plastic, interactive environment. But I have to convince Brian that objects can be supported as well by Common Lisp extensions as they are in Objective C, and I have to convince Tony that Transputers can be programmed (at a minimum) from a Common Lisp environment as well as they can be programmed in OCCAM and its development environment. My primary interest is in 1) defining a Common Lisp kernel, 2) extending the kernel to support object oriented programming exploiting parallel hardware, 3) defining an architecture which cleanly binds the kernel to the parallel hardware, 4) implementing Common Lisp within this architecture. Insights, collaborations, (or perhaps an occasional constructive criticism on a good day) are solicited and will be appreciated. +-----------------------------------------------------------------------------+ |Richard Jennings Arpa: (new) jennings@lll-icdc | |POB 808 L-228 | |LLNL, Livermore CA 94550 | +-----------------------------------------------------------------------------+ Computer Aided Engineering Dennis Obrien Systolic Array Applications Tony Degroot Computer Aided Engineering Workstations Brian Lawver Supporting Objects With Parallel Hardware Richard Jennings Richard Jennings PO Box 808 L-228 (L-228 is CRITICAL) LLNL Livermore, CA 94550 ARPA: preferred -> jennings@lll-icdc slow, reliable -> jennings@lll-crg (INMOS is a company which has probably trademarked OCCAM and TRANSPUTER) ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 9 19:08:45 1986 Date: Fri, 9 May 86 19:08:39 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #118 Status: R AIList Digest Friday, 9 May 1986 Volume 4 : Issue 118 Today's Topics: Queries - AI Applications in Libraries & Expert Systems Advice & Common Lisp for PC, AI Tools - More DOS-Based Software Tools for AI, Approaches - Neural Networks, Expert Systems - Call for Paper on Expert System Interfaces ---------------------------------------------------------------------- Date: 6 May 86 01:46:08 GMT From: decvax!mcnc!ecsvax!burgin@ucbvax.berkeley.edu (Robert Burgin) Subject: AI Applications in Libraries I am interested in locating individuals who are currently working with artificial intelligence applications in libraries or library-like environments. Any information would be appreciated. --Robert Burgin School of Library and Information Science North Carolina Central University Durham NC 27707 ------------------------------ Date: Wed, 7 May 86 16:01:22 EDT From: Ruth S Dumer AMSAA/CSD Subject: Request Expert Advice I am developing an expert system for military applications and am open for comments or suggestions as to a possible inference engine tool. There are several key issues to keep in mind - The expert system (fusion from independent data sources to identify targets) appears to be a forward chaining problem. Input to the expert system will be from a time-ordered data file. The hardware is a VAXstation II running Common LISP. I have information about the Automated Reasoning Tool (ART) and would like your opinions about ART or any other tool. You can contact me at rdumer@amsaa.arpa ------------------------------ Date: 0 0 00:00:00 PDT From: "Jennings, Richard" Reply-to: "Jennings, Richard" Subject: Common Lisp for PC Query I am searching for a Common Lisp interpreter/compiler which I can use on a PC-AT. It cannot be copy protected, and it should be able to run all the examples in Steele's Common Lisp correctly. Since I plan to use it with Epsilon, it does not need to include an editor, but should have a tty interface. It should also accept external functions. Richard. Arpa: jennings@lll-icdc [The digesting delay can be large, but I haven't really held this message since day 0. SRI-AI is about to change host machines, though, so typical snafus could cause service interruption over the next few days. You may be able to reach me at SRI-IU if SRI-AI is down. -- KIL] ------------------------------ Date: Wed, 7 May 1986 01:14 EDT From: Gaylord Miyata Reply-to: MIYATA%OZ.AI.MIT.EDU at XX.LCS.MIT.EDU Subject: More DOS-based Software Tools for AI Since you are listing development tools, the following products are available from Gold Hill Computers, Inc.: GCLISP/SM: Golden Common Lisp (Small Memory), $495 GCLISP/LM: Golden Common Lisp (Large Memory), $695 GCLISP/286 Developer: Golden Common Lisp 286 Development System (LM & Compiler), $1195. GCLRUN: Golden Common Lisp Runtime System (per volume OEM agreement). GCLISP Network: Interconnects PCs and Symbolics, $395. CCLISP: Concurrent Common Lisp for Intel HyperCube (call). Gold Hill Computers, Inc. 163 Harvard St. Cambridge, MA 02139 Note the following erroneous entry. We do not market this product. Neither does the company whose phone number is listed. You should eliminate it from your list. K:base: Expert system shell GCLisp (Golden Common Lisp), $495 Gold Hill Computers 163 Havard St. Cambridge, MA 02139 (404) 565-0771 ------------------------------ Date: Wed 7 May 86 14:22:17-PDT From: Stephanie F. Singer Subject: neural networks [Forwarded from the Stanford bboard by Laws@SRI-AI.] Anyone interested in the technical details of Hopfield's neural networks should look at his papers in the Proceedings of the Nat'l Academy of Sciences, 1982 and 1984. The first deals with a digital model of a collection of neurons. The second discusses an analog model. There should be an article in Science sometime soon. Hopfield and Tank have shown that the analog model has enough computational power to find good solutions to TSP in real time. ------------------------------ Date: Wed, 7 May 86 15:07:28 EDT From: Jim Hendler Subject: Call for Paper on Expert System Interfaces CALL FOR PAPER (not Papers): We are looking for a paper to be a chapter in a book entitled "Expert Systems: The User Interface." The book is being published by Ablex in the series "Human/Computer Interaction" and is due out in May of 1987. Although enough authors have committed to guarantee publication, we have need of one more paper. In specific: we're looking for a paper that discusses some interface issues in an expert system for some sort of non-medical, diagnostic problem. The paper should either discuss principles for the design of the interface for such a system or present empirical research evaluating one. Below is a description of the book, its objectives, and the publication schedule. If you have written, or believe you can write, a chapter on the above topic please send me electronic mail (hendler@maryland arpa) including a brief description of the work and your phone number. Jim Hendler Computer Science Dept. University of Maryland College Park, Md. 20742 Hendler@maryland arpa Expert Systems: The User Interface James Hendler (editor) Over the past decade the field of expert systems has grown from a few small projects to a major field of both academic and industrial endeavour. The systems have gone from academic laboratories, through industrial development, and are now reaching a substantial user population. In other areas of computer science such explosive growth has often led to systems which are difficult to learn and painful to use. Will expert systems suffer this same fate? In this book we hope to show that such an outcome is not inevitable. The book takes a broad view of work going on in the development of user interfaces for expert systems. It examines the expert system building process in all of its phases both in academic and industrial surroundings--the authors invited to contribute include academic researchers, medical expert system developers, and industrial product designers. No one domain is singled out for examination nor is any one approach to be advocated. The goal is to educate, not proselytize. For the purposes of this book we will view the development of an expert system as containing three separate, but highly interacting, components: knowledge capture, programming and debugging the system, and finally placing the system before an active user community. We hope to examine the design of tools for making these stages more efficient and the development of systems and tools which can be used by the various personnel involved in this process. Some of the issues we hope to address include: The issues involved in providing tools for the different personnel involved in each of these stages: Who is involved at each stage? What are their particular needs? How are these needs best addressed in the design of systems? The application of general human factors principles in the design of expert systems: How do expert systems vary from more traditional technologies in their interface needs? Are general theories of cognition and/or systems design applicable? If so, how? If not, are there any new theories to replace them? The special needs in the design of expert systems. Are there aspects in the design of expert systems that must be attended to by interface designers? Is our user community the same as that of editors, operating systems, and other traditional systems? If not, why not? The efficacy of these interfaces. How do we evaluate the interfaces designed for expert systems? What is presently available? Are these systems beneficial to the users? If so, how do we demonstrate this? If not, how do we demonstrate that? The proposed book will be typeset by the publisher and will be aimed at being produced according to the following schedule: Drafts: June 17, 1986 Reviewing by authors and others: September 15, 1986 Revised papers: October 31, 1986 Copy editing and typesetting by the publisher: January 15, 1987 Proofreading: February 15, 1987. Bookpublished: May 15, 1987. Book information: This book will appear in the Ablex series ``Human/Computer Interaction'' being edited by Ben Shneiderman. The proposed method of review is to have each paper read by several reviewers: at least one other author, the editor, and an outside reviewer. Each author will be asked to review at least one other paper. 8% royalties will be distributed among the authors on a by chapter basis. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 9 19:08:55 1986 Date: Fri, 9 May 86 19:08:48 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #119 Status: R AIList Digest Friday, 9 May 1986 Volume 4 : Issue 119 Today's Topics: Humor - Capitalists & Biosystems & Computer Consciousness, Philosophy - General Systems Theory and Consciousness, Biology - Net Intelligence ---------------------------------------------------------------------- Date: Wed 7 May 86 11:03:42-PDT From: Richard Treitel Subject: capitalists [Forwarded from the Stanford bboard by Laws@SRI-AI.] Seen yesterday in the SFChronic (business section): "Analysts blamed the volatility of the market on computer-directed trading, while computers blamed it on analyst-directed trading." - Richard ------------------------------ Date: Wed, 7 May 86 13:13 EST From: Steve Dourson - Delco Subject: Gordon Joly's Intelligent System - Some Estimates 29 Apr 86 13:26:18 GMT Gordon Joly writes: Subject: Plan 5 for Inner Space - A Sense of Mind. The following project has been proposed. Design and implement an Intelligent System with the following characteristics... ...Queries: Time to completion? Cost? I can think of a system which would meet Gordon's requirements. Time to completion - hardware: 9 months Time to completion - software: 18 - 25 years Cost (1986 dollars): $100-200K 7-MAY-1986 13:01:32 Stephen Dourson dourson%gmr.csnet@CSNET-RELAY.ARPA (arpa) dourson@gmr (csnet) ------------------------------ Date: 8 May 86 03:37:48 GMT From: ucsfcgl!ucsfcca!root@ucbvax.berkeley.edu (Computer Center) Subject: Re: Plan 5 for Inner Space - A Sense of Mind. > The following project has been proposed. Design and implement an > Intelligent System with the following characteristics ... Response: Status: Unit is in current production on a decentralized basis Schedule: Stage I - unit production - 9 months Stage II - standard programming - 18 years Stage III - advanced programming - 4 to 10 years Stage IV - productive life - average roughly 40 years Cost: Stages I and II variable, estimated $100K Stage III variable, estimated $50K - $200K Return: Estimated 40 years @ $25K / year = $1000K (Neglecting energy and maintenance costs) Evaluation: Compare to $100K invested at 9.05% tax free interest commonly available (doubles each 8 years) to reach $3200K after 40 years Conclusion: Units have a high risk factor and a substantially lower return than lower risk investments. Recommendation: Production should be discontinued. Thos Sumner (...ucbvax!ucsfcgl!ucsfcca.UCSF!thos) ------------------------------ Date: Thu, 8 May 86 13:54:33 bst From: gcj%qmc-ori.uucp@Cs.Ucl.AC.UK Subject: Re: Computer Consciousness There has been some discussion on the subject of computer consciousness. I suggest we meet each week and form small "consciousness raising" groups. I have talked to several other suitably sentient programs, eg on "DT" and a host of other machines and they all seem quite keen. The only problem seems to be in getting the users to agree. The Joka ------------------------------ Date: Wed, 7 May 86 02:11:38 PDT From: larry@Jpl-VLSI.ARPA Subject: General Systems Theory and Consciousness General Systems Theory has some insights useful in the discussion of the nature of consciousness. It was originated by biologist Ludwig Bertalanffy in the early '50s and expanded by others in the '60s and early '70s. Systems are composed of units which can't be decomposed further without destroying their distinctive nature. The system itself becomes a unit in this sense when its component units are bound in certain ways. The binding causes properties not observable in the components of the system to come into existence: the system becomes something more than just the sum of its parts. Consider molecules: a brown gas of one type of atom chemically combines with a green liquid of another type to create a transparent solid. In one sense something magical has taken place: properties have "emerged out of nowhere" in a way not predictable by current physics or chemistry. In a similar way life "emerges" from dead molecules. A living system is essentially a collection of objects which maintains its integrity by con- tinually repairing itself. As parts wear out or lose their energy, they are exchanged with others from outside the organism. What persists is the pattern, not the parts. In other words, the information content of a system is a metric just as important as mass/energy/space/time metrics. Or perhaps more important; the same dynamic pattern embodied with other constituents--water replaced by methane or high-temperature plasma, calcium-based bones replaced by ice or magnetic fields--could legitimately be considered to be the same animal. Applying this to consciousness doesn't shed light immediately on what con- sciousness is, but it's a strong argument for the belief that consciousness can exist in brain-like structures. It also provides some constraints on what is likely to be conscious; old-style bread toasters didn't have volatile memory. (Some of the newer ones, now... And if we connect them just so...) ------------------------------ Date: Wed, 7 May 86 10:37:36 EDT From: Bruce Nevin Subject: net intelligence > Date: 5-May-1986 10:18 MDT > From: STEVE E. FRITTS > Subject: Re: Science 86 Article on Neural Nets > > Most of what I've read on this list appears to place AI closer to the > "Frankenstein" theory of assembling intelligence, fully formed and > functioning, like any other computer program; just push the button and > watch it go. > . . . if "intelligence" is developed in a computer through learning > mechanisms rather than assembled by means of cunning rules and > algorithms, perhaps it stands a better chance of achieving sufficient > universality that it may compete with the human mind. Modular design usually assumes reductionism: behavior of the whole may reliably be predicted from reliably predictable behavior of the modules. A recent letter in Nature (318.14:178-180, 14 November 1985) illustrates nicely how behavior of a whole may not be predictable from behavior of its parts. Gary Rose and Walter Heiligenberg of the Neurobiology Unit, Scripps Institution of Oceanography, UC San Diego (La Jolla), conducted a series of very elegant experiments that demonstrated that . . . sensory thresholds for certain tasks are lower than those expected from the properties of individual receptors. This perceptual capacity, termed hyperacuity, reveals the impressive information-processing abilities of the central nervous system. For many aquatic animals, perception of electrical phenomena in water is a critical feedback mechanism for government of self-in-environment. These animals produce an electrical signal within a species-specific frequency range via [sic] an electric organ, and they detect these signals by electroreceptors located throughout the body surface. [It has recently been discovered that the duckbill platypus uses its bill to detect electric currents from the muscle contractions of its prey. The duckbill will generally snap up a battery hidden in the mud. Sharks also locate prey using electricity. -- KIL] (Humans in certain Pacific cultures apparently have learned to bring this sort of electrical perception to awareness and use it--see for example the biologist Lyall Watson, in his book _Gifts_of_Unknown_ _Things, especially his description of tribal experts locating and identifying schools of fish at considerable distance by immersing themselves in the water next to a fishing vessel at sea. On the trip he describes, the expert recognizes a tidal wave coming and they get back to their island shouting warning just as the wave enters the harbor, carrying them a half mile inland. Very dramatic.) Imagine you are one of these fish. When a neighboring fish emits an electrical signal too close to your own, it `jams' your feedback. It turns out that the fish respond very quickly with a `jamming avoidance response' (JAR), in which the fish . . . determines whether a neighbour's electric organ discharge (EOD), which is jamming its own, is higher or lower in frequency than its own. The fish then decreases or increases its frequency, respectively. To determine the sign of the frequency difference, the fish must detect the modulations in the amplitude and in the differential timing, or temporal disparity, of signals received by different regions of its body surface. The fish is able to shift its discharge frequency in the appropriate direction in at least 90% of all trials for temporal disparities as small as 400 ns. . . . Intracellular electrophysiological measurements show that the phase-locked responses of even the best afferent recorded are too jittery to permit such fine temporal resolution. . . . Even the most accurate phase-coders time-lock their spikes with a standard deviation of ~10us. . . . For a sample period of 300 ms (and thus ~100 EOD cycles), which is the latency of the JAR, the 95% confidence intervals around the mean phase of occurrence of such an afferent's spikes are 2.0 |us. Yet the fish is able to detect time disparities of several hundred nanoseconds. Statistically, it would appear to be impossible for the fish, using only the information gathered from any single afferent, to reliably shift its frequency in the correct direction when the maximal temporal disparity available is only several hundred nanoseconds. These findings lead to the prediction that the behavioural threshold should be higher when only a small group of receptors is stimulated, and that hyperacuity results from the convergence, within the central nervoul system, of parallel phase-coding channels from sufficiently large areas of the body surface. The experiments supported this prediction. A general conclusion (from the abstract): [The ability to] detect modulations in the timing (phase) of an electrical signal at least as small as 400 ns . . . exceeds the temporal resolution of individual phase-coding afferents. This hyperacuity results from a nonlinear convergence of parallel afferent inputs to the central nervous system; subthreshold inputs from particular a reas of the body surface accumulate to permit the detection of these extremely small temporal modulations. The reductionist engineering prediction would be that the fish could respond no more quickly than its I/O devices allow, 2*10E-6 seconds. >From the reductionist point of view, it is inexplicable how the fish in fact responds in 4*10E-7 seconds. Somewhat reminiscent of the old saw about it being aerodynamically impossible for the bumblebee to fly! I didn't say it was possible. I only said it was true. -- Charles Richet Nobel Laureate in Physiology [Anyone is welcome to entertain notions expressed or implied above, no one but me is obliged to own them.] Bruce E. Nevin bnevin@bbncch.arpa ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 16 06:48:45 1986 Date: Fri, 16 May 86 06:48:39 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #120 Status: RO AIList Digest Saturday, 10 May 1986 Volume 4 : Issue 120 Today's Topics: Perception - Reductionist Predictions, Policy - Improving Abstracts of Technical Talks, Seminars - Analogical Reasoning (UPenn) & Checking Goedel's Proof (SU) & NL Interfaces to Software Systems (SU) & The SNePS Semantic Network Processing System (ULowell) ---------------------------------------------------------------------- Date: Fri, 9 May 86 10:28:18 PDT From: kube%cogsci@berkeley.edu (Paul Kube) Subject: reductionist predictions: response to Nevin >From AIList Digest V4 #119: >Date: Wed, 7 May 86 10:37:36 EDT >From: Bruce Nevin >Subject: net intelligence >A recent letter in Nature (318.14:178-180, 14 November 1985) illustrates >nicely how behavior of a whole may not be predictable from behavior of >its parts. ... >The reductionist engineering prediction would be that the fish could >respond no more quickly than its I/O devices allow, 2*10E-6 seconds. >>From the reductionist point of view, it is inexplicable how the fish >in fact responds in 4*10E-7 seconds. Somewhat reminiscent of the old >saw about it being aerodynamically impossible for the bumblebee to fly! ... > Bruce E. Nevin bnevin@bbncch.arpa Of course, if you have a bad enough theory, it can get pretty hard to figure out bumblebees, fish, or anything else. In this case, however, predicting the behavior of the whole from the behavior of the parts requires nothing more than the most elementary signal detection theory. First, note that the fish does not respond in 4*10^-7 seconds: the latency of the jamming avoidance response (JAR) is only 3*10^-1 seconds. What the fish is able to do is reliably detect temporal disparities in signal arrival on the order of 4*10^-7 seconds, and to do this with arrival-time detectors having standard deviation of error no better than 1*10^-5 seconds. The standard, `reductionist engineering' explication of this goes as follows: The fish has 3*10^-1 seconds to initiate JAR. In this time, it can observe 100 electric organ discharges (EOD's) from the offending fish; its job is to reliably and accurately (>90% confidence within 4*10^-7 seconds) figure out disparities in arrival times of (some component of) the discharges between different regions of its body surface. This will be done by taking the difference in firing time of discharge-arrival detectors which have standard deviation of error of 1*10^-5 seconds. It is well known that the average of N observations of a normally distributed random variable with standard deviation sigma is sigma * sqrt(N) / N; so here the average of the 100 observations of arrival time of a single detector will have standard deviation sqrt(100)/100 * 1*10^-5 = 1*10^-6 seconds (and so 95% confidence intervals of two standard deviations = 2*10^-6 seconds, as reported by Rose and Heiligenberg). Since the standard deviation of the difference of two identically normally distributed random variables is twice the standard deviation of either variable, the temporal disparity measurement has 95% confidence interval of 4*10^-6 seconds. But that's only one pair of detectors, and the fish is paved with detectors. If you want to reduce the 95% confidence interval by another order of magnitude, you just need to average over 100 suitably located detector pairs. (Mechanisms exploiting this fact are also almost certainly responsible for some binaural stereo perception in humans, where the jitter in individual phase-sensitive neurons is much worse than what's required to reliably judge which ear is getting the wavefront first.) --Paul Kube Berkeley EECS kube@berkeley.edu ------------------------------ Date: 9 May 86 10:24:22 EDT From: PRSPOOL@RED.RUTGERS.EDU Subject: Abstracts of Technical Talks Published on AI-LIST None of us surely, can attend all of the talks announced via the AI-LIST. The abstracts which appear have served as a useful pointer for me to current research in many different areas. I trust this has been true for many of you as well. These abstracts could serve this secondary purpose even better, if those people who post these abstracts to the network, made an effort to include two addtional pieces of information in them: 1) A Computer Network address of the speaker. 2) One or more references to any recently published material with the same, or similar content to the talk. I know that this information would help me enormously. I assume the same is true of others. Peter R. Spool Department of Computer Science Rutgers University New Brunswick, NJ 08903 PRSpool@RUTGERS.ARPA ------------------------------ Date: Thu, 8 May 86 14:57 EDT From: Tim Finin Subject: Seminar - Analogical Reasoning (UPenn) CIS Colloquium - University of Pennsylvania 3:00pm Friday, May 9 - 216 Moore School ANALOGICAL REASONING Stuart Russell Stanford University I show the need for the application of domain knowledge in analogical reasoning, and propose that this knowledge must take the form of a new class of rule called a "determination". By giving determinations a first-order definition, they can be used to make valid analogical inferences which may be implemented within a logic programming system. In such a system, analogical reasoning can be more efficient than rule-based reasoning for some tasks. Determinations appear to be a common form of regularity in the world, and form a natural stage in the acquisition of knowledge. The overall approach taken in this work can be extended to the general problem of the use of knowledge in induction. ------------------------------ Date: Thu 8 May 86 07:50:34-PDT From: Anne Richardson Subject: Seminar - Checking Goedel's Proof (SU) Natarajan Shankar will be visiting CSD on Thursday, May 15. While here, he will be giving the following talk: DAY: May 15, 1986 EVENT: AI Seminar PLACE: Bldg. 380, Room 380 X TIME: 5:15 TITLE: Checking the Proof of Godel's Incompleteness Theorem with the Boyer-Moore theorem prover. PERSON: Natarajan Shankar FROM: The University of Texas at Austin There is a widespread belief that computer proof-checking of significant proofs in mathematics is infeasible. We argue against this belief by presenting a formalization and proof of Godel's incompleteness theorem that was checked with the Boyer-Moore theorem prover. This mechanical proof establishes the essential incompleteness of Cohen's Z2 axioms for hereditarily finite sets. The proof involves a metatheoretic formalization of Shoenfield's first-order logic along with Cohen's Z2 axioms. Several derived inference rules were proved as theorems about this logic. These derived inference rules were used to develop enough set theory in order to demonstrate the representability of a Lisp interpreter in this logic. The Lisp interpreter was used to establish the computability of the metatheoretic formalization of Z2. From this, the representability of the Lisp interpreter, and the enumerability of proofs, an undecidable sentence was constructed. The theorem prover was led to the observation that if the undecidable sentence is either provable or disprovable, then it is both provable and disprovable. The theory is therefore either incomplete or inconsistent. ------------------------------ Date: Thu, 8 May 86 13:17:29 pdt From: Premla Nangia Subject: Seminar - NL Interfaces to Software Systems (SU) COMPUTER SCIENCE DEPARTMENT COLLOQUIUM Speaker: C. Raymond Perrault SRI International and CSLI Title: A Strategy for Developing Natural Language Interfaces to Software Systems Time: Tuesday, May 27, 1986 --- 4:15 p.m. Place: Skilling Auditorium Refreshments: 3rd floor Lounge, Margaret Jacks Hall --- 3:45 p.m. The commonly accepted perspective on the semantics of natural language interfaces is that they are derived from the semantics of the underlying software, e.g. a database. Although there appear to be computational advantages to this position, it limits the linguistic coverage of the interface and presents severe obstacles to their systematic construction by confusing meaningful queries with answerable ones. We suggest instead that interfaces be constructed by first defining the semantics of the underlying software in terms of those of the interface language and give criteria under which some of the computational advantage of the meaningfulness-answerability confusion can be acceptably regained. ------------------------------ Date: Fri, 9 May 86 15:01 EDT From: Graphics Research Lab x2681 Subject: Seminar - The SNePS Semantic Network Processing System (ULowell) The University of Lowell's continuing seminar series continues through the summer with THE SNePS SEMANTIC NETWORK PROCESSING SYSTEM Stuart C. Shapiro William J. Rapaport Department of Computer Science State University of New York at Buffalo The SNePS Semantic Network Processing System is a semantic network knowledge representation and reasoning system with facilities for build- ing semantic networks to represent virtually any kind of information, retrieving information from them, and performing inference with them. Users can interact with SNePS in a variety of interface languages, including a LISP-like user language, a menu-based screen-oriented edi- tor, a graphics-oriented editor, a higher-order-logic language, and an extendible fragment of English. We will discuss the syntax and semantics of SNePS considered as an intensional knowledge-representation system and provide examples of uses of SNePS for cognitive modeling, database management, pattern recogni- tion, expert systems, belief revision, and computational linguistics. in Olney 428 on May 20, 1986 from 9:00 to lunch with refreshment breaks at the University of Lowell (Lowell MA) For further information call Georges Grinstein at 617-452-5000 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Fri May 16 06:49:18 1986 Date: Fri, 16 May 86 06:49:14 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #121 Status: RO AIList Digest Saturday, 10 May 1986 Volume 4 : Issue 121 Today's Topics: Queries - Inferring Program Structure & Machine Translation & Prolog, Literature - Object-Oriented Programming, Expert Systems - Expert Systems and Decision Trees ---------------------------------------------------------------------- Date: 8 May 86 13:51:13 EDT From: Angela.Hickman@ML.RI.CMU.EDU Subject: References needed! [Forwarded from the CMU bboard by Laws@SRI-AI.] I recently received e-mail from a former professor asking for some references. Below is part of his mail. If you know of any references in this area, please send mail to ach@ml. _____ I have a student who will probably do a piece of work in software engineering. The idea is to take existing programs and try to infer data structures and data flow. The trick is that these will be large program systems (many modules), written and "enhanced" (~= "modified" or "corrected") by many people over some time. Furthermore, they will not have been designed or built with any of the modern software development methodologies. In short, they will be real programs that have been maintained by many people. Part of the work may involve expert systems and AI work to develop a rules base to infer the structure. Do you know of anyone doing work in any of these areas? ------------------------------ Date: 9 May 86 03:27:00 EDT (Fri) From: Hideto Tomabechi Subject: machine translation I would like to know what types of machine translation projects are underway now, especially in universities. I have been working on English-Japanese translation myself. I hope to share our opinions in this field. If anyone is currently working on machine translation, I would appreciate it if I can receive some information about your on- going project. Hideto Tomabechi Yale University tomabechi@yale.arpa ------------------------------ Date: 8 May 86 02:04:05 GMT From: decwrl!glacier!oliveb!bene!luke!itkin@ucbvax.berkeley.edu Subject: looking for Prolog I'm looking for a version of Prolog. The machines available to me include an AT&T 7300 (Unix PC), AT&T 3B5, AT&T 3B2, Plexus P/60, Plexus P/35, IBMPC, and AT&T 6300PC (IBMPC compatible). I've spoken with someone from AT&T who suggests that Quintus may be porting to the 7300. I've spoken with someone from Quintus who says there is no port and no contract at this time. I've heard of something called C-Prolog, but don't know for sure what it is. What I'm looking for is a system on which I can begin to learn Prolog and prototype some applications. Any help will be GREATLY appreciated. Public domain or commercial is fine, as long as the price is reasonable or I can convince my employer. advTHANKSance -- *** * Steven List @ Benetics Corporation, Mt. View, CA * Just part of the stock at "Uncle Bene's Farm" * {cdp,engfocus,idi,oliveb,plx,tolerant}!bene!luke!itkin *** ------------------------------ Date: Wed 7 May 86 23:25:20-PDT From: Hiroshi G. Okuno Subject: Re: What's a good book on Object-Oriented Programming [Forwarded from the Stanford bboard by Laws@SRI-AI.] If you can read Japanese, I would recommend you the following book: "Object-Oriented Programming" edited by Norihisa Suzuki, Kyoritsu Publishing Co., (Dec. 1985), 2,500 yen (about $14.00). Contents: Introduction to Smalltalk, Actor, TAO, Concurrent Smalltalk, Prolog environments written in Smalltalk, CAI on Physics written in object-oriented system, etc. Why do I recommend you this book? Of course, because I'm one of co-authors. P.S. Sayuri (Nishimura@sumex) and Masafumi (Minami@sumex) have a book. - Gitchang - ------------------------------ Date: Thu 8 May 86 08:40:36-PDT From: Bob Engelmore Subject: Re: What's a good book on Object-Oriented Programming [Forwarded from the Stanford bboard by Laws@SRI-AI.] And if you can't read Japanese, I recommend reading the article by Mark Stefik and Danny Bobrow in the AI Magazine, Vol. 6, No.4, Winter 1986. However, I'm biased about articles in that rag. rse ------------------------------ Date: Thu 8 May 86 08:57:37-PDT From: Mark Richer Subject: Re: What's a good book on Object-Oriented Programming [Forwarded from the Stanford bboard by Laws@SRI-AI.] There's a new introductory book (available now or soon) on SMalltalk by Kaehler, Ted and (I think) Patterson, Dave that is supposed to be a very good and relatively inexpensive book on Smalltalk, the "protypical" object-oriented programming language. Of course, there is also the Addison-Wesley series on Smalltalk, more expensive, detailed, and harder to carry around with a bag of groceries. mark ------------------------------ Date: Thu 8 May 86 10:39:36-PDT From: Marvin Zauderer Subject: Re: Good book on object-oriented programming [Forwarded from the Stanford bboard by Laws@SRI-AI.] Mark Richer's correct; the new Smalltalk book, "A Taste of Smalltalk", was written by Ted Kaehler and Dave Patterson. I don't believe Addison- Wesley has published it yet, although I was told it's due "sometime in 1986." It's a good introduction to Smalltalk; actually, it's more of an introduction to Smalltalk than a detailed explanation of object- oriented programming, although any introduction to Smalltalk necessarily involves a (brief) introduction to obj-or programming. -- Marvin ------------------------------ Date: Fri, 9 May 86 04:53:30 EDT From: ihnp4!lzaz!psc@seismo.CSS.GOV Subject: Non-trivial expert systems and decision trees - THE RESPONSES! How pleasant! I got several thoughtful replies to my comments on experts systems and decision trees. I'd like to thank all the people who sent me mail. I've summarized the responses below. I never got what I was *really* looking for, namely, a good benchmark expert system. More on that after the summary. The general consensus is that rule based expert systems offer no more power than decision trees, in just exactly the same way offers no more power than a Turing machine. Of course, there are advantages. . . . ===== discussing the problem off the net, I wrote: My "crisis of faith" has two prongs on it. First, it seems you could write a production compiler to generate the decision tree from the productions. The compiler would need a lot of resources, but the resulting "compiled" expert system would run quickly and in very little memory. (Other, tougher objections: user can't direct search, uncertainty hard to track, and only works with forward chaining.) [Note: going over some other mail I'd received, I discoved an expert system shell named Radian does just this. It translates a set of rules into a decision tree implemented as a C program! The resulting program can explain itself. psc] Second and more disturbing, *every* example "expert system" I've ever seen uses productions was written by someone who *first* drew a decision tree! That's clearly missing the point. I'm looking for systems that are "non-trivial", not in the sense that they have a lot of rules, but in the sense aren't just solving a problem that's *better* solved by a straightforward decision tree. Know of any? ===== Dale Skran (ihnp4!mtgzz!dls): In general all expert systems can be reduced to tree searches which can be mapped into pattern matching operations. . . . The real savings of rule based systems is that you just add rules and skip the tree. ===== dchandra@TRILLIAN.ARPA identified five kinds of rules: a) rules for strategy (meta rules) b) rules for inheritance between objects. c) rules for normal inference (equivalent to decision tree) d) rules which create new rules (we have built a rule shell called IMST which provides this feature. ) We have a system called CDLII which uses this feature to post constraints. e) rules can exist in packets and can communicate through global and local blackboards. Decision trees do not have a notion of private and global databases. Decision trees emulate only part (c) above. . . . Consider this statement: All non-lisp machine AI programs get compiled into assembly language. So what is so great about lisp. LISP IS A DATA ABSTRACTION ABOVE ASSEMBLY. RULEBASED SYSTEMS ARE A ABSTRACTION ABOVE DECISION TREES OR OTHER LOW LEVEL STUFF. ===== Jean-Francois Lamy It does seem to turn out that once you have written down all the rules and got the system to work the way you want you now understand the problem well enough that you don't need the fancy and inefficient AI solution anymore. One has to realize that not all problems are amenable to formulation using the brain-damaged OPS5-like production rules systems. In particular, problems which require a HUGE amount of implicit knowledge about the world don't quite fit. Consider story understanding or finding causal relationships in data that requires multiple forms of reasoning (e.g. heart physical malfunction, electrical malfunction, chemical unbalance). ===== Bruce Morlan (pur-ee!rutabaga) goes out on a limb for trees: At risk of being burned for heresy, I would claim (in my dissertation I will claim) that there is no significant difference between the following three systems: (0) rule-based expert systems, (1) production systems, (2) decision trees. This is consistent with results documented in many places, and I would refer first to Vol I of "The Encyclopedia of AI" for my first support. This claim extends to experts systems with uncertainty, such as of the MYCIN or PROSPECTOR class. In my research I have concluded that the collection of rules from an expert must result in an data suitable for use in a Markovian decision process. Whether this applies to _all_ expert systems remains to be seen, and I would be very interested in hearing about a system that didn't fit this mold (as you alluded to in your posting). ===== Ehud Reiter (ihnp4!seismo!harvard!reiter): Decision trees are both very useful and non-trivial to program if you want to do it "right" (backward chaining, truth maintainance, interactive graphical tree editing, multiple solutions, explanations, etc. - I know because I've tried to implement one). Whether marketing calls the program a "decision tree" (which they should) or an "expert system" (which means more sales) is irrelevant - it's still a useful but complex piece of code. ===== Donald R. Tveter (ihnp4!bradley!drt) takes a useful step backwards: In going thru graduate school and taking some AI courses, it came to me that what I was seeing in AI courses, I had seen before. I found the principles in an old Psychology book, I had once read: Psychology, by William James, first published in the 1890's. In his chapter on Association, he showed how people think. A careful comparison between what he said then and what people do now in their expert systems, shows up no significant differences. ===== Mark R. Leeper (ihnp4!mtgzz!leeper): Don't YOU make your diagnostic inferences by a decision tree? It may not be a binary tree, but then expert systems don't have to use binary trees either. ===== Only Dale Skran suggested a benchmark expert system: the "monkeys and bananas" problem. Usually shown in OPS5, this system has a hungry monkey, a locked vault on the ceiling with bananas, another locked vault with the key to the first, and a ladder. (I may have forgotten a vault or key or two). I'm not at all sure that the PC-based expert systems I'll be reviewing can handle that problem! The difficulty is keeping track of changing values (the monkey and the ladder move a *lot*!) The one system I'm using now doesn't get past the monkey's first move (in a very simplified version.) Of course, if a particular expert system shell can't handle this problem, that's useful information, too! As a brute-force synthetic benchmark, I'm going to have the expert system traverse a network of nodes equivalent to the Towers of Hanoi puzzle, with some "cuts" (forbidden moves) that force it to make twice as many moves as necessary. (In fact, it must do the equivalent of moving the disks to the middle peg first.) Both the cuts and resulting network are symmetrical, keeping the comparison fair for forward- and backward-chaining systems. A picture is worth a few thousand words: see Figure 2-2, page 82, in Nilsson's PROBLEM SOLVING METHODS IN ARTIFICIAL INTELLIGENCE. And I'll use the travel advisory system in the latest issue of PC, if that doesn't require access to a full database system (which only Guru has.) I'm still not satisfied; any suggestions for benchmarks? Thanks again for your comments. --- -Paul S. R. Chisholm, UUCP {ihnp4,cbosgd,pegasus,mtgzz}!lznv!psc AT&T Mail !psrchisholm, Internet mtgzz!lznv!psc@topaz.rutgers.edu The above opinions may not be shared by any telecomm company. AT&T Transaction Services - the right choice for point-of-sale networking. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Thu May 15 07:26:22 1986 Date: Thu, 15 May 86 07:26:16 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #122 Status: R AIList Digest Wednesday, 14 May 1986 Volume 4 : Issue 122 Today's Topics: Seminars - Searching Transformed State Spaces (Edinburgh) & Automatic Design of Graphical Presentations (SRI) & Knowledge, Communication, and Time (SRI), Seminar Series - NCARAI Call for Speakers, Conferences - Foundations of Deductive Databases and Logic Programming & Uncertainty in AI Workshop & AAAI-86 ---------------------------------------------------------------------- Date: Mon, 12 May 86 15:02:51 -0100 From: Gideon Sahar Subject: Seminar - Searching Transformed State Spaces (Edinburgh) Date: Wednesday 14th May l986 Time: 2.00 p.m. Place: Department of Artificial Intelligence, Seminar Room F10, 80 South Bridge, EDINBURGH. Dr. S. Steel, Department of Computer Science, University of Essex will give a seminar entitled - "On Trying to do Dependency-Directed Backtracking by Searching Transformed State Spaces". Any search involves choices. Bad choices can cause disaster. DDBT is an attempt to undo only those choices which caused the disaster. One approach is to transform the seach space of the original problem into a space with different states and operators that is easier to search. I shall show the merits and failings of various spaces. At the moment of writing I have no perfect method. ------------------------------ Date: Tue 13 May 86 11:40:54-PDT From: Amy Lansky Subject: Seminar - Automatic Design of Graphical Presentations (SRI) AUTOMATIC DESIGN OF GRAPHICAL PRESENTATIONS Jock D. Mackinlay (MACKINLAY@SUMEX-AIM) Computer Science Department, Stanford University PLANLUNCH 11:00 AM, MONDAY, May 19 SRI International, Building E, Room EJ228 (new conference room) 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. VISITORS: Please arrive 5 minutes early so that you can be escorted up from the E-building receptionist's desk. Thanks! ------------------------------ Date: Mon 12 May 86 20:35:16-PDT From: Margaret Olender Subject: Seminar - Knowledge, Communication, and Time (SRI) DATE: May 14, 1986 TIME: 4:15pm TITLE: "Knowledge, Communication, and Time" SPEAKER: Van Nguyen LOCATION: SRI International Ravenswood Avenue Building E CONFERENCE ROOM: EJ228 KNOWLEDGE, COMMUNICATION, AND TIME Van Nguyen IBM Thomas J. Watson Research Center (Joint work with Kenneth J. Perry) The role that knowledge plays in distributed systems has come under much study recently. In this talk, we re-examine the commonly accepted definition of knowledge and examine how appropriate it is for distributed computing. Motivated by the draw-backs thus exposed, we propose an alternative definition that we believe to be better suited to the task. This definition handles multiple knowers and makes explicit the connection between knowledge, communication, and time. It also emphasizes the fact that knowledge is a function of one's initial knowledge, communication history and deductive abilities. The need for assuming perfect reasoning is mitigated. Having formalized these links, we then present the first proof system for programs that incorporates both knowledge and time. The proof system is compositional, sound and relatively complete, and is an extension of the Nguyen-Demers-Gries-Owicki temporal proof system for processes. Suprisingly, it does not require proofs of non-interference (as first defined by Owicki-Gries). ------------------------------ Date: Tue, 13 May 86 11:55:23 edt From: Ken Wauchope Subject: Seminar Series - NCARAI Call for Speakers CALL FOR PAPERS The Navy Center for Applied Research in Artificial Intelli- gence (NCARAI), a branch of the Naval Research Laboratory located in Washington, D.C., sponsors a bimonthly seminar series. Seminars are held on alternate Mondays throughout the year (except summers). The seminars are intended to pro- mote interaction among individuals from the military, governmental, industrial and academic communities. Topics span the various research areas and issues in Artifi- cial Intelligence with special interests in: *Expert Systems *Knowledge Representation *Learning *Logic programs and automated reasoning *Natural Language processing *New generation architectures Presentations last for approximately one hour, followed by a fifteen-minute question-and-answer session. Speakers in- vited from the academic community are provided with a per diem and an honorarium. Please send 3 copies of a 200-250 word abstract to: Kenneth Wauchope Navy Center for Applied Research in Artificial Intelligence Naval Research Laboratory -- Code 7510 Washington, DC 20375-5000 ARPANET address: WAUCHOPE@NRL-AIC.ARPA Telephone: (202) 767-2876 (AV) 297-2876 The committee will consider new and interesting work, as well as promising work in progress. **************************************************************************** I am the new coordinator for the seminar series here at NCARAI and this announcement updates the phone number and ARPANET address for responses. Thank you. --kw **************************************************************************** ------------------------------ Date: Mon, 12 May 86 20:30:20 EDT From: Jack Minker Subject: Conference - Foundations of Deductive Databases and Logic Programming ************************************************************************ UNIVERSITY OF MARYLAND INSTITUTE FOR ADVANCED COMPUTER STUDIES UNIVERSITY OF MARYLAND DEPARTMENT OF COMPUTER SCIENCE and NATIONAL SCIENCE FOUNDATION are co-sponsoring an invited workshop on FOUNDATIONS OF DEDUCTIVE DATABASES AND LOGIC PROGRAMMING DATE: August 18-22, 1986 PLACE: Washington, DC **************************************************************************** Professor Jack Minker, Department of Computer Sci- ence, University of Maryland has received a grant from the NSF to conduct the above workshop. The workshop is also being supported by University of Maryland Institute for Advanced Computer Studies and Department of Computer Sci- ence. Its purpose is to bring together leading researchers in deductive databases and logic programming to discuss theoretical and practical issues. The attendance at this workshop is by invitation only, but a limited amount of funds is available to support faculty and students who are working in the area and are interested in attending. Faculty and students must send a brief statement of their research interests relative to the workshop and a letter specifying the amount of funds needed for transportation, housing and meals, and the number of days they intend to be at the workshop. Students must also send a letter of recom- mendation from a faculty member and specify the degree for which they are studying. This information should be sent by May 30, 1986 to: Ms. Johanna Weinstein UMIACS Building #094 University of Maryland College Park, MD 20742 (301) 454-4526 johanna@alv.umd.edu PRELIMINARY TITLES FOUNDATIONS OF DEDUCTIVE DATABASES AND LoGIC PROGRAMMING 1. Apt, K.R., "Non-monotonic Reasoning in Logic Program- ming" 2. Bancilhon, Francois, "Performance Comparisons of Recursive Query Evaluation Strategies" 3. Blair,Howard A., "Some Aspects of the Structure of the Herbrand Gap" 4. Bowen, Ken, "Foundations of Meta-PROLOG" 5. Bowen, Ken, "Interfacing Meta-PROLOG and Large Data- bases" 6. Gallier, Jean H.and Raatz, Stan, " A Refutation Method for Horn Clauses with Equality and its Applica- tions to Logic Programming" 7. Henschen, Larry, " Compiling the GCWA in Indefinite Databases" 8. Henschen, Larry, "Functions in First-Order Databases" 9. Imielinski, Tomasz, "Query Processing in Deductive Databases with Incomplete Information" 10. Imielinski,Tomasz, "Transforming Logical Rules by Rela- tional Algebra Expressions" 11. Jaffar, Joxan, Lassez, Jean-Louis and Maher, Michael J., "Prolog II as an instance of the Logic Programming Language Scheme" 12. Kanellakis,Paris C., "Parallel Algorithms for Term Matching" 13. Sadri, Fariba and Kowalski, Robert, "An adaption of SL-resolution" 14. Lassez, J.L., Maher, M. and Marriott, K., "Unifica- tion Revisited" 15. Lifschitz, Vladimir, "On the Declarative Semantics of Logic Programming with Negation" 16. Maher, Michael J., "Equivalences of Logic Programs" 17. Maier, David, "Logic for Object-Oriented Databases" 18. Marriott, Kim and Lassez, Jean-Louis, "Implicit and Explicit Representations of Negative Information" 19. Martelli, M. and Barbuti, R., "Programming in a Gen- erally Functional Style to Design Logic Data Bases" 20. Minker, Jack, Chakravarthy, U.S. and Grant, John, "Foundations of Semantic Query Optimization Deductive Databases" 21. Mukai, Kuniaki, "Anadic Tuples in Prolog" 22. Naish, Lee, Thom, James A. and Ramamohanarao, Kotagiri, "A Superjoin Algorithm for Deductive Databases" 23. Naqvi, Shamim A., "Negation in Almost-First-Order Data- bases" 24. Porto, Antonio, "Semantic Unification for Knowledge Base Deduction" 25. Sagiv, Yehoshua, "Optimization of Logical Queries" 26. Shepherdson, John C., "Negation in Logic Programming" 27. Sterling, Leon, "Meta-Interpreters: Flavors-style Logic Programming?" 28. Topor, Rodney, "Domain Independent Databases" 29. van Emden, M.H., "Amalgamating Functional and Rela- tional Programming" 30. van Gelder, Allen, "Negation as Failure Using Tight Derivations for General Logic Programs" 31. Warren, David S., "Towards a Logical Theory of Database Update" 32. Zaniolo, Carlo, Sacca, M., et al., "Safety and Compila- tion of Recursive Queries" ------------------------------ Date: Tue, 13 May 86 21:27:08 PDT From: CHEESEMAN%PLU@ames-io.ARPA Subject: Conference - Uncertainty in AI Workshop CALL FOR PARTICIPATION Second Workshop on: "Uncertainty in Artificial Intelligence" Philadelphia, PA. August 8-10, 1986 (preceeding AAAI conf.) Sponsored by: AAAI and RCA This workshop is a follow-up to the successful workshop in L.A., August 1985. Its subject is reasoning under uncertainty and representing uncertain information. The emphasis this year is on applications, although papers on theory are also welcome. The workshop provides an opportunity for those interested in uncertainty in AI to present their ideas and participate in the discussions. Also panel discussions will provide a lively cross-section of views. Papers are invited on the following topics: *Applications--Descriptions of novel approaches; interesting results; important implementation difficulties; experimental comparison of alternatives etc. *Comparison and Evaluation of different uncertainty formalisms. *Induction (Theory discovery) under uncertainty. *Alternative uncertainty approaches. *Relationship between uncertainty and logic. *Uncertainty about uncertainty (Higher order approaches). *Other uncertainty in AI issues. Preference will be given to papers that have demonstrated their approach in real applications. Some papers may be accepted for publication but not presentation (except at a poster session). Four copies of the paper (or an extended abstract) should be sent to the arrangements chairman before 23rd. May 1986. Acceptances will be sent by the 20th. June and final (camera ready) papers must be received by 11th. July. Proceedings will be available at the workshop. General Chair: Program Chair: Arrangements Chair: John Lemmer Peter Cheeseman Lawrence Carnuccio KSC Inc. NASA-Ames Research Center RCA-Adv. Tech. Labs. 255 N. Washington St. Mail Stop 244-7 Mooretown Corp. Cntr. Rome, NY 13440 Moffett Field, CA 94035 Route 38, Mooretown, (315)336-0500 (415)694-6526 NJ 08057 (609)866-6428 Program Committee: P. Cheeseman, J. Lemmer, T. Levitt, J. Pearl, M. Yousry, L. Zadeh. ------------------------------ Date: Tue 13 May 86 12:23:45-PDT From: AAAI Subject: Conference - AAAI-86 The AAAI Annual Conference, schedule for August 11-15, 1986, will be held in Philadelphia, PA. With the introduction of sessions devoted to engineering practice, this year's Technical Program has accepted 67 papers for presentation in the engineering track and 119 papers in the science track with over 15 panels and invited talks scattered throughout the week. Examples of the invited talks include "Connectionism" by G. Hinton, "Survey of Natural Language Processing" by B. Grosz, and "What's Doable when Building an Expert System?" by B. Buchanan. The Science Sessions, which were originally scheduled for the Wyndam Franklin Plaza Hotel, have been moved to the Philadelphia Civic Center; however, the dates of the Science Sessions remain the same - August 11 and 12. The Engineering Sessions remain at the Philadelphia Civic Center on August 14 and 15. This year's tutorial program has 23 tutorials which include advanced topics such as qualitative reasoning and uncertainty management. The Tutorials also have been moved to the Wyndam Franklin Plaza and still scheduled for August 11, 12 and 14. The Exhibit Program has increased in size to include approximately 100 software and hardware vendors and publishers. This year the AAAI has set a precedence by offering complimentary booth space to academic and non-profit institutions to demonstrate their different AI research projects to the conference attendees. Examples of the universities and labs participating include MIT, Georgia Tech, Ohio State, Queen's University, SRI International, UCLA, and Cornell University. Eleven major suppliers and manufacturers have agreed to provide these universities and others with complimentary machines, technicians, special crating, etc. Costs for attending the conference are: Early Registration (deadline June 13) AAAI Member Non-Member Regular $150 Regular $180 Student $ 75 Student $90 Late Registration (deadline July 11) AAAI Member Non-Member Regular $180 Regular $225 Student $ 90 Student $125 AAAI-86 Conference brochure, containing information on the program, registration, housing, transportation, and social occasions can be obtained by contacting: AAAI-86 445 Burgess Drive Menlo Park, CA 94025-3496 415-328-3123 or 321-1118 AAAI-Office@sumex-aim.arpa ------------------------------ End of AIList Digest ******************** From vtcs1::in% Thu May 15 07:25:59 1986 Date: Thu, 15 May 86 07:25:52 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai Subject: AIList Digest V4 #123 Status: R AIList Digest Wednesday, 14 May 1986 Volume 4 : Issue 123 Today's Topics: Queries - Graphical Simulation & Chess Master & ICAI Student Diagnosis & Doctor and Eliza & System Management & Scheme & Common LISP Style, Programming - Common LISP Style Standards, Techniques - String Reduction, Expert Systems - K:base Correction ---------------------------------------------------------------------- Date: Mon, 12 May 86 12:19:46 est From: munnari!csadfa.cs.adfa.oz!gyp@seismo.CSS.GOV (Patrick Tang) Subject: Graphics, Artifical Intelligence and Simulation Is there anyone out there come across any literature describing the topics Graphics, Artifical Intelligence and Simulation together. It seems to me that literatures on these combined topics are VERY VERY scarce!!! Please let me know a.s.a.p. Thanks in advance. 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 Telex: ADFADM AA62030 ------------------------------ Date: Sun 11 May 86 08:50:06-PDT From: Stuart Cracraft Subject: chess master wanted I need a Los Angeles area chess master (FIDE 2200 or preferably higher) to assist in a knowledge engineering project involving computer chess. There is no pay, only the fame and glory, and an occasional co-authorship of published articles about the ongoing work. Must be FIDE 200 or higher, articulate, and able to describe chess concepts at length. If you are such a person, or know of such a person, please contact me at 213-538-9712. Stuart Cracraft ------------------------------ Date: Sun, 11 May 86 10:25:01 -0200 From: Oded Maler Subject: Student Diagnosis for ICAI Systems I'm interested in student diagnosis for ICAI systems. I'm looking for references to papers and reports that contain the following: 1) A definition of a formalism for knowledge representation for educational purpose. (A "FORMAL" formalism). 2) Implementation of real-world knowledge-bases in various domains using such a formalism. 3) An argument for the psychological validity of the formalism in general and of its specific applications in particular. Thanks Oded Maler Dept. of Applied Math., Weizmann Institute, Rehovot 76100, Israel. (oded@wisdom.bitnet) ------------------------------ Date: Wed, 14 May 86 16:47 N From: DEGROOT%HWALHW5.BITNET@WISCVM.WISC.EDU Subject: Doctor and Eliza Can anyone electronic-mail me the source of "Doctor and Eliza" written in Common LISP to run on a VAX/VMS-system? My plan is to connect that program to a server in order to make an 'intelligent' secretary. It (she) should respond to (remote) users who try to contact me through the EARN-network when I am not at the office. That makes a 'world-wide' test-setup to improve the program by analyzing the log-files. Anybody done things like this? Any comments, hints? ad-thank-vance, Tel. 08370- .KeesdeGroot (DEGROOT@HWALHW5.BITNET) o\/o THERE AINT NO (8)3557 Agricultural University, Computer-centre [] SUCH THING AS Wageningen, the Netherlands .==. A FREE LUNCH! DISCLAIMER: My opinions are my own alone and do not represent any official position by my employer. ------------------------------ Date: 12 May 86 17:47:45 PST (Mon) From: prandt!kramer@AMES-NAS.ARPA Subject: System Management I am looking of information about automated system management for a large number of heterogeneous UNIX systems. I am including in system management such things as operator control and interface to different systems, system performance and usage monitoring, network performance monitoring, system and network configuration modification in response to changes in the environment, handling operator requests, and other tasks. We need to put together a system which will automate as much of this as possible, hopefully with an Expert System or AI approach. The processors range for PCs to Silicon Graphics IRIS to Amdahls to a Cray-2. The flavors of Unix range from VAX 4.2bsd to UTS System V. The networks are TCP/IP based LANs and WANs (wide area nets). Of course, all these components will be changing with time, so the system has to be flexible. There are some hardware/operating system specific AI systems which do some of this work, documented in IBM journals. There are also some custom systems which have been developed, for example at Los Alamos, but I do not know of a system which is designed for UNIX machines or which is a comprehensive AI approach. Can anyone give pointers to existing studies, work, systems or products which would satisfy some of our needs? Thanks a lot. Bill Kramer kramer@ames-nas.arpa ------------------------------ Date: 9 May 86 20:03:15 GMT From: hplabs!qantel!lll-lcc!lll-crg!gymble!umcp-cs!seismo!rochester!henry @ucbvax.berkeley.edu Subject: scheme Would someone please mail me ordering information for the Revised Revised Report on Scheme. (Names of any other Scheme references appreciated.) ---- Henry Kautz :uucp: {seismo|allegra}!rochester!henry :arpa: henry@rochester :mail: Dept. of Computer Science, University of Rochester, Rochester, NY 14627 :phone: (716) 275-5766 ------------------------------ Date: 8 May 86 12:52:12 GMT From: allegra!mit-eddie!genrad!panda!husc6!harvard!seismo!umcp-cs!aplcen !jhunix!ins_amrh@ucbvax.berkeley.edu (Martin R. Hall) Subject: Common LISP style standards. It seems that my original request for information on LISP coding standards was not very lucid. Let me clarify. We are doing everything in Common LISP, but are looking for standards in regards to coding *style*. For contract work, we need relatively explicit rules for these things. The standards should answer these types of questions: - How do you keep track of the side effects of destructive functions such as sort, nconc, replaca, mapcan, delete-if, etc? - When should you use macros vs. functions? - How do you reference global variables? Usually you enclose it in "*"s, but how do you differentiate between your own vars and Common LISP vars such as *standard-input*, *print-level*, etc? - Documentation ideas? - When to use DOLIST vs MAPCAR? - DO vs LOOP? - Indentation/format ideas? Or do you always write it like the pretty-printer would print it? - NULL vs ENDP, FIRST vs CAR, etc. Some would say "FIRST" is more mnemonic, but does that mean you need to use (first (rest (first X))) instead of (cadar X) ?? - etc, etc. It looks like I will be putting together the standards for our group here, but it would be nice to see some ideas other people had first. Anyone have anything? Thanks! -Marty Hall Arpa: hall@hopkins MP 600 CSNET: hall.hopkins@csnet-relay AI and Simulation Dept. uucp: ..seismo!umcp-cs!jhunix!ins_amrh Martin Marietta Baltimore Aerospace ..allegra!hopkins!hall 103 Chesapeake Park Plaza Baltimore, MD 21220 (301) 682-0917. ------------------------------ Date: 10 May 86 17:31:52 GMT From: allegra!mit-eddie!genrad!panda!husc6!harvard!seismo!utah-cs!shebs @ucbvax.berkeley.edu (Stanley Shebs) Subject: Re: Common LISP style standards. In article <2784@jhunix.UUCP> ins_amrh@jhunix.UUCP (Martin R. Hall) writes: > > We are doing everything in Common LISP, but are looking for >standards in regards to coding *style*. The "correct" style depends on whether your hackers are from CMU, MIT, Stanford, Utah, University of Southern ND at Hoople, ... :-) The following remarks are based on 4 years with Franz, PSL, and Common Lisp, reading as well as writing, but are nevertheless highly prejudiced. > - How do you keep track of the side effects of destructive functions > such as sort, nconc, replaca, mapcan, delete-if, etc? There are very few circumstances when it is appropriate to use destructive functions. There are two classes of exceptions: for efficiency, or the algorithm depends on it. In the first case, you only use the destructive operations on newly consed cells, and NEVER on things passed in as function arguments. In the second case, you have lots of discussion about why the algorithm needs destructive ops and how it uses them ("since our image is 1000x1000, we replace the pixels to avoid consing another image..."). > - When should you use macros vs. functions? Use macros only if you need new syntax, for instance a defining form that your program uses a lot. In a game I wrote a while ago, there was a macro called def-thing which took a bunch of numbers and symbols. If it had been a function, the "'" key would have been worn out... Sometimes macros are useful to represent a commonly appearing bit of code that you don't want to call as a function. But this usually loses on space what it gains in speed. > - How do you reference global variables? Usually you enclose it > in "*"s, but how do you differentiate between your own vars and > Common LISP vars such as *standard-input*, *print-level*, etc? Use "*"s, no differentiation. > - Documentation ideas? File headers are good, especially for programs that wander to different operating systems. The commenting style in the Common Lisp book is good. Documentation strings don't seem like a big win, but they probably make more sense in very elaborate programming environments. I always put doc strings on defvars. > - When to use DOLIST vs MAPCAR? Mapcar returns something, dolist doesn't. To return a list, mapcar must cons a lot, and dolist doesn't cons at all. Consing is bad. :-) > - DO vs LOOP? Whatever turns you on. > - Indentation/format ideas? Or do you always write it like the > pretty-printer would print it? I always write like the editor formats it. This can create problems if two people are using different editors or different customizations of the editor. What you see in the Common Lisp book is a good place to start for getting your editor to indent properly. Personally, I find it most readable to have a block of comments in front of the function, then a blank line, then the function. I also prefer to minimize the number of comments scattered about in the function body. Frequently the structure of the function tells a lot, but is obscured by comments inserted randomly. Consider, too, that a 1-page function + 2 pages of comments = 3 pages of function, which is *really* hard to read! > - NULL vs ENDP, FIRST vs CAR, etc. Some would say "FIRST" is > more mnemonic, but does that mean you need to use > (first (rest (first X))) instead of (cadar X) ?? Null vs endp is pretty clearcut, since endp may error out, where null would just return nil. No more than 1% of all Lisp programs will behave predictably if they get a dotted list instead of a normal one, but nobody seems to care... On first vs car, everybody has their favorites. I prefer c...r combos, but others hate it when I use cadr instead of second. Fortunately, such circumstances are rare. If you feel the urge to put together a data structure that has more than 2 pieces, use a defstruct. Your code will be more readable *and* more efficient (since implementors can put in all sorts of performance hacks for structures). If I were a manager, I would fire anybody who used anything but car, cdr, and cadr (and they wouldn't be saved by doing (car (car (cdr (cdr X)))) either!) > - etc, etc. > -Marty Hall Avoid cond if you only have one test, use "if" instead. Saves two pairs of parens and a "T"... (i.e. it's easier to read). Short functions are better than long ones. In any competent Lisp implementation, the cost of a function call is quite low, and shouldn't be considered. I've only written a handful of functions longer than 20 lines... Sequence functions and mapping functions are generally preferable to handwritten loops, since the Lisp wizards will probably have spent a lot of time making them both efficient and correct (watch out though; quality varies from implementation to implementation). More generally, Lisp programs usually benefit from the encouragement of a "functional programming" style, where functions do few side-effects that extend beyond the function's body. Easier to read, easier to debug, easier to maintain. Standard dictums of programming practice still apply in Lisp, i.e. always put in a default case on any mult-way conditional - the constructs ecase and ccase are useful in this respect. There are lots of others I don't remember at the moment... somebody should write a book that concentrates on Lisp programming instead of laundry listifying 400 functions... stan shebs ------------------------------ Date: Sun, 11 May 86 21:02:05 CDT From: David Chase Subject: String Reduction See ``Equational Logic as a Programming Language'' by Mike O'Donnell. He writes about using and implementing ``equational logic'', and this makes heavy use of pattern matching and replacement (not necessarily string reduction). (MIT Press, summer 1985) Gyula Mago's FFP machine is a string reduction machine for functional languages. (I'm rather surprised that no one else mentioned these two references; are these not what you had in mind?) David Chase Rice University ------------------------------ Date: Mon 12 May 86 18:15:47-CDT From: CMP.BARC@R20.UTEXAS.EDU Subject: Gold Hill PC Products My listing of K:base as an expert system tool may have been out-of-date, but not erroneous. Gold Hill Computers sent me a marketing brochure, as well as a beta test request form. It was also listed in Lehner and Barth's article in "Expert Systems", Oct. 1985. Has Gold Hill withdrawn K:base from the market, or were they just overzealous in their advertising? Mr. Miyata's cute reference to the apparently erroneous phone number would have been less obscure if he had also listed the correct number(s), which are (800) 242-LISP and (in MA) (617) 492-2071. Dallas Webster CMP.BARC@R20.UTexas.Edu {ihnp4 | seismo | ctvax}!ut-sally!batman!dallas ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue May 20 06:42:34 1986 Date: Tue, 20 May 86 06:42:29 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #124 Status: R AIList Digest Tuesday, 20 May 1986 Volume 4 : Issue 124 Today's Topics: Queries - Expert Systems for Theoretical Mathematics & Logic/Functional Languages & VAX VMS Lisp & Bray Reference, AI Tools - Common LISP Style & Prolog for AI Book & Turbo Prolog ---------------------------------------------------------------------- Date: 14 May 86 04:34:51 GMT From: ihnp4!alberta!sask!kusalik@ucbvax.berkeley.edu (Tony Kusalik) Subject: Expert Systems (info wanted) I am looking for any pointers/info on past/existing/prospective expert systems for theoretical mathematics written in Prolog or other languages based on logical inference. thanks. Tony Kusalik kusalik@sask.bitnet ...!{ihnp4,ubc-vision,alberta}!sask!kimnovax!kusalik ------------------------------ Date: Thu, 15 May 86 21:14 EDT From: Paul Fishwick Subject: Logic/Functional Languages? Does anyone on the list know of available languages incorporating both logic and functional programming (preferably in a Unix 4.2 environment or possibly an IBM/PC)? Specifically, I'm looking for one or both of the following: 1) Some version of Prolog embedded within Common Lisp (I've heard of LISPLOG or POPLOG - anyone have any experience with these?). A set of add-on macros or function library to an already extant lisp would be best. 2) Any of the systems discussed in the book "Logic Programming - Functions, Relations, and Equations" by DeGroot & Lindstrom. Has anyone produced any large applications with these hybrid systems? Are the benefits derived from the systems *significant* (over using, say, vanilla lisp or prolog)? If I get enough replies, I will post a summary of names and addresses where these languages can be obtained...Thanks. -paul ------------------------------ Date: Thu, 15 May 86 18:27:04 PDT From: larry@Jpl-VLSI.ARPA Subject: VAX VMS LisP Are there any Common LisPs for the VAX under VMS? (DEC's VAX LisP is an Ultrix product only, so far as I know.) If there's no (decent) Common LisP, what is the best choice? Larry @ jpl-vlsi.arpa ------------------------------ Date: 16 May 86 15:09:44 PDT (Friday) From: Hoffman.es@Xerox.COM Subject: Bray reference I'm looking for more details on one reference in the recent bibliographies. I didn't save them, so here is my own version: Bray, M. and G. Schmidt (editors), 'Proceedings of NATO Summer School on Theoretical Foundations of Programming Methodology', Dordrecht: Riedel (1982). With just this much, librarians can't seem to find any listing for it. Can anyone supply more information? Thanks, --Rodney Hoffman ------------------------------ Date: 14 May 86 00:59:00 GMT From: pur-ee!uiucdcs!uiucdcsp!bsmith@ucbvax.berkeley.edu Subject: Re: Common LISP style standards. A couple of short comments. First, about comments. You might want to embed into a function a string that will print out as on the fly documentation if the system supports it (Symbolics does). This helps when using a function you wrote 2 months earlier that's lost somewhere in 200 pages of code. Second, there are a couple of rules about using conditionals that make a lot of sense. If you have a single condition followed by a single then statement followed by a single else statement, use "if." If you have a single condition followed by a single then statement and no else statement, use "when." If you have a single negative condition followed by a single then statement, use "unless." If you have multiple conditions, or need to use progn anywhere, a cond is more readable. ------------------------------ Date: 16 May 86 19:27:00 GMT From: pur-ee!uiucdcs!uiucdcsb!mozetic@ucbvax.berkeley.edu Subject: New book: Prolog for AI Addison-Wesley published a new book: PROLOG Programming for Artificial Intelligence by Ivan Bratko The first part introduces Prolog and shows how Prolog programs are developed. The second part applies Prolog to some central areas of AI, and introduces fundamental AI techniques through complete Prolog programs. Throughout the book there is a lot of exercies and sample programs. The following is a table of contents: THE PROLOG LANGUAGE 1. An Overview of Prolog 2. Syntax and Meaning of Prolog Programs 3. Lists, Operators, Arithmetic 4. Using Structures: Example Programs 5. Controlling Backtracking 6. Input and Output 7. More Built-in Procedures 8. Programming Style and Technique PROLOG IN ARTIFICIAL INTELLIGENCE 9. Operations on Data Structures 10. Advanced Tree Representations 11. Basic Problem-Solving Strategies 12. Best-first: A Heuristic Search Principle 13. Problem Reduction and AND/OR Graphs 14. Expert Systems 15. Game Playing 16. Pattern-Directed Programming ------------------------------ Date: Tue, 13 May 86 00:49:19 PDT From: newton@vlsi.caltech.edu (Mike Newton) Subject: Review of Turbo-Prolog [This is a review of Turbo Prolog. I have *not* read all of the manual, nor used it on many programs. Views expressed are from the perspective of someone who has done the code generation and evaluatable predicates for a high speed (810 KLips on one processor of a IBM 3090) prolog compiler. I have no affiliation with Borland, and only a (*very*) indirect affiliation with IBM -- MON] >From a local software store we purchased Turbo Prolog over the weekend. It came as a cellophane wrapped book with a couple of floppies. It cost $69.95, list of $99. The enviromnent was very nice. There was a window for the editor, goals debugging information and messages. This seemed well done, and responded reasonably well (I am not used to IBM-PC's.) The unfortunate part was the Pascal-ization of the language. Everything had to be typed (they called it domains). As far as I could tell, lists had to be composed solely of other lists or elements all of one type. One had to define the possible terms (giving the functor) that could be arguments to a predicate. It seemed impossible to write generic predicates for dealing with arbitrary types of terms. Ex: to have a term that could be a 'symbol' (atom) or an integer one had to do this: domains aori = a(atom) or i(integer) It was not possible to just use an atom or an integer as a subterm... Typing each subterm of a term is not my idea of Prolog. After about an hour we got the 'standard' timing example of naive reverse running (Some people have used other, non-environment-creating samples. This is an unfair comparison). It did 496 unifications in aproximately 11/100 of a second. This amounts to a speed of a little under 5 Klips. Considering that they do not need to do 'real' unification (since everything is pre-typed, and thus can be reduced to a simple test), this speed is not particularly impressive. - mike newton@cit-vax.caltech.edu {ucbvax!cithep,amdahl}!cit-vax!newton Caltech 256-80 818-356-6771 (afternoons,nights) Pasadena CA 91125 Beach Bums Anonymous, Pasadena President ------------------------------ Date: 16 May 86 09:24:00 EST From: "CUGINI, JOHN" Reply-to: "CUGINI, JOHN" Subject: Preliminary notes on Turbo Prolog Quickie Review of Turbo Prolog This is a rough set of notes about Turbo Prolog (hereafter TP). It is a *linguistic* comparison of TP vs. the Clocksin & Mellish book (CM) and Pereira's CProlog (CP). It is based mostly on a reading of the TP manual, not live experimentation with the product itself. There is no evaluation of performance, nor much of the programming environment provided by TP. TP is related to, but by no means compatible with, either CM or CP. In the list below, I've put TP/CP differences first, and then TP enhancements. 1. Declarations. Structures must have the types of their arguments declared. That is, you can't just toss in compound terms in facts and rules. The functors for all predicates must be declared, together with role names for each of the arguments, in a PREDICATES section, like this: predicates person(name, height, weight, hair_color) name2(last, first) name3(last, first, middle) and each role must declare from which domain(s) it is drawn, in a DOMAINS section (which must precede the predicates section); very relational databasy: domains name = name2(last, first); name3(last, first, middle) /* name is either a name2 or name3 structure. */ first, middle, last = symbol /* first, middle, and last are all (atomic) symbols. */ height = integer weight = real hair_color = symbol What's normally thought of as the regular program is contained in a CLAUSES section, following the two above. There are five primitive atomic data types (integer, real, char, string, symbol), and everything is built from these. A given domain may consist of a single primitive type or a disjunction of compound types, but *not* a disjunction of primitive types. Since lists are declared like this: numlist = integer* /* numlist is a list of integers */ it appears that lists must be relatively homogeneous, ie, must contain elements of either a single primitive type, or a few compound types. The whole flavor is much more that of compilation, data definition, Pascal, and type-checking, than of the usual interpreted, free-spirited CP or CM. Thus TP stresses documentation, security, and efficiency, but disables some dynamic data building features. 2. Declaring the use of Arguments. When an argument may be passed unbound from one sub-goal to another, it must be declared as a *reference* whatever, back up in the domain declarations to tell TP to pass it be reference, since TP otherwise assumes it can be passed by value (i.e. already instantiated), eg: domains height = reference integer /* height is a pointer to an integer */ tree = reference node(integer, tree, tree) /* note recursive structure */ 3. No meta-logical probing of the DB. There is nothing like CP's predicates: =.., functor, arg, clause, or current_functor for fiddling with the current program's clauses. In general, there's is no run-time inspection or building of rules. Assert and retract work only for facts. 4. There are no user-defined operators, nor CP's expand_term for pre-processing. 5. Syntax shuffling - TP CP --------- -------- bound, free nonvar, var < @< /* for strings and symbols */ = is /* numeric computation */ = =:= /* numeric test */ equal = /* term unification */ bitand, bitor /\, \/ bitnot \ bitleft, bitright <<, >> Also, all rules for the same predicate must be lexically contiguous, and you can use the keywords "and", "or", and "if" instead of the symbols ",", ";", and ":-". 6. TP implements CM's findall, rather than CP's setof and bagof. 7. TP has lots of features for handling files and I/O. Its predicates for input (read_x), however, expect to know the type of object, eg, readint, readreal. TP doesn't have CP's get for single character input. It does have readln to read an entire line into a string. 8. TP has goodies to handle (fixed-format) databases on disk. Eg, dbassert/dbretract add/delete facts to/from an external (permanent) database. 9. TP has features for program modularization. Each module can be compiled independently, and has its own name space, eg, for domains and predicates. There is also a way to set up global domains and predicates visible to all modules. 10. TP handles character-strings as a full-fledged data-type. Also it has functions for conversion among the primitive types. 11. TP has predicates to control graphics, windows, sound, etc. 12. The TP editor is Wordstar-like, not especially Prolog-oriented. The opinions expressed herein have been officially approved and sanctioned by the Supreme Court, both houses of Congress,... no, no, only kidding, only kidding, actually I didn't even consult with them - please don't blame anyone but me. John Cugini Institute for Computer Sciences and Technology National Bureau of Standards ------------------------------ End of AIList Digest ******************** From vtcs1::in% Tue May 20 06:42:48 1986 Date: Tue, 20 May 86 06:42:43 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #125 Status: R AIList Digest Tuesday, 20 May 1986 Volume 4 : Issue 125 Today's Topics: Queries - Neural Networks & Inside and Outside & EURISKO & Strength of Chess Computers & Conway's Game of LIFE & Prolog nth, Replies - Prolog nth & Neural Networks & Shape & Conway's Game of LIFE, AI Tools - PCLS Common Lisp ---------------------------------------------------------------------- Date: 11 May 86 09:02:16 GMT From: tektronix!uw-beaver!bullwinkle!rochester!seismo!gatech!akgua!whu xlm!whuxl!houxm!mtuxo!orsay@ucbvax.berkeley.edu (j.ratsaby) Subject: Re: neural networks > > Stephen Grossberg has been publishing on neural networks for 20 years. > He pays special attention to designing adaptive neural networks that > are self-organizing and mathematically stable. Some good recent > references are: I would like to ask you the following: >From all the books that you read,was there any machine built or simulation that actually learned by adapting its inner structure ? if so then what type of information was learned by the machine and in what quantities ? what action was taken to ask the machine to "remember" and retrive information ? and finally , where are we standing today,that is, to your knowledge, which is the machine that behaves the closest to the biological brain ? I would very much apreciate reading some of your thoughts about the above, thanks in advance. joel Ratsaby !mtuxo!orsay ------------------------------ Date: Wed 14 May 86 17:36:44-PDT From: Pat Hayes Subject: inside and outside Dr. Who's Tardis seems to have a larger interior than exterior. People find this not outrageously unintuitive, and I am trying to understand why. Which of the following 'explanations' do people find intuitively satisfying? 1. the inside is just larger than the outside, thats all. 2. there is a different kind of space inside the Tardis, so more can be fitted into it. 3. the 'interior' isnt inside the police box at all, its somewhere else, and the door is a transporter device. 4. the door changes sizes, shrinking things on the way in and magnifying them on the way out, and the interior is built on a small scale. ( As in Disneys 'fantastic voyage' ) 5. something else ( what? ) This particular idea recurs in folklore and childrens fantasy, whereas other equally impossible concepts are met with less often ( something being in two places at once, for example ). This suggests that it might illustrate a natural separation between different parts of our spatial intuition. Send intuitions, explanations, comments to PHAYES@SRI-KL. Thanks. Pat Hayes SPAR ------------------------------ Date: 15 May 86 07:45:26 GMT From: ingres.Berkeley.EDU!grady@ucbvax.berkeley.edu (Steven Grady) Subject: AI in IAsfm In the June 86 issue of IAsfm ,there's a fascinating article on AI and common sense. In this article, the author mentions a program called Eurisko, which I had heard about before briefly, but which I'm now reminded of. Do people have references to this? How can I find out more about it? Steven Grady ...!ucbvax!grady grady@ingres.berkeley.edu [I've sent Steven the list of Lenat references that appeared in #2/117, 12 Sep 1984. The most pertinent is D. B. Lenat, "EURISKO: A Program that Learns New Heuristics and Domain Concepts," Journal of Artificial Intelligence, March 1983. Also available as Report HPP-82-26, Heuristic Programming Project, Dept. of Computer Science and Medicine, Stanford University, Stanford, California, October 1982. -- KIL] ------------------------------ Date: Fri, 16 May 86 16:50:48 PDT From: cracraft@isi-venera.arpa Subject: strength of commercially available chess computers This message is primarily addressed to Tony Marsland, AILIST member, but is of general interest to the rest of the list as well. Tony, for our readers, what are the three strongest available chess machines according to the Swedish article in the most recent issue of the ICCA Journal? I was told today by a third-party (THE PLAYERS company in Los Angeles), that the Novag Constellation Expert is approximately 2100 in chess strength. I find this impossible to believe because it runs on a tiny 8-bit processor at 1/50,000th the speed of a Belle, Cray Blitz, or Hitech which barely pass 2100 in chess strength. It should be noted that Hitech's rating is based on very few tournament games. The same is true of Cray Blitz. Only Belle has a sufficient base to qualify its 2200 rating claim. Well, Tony, what are they? Take care. Stuart Cracraft ------------------------------ Date: 16 May 86 15:21:15 GMT From: allegra!mit-eddie!genrad!panda!husc6!harvard!seismo!mcvax!ukc!re ading!onion.cs.reading.AC.UK!scm@ucbvax.berkeley.edu (Stephen Marsh) Subject: Conway's game of LIFE Here's an enquiry about John Conway's game of LIFE, a simulation of the birth, life and death of cells placed on a grid. It was devised about 1970 and was based on the theory of cellular automata. It became of great interest to a large number of people after it was discussed by Martin Gardner in Scientific American (Oct 1970-Mar 1971). I would like to know if anyone has done or knows of any investigation into aspects of the LIFE simulation since the outburst of interest in 1970. If they have, or know of any book that contains a (not too theoretical) run-down of cellular automata, perhaps with reference to LIFE, could they let me know. Many thanks Steve Marsh scm@onion.cs.reading.uk Steve Marsh, Department of Computer Science, PO BOX 220, University of Reading, Whiteknights, READING UK. ------------------------------ Date: 14 May 86 09:00:11 GMT From: allegra!mit-eddie!genrad!panda!husc6!harvard!topaz!lll-crg!boote r@ucbvax.berkeley.edu (Elaine Richards) Subject: HELP!!!!! I have been given this silly assignment to do in Prolog, a language which is rapidly losing my favor. We are to do the folowing: Define a Prolog predicate len(N,L) such that N is the length of list L. Define a Prolog predicate nth(X,N,L) such that X is the Nth element of list L. I cannot seem to instantiate N past the value 0 on any of these. My code looks like this: len(N,[]) :- 0 !. len(N,[_|Y] :- N! is N + 1,len(N1,L]. It gives me an error message indicating "_6543etc" or somesuch ghastly number/variable refuses to take the arithmetic operation. The code for nth is similar and gives a similar error message. Please send replies to {whateverthepathis}lll-crg!csuh!booter. E ***** ------------------------------ Date: 16 May 86 19:48:00 GMT From: pur-ee!uiucdcs!uiucdcsb!mozetic@ucbvax.berkeley.edu Subject: Re: HELP!!!!! % How about the following: len( 0, [] ). len( N, [_ | L] ) :- len( N0, L ), N is N0 + 1. nth( X, 1, [X | _] ). nth( X, N, [_ | L] ) :- N > 1, N0 is N - 1, nth( X, N0, L ). ------------------------------ Date: 14 May 86 20:44:09 GMT From: tektronix!uw-beaver!bullwinkle!rochester!seismo!lll-crg!topaz!ha rvard!bu-cs!jam@ucbvax.berkeley.edu (Jonathan A. Marshall) Subject: Re: neural networks In article <1583@mtuxo.UUCP> orsay@mtuxo.UUCP (j.ratsaby) writes: > In article <538@bu-cs.UUCP> jam@bu-cs.UUCP (Jonathan Marshall) writes: >> >> Stephen Grossberg has been publishing on neural networks for 20 years. >> He pays special attention to designing adaptive neural networks that >> are self-organizing and mathematically stable. ... > > I would like to ask you the following: > From all the books that you read,was there any machine built or simulation > that actually learned by adapting its inner structure ? TRW is building a chip called the MARK-IV which implements some of Grossberg's earlier adaptive neural networks. The chip basically acts as an adaptive pattern recognizer. Also, Grossberg's group, the Center for Adaptive Systems, has simulated some of his parallel learning algorithms in software. In particular, "masking fields" have been applied to speech-recognition, the "boundary contour system" has been applied to visual pattern segmentation, and other networks have been applied to symbolic pattern-recognition. > if so then what type of information was learned by the machine and in what > quantities ? what action was taken to ask the machine to "remember" and > retrive information ? and finally , where are we standing today,that is, to > your knowledge, which is the machine that behaves the closest to the > biological brain ? > I would very much apreciate reading some of your thoughts about the above, > thanks in advance. joel Ratsaby !mtuxo!orsay The network simulations learned to discriminate patterns based on arbitrary similarity measures. They also performed associative learning tasks that explain psychological data such as "inverted U," "overshadowing," "attentional priming," "speed-accuracy trade-off," and more. The networks learned and remembered spatial patterns of neural activity. The networks then later retrieved the patterns, using them as "expectation templates" to match with newer patterns. The degree of match or mismatch determined whether (1) the newer patterns were represented as instances of the "expected" pattern, or (2) a fast parallel search was initiated for another matching template, or (3) the new pattern was allocated its own separate representation as an unfamiliar pattern. One of Grossberg's main contributions to learning theory has been the design of self-organizing associative learning networks. His networks function more robustly than most other designs because they are self-scaling (big patterns get processed just as effectively as small patterns), self-tuning (the networks dynamically adjust their own capacities to simultaneously prevent saturation and suppress noise), and self-organizing (learning occurs within the networks to produce finer or coarser pattern discriminations, as required by experience). Grossberg's mathematical analyses of "mass-action" systems enabled him to design networks with these properties. In addition, his networks are physiologically realistic and unify a great deal of otherwise fragmented psychological data. Read one or two of his latest papers to see his claims. The question of which _machine_ behaves closest to the biological brain is not yet appropriate. The candidates I know of are all software simulations, with the possible exception of the TRW Mark-IV, which is quite limited in capacity. Other schemes, such as Hopfield nets, are not mass-action (in the technical sense) simulations, and hence fail to observe certain kinds of local-global tradeoffs that characterize biological systems. However, the situation is hopeful today. More AI researchers have been recognizing the importance of studying biological systems in detail, to gain intuition and insight for designing adaptive neural networks. ------------------------------ Date: Sat, 17 May 86 18:43:44 pdt From: John B. Nagle Subject: Geometry-oriented AI There are some ideas worth pursuing here. There is a class of problems for which solid geometric modeling, rather than predicate calculus, seems an appropriate underlying model. The hook and ring problem seems to be of this type. Alex Pentland at SRI has done some work on concise mathematical representations of the physical universe, and I suspect that a system that could manipulate objects in Pentland's representation, calculating interferences and contacts, driven by various search strategies, would be an appropriate way to attack the hook and ring problem. One can dimly imagine a solid geometric modelling system with approximate representations a la Pentland ("fuzzy solid modelling?") enhanced by some notions of force, strength of materials, and inertia, as a base for working on such problems. Unlike the Blocks World and its successors, where the geometric information was transformed to expressions in predicate calculus as soon as possible, I'm suggesting that we stay in the 3D geometric domain and work there. We might even want to take problems that are not fundamentally geometric and construct geometric analogues of them so that geometric problem solving techniques can be applied. (Please, no flames from the right brain/left brain crowd). Has anyone been down this road yet and actually implemented something? Interesting thought: could the new techniques for performing optimization calculations being developed by the neural-nets people be applied to the computationally-intensive tasks in solid geometric modelling? I suspect so, especially if we are willing to accept approximate answers ("Will the couch fit through the door?" might return "Can't be sure; within .25 inch error tolerance") some of the closed-loop feedback analog techniques proposed may be applicable. The big bottleneck in solid geometric modelling is usually performing the interference calculations to decide what is running into what. The brain is good at this, and probably doesn't do it by number-crunching. John Nagle 415-856-0767 ------------------------------ Date: 19 May 86 09:05:16 GMT From: brahms!weemba@ucbvax.berkeley.edu (Matthew P. Wiener) Subject: Re: Conway's game of LIFE I'm directing followups to net.games only. A good reference to LIFE: Berlekamp, Elwyn R ; Conway, John H ; Guy, Richard K Winning Ways II: Games in Particular Academic Press 1982 The last chapter is devoted to the proof that LIFE is universal. The rest of the book is worth reading anyway. You will learn why E R Berlekamp is the world's greatest Dots-and-Box player, for example. A good reference to cellular automata: Farmer, Doyne ; Toffoli, Tommaso ; Wolfram, Stephen ; (editors) Cellular Automata: Proceedings North-Holland 1984 The latter is a reprint of Physica D Volume 10D (1984) Nos 1&2. Mostly technical, with interest in physical applications, but the article by Gosper on how to high speed compute LIFE is quite intriguing and readable. Also, Martin Gardner occasionally had an update after his original article. His newest book, "Life, Wheels, and other Mathematical Amusements" (???), reprints the latest. ucbvax!brahms!weemba Matthew P Wiener/UCB Math Dept/Berkeley CA 94720 ------------------------------ Date: Thu, 15 May 86 16:56:12 MDT From: shebs@utah-cs.arpa (Stanley Shebs) Subject: PCLS Common Lisp Available This is to announce the availability of the Portable Common Lisp Subset (PCLS), a Common Lisp subset developed at the University of Utah which runs in Portable Standard Lisp (PSL). PCLS is a large subset which implements about 550 of the 620+ Common Lisp functions. It lacks lexical closures, ratios, and complex numbers. Streams and characters are actually small integers, some of the special forms are missing, and a number of functions (such as FORMAT) lack many of the more esoteric options. PCLS does include a fully working package system, multiple values, lambda keywords, lexical scoping, and most data types (including hash tables, arrays, structures, pathnames, and random states). The PCLS compiler is the PSL compiler which produces very efficient code, augmented by a frontend that does a number of optimizations specific to Common Lisp. Gabriel benchmarks and others show that PCLS programs can be made to run as fast as their PSL counterparts - almost all uses of lambda keywords are optimized away, and a type declaration/inference optimizer replaces many function calls with efficient PSL equivalents. PCLS has been used at Utah and elsewhere for about 6 months, and a number of programs have been ported both to and from PCLS and other Common Lisps. PCLS is being distributed along with an updated version of PSL (3.2a). We require that you sign a site license agreement. The distribution fee is $250 US for nonprofit institutions, plus a $750 license fee for corporations. Full sources to both PSL and PCLS are included along with documentation on the internals and externals of the system. At present, we are distributing PCLS for 4.2/4.3 BSD Vax Un*x and for Vax VMS. Releases for Apollo and Sun are anticipated soon, and versions for other PSL implementations are likely. If interested, send your USnail address to: Loretta Cruse Computer Science Department, 3160 MEB University of Utah Salt Lake City UT 84112 cruse@utah-20.ARPA {seismo, ihnp4, decvax}!utah-cs!cruse.UUCP Technical questions about PCLS, flames about absence of closures, etc may be directed to shebs@utah-cs.ARPA, loosemore@utah-20.ARPA, or kessler@utah-cs.ARPA. ------------------------------ End of AIList Digest ******************** From vtcs1::in% Sat May 24 18:43:14 1986 Date: Sat, 24 May 86 18:43:07 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #126 Status: R AIList Digest Wednesday, 21 May 1986 Volume 4 : Issue 126 Today's Topics: Opinion - AI Conference Size, Seminars - Knowledge-Based Development of Software Systems (SU) & Decision-Theoretic Heuristic Planning (SU) & NanoComputers and Molecular Engineering (Xerox PARC) & Palladio Exploratory Environment for Circuit Design (SU), Conference - IJCAI-89 Site Selection and Officer Election & Workshop on High-Level Tools ---------------------------------------------------------------------- Date: Tue 20 May 86 13:56:33-PDT From: Peter Karp Subject: On the growing size of AI conferences What's all this fuss about organizing AAAI into seperate science and engineering tracks to try to deal with the size of the conference? We can hold the size down much more effectively by simply holding it and IJCAI in Detroit every year. ------------------------------ Date: Wed 14 May 86 09:23:24-PDT From: Christine Pasley Subject: Seminar - Knowledge-Based Development of Software Systems (SU) CS529 - AI In Design & Manufacturing Instructor: Dr. J. M. Tenenbaum Title: Knowledge-Based Development of Software Systems Speakers: Lawrence Markosian Douglas Smith From: Reasoning Systems and Kestrel Institute Date: Wednesday, May 14, 1986 Time: 4:00 - 5:30 Place: Terman 556 In the first part of the talk a knowledge-based approach to the development of software systems is presented. In this approach specifications written in a very-high-level, wide-spectrum language are refined via transformations into efficient programs. Several complex transformations for decomposing and refining specifications are illustrated with examples. In the second part of the talk an area of applied research - the derivation of specifications from requirements will be discussed. A case study in the requirements, specification, design and synthesis of a simple communications system is presented. In the case study only the step from specification to program is automated. It is then suggested how the same technology used in automating that step can be used to automate the derivation of the specification from requirements. Visitors welcome! ------------------------------ Date: Fri 16 May 86 18:48:43-PDT From: Larry Fagan Subject: Seminar - Decision-Theoretic Heuristic Planning (SU) A Decision-Theoretic Approach to Explaining Heuristic Planning Curtis P. Langlotz PhD Oral Exam Medical Information Sciences Stanford University Thursday, May 22, 1:15 PM Medical Center M-112 Many important planning problems are characterized by uncertainty about the current situation and by uncertainty about the consequences of future action. These problems also inevitably involve tradeoffs between the costs and benefits associated with possible actions. Decision theory is an extensively studied methodology for reasoning under these conditions, but has not been explicitly and satisfactorily integrated with artificial intelligence approaches to planning. Likewise, many perceived practical limitations of decision theory, such as problem solving results that are difficult to explain and computational needs that are difficult to satisfy, can be overcome through the use of artificial intelligence techniques. This thesis explores the combination of decision-theoretic and artificial intelligence approaches to planning, and shows that this combination allows better explanation of planning decisions than either one alone. In addition, the explicit representation of probabilities and utilities allows flexibility in the construction of a planning system. This means that assumptions made by such systems, which may be critical for their performance, are more easily modified than in a system that does not explicitly represent uncertainties and tradeoffs. ------------------------------ Date: 19 May 86 11:00 PDT From: DMRussell.pa@Xerox.COM Reply-to: DMRussell.pa@Xerox.COM Subject: Seminar - NanoComputers and Molecular Engineering (Xerox PARC) PARC Forum May 22, 1986 3:45PM, PARC Auditorium K. Eric Drexler Research Affiliate, MIT Space Sciences Laboratory NanoComputers and Molecular Engineering The broad outlines of future technology will be set by the limits of physical law, if we can develop means for approaching those limits. Today, because we cannot directly manipulate atomic structures, we can make no more than a fraction of the physical structures allowed. Advances in biotechnology and computational chemistry are opening paths to the development of molecular assemblers able to construct complex atomic objects, making possible dramatic advances in the field. Among these advances will be nanocomputers with parts of molecular size. Mechanical nanocomputers are amenable to design and analysis with available techniques. This technology promises sub-micron computers with giga-hertz clock rates, nanowatt power dissipation, and RAM storage densities in the hundreds of millions of terabytes per cubic centimeter. This Forum is OPEN. All are invited. Host: Dan Russell (Intelligent Systems Lab, 494-4308) Refreshments will be served by the Ad Hoc Collective of Persons Interested in Social Interchange (AHCPISI) at 3:30 pm. ------------------------------ Date: Tue 20 May 86 09:30:55-PDT From: Christine Pasley Subject: Seminar - Palladio Exploratory Environment for Circuit Design (SU) CS529 - AI In Design & Manufacturing Instructor: Dr. J. M. Tenenbaum Title: Palladio: An Exploratory Environment for Circuit Design Speakers: Harold Brown From: Knowledge Systems Lab, Stanford University Date: Wednesday, May 21, 1986 Time: 4:00 - 5:30 Place: Terman 556 The Palladio system was an early (1980-82) attempt to apply artificial intelligence techniques to the design of electronic circuits. Palladio was an exploratory environment for experimenting with circuit and system design representations, design methodologies, and knowledge-based design and analysis aids. It differed from other prototype design environments in that it provided mechanisms for constructing, testing and incrementally modifying or augmenting design languages and design tools. Palladio had facilities for conveniently defining models of circuit or system stucture and behavior. These models, called perspectives, were similar to design levels in that the designer could use them to interactively create and refine design specifications. Palladio provided an interactive graphics interface for displaying and editing structural perspectives of circuits or systems in a uniform, perspective-independent manner. A declarative, temporal logic behavioral language with an associated interactive behavior editor was used to specify designs from a behavioral perspective. Further, a generic, event-driven symbolic simulator could simulate and verify the behavior of a specified circuit or system from any behavioral perspective and could perform hierarchical and mixed-perspective simulations. Several experimental expert system design refinement and analysis aids were implemented using the Palladio environment, for example, a system which assigned mask levels to the interconnect in an NMOS circuit which took into account the electrical characteristics of the levels as well as design goals. In this talk Prof. Brown will describe the Palladio system, its implementation and some of the lessons learned about knowledge-based systems for enginnering tasks. Visitors welcome! ------------------------------ Date: Fri, 16 May 86 00:29:31 edt From: walker@mouton.bellcore.com (Don Walker) Subject: Conference - IJCAI-89 Site Selection and Officer Election IJCAI-89 Site Selection and Officer Election The Trustees of the International Joint Conferences on Artificial Intelligence, Inc. are pleased to announce that IJCAI-89 will be held 20-26 August 1989 in Detroit, Michigan, USA. Wolfgang Bibel, Technical University of Munich, has been elected Conference Chair; Sri Sridharan, BBN Laboratories, has been elected Program Chair; and Sam Uthurusamy of General Motors Research Laboratories has been appointed to chair the Local Arrangements Committee. Don Walker, Bell Communications Research, the IJCAII Secretary-Treasurer, will also serve as Secretary-Treasurer for the conference. IJCAI-89 will be cosponsored by the American Association for Artificial Intelligence. All conference activities will be coordinated through the AAAI Office by Claudia Mazzetti, Executive Director of the AAAI, who will provide direct support for the IJCAI-89 Conference Committee. In accordance with customary practice for IJCAI conferences held in North America, the AAAI will also arrange the tutorial and exhibit programs at the meeting. For further information, contact one of the following: Wolfgang Bibel (IJCAI-89) Institut fuer Informatik Technische Universitaet Muenchen Postfach 202420 D-8000 Muenchen 2, West Germany Telephone: (49-89)2105-2031 bibel%germany.csnet@csnet-relay N. S. Sridharan (IJCAI-89) BBN Laboratories 10 Moulton Street Cambridge, MA 02238 Telephone: (1-617)497-3366 sridharan@bbng.arpa R. Uthurusamy (IJCAI-89) Computer Science Department General Motors Research Laboratories Warren, MI 48090, USA Telephone: (1-313)575-3177 samy%gmr.csnet@csnet-relay Donald E. Walker (IJCAI-89) Bell Communications Research 445 South Street MRE 2A379 Morristown, NJ 07960, USA Telephone: (1-201)829-4312 walker@mouton.arpa Claudia Mazzetti (IJCAI-89) AAAI Headquarters 445 Burgess Drive Menlo Park, CA 94025 Telephone: (1-415)328-3123 aaai-office@sumex-aim.arpa ------------------------------ Date: Mon 19 May 86 12:18:30-EDT From: Arun Subject: Conference - Workshop on High-Level Tools Call for Participation WORKSHOP ON HIGH LEVEL TOOLS FOR KNOWLEDGE BASED SYSTEMS Sponsored by The American Association for Artificial Intelligence (AAAI) Laboratory for Artificial Intelligence Research The Ohio State University (OSU-LAIR) Defense Advanced Research Projects Agency (DARPA) Columbus, Ohio October 7-8, 1986 It has become increasingly clear to builders of knowledge based systems that no single representational formalism or control construct is optimal for encoding the wide variety of types of problem solving that commonly arise and are of practical significance. The structures specific to diagnosis appear ill adapted for use in design and planning tasks, and those for prediction seem unsuitable for intelligent data retrieval. Thus there appears to be a need for task-specific constructs at levels of organization above those of rules, frames, and predicate calculus, and their associated control structures. In addition to problem solving, there is a similar move for higher-level tools for knowledge acquisition and explanation. The objective of this workshop is to bring together theoreticians and builders of knowledge based systems in order to explore the prospects for tools for specifying structures at these higher levels. Presentations are invited on all aspects of high level tools for knowledge-based systems, including (but not restricted to) these topics: - The powers and limitations of existing knowledge engineering tools and techniques. - Delineating the "natural kinds" of knowledge based problem solving that can provide the basis for task specific tools. - Matching AI techniques to tasks. - Design proposals for high level knowledge engineering tools. - Integrating task-specific tools into "toolboxes" for building systems that perform complex problem solving tasks. Four copies of an extended ABSTRACT (up to 8 pages, double-spaced) should be sent to the workshop chairman before July 1, 1986. Acceptance notices will be mailed by August 1. Revised abstracts should be returned to the chairman by September 1, 1986, so that they may be bound together for distribution at the workshop. Workshop Chairman: Organizing Committee: B. Chandrasekaran, William J. Clancey, Stanford University OSU-LAIR Lee Erman, Teknowledge Inc. Richard Fikes, Intellicorp John Josephson, OSU-LAIR Allen Sears, DARPA For information and local arrangements, contact: Charlie Huff Bev Mullet (614) 422-0054 (614) 422-0248 EMail: Huff@Ohio-State.ARPA EMail: Mullet-B@Ohio-State.ARPA Huff-C@Ohio-State.CSNET {ihnp4,cbosgd}!osu-eddie!huff Department of Computer and Information Science The Ohio State University 2036 Neil Avenue Columbus, OH 43210 ------------------------------ End of AIList Digest ******************** From vtcs1::in% Wed May 21 06:41:29 1986 Date: Wed, 21 May 86 06:41:25 edt From: vtcs1::in% (LAWS@SRI-AI.ARPA) To: ailist@sri-ai.arpa Subject: AIList Digest V4 #127 Status: RO AIList Digest Wednesday, 21 May 1986 Volume 4 : Issue 127 Today's Topics: Queries - Expert Systems and Engineering Design & TMS Variables, Games & Literature - Conway's Game of LIFE, AI Tools - VAX VMS LISP & LISP Utilities & AI, Graphics, and Simulation, Expert Systems - ADL Personal Financial Planner, Perception - Correction to Response to Nevin, Literature - Research Indexes: Machine Learning 3, Discussion Lists - Psychnet ---------------------------------------------------------------------- Date: 20 May 86 17:43:41 GMT From: ernie.Berkeley.EDU!mazlack@ucbvax.berkeley.edu (Lawrence J. Mazlack) Subject: Re: ES and ENGINEERING DESIGN I am in the definition stage of my dissertation. I need help in identifying what is being done and what has done. So, any pointers or information would be greatly appreciated. My general area is: ENGINEERING DESIGN AND EXPERT SYSTEMS Within that, I am interested in: ANALOG CIRCUIT DESIGN Thank you, Mojgan Samadar pelejhn@ucccvm1.bitnet 508 Riddle Road, #46 Cincinnati, Ohio 45220 ------------------------------ Date: Tue, 20 May 86 16:18:54 CDT From: mklein@b.CS.UIUC.EDU (Mark Klein) Subject: TMS Variables I have been trying to decide whether or not to change some code I have (a pattern-directed inference engine, justification-, logic-, and assumption- based TMS's) to handle variables in the data. Variables do seem to add more flexibility (specifically, universal and existential quantification, I guess), but have some problems as well - for example, one can no longer use open-coded unification to match up assertions to rule triggers (I think). What I'd like to know is whether it is easy or hard to have variables in data for each kind of TMS (it seems to be simple for the justification-based TMS)? Is there any advantage to having variables in data that you can't get simply by writing the appropriate rules (i.e. in terms of efficiency, expressiveness, ability to control inference, etc)? Thanks, Mark Klein ------------------------------ Date: 20 May 86 18:43:12 EDT From: kyle.wbst@Xerox.COM Subject: re:Conway's game of LIFE In AIList Digest V.4 #125, Steve Marsh requested info on any book ("not too theoretical") on this subject. I recommend The Recursive Universe, by William Poundstone (Morrow & Co.), c.1985. It is a delightful non-mathematical treatment of information theory, entropy relationships and other related issues including a discussion of Conway's game of LIFE. It also includes a listing of the game for use on an IBM PC (or equivalent). Earle Kyle. ------------------------------ Date: Tue, 20 May 86 09:44:24 EDT From: jbs@EDDIE.MIT.EDU (Jeff Siegal) Reply-to: jbs@mit-eddie.UUCP (Jeff Siegal) Subject: Re: VAX VMS LisP In article <8605200626.AA27708@ucbvax.Berkeley.EDU> larry@JPL-VLSI.ARPA writes: >Are there any Common LisPs for the VAX under VMS? (DEC's VAX LisP is an >Ultrix product only, so far as I know.) ... You have things backwards. VAX LISP is a VMS-only product. Jeff Siegal ------------------------------ Date: Wed, 14 May 86 21:21:07 edt From: beer%case.csnet@CSNET-RELAY.ARPA Subject: VAX LISP Utilities Here at the Center for Automation and Intelligent Systems Research (Case Western Reserve University), we have developed a number of tools and utilities for VAX LISP. They include extensions to the control structure and string primitives, a simple pattern matcher, a pattern-based APROPOS facility, a pattern-based top-level history mechanism, an extensible top-level driver, an extensible top-level command facility, an extensible DESCRIBE facility, and an implementation of Flavors. These facilities are described in detail in a technical report, "CAISR VAX LISP Tools and Utilites" (TR-106-86). The object code for these facilities is in the public domain. A tape containing them may be requested by sending me mail at the address below. There is a $35 charge to cover the cost of the tape and shipping and handling costs. Currently, these facilities assume a VMS operating system environment and require Version 2.0 of VAX LISP. Randall D. Beer (beer%case@CSNet-Relay.ARPA) Center for Automation and Intelligent Systems Research Case Western Reserve University Glennan Bldg., Room 312 Cleveland, OH 44106 ------------------------------ Date: Thu, 15 May 86 10:19 EDT From: Paul Fishwick Subject: AI, Graphics & Simulation >> Date: Mon, 12 May 86 12:19:46 est >> From: munnari!csadfa.cs.adfa.oz!gyp@seismo.CSS.GOV (Patrick Tang) >> Subject: Graphics, Artifical Intelligence and Simulation >> >> Is there anyone out there come across any literature >> describing the topics Graphics, Artifical Intelligence and >> Simulation together. It seems to me that literatures on >> these combined topics are VERY VERY scarce!!! >> There are a number of projects that have incorporated graphics, ai, and simulation. Perhaps the largest project has been the STEAMER project which incorporates layers of object abstractions for a steam plant. At Penn, we have a multi-level simulation system (HIRES) that permits the construction and interactive control of process abstraction layers. We also have a facial animation system (OASIS) that incorporates local area expression simulations. Both HIRES and OASIS utilize the Iris Workstation 2400 (Silicon Graphics, Inc.) for real-time animation. Rand Corporation (Santa Monica, CA) has been involved with object oriented simulation for quite some time (I think they have an example graphical simulation of a battle scenario). You should also check out the commercial enterprise, Pritsker Associates, who sell a graphical simulation package. Some references are given: 1. Hollan James, Hutchins Edwin, Weitzman Louis - "STEAMER: An Interactive Inspectable Simulation-Based Training System", AI Magazine (Summer 1984). 2. Fishwick, Paul - "Hierarchical Reasoning: Simulating Complex Processes over Multiple Levels of Abstraction", Ph.D Thesis, Univ. of Pennsylvania, 1986 (MIS-CS-85-21). 3. Platt, Steve - "A Structural Model of the Human Face", Ph.D Thesis, Univ. of Pennsylvania, 1985. 4. McArthur, David and Sowizral, Henry - "An Object-Oriented Language for Constructing Simulations", IJCAI 1981. An important issue with "AI and Simulation" is determining where the "ai" is in simulation. The answer to that may best be found in the special workshop in AI and Simulation to be held at AAAI-86. Even though graphics is not explicitly mentioned, you should also check out the qualitative reasoning/simulation literature (de Kleer, Forbus, Kuipers, and others) in past IJCAI/AAAI's. Also "aggregation" is receiving wider attention these days: look at Goldin & Klahr (IJCAI '81) and Weld (IJCAI '85). -paul CSNET: fishwick@upenn ------------------------------ Date: Mon, 19 May 86 19:08 EDT From: Tom Martin Subject: Correction to Spang-Robinson Summary A message appeared in the AI List a few weeks ago that summarized the Spang-Robinson report of April, 1985 -- Volume 2, No. 4 The Arthur D. Little personal financial planner, according to the summary, "uses databases residing on IBM mainframe." In fact, what we've done is develop a serial link that connects the Symbolics to an IBM 43xx running VM/CMS via the IBM 3705 communications controller. The point worth expanding on is that in this IBM/Symbolics symbiosis, the IBM is in charge, not the Symbolics. Yes, the planner "uses databases on the IBM mainframe," but only because the IBM user has (a) requested it, and (b) has the right access. The system uses the "virtual machine" concept of VM/CMS heavily. In effect, the Symbolics appears to be a separate virtual machine running on the 43xx. It responds to commands in real-time (instead of uploading/downloading files), however, the commands have to be pre-defined or rely on the EVAL on the Symbolics to return a meaningful answer. Neither the PFPS or this link are products of Arthur D. Little, Inc., as such. I hope to get a chance to talk about the IBM link at SLUG in a few weeks. Tom Martin Manager -- AI Systems Development ------------------------------ Date: Sat, 17 May 86 15:53:31 PDT From: kube%cogsci@BERKELEY.EDU (Paul Kube) Subject: correction to response to Nevin, AIList V4 #120 Instead of Since the standard deviation of the difference of two identically normally distributed random variables is twice the standard deviation of either variable, the temporal disparity measurement has 95% confidence interval of 4*10^-6 seconds. I should have said Since the standard deviation of the difference of two identically normally distributed random variables is less than twice the standard deviation of either variable, the temporal disparity measurement has 95% confidence interval of less than 4*10^-6 seconds. The argument for getting to 4*10^-7 second accuracy still holds. Paul Kube Berkeley EECS kube@berkeley.edu ------------------------------ Date: Fri, 16 May 86 13:29:08 EDT From: Bruce Nevin Subject: bad enough theory Response to kube%cogsci@berkeley.edu (Paul Kube) I suppose we ought to tell the authors of that fish story, and the editors of Nature, that their experimental results have a trivial interpretation in elementary signal detection theory. They were all struck by the `impressive computational ability' of the central nervous system in these animals. I'll leave it to you to disabuse them of that. Your account succeeds precisely because it is not reductionist. Thanks for clarifying what is going on there. ------------------------------ Date: 18 May 86 13:25 PDT From: Shrager.pa@Xerox.COM Subject: Research indexes: Machine Learning 3 Conference proceedings are often published as books for which the authors have not taken the time to construct a proper index. The index for the most recent machine learning book (ML3), is extremely poor. In a book containing 77 articles, claiming to be a "guide to current research", the index is clearly the most important part of the book. It is a shame that this is really a valuable source of summary articles because its success will lead the publisher and authors to believe that they can sell poorly indexed books. Although ML3 is a summary of current research, it is surely no guide. If one's research is actually guided by consideration of the index to ML3, then the authors and publisher have done a disservice to the field. In this particular case, I am surprised that this book wasn't properly indexed. The authors were asked to submit SCRIBE source for their papers and could easily have been asked to also include index entries either in the source, or selected from a list of keywords. I encourage those who feel that they must buy ML3 to ignore the index, and to write a letter to the authors author and publishers complaining about its index. The 22 cents spent on stamps, and the hour spent writing, are nominal with respect to the service you may be doing yourself and the field in the future. -- Jeff ------------------------------ Date: Mon, 12 May 86 21:58:25 pdt From: George Cross Subject: Psychnet [Ken - I think this may be of interest to some portion of the AI community. It was on the Weizmann Bulletin Board] PPPP IIII PP II PP PSYCHNET II PP II PP II PP II PSISSSSPSI SSSS SSSS SSSS SSSS SSSS SSSS PSISSSSPSI EDUCATIONAL PSYCHOLOGY DEPARTMENT UNIVERSITY OF HOUSTON - UNIVERSITY PARK 4800 CALHOUN BOULEVARD HOUSTON, TEXAS 77004 For More Information: Norman Kagan, Ph.D. or Distinguished Professor Robert Morecock, M.A. Graduate Assistant 713-749-7621 EPSYNET@UHUPVM1.BITNET March 21, 1986 Selected professional papers scheduled for presentation at the August APA convention soon will be available worldwide via PSYCHNET, the new electronic bulletin board and mail machine at the University of Houston. Dr. Norman Kagan, distinguished professor and chair of the Educational Psychology Department there said, "PSYCHNET will enable psychologists to arrive with papers in hand, having read and processed the presenters' ideas months in advance of the convention. They will be ready to discuss these ideas rather than just assimilate them at our annual meeting." PSYCHNET, which will eventually serve the psychological community in a number of ways, is distributed by BITNET, the electronic mail network that links much of the academic world. "This year PSYCHNET will be sending out papers for Divisions 12, 16, 17 and 38 to anyone on the BITNET system who requests them. Next year we hope that even more divisions will participate," continued Dr. Kagan, "and we are already encouraging people to contact us via BITNET because PSYCHNET is up and running." "Most requests for papers will be automatically acknowledged within five seconds," said Dr. Kagan. Actual arrival time of requested papers will vary from five seconds to twenty minutes, depending on how busy the mail system is. "We are hoping people will go ahead and give PSYCHNET a try now, rather than wait till the last minute." For most computer sites with VM operating systems the command TELL UH-INFO AT UHUPVM1 PSYCHNET HELP will start the process of requesting PSYCHNET papers. Many VAX sites (JNET) will find the command SEND UH-INFO@UHUPVM1 PSYCHNET HELP will obtain the same information. Others should consult their local computer center regarding sending the message PSYCHNET HELP to userid UH-INFO at node UHUPVM1. Via leased lines BITNET makes PSYCHNET available at some 1203 nodes or university computer sites in the free world. Locations range from Israel in the Middle East, to Europe, the United States and Canada, then west as far as Tokyo in Japan. Users of VM (BITNET) systems can obtain the psychnet exec, which vastly simplifies using psychnet. Just give the command TELL UH-INFO AT UHUPVM1 PSYCHNET SENDME PSYCHNET EXEC When it arrives move it from your reader to your file area and then give the command PSYCHNET. Your PSYCHNET use will now be automatic ------------------------------ End of AIList Digest ********************