From comsat@vpics1 Wed Sep 4 00:27:06 1985 Date: Wed, 4 Sep 85 00:26:57 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by csnet-relay.arpa id a018209; 2 Sep 85 23:17 EDT Date: Mon 2 Sep 1985 18:59-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #116 To: AIList@SRI-AI Received: from rand-relay by vpi; Wed, 4 Sep 85 00:08 EST AIList Digest Monday, 2 Sep 1985 Volume 3 : Issue 116 Today's Topics: Queries - Parallel LISP Environments & Hypercube Simulators & OPS5 in Interlisp & Texture Images & Tax Expertise, Philosophy - Intelligence and Generalization, Knowledge Representation - Limitations of Frames/Semantic Nets, Linguistics - CSLI Reports, Expert Systems - Psychiatry ---------------------------------------------------------------------- Date: Tue, 27 Aug 85 15:37:18 EDT From: Deepak Kumar Subject: Parallel LISP Environments We are planning to implement a parallel-environment simulator in LISP for trying out various control metaphors that require parallelism. Anyone already having any implementations or experiences in using such environments? We would appreciate any kind of responses that could help in highlighting various aspects of design as well as implementation. Thanx. Deepak. UUCP : {cmcl2,hao,harpo}!seismo!rochester!rocksvax!sunybcs!kumard ...{allegra,decvax,watmath}!sunybcs!kumard CSNET : kumard@buffalo ARPA : kumard%buffalo@csnet-relay BITNET : kumard@sunybcs ------------------------------ Date: 30 Aug 85 13:54:23 EDT (Fri) From: duke@mitre.ARPA Subject: Simulators for hypercube architectures Lisa Sokol (sokol@mitre) and I are investigating the use of parallel architectures for object-oriented simulations. We have a large simulation called the BEM (Battlefield Environment Model) which is written in the simulation language ROSS, which runs on top of Franz LISP on a VAX. We would like to have a hypercube simulator which would help us investigate strategies for distributing objects in a hypercube. Our main problem seems to be the integration of LISP code with the simulators. Translating the Lisp into C would be messy at best, even with a translator program. Another possibility would be to have Franz LISP running in another process on the VAX and communicating with the simulator process. That sounds pretty messy also, particularly for analyzing the timing since the Lisp is running outside of the simulator process. For our purposes, it may be better to write a Lisp simulator of a hypercube architecture. Do you know of anyone who already has such a simulator? We expect that Lisp will be available on some hypercube in the next year, and our simulator studies should allow us to determine how to distribute the objects by that time. Duke Briscoe duke@mitre ------------------------------ Date: Mon, 2 Sep 85 00:20:55 cdt From: neves@wisc-ai.arpa (David Neves) Subject: OPS5 in Interlisp? Has anyone translated OPS5 into Interlisp? If yes, please send me mail. David Neves Computer Sciences Department University of Wisconsin-Madison Usenet: {allegra,heurikon,ihnp4,seismo,uwm-evax}!uwvax!neves Arpanet: neves@uwvax ------------------------------ Date: Thu 29 Aug 85 14:48:30-PDT From: BARNARD@SRI-AI.ARPA Subject: texture images I am collecting a set of digital images of natural textures. If you have any such images, I would appreciate your help. They could either be images of single textures (Brodatz-type) or images of natural scenes constaining several textured surfaces. I will make the collection available to the AI community. Reply to Barnard@SRI-AI. ------------------------------ Date: Thu 29 Aug 85 13:26:29-CDT From: Charles Petrie Subject: Tax Expertise Available for Expert System Prof. Lewis Solomon is a specialist in tax law and is interested in working with someone on an expert system in that domain. He would also like to hear about existing systems. His US Mail address is: George Washington University National Law Center Washington, D.C. 20052 Phone #(202)676-6753 ------------------------------ Date: 28 Aug 85 14:51:00 EDT From: "CUGINI, JOHN" Reply-to: "CUGINI, JOHN" Subject: Intelligence as the ability to apply the distributive property To wax philosophical for a while and then get down to specifics: 1. A major (the major?) aspect of intelligence is the ability to see several instances of a thing and then be able to abstract out common features. This is terribly handy for information representation as it allows one to condense, by "factoring out", the total info. Nothing really new here - the notion of "inheritance", based on the is-a relation is a clear example. 2. The whole problem of context seems strongly related - isn't context simply that which we hold constant over time, until we are forced to assume something new? - finding the antecedent of pronouns can be seen as the problem of: given the most recent n sentences, what (single, common) interpretation allows me to maximize the number of unchanged assumptions? 3. A big issue then becomes, how rich is the repertoire of pattern-matching mechanisms? Put concretely, and blithely assuming that you can represent anything with lists, given n lists (Lisp-type if you like), which abstractions are available for describing (by generalizing about) them, and which of several applicable abstractions should take precedence? For example, is there a Lisp system out there which would abstract over the following sets of lists the way I suspect would be done by thee or me? Any research being done on general-purpose similarity finding among Lisp lists? (a b c), (a b c), (a b c) (a b c), (a b w), (a b q), (a b d e r) (a b c q), (a b c e), (a b c (d e (w e))) (a b c), ((a) (b) (c)), (((a)) b c) (a b c), (aaaa bb ccccc), (aaa b cccc) (a b c), (A B C), (a B c) ((a b c) (b)), ((a b c d e f) (b c d e)), ((a b (c d) (e f)) (b (c d))) (a a a), (b b b b b b), (xx xx xx xx) (2 3 5), (5 6 11), (12 2 14) (2 3 5), (5 6 11), (12 2 14), (one three four), (3 four 7) The last set is, of course, somewhat unfair, since it relies on knowledge of English semantics, and not simply on structural properties. John Cugini Institute for Computer Sciences and Technology National Bureau of Standards Bldg 225 Room A-265 Gaithersburg, MD 20899 phone: (301) 921-2431 ------------------------------ Date: 28 Aug 1985 10:04-EDT From: Robert.Frederking@CMU-CS-CAD.ARPA Subject: AI Mag article on KR The current (Fall 85) issue of AI Magazine has an article by Ron Brachman raising one of the issues (lack of definitional information) that has been bothering me about AI knowledge bases. He explains why these capabilities are necessary, and then shows that they aren't possible in a KR system where prototype information can be overridden, i.e., where nodes are treated as prototypes containing default information. [Among other points, Brachman shows that a frame/semantic net/ inheritance network/nonmonotonic representation seems to have the following limitations: it cannot determine automatically where in the network to place an ELEPHANT-WITH-THREE-LEGS (or similar composite) node; it cannot infer that this is a subclass of elephants, or indeed that it has anything to do with elephants; it cannot infer that instances have three legs; and it cannot recognize a three-legged elephant as an instance of this concept. My 5-year-old also enjoyed the riddles about "What's big and gray, has a trunk, and lives in the trees?" (Valid answers in Ron's strawman representation systems are "elephants", "giraffes", and "ideas".) -- KIL] ------------------------------ Date: Wed 28 Aug 85 17:10:02-PDT From: Emma Pease Subject: New Reports [Excerpted from the CSLI Newsletter by Laws@SRI-AI.] NEW CSLI REPORTS Report No. CSLI-85-29, ``Equations, Schemata and Situations: A framework for linguistic semantics'' by Jens Erik Fenstad, Per-Kristian Halvorsen, Tore Langholm, and Johan van Benthem, and Report No. CSLI-85-30, ``Institutions: Abstract Model Theory for Computer Science'' by J. A. Goguen and R. M. Burstall, have just been published. These reports may be obtained by writing to David Brown, CSLI, Ventura Hall, Stanford, CA 94305 or Brown@SU-CSLI. ------------------------------ Date: Thu, 29 Aug 85 15:49 EST From: Clarke Thacher Subject: Expert Systems In Psychiatry (Responses) I would like to thank all of the people who responded to my recent request. The following is a summary of the responses which I have received (so far). I have passed this information to Dr. David Atcher in our Med. School, and he may be following up on some of these leads. _______ > Date: 26 August 1985, 14:45:02 GMT > From: Thomas Rothenfluh K715311 at CZHRZU1A > > I've read your request in the AIList and like to submit you two hints. > > In the last AI Magazine there was an article about AI research at > the University of Michigan where some research is done in the field > of expert systems in psychiatry. Upon request, I received a manuscript > with a short overview about current systems, own work and bibliography: > Micheal Feinberg & Robert K. Lindsay > "Expert systems in psychiatry" > (Mental Health Institute, Dept. of Psychiatry, Univ. of Michigan, > Ann Arbor, MI, 48109-0010) > > Another research group around Janet L. Kolodner at the Georgia Institute > of Technology (School of Information and Computer Science, Georgia > 30332) is also working on a psychiatric expert system, e.g. see: > Kolodner, J.L.: Towards an understanding of the role of experience > in the evolution from novice to expert. In: M.J. Coombs. (Ed). > Developments in expert systems. London: Academic, 1984. > > There are a lot of references in the field of computer-assisted > diagnosis in psychiatry, however there a only few concerning > expert systems in a sense that deserves that term. > > As I'm working on a dissertation project related to this field > (a computer model for the diagnostic process of experts in diagnosing > borderline personality disorders), I would be happy if you could send > me a collection of other people's answers. > > Sincerely yours, > > Thomas E. Rothenfluh, research assistant > Konfliktforschungsstelle > University of Zurich > Zurichbergstrasse 43 > CH-8044 Zurich > Switzerland (K715311 at CZHRZU1A.BITNET) _______ > Date: Mon 26 Aug 85 17:12:45-EDT > From: David.Servan-Schreiber@CMU-CS-C.ARPA > > I have developed with a collegue an expert system for the > pharmacological treatment of depressive disorders called Blue-Box. You > can find a description of our work in "Computers in Biomedical > Research", Feb 84 issue. and also in the KSL series published by > Stanford University (public domain reports). > > David _______ > Date: Tue 27 Aug 85 18:19:24-PDT > From: Christopher Schmidt > > I don't know much about his work, but Sam Holtzman > (Holtzman@sumex-aim.arpa) has an expert system which helps infertile > couples decide what their next move should be. You could ask him for > other references at least. > --Christopher _______ > Date: Wed, 28 Aug 85 10:14:03 pdt > From: broder@isi-vaxa (Ben Broder) > > I would be interested in any leads you turn up on Psychiatric > Expert Systems. I'm sorry that I don't have any information to give > you. > > Ben Broder _______ > Date: Thu 29 Aug 85 11:15:27-PDT > From: Michael Walker > > You asked on the AIList for pointers to expert systems in > psychiatry. One developed here at Stanford by Benoit Mulsant and David > Servan-Schreiber was written up in Computers and Biomedical Research, > as I recall in 1984 or late 1983. > > Mike Walker ------------------------------ End of AIList Digest ******************** From csvpi@vpics1 Wed Sep 4 08:36:59 1985 Date: Wed, 4 Sep 85 08:36:52 edt From: csvpi@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by csnet-relay.arpa id a022810; 3 Sep 85 13:17 EDT Date: Tue 3 Sep 1985 09:26-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #117 To: AIList@SRI-AI Received: from rand-relay by vpi; Wed, 4 Sep 85 08:25 EST AIList Digest Tuesday, 3 Sep 1985 Volume 3 : Issue 117 Today's Topics: Seminars - Force Dynamics (UCB) & Term Rewriting Systems (SMU) & PARLOG (CMU) & Temporal Logic (UT) & Speech Recognition (BBN) & NL Processing (BBN), Conference - Intelligent Simulation Environments ---------------------------------------------------------------------- Date: Thu, 29 Aug 85 14:12:49 PDT From: chertok%ucbcogsci@Berkeley (Paula Chertok) Subject: Seminar - Force Dynamics (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Fall 1985 Cognitive Science Seminar -- IDS 237A TIME: Tuesday, September 3, 11:00 - 12:30 PLACE: 240 Bechtel Engineering Center (followed by) DISCUSSION: 12:30 - 1:00 in 200 Building T-4 SPEAKER: Leonard Talmy, UCB TITLE: ``Force Dynamics in Language and Thought'' A semantic category that has previously been neglected in linguistic research is that of ``force dynamics''--how enti- ties interact with respect to force. Included here is the exertion of force, resistance to such a force, the overcoming of such a resistance, blockage of the expression of force, removal of such blockage, and the like. Though scarcely recognized before, force dynamics figures significantly in language structure. It is, first of all, a generalization over the traditional notion of ``causative'': it places naturally within a single framework not only `caus- ing', but also `letting,' as well as a set of notions not nor- mally considered in the same context. Force dynamics, furthermore, plays a structuring role across a range of language levels. First, it has direct gram- matical representation. In English, such representation appears not only in subsets of conjunctions, prepositions, and other closed-class elements but, most significantly, also as the semantic category that the modal system as a whole is dedicated to expressing. Force dynamic patterns are also incorporated in open-class lexical items, and bring numbers of these together into systematic relationships. Lexical items involved in this way refer not only to physical force interac- tions but, by metaphoric extension, also to psychological and social interactions, conceived in terms of psycho-social ``pressures.'' In addition, force dynamic principles can be seen to operate in discourse that is involved with persuasion. Such rhetorical interchange (including efforts to exhort, con- vince, or logically demonstrate) involves the deployment of points to argue for and against conflicting positions. Force dynamics is a major conceptual organizing system, constituting one of four major ``imaging'' systems that I have developed which provide an integrated semantic schematization of a referent scene. Cognitively, it corresponds to concepts within ``naive physics'' as well as to ones in ``naive (social) psychology,'' and can be contrasted with modern scientific concepts in these domains. ------------------------------ Date: 30 Aug 1985 07:42-EST From: leff%smu.csnet@csnet-relay.arpa Subject: Seminars - Rewrite Rules (SMU) Dr. Franz Winkler Department of Computer and Information Science University of Delaware Improvements of the Completion Algorithm for Bases of Polynomial Ideals and Rewrite Rule Systems Time: 1:00 - 2:00 PM Wednesday, September 4, 1985 Place: 315 Science Information Center, SMU, Dallas, Texas The Knuth-Bendix completion procedure for rewrite rule systems is one of wide applicability in symbolic and algebraic computation. Attempts to reduce the complexity of this completion algorithm are reported in the literature. Already in their seminal 1967 paper Knuth and Bendix have suggested to keep all the rules intereduced during the execution of the algorithm. Huet has presented a version of the completion algorithm in which every rewrite rule is kept in reduced form with respect to all the other rules of the system. Using an idea of Buchberger's for the completion of bases of polynomial ideals we have proposed in 1983 a criterion for detecting "unnecessary" critical pairs. If a critical pair is recognized as unnecesary then one need not apply the costly process of computing normal forms to it. Only recently have we given a proof that these approaches can be combined. I.e., it is is possible to keep all the rewrite rules interreduced and still use a criterion for eliminating unnecesary critical pairs. _______ Speaker: Leo Bachmair Department of Computer Science University of Illinois at Urbana-Champaign Topic: Termination of Rewrite Rule Systems Time: 3:00-4:00 P. M. Wednesday, September 4, 1985 Place: 315 Science Information Center, SMU, Dallas, Texas Applications of rewrite rule systems to programming languages, specifications of abstract data types, theorem proving, algebraic simplification, etc. often depend on the termination of the given systems and various termination methods have been developed in recent years. Termination, in general, is a nondecidable property for rewrite systems, however. We will describe several termination methods. Of particular practical importance are methods based on the use of simplification orderings. These include orderings that extend a given partial ordering on operator symbols (a precedence ordering) to terms. Examples are the recursive path ordering and the recursive decomposition ordering. Other techniques apply to rewrite systems satisfying certain syntactic restrictions like linearity. We will also describe recent results on termiantion of associative-commutative rewrite systems. ------------------------------ Date: 22 Aug 1985 1043-EDT From: Lydia Defilippo Subject: Seminar - PARLOG (CMU) Keith Clark will visit CMU on August 29. He is a reader and senior research fellow at Imperial College, London. He has been actively engaged in logic programming research since 1975. Speaker: Keith Clark Imperial College, London Date: Thursday, August 29 Time: 3:30 pm Place: 8220 Topic: PARLOG: Parallel Programming in Logic PARLOG is a Horn clause logic programming language designed for efficient parallel implementation, including both and- parallel and or-parallel evaluation mechanisms. The talk will include a summary of the history of parallel logic programming. Then the features of PARLOG will be presented by means of examples; and some aspects of the implementation outlined. ------------------------------ Date: Tue, 27 Aug 85 14:06:18 cdt From: julie@ut-ratliff.UTEXAS.EDU (Julie Barrow) Subject: Seminar - Temporal Logic (UT) University of Texas Computer Sciences Department COLLOQUIUM SPEAKER: Amir Pnueli Weizmann Institute TITLE: Temporal Logic - Global vs. Compositional DATE: Thursday, August 29, 1985 PLACE: PAI 3.14 TIME: 4-5 p.m. We present the general framework of Temporal Logic as a formalism for specifications, verification and develpment of reactive systems. Recent enhance- ments required by a compositional approach will be dis- cussed. ------------------------------ Date: 20 Aug 1985 16:08-EDT From: AHAAS at BBNG.ARPA Subject: Seminars - Speech Recognition and NL Processing (BBN) [Forwarded from the MIT bboard by SASW@MIT-MC.] There will be an AI seminar on Monday August 26 at 10:30 in the second floor conference room at 10 Moulton St. Jean-Francois Cloarec and Michel Gilloux of Centre Nationale d'etudes des Telecommunications (CNET), Lannion, France will speak. Their abstract: SERAC : An Expert System for Acoustic-Phonetic Speech Recognition We present a knowledge based approach to speech recognition at the phonetic level. SERAC is a production system generating phonetic hypotheses for continuously spoken french sentences. We give the motivations for using such an approach and we describe the knowledge representation language. Then we present the knowledge base and report some preliminary results. There will be another talk by Karen Sparck Jones the next morning, August 27th, at 10:00 in the 2nd floor conference room. Her abstract: Natural Language Processing Research at the Computer Laboratory, University of Cambridge The talk will outline recent and current work at the Laboratory. This includes both research with a semantic stimulus and research driven by parsing issues. The semantic work is concerned with interpretation problems like reference resolution, and with techniques for representation and inference involving general as well as domain knowledge, in the context of such tasks as database query and construction, paraphrase, and indexing. The parsing work includes projects on grammar construction, morphological analysis, and the use of a large machine-readable dictionary, and research on finite state techniques for compositional interpretation and on robust phrase-based parsing strategies. ------------------------------ Date: 30 Aug 1985 07:37-EST From: leff%smu.csnet@csnet-relay.arpa Subject: Conference - Intelligent Simulation Environments 1986 SCS MultiConference January 23-25 1985 Bahia Hotel San Diego, California Intelligent Simulation Environments An expert system for simulation model selection Delphi-based distributed expert decision making Expert systems and user decisionf in simulation studies Artificial Intelligence and Rapid Prototyping Professional Development Seminar An Introduction to Prolog Instructor: Dr. Heimo H. Adeslsberger For more info write to: SCS, P. O. Box 17900 San Diego, CA 92117 (619) 277-3888 ------------------------------ End of AIList Digest ******************** From LAWS@KL.SRI.COM Fri Dec 18 03:46:28 1987 Mail-From: LAWS created at 5-Sep-85 11:22:08 Date: Thu 5 Sep 1985 11:12-PDT From: AIList Moderator Kenneth Laws Reply-To: AIList@SRI-AI Us-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #118 To: AIList@SRI-AI Resent-Date: Fri 18 Dec 87 00:08:29-PST Resent-From: Ken Laws Resent-To: isr@vtopus.CS.VT.EDU Resent-Message-Id: <12359392093.20.LAWS@KL.SRI.COM> Status: R AIList Digest Thursday, 5 Sep 1985 Volume 3 : Issue 118 Today's Topics: Query - CUSP/MANDALA, AI Tools - OPS5 in Interlisp & Prolog and Lisp, Expert Systems - FDA Approval for Expert Systems, Humor - Re: Good News and Bad News, Games - Chess Openings & Computers Cheat at Chess? ---------------------------------------------------------------------- Date: 4 Sep 1985 10:19-EST From: leff%smu.csnet@csnet-relay.arpa Subject: CUSP/MANDALA I found this in net.ai. I also have attached a response for him/her. Can you either get it back to him or put in AIList? (I checked the curent UUCP map and find no record of this site.) /* Written 10:38 am Aug 30, 1985 by jjd@oce-rd2.UUCP in smu:net.ai */ /* ---------- "CUSP/MANDALA" ---------- */ Can anybody tell me about CUSP, Mandala and/or other End User Languages. CUSP = Customer Programming Language Mandala = Pictoral Language Response: Electronics Week, November 19, 1984 ICOT Details Its Progress. Reports on work done on prolog machines, a new logic language called Mandala. page 20 %A Robert Haavind %T Playing to win a New Generation %J High Technology %D AUG 1985 %P 63-65 %K prolog lisp machine KL1 mandala ICOT %X describes new parallel and other novel architectures being developed in Japan including those for AI ------------------------------ Date: Tue 3 Sep 85 08:18:36-PDT From: Mark Richer Subject: OPS5 in Interlisp Someone asked about OPS5 in Interlisp; I picked up a brochure at IJCAI on a version that is for sale. SAIC (Science Applications International Corporation) First package (1 disk, object code only, and 1 user's manual) $2000 additional packages $500 each source code $5000 (interlisp) For more information, write: saic, p.o. box 2341, La Jolla, CA 92038 [attention: Linda Anderson] Mark ------------------------------ Date: Mon 26 Aug 85 00:57:43-PDT From: Andy Freeman Subject: Prolog and Lisp From: Carl E. Hewitt Prolog (like APL before it) will fail as the foundation for Artificial Intelligence because of competition with Lisp. There are commercially viable Prolog implementations written in Lisp but not conversely. From: PEREIRA@SRI-AI.ARPA 1. (the least interesting one) All the so-called commercially viable Prolog systems in Lisp are not really Prolog systems written IN Lisp, but rather Prolog systems written FOR Lisp machines. [They are microcoded and have good support for tagged data types.] Without those machine-level operations, those Prolog systems would run too slow and use too much memory to be useful for serious Prolog programming. Hewitt's message alludes to an apparent difference between Lisp and Prolog which Pereira's response ignores. The response also implies that Prolog in Lisp is inherently slow. A previous message from Pereira (Prolog Digest Volume 1, Issue 21) correctly emphasizes that speed is important. (This issue and the ones following are quite informative.) From: PEREIRA@SRI-AI.ARPA What Prolog "does" is not just to make certain deductions in a certain order, but also MAKE THEM VERY FAST. One of the differences between Lisp and Prolog is in how efficiently they support embedded languages. Special purpose languages, like special purpose hardware, are an important tool. Prolog has not demonstrated its ability to support them (apart from Logic in Prolog, of course), Lisp has. One example of this is the Prolog interpreter Foolog by Martin Nilsson* in that Prolog Digest issue. Written in 2 pages of Maclisp, it runs about 75% as fast as interpreted DEC-10 Prolog; a later version was supposed to be marginally faster. Naturally, Foolog doesn't include a debugger and other system functions or all of the user utilities in the Prolog library (but they're written in Prolog...), but it does support cut, call, bagof, arithmetic, and I/O. A simple compiler apparently was written later that generated code 25% as fast as compiled DEC-10 Prolog. After that message, I lost track of Foolog. Nilsson described it as a "toy"; I doubt much came of it. Obviously the first 50% is the easiest and one shouldn't ignore the environment. (Both Prolog and Lisp encourage powerful environments. At that time, DEC-10 Prolog was fairly mature.) When Prolog is the appropriate language, then one should use the best Prolog available. When you need a special language however, Lisp is hard to beat. If logic is by far the most important language for AI, Lisp may be in trouble. If it isn't, pure Prolog environments are in trouble. -andy ps - The speed advantage of special Lisp hardware is shrinking. I assume that the same is true for Prolog. * Nilsson was one of the developers of LM-Prolog. ------------------------------ Date: Tuesday, 3 Sep 1985 11:40:22-PDT From: billingslea%lite.DEC@decwrl.ARPA (Mark Billingslea `Lock and Load!') Subject: FDA Approval for Expert Systems This mail was sent to me, from Germany. Thought I would pass it on to you for review. -Mark From: GYPSC2::ROLLER "Christian E. Roller - PSC Muenchen - RTO" 1-SEP-1985 02:51 To: COORS::BILLINGSLEA Subj: Some news for AI digest <><><><><><><><> T h e V O G O N N e w s S e r v i c e <><><><><><><><> Edition : 897 Friday 30-Aug-1985 Circulation : 365 Send subscription requests, backissue requests and letters to MAGIC::VNS [TAYLOR ] [Nashua, NH, USA] Some AI systems may need FDA approval Expert systems come within the FDA ambit to the extent that they supplement doctor's work, according to Richard Beutal, a Washington D.C. attorney specializing in the legal aspects of technology. An expert system may be defined as a computer program that embodies the expertise of one or more human experts in some domain and applies this knowledge to provide inferences and guidance to a user. some of the earliest and most sophisticated systems were developed for medical diagnosis: MCYIN, EMCYIN, CADUCEUS AND ATTENDING. [There are several more in use in Japan. --mjt] Beutal called attention to proposed FDA regulations that, if implemented, would require medical expert systems to obtain FDA pre-marketing approval. Given that FDA approval for what are class 3 devices could take up to 10 years and that reclassifying such devices can take almost as long, these FDA regulations would virtually cause investment to dry up. {Government Computer News Aug 16, 1985} [...] ------------------------------ Date: Mon, 26 Aug 85 10:50:13 EDT From: Cymru am Byth! Subject: Re: Good news and bad news, Mr. Wizard... From: straz@AQUINAS.THINK.COM@MIT-CCC, Steve Strassmann But the study also showed that TV scientists are killed more often than soldiers, private eyes, and police officers." WOW! Just how often is a TV scientist likely to be killed? Not more than once, I hope! PJB "So you think being drunk feels good -- tell that to a glass of water!" ------------------------------ Date: Mon, 26 Aug 85 8:15:37 EDT From: Bruce Nevin Subject: chess openings It is not clear whether a human expert studying the Caro-Kann defense for five weeks memorizes 50,000 openings or generalizes in ways that are difficult in conscious, verbal terms to articulate. Indeed, isn't there evidence that even human memorizing entails kinds of generalization that are not present in simple storage of a table for later lookup? Seems to me this points to the kernel issue of machine learning, and a hard nut at that! [For recent progress in chess subpattern learning see Albrecht Heeffer's "Validating Concepts from Automated Acquisition Systems", IJCAI-85, pp. 613-615. -- KIL] ------------------------------ Date: Wed, 28 Aug 85 09:33:14 pdt From: Tom Dietterich Subject: Computers Cheat at Chess? I enjoyed Stuart Cracraft's notes concerning the use of tree searching in chess programs. Amidst all of the hype about "shallow" versus "deep" expert systems, it is interesting to note that most computer chess systems should be classified as "deep". Once they get past the opening moves, they play every game from "first principles"! --Tom ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Thu Sep 12 22:05:53 1985 Date: Thu, 12 Sep 85 22:05:49 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by csnet-relay.arpa id a017028; 6 Sep 85 15:05 EDT Date: Fri 6 Sep 1985 10:41-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #119 To: AIList@SRI-AI Received: from rand-relay by vpi; Thu, 12 Sep 85 21:44 EST AIList Digest Friday, 6 Sep 1985 Volume 3 : Issue 119 Today's Topics: Seminars - Flavor-Based Knowledge Representation (CSLI) & Misconceptions about Basketball Statistics (UCB) & Haptic Object Recognition (UPenn) & Scalar Implicature (UPenn) & NL Menu Interfaces to Databases (SMU), Conference - Army AI and Robotics ---------------------------------------------------------------------- Date: Wed 4 Sep 85 17:17:57-PDT From: Emma Pease Subject: Seminar - Flavor-Based Knowledge Representation (CSLI) [Excerpted from the CSLI Newsletter by Laws@SRI-AI.] ``FORK: A Flavor-Based Environment for Object-oriented Knowledge Representation'' C. Beckstein, G. Goerz, University Erlangen-Nuernberg, West Germany 2:15, Thursday, September 5, Ventura Seminar Room Most object-oriented extensions of LISP provide only marginal support for the purpose of knowledge representation. In particular, there are only poor means---if any---for specifying meta-information about attributes of objects such as typed domains, methods for determining values (demons), multiple-valued attributes and explicit control of inheritance. Furthermore, they usually don't offer adequate utilities for handling multiple perspectives, retrieving objects through patterns of characteristic features, and maintaining structural relations (integrity constraints) in and between objects. FORK is an attempt to extend Flavors, an object-oriented extension of LISP, by adding features which are well known from frame-like systems with the advantage of keeping a systematic distinction between classes and instances. The procedural knowledge is attached to classes either in the usual sense of methods as functions or in the form of (forward chaining) rule sets. In addition, FORK offers a programming environment to support users in the construction and maintenance of large, hybrid knowledge bases. ------------------------------ Date: Wed, 4 Sep 85 13:43:19 PDT From: chertok%ucbcogsci@Berkeley (Paula Chertok) Subject: Seminar - Misconceptions about Basketball Statistics (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Fall 1985 Cognitive Science Seminar -- IDS 237A TIME: Tuesday, September 10, 11:00 - 12:30 PLACE: 240 Bechtel Engineering Center (followed by) DISCUSSION: 12:30 - 1:30 in 200 Building T-4 SPEAKER: Amos Tversky, Department of Psychology, Stanford University TITLE: ``Misconception of Chance Processes in Basketball'' We investigate the origin and the validity of common beliefs regarding ``the hot hand'' and ``streak shooting'' in the game of basketball. Basketball players and fans alike tend to believe that a player's chance of hitting a shot are greater following a hit than following a miss on the previous shot. However, detailed analyses of the shooting records of the Phi- ladelphia 76ers provided no evidence for a positive correla- tion between the outcomes of successive shots. The same con- clusions emerged from free-throw records of the Boston Cel- tics, and from a controlled shooting experiment with the men and women of Cornell's varsity teams. The outcomes of previ- ous shots influenced Cornell players' predictions but not their preformance. The belief in the hot hand and the ``detection'' of streaks in random sequences is attributed to a general misconception of chance according to which even short random sequences are thought to be highly representative of their generating process. ------------------------------ Date: Thu, 5 Sep 85 20:56 EDT From: Tim Finin Subject: Seminar - Haptic Object Recognition (UPenn) HAPTIC OBJECT RECOGNITION: WHAT CAN WE LEARN FROM HUMANS FOR MACHINE PERCEPTION AND MANIPULATION. Susan Lederman, Psychology Department, Queen's University in Kingston, Canada 2pm Friday, September 6, 216 Moore School, University of Pennsylvania We shall present our investigation of haptic object recognition which concerns with what we call "knowledge based control of Human hand movements. The "knowledge based" hand movements are directed by the observer's goal. This implies an analysis of hand movements at the cognitive level rather than at a biomechanical or neutral level. Some exploratory hand movement procedures are being suggested. ------------------------------ Date: Tue, 3 Sep 85 15:04 EDT From: Tim Finin Subject: Seminar - Scalar Implicature (UPenn) DISSERTATION DEFENSE A Theory of Scalar Implicature Julia Hirschberg 10:00am Sept 4 1985 216 Moore School, University of Pennsylvania Determining what an utterance conveys, beyond its semantic import, is an important goal of natural-language processing. This thesis first proposes a definition of one type of non-logical inference, Gricean conversational implicature. Within this framework, it defines a class of conversational implicature, scalar implicature, revising and extending work by Horn (1972), Harnish (1979), and Gazdar (1979). A theory of scalar implicature is proposed based upon an analysis of naturally occurring data. A representation of the phenomenon is developed, as are algorithms for calculating licensed implicatures. An application to computer-human question-answering is discussed, as are other potential uses in natural-language generation and understanding. ------------------------------ Date: 5 Sep 1985 11:14-EST From: leff%smu.csnet@csnet-relay.arpa Subject: Seminar - NL Menu Interfaces to Databases (SMU) Speaker: Dr. Craig W. Thompson, Texas Instruments, Inc. Topic: Menu-Based Natural Language Interfaces to Databases Time: 3:00-4:00 p. m., Wednesday, September 11, 1985 Place: 315 SIC SMU, Southern Methodist University, Dallas, Texas Menu-based natural language as implemented in the NLMenu system, provides useful near-term solutions to a number of problems that affect conventional natural language interfaces to databases. This talk overviews our research on menu-based natural language, describing 1) the basic NLMenu approach 2) advantages of the approach including ease-of-use for end users and low cost for interface designers 3) applications of the approach for database updates, request for business graphs and map displays, and mixed dbms and keyword based informaiton retrieval queries. The talk ends with research directions related to this new approach. ------------------------------ Date: Thu, 5 Sep 85 11:46:41 EDT From: MAJ Kenneth Rose (Ft. Benj. Harrison) Subject: Conference - AI and Robotics The U.S. Army Training and Doctrine Command is sponsoring an artificial intelligence and robotics symposium in conjunction with the American Defense Preparedness Association on November 6th-7th in Austin, Texas. The pupose is to afford members of industry and the acedemic research community an opportunity to respond to Army areas of technical interest as described in the call for papers. A more specific description of Army interests is in preparation for distribution at the symposium. The agenda for the symposium follows. For more information, contact Colonel Bruce Holt at-- American Defense Preparedness Association Rosslyn Center, Suite 900 1700 North Moore Street Arlington, VA 22209 ***************************************************************** ARTIFICIAL INTELLIGENCE AND ROBOTICS SYMPOSIUM 6-7 November 1985, Austin, Texas AGENDA Tuesday, 5 November 1800- REGISTRATION, Wyndam Hotel, Austin, Texas. 2000 2030 PRE-SYMPOSIUM MEETING FOR SPEAKERS, Wyndam Hotel. Room location to be announced. Wednesday, 6 November 0700 REGISTRATION, Wyndam Hotel. OPENING SESSION 0800 INTRODUCTORY REMARKS, Major Kenneth H. Rose, Chief of Artificial Intelligence and Robotics, US Army Soldier Support Center, Sessions Chairman. 0805 PURPOSE OF CONFERENCE, Major General Maurice O. Edmonds, Commander, US Army Soldier Support Center, Conference Chairman. 0815 KEYNOTE ADDRESS, Lieutenant General Robert L. Moore, Deputy Commanding General for Research, Development, and Acquisition, US Army Materiel Command. 0925 US ARMY ROBOTICS DEVELOPMENT DIRECTIONS, Mr. Richard Vitali, Deputy Chief of Staff for Technology Planning and Management, Headquarters, US Army Materiel Command. SESSION I - ROBOTICS 0950 Mobile Robots for Surveillance, Reconnaissance, and Manipulative Missions: A Survey of Current Systems. Mr. Harvey B. Mieieran, H. B. Meieran Associates. 1015 Technology Development in Intelligent Machine Systems. Mr. Thomas G. Bartholot, Odetics, Inc. 1105 Loading, Assembling, and Packaging of Ammunition: Applying Flexible Automation in the Future to Solve the Problems of the Past. Mr. Vernon L. Mangold, KOHOL, Inc. 1130 Control of a Multi-Robot Processing Line Using Artificial Intelligence. Mr. James M. McNair, GA Technologies. 1300 ROMAC Muscle Powered Mobile Robots. Mr. Guy Immega, MacDonald Dettwiler and Associates, Ltd., (Canada) and Mr. Harvey B. Meieran, HB Meieran Associates. SESSION II - AUTONOMOUS VEHICLES 1325 Abstractions to Represent the Plan of an Autonomous Land Vehicle. Dr. Theodore A. Linden, Advanced Information & Decision Systems. 1350 A Planning System for Autonomous Land Vehicles: An Overview of the Hughes System. Dr. David Y. Tseng, Hughes Aircraft Company. 1415 A Land Vehicle Navigation System Supported by a Digital Map Data Base. Mr. Walter B. Zavoli, Etak, Inc. 1500 Obstacle Avoidance Simulation for Autonomous Land Vehicles. Dr. Theodore A. Linden, Advanced Information & Decision Systems. 1525 An Incremental Path Toward Autonomous Vehicles. Mr. Jack Harper, Robot Defense Systems, Inc. 1550 Robot Combat Vehicles: Synchronizing Technology and Applications. Mr. R. G. Diaz, General Dynamics Land Systems Division. 1615 Remote Control Weapons Platforms. Mr. C. Ron Clouser, Robot Defense Systems, Inc. 1640 Robotic Ranger: Recent Testbed Results/Path to Autonomy. Mr. Jerome Kirsch, Grumman Corporation. (PROPRIETARY INFORMATION: US GOVERNMENT PERSONNEL ONLY) 1800- RECEPTION BUFFET, Wyndam Hotel. 2000 Thursday, 7 November 0800 Design of a Lightweight, Full Mobility Vehicle. Mr. David D. Wright, Unique Mobility, Inc. SESSION III - KNOWLEDGE-BASED SYSTEMS 0825 Expert System for Logistics Analysis. Mr. William O. Hedgepeth, US Army Logistics Center. 0850 Relevant Help, User Modeling, and Reasoning Under Uncertainty. Dr. Joseph Dempsey, RCA. 0915 A Software Architecture for Realtime, Embedded Expert Systems. Dr. Kenneth R. Whitebread, Honeywell, Inc. 1000 Stochastic Resources Allocation for Command and Control. Dr. Marc D. Diamond, FMC Corporation and Ms. Olivia M. Carducci, Carnegie-Mellon University. 1025 Knowledge Integrity Maintenance: Quality Assurance in Knowledge System Development. Dr. E. Webb Stacey, Jr., Scientific Systems, Inc. SESSION IV - COMMAND AND CONTROL 1050 Embedding AI Systems Into Command and Control Applications. Ms. Sharon Storms, Ford Aerospace and Communications Corporation. 1115 A Knowledge-based System Approach for Enhanced Crisis Action Planning. Ms. Ina Ghaznavi-Collins, GTE Government Systems. 1300 Intelligent Tactical Display. Mr. James R. Richardson, Symbolics, Inc. and Captain Bill Johnson, US Army Armor Center. SESSION V - NATURAL LANGUAGE 1325 A Natural Language Understanding System for Maneuver Control. Mr. Isaac Fajerman, US Army Communications- Electronics Command, and Dr. Abe Lockman, Horizon Information Systems. 1350 A Speech Understanding Testbed for Command and Control Dialogs. Dr. Richard Kittredge, Odyssey Research Associates and Mr. Isaac Fajerman, US Army Communications-Electronics Command. SESSION VI - TRAINING 1415 A Mark 45 Maintenance Advisor. Mr. Dick Grommes, FMC Corporation. 1440 The Design of a Generic Intelligent Trainer. Mr. Philip Underwood, Lockheed Missiles and Space Company. PAPERS TO BE PUBLISHED IN SYMPOSIUM PROCEEDINGS. Project PERICLES: The Use of Artificial Intelligence in Assisting the Provision of Legal Services. Harvard University Law School. ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Thu Sep 12 22:32:12 1985 Date: Thu, 12 Sep 85 22:32:06 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by csnet-relay.arpa id a009469; 8 Sep 85 20:04 EDT Date: Sun 8 Sep 1985 16:27-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #120 To: AIList@SRI-AI Received: from rand-relay by vpi; Thu, 12 Sep 85 22:19 EST AIList Digest Monday, 9 Sep 1985 Volume 3 : Issue 120 Today's Topics: Queries - Source Licenses for Common Lisp & Semantic Net Graphics & Krypton & Children's Story Generator, AI Tools - Prolog and Lisp, Psychology - Misperception of Probability, Public Service - Trojan Horses ---------------------------------------------------------------------- Date: Thu, 5 Sep 85 15:23 MST From: May@HIS-PHOENIX-MULTICS.ARPA Reply-to: May%pco@CISL-SERVICE-MULTICS.ARPA Subject: Source Licenses for Common Lisp We are interested in porting Common Lisp to our large system hosts and are looking for software houses who are interested in selling source licenses for Common Lisp that is written in either Pascal or, preferably, C. If you know of any, please send whatever information you can to me and I will post the responses here in the list. Thanks. Bob May May%pco @ cisl-service-multics ------------------------------ Date: Thu, 5 Sep 85 21:18:31 edt From: Brad Miller Subject: Wanted: Graphics Software for 3600 (Semantic Nets) I'm doing a semantic parser, and just for hacks, want to display the output graphically as a Semantic Net. Anyone out there hack anything similar for the Symbolics FLAVOR system? (or the TI explorer, or LMI, or any other degenerate case of MIT's LM) I'm a novice to this sort of graphics, so anything likely (say a program that displays ATNs) would be fine! I just want to get a better grasp on this stuff than the provided examples give.... Brad Miller miller@ur-seneca.rochester.arpa University of Rochester CS dept. ------------------------------ Date: 6 Sep 85 09:29:00 EDT From: "CUGINI, JOHN" Subject: Krypton In the October 1983 issue of IEEE's Computer, there was an article called "Krypton: A Functional Approach to Knowledge Representation" by Ronald Brachman, Richard Fikes, and Hector Levesque. It described work in progress. Does anyone out there know what became of this effort? Any follow-up articles, etc?? John Cugini Institute for Computer Sciences and Technology National Bureau of Standards Bldg 225 Room A-265 Gaithersburg, MD 20899 phone: (301) 921-2431 ------------------------------ Date: 7 Sep 85 21:04:13 EDT From: Steve.Hoffmann@CMU-CS-K Subject: Children's story generator [Forwarded from the CMU bboard by Laws@SRI-AI.] Can anyone give me a reference to a story-generation program, I believe from Schank's group at Yale, which tells stories about such characters as Joe Bear and Irving Bird? Also, any pointers to other story generation would be appreciated. Thank you. ------------------------------ Date: Fri, 6 Sep 1985 08:14 EDT From: Hewitt@MIT-MC.ARPA Subject: Prolog and Lisp I would like to respond to the message from Andy Freeman who sent the following: From: Carl E. Hewitt Prolog (like APL before it) will fail as the foundation for Artificial Intelligence because of competition with Lisp. There are commercially viable Prolog implementations written in Lisp but not conversely. [...] I believe that the Prolog implementations on Common Lisp will be just as efficient as the stand-alone Prolog implementations. However, it is not possible to make a commercially viable Common Lisp implementation on Prolog. This means that any good software written for a stand-alone Prolog system will soon appear on the Lisp Systems but NOT vice versa. Therefore the stand alone Prolog systems will always have impoverished software libraries by comparison with the Common Lisp systems and will not be commercially viable in the long run. ------------------------------ Date: Wed 4 Sep 85 21:17:20-PDT From: Donald Henager Subject: Misperception of Probability [Forwarded from the Stanford bboard by Laws@SRI-AI.] The October issue of Science 85 has an interesting article on people's mistaken view of probability. It starts with the results of an experiment in which people were drilled about the advantages of seat belts, then agreed that seat belts were great, and then drove away without their seat belts fastened. It goes on to say: "If you think the apparent irrationality of Slovic's subjects frustrated him, imagine how people in the nuclear power business must feel. [This is] the same general public whose concern for the safety of nuclear reactors -- which have claimed a total of three lives in accidents in the last 30 years -- brought the industry to a virtual standstill. It's the same general public that smokes billions of cigarettes a year while banning an artificial sweetner because of a one-in-a-million chance that it might cause cancer; the same public that eats meals full of fat, flocks to cities prone to earthquakes, and goes hang gliding while it frets about pesticides in food, avoidsthe ocean for fear of sharks, and breaks into a cold sweat on airline flights. "In short, we the general public are irrational, uninformed, super- stitious, even stupid. We don't understand probability, are biased by the news media, and have a fear of some technologies that borders on the primeval." It's an interesting article about how people think about probability and in particular points out some catchy statistics about what is and isn't dangerous to your life span. If you can get a copy, read it. Don [Although I have retitled this message "Misperception of Probability", articles by Amos Tversky (and cited by Paul Cohen) have stressed that people seem to base judgements on prototype similarity rather than on probability, even when the "priors" needed for probabilistic reasoning are presented as the major component of a problem specification. Given that people >>want<< to reason in this manner, the misperception involved may be that of the scientific community in assuming that people are trying to reason probabilistically and that they are getting it wrong. There may be valid epistemological reasons (as well as computational ones) for prototype-based pattern recognition and reasoning. -- KIL] ------------------------------ Date: 05 Sep 85 14:37:38 EDT (Thu) From: Marshall D. Abrams Subject: WARNING !! [A Trojan Horse Bites Man] [Forwarded from the Stanford bboard by Laws@SRI-AI.] [Forwarded from the Info-Atari bboard by MRC@SIMTEL20.] [Forwarded to the Info-Atari bboard by Malpass@LL-SST.] Today's Wall St. Journal contained the following article. I think it is of enough potential significance that I'll enter the whole thing. In addition to the conclusions it states, it implies something about good backup procedure discipline. In the hope this may save someone, Don Malpass ****************************************** (8/15/85 Wall St. Journal) ARF! ARF! Richard Streeter's bytes got bitten by an "Arf Arf," which isn't a dog but a horse. Mr. Streeter, director of development in the engineering department of CBS Inc. and home-computer buff, was browsing recently through the offerings of Family Ledger, a computer bulletin board that can be used by anybody with a computer and a telephone to swap advice, games or programs - or to make mischief. Mr. Streeter loaded into his computer a program that was billed as enhancing his IBM program's graphics; instead it instantly wiped out the 900 accounting, word processing and game programs he had stored in his computer over the years. All that was left was a taunt glowing back at him from the screen: "Arf! Arf! Got You!" "HACKERS" STRIKE AGAIN [...] Several variations of the "Arf! Arf!" program have made the rounds, including one that poses as a "super-directory" that conveniently places computer files in alphabetical order. [...] Al Stone, the computer consultant who runs Long Island based Family Ledger, [says] "Don't attempt to run something unless you know its pedigree," he says. That's good advice, because the computer pranksters are getting more clever - and nastier. They are now creating even-more-insidious programs that gradually eat away existing files as they are used. Appropriately enough, these new programs are known as "worms". ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Thu Sep 12 23:05:47 1985 Date: Thu, 12 Sep 85 23:05:37 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by csnet-relay.arpa id aa00879; 11 Sep 85 1:28 EDT Date: Tue 10 Sep 1985 15:58-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #121 To: AIList@SRI-AI Received: from rand-relay by vpi; Thu, 12 Sep 85 22:26 EST AIList Digest Wednesday, 11 Sep 1985 Volume 3 : Issue 121 Today's Topics: Seminars - Equational Logic as a Programming Language (UPenn) & Constructive Lexicon-Grammar (BBN) & Corporate Distribution Management (CMU) & Belief, Awareness, and Limited Reasoning (SU), Conferences - Factory Automation and Robotics & Aerospace Applications of AI ---------------------------------------------------------------------- Date: Fri, 6 Sep 85 14:10 EDT From: Tim Finin Subject: Seminar - Equational Logic as a Programming Language (UPenn) EQUATIONAL LOGIC AS A PROGRAMMING LANGUAGE Michael J. O'Donnell, The University of Chicago 3pm September 19th, 216 Moore School, University of Pennsylvania In logic programming languages, programs are logical assertions with no explicit procedural information, and execution consists of the efficient derivation of certain logical consequences of a program. Prolog, and relational database query languages are both logic programming languages based on the predicate calculus. The advantages of logic programming are clarity of programs, simplicity of semantics, and the potential for parallel execution without timing dependence. In this talk, I describe a programming language based on the logic of equations. A prototype implementation exists, and has been used in a number of experiments. The talk will focus on examples illustrating the advantages of equational programming, and the differences between equational programming and Prolog programming. ------------------------------ Date: 4 Sep 1985 17:37-EDT From: AHAAS at BBNG.ARPA Subject: Seminar - Constructive Lexicon-Grammar (BBN) [Forwarded from the MIT bboard by SASW@MIT-MC.] The next BBN Artificial Intelligence seminar will be held in the 3rd floor large conference room at 10 Moulton Street, 10:30 on Friday September 13. Bruce Nevins of BBN wil speak on "Constructive Lexicon-Grammar". His abstract: Maurice Gross's group in Paris found that, after they had specified French verbs by their syntactic properties, there was no need for lexical features to make further semantic distinctions between them. Because of this perhaps surprising result, they have been able to develop a highly specific lexical representation, using classifier words in sentence forms rather than abstract features. Their lexicon-grammar replaces most context-free parsing with simple lookup in 3-dimensional tables of syntactic properties of words. Constructive grammar, as exemplified by Harris's _A_Grammar_of _English_on_Mathematical_Principles_ (Wiley, 1984), uses only the constructive `has-a' relations of dependency and adjunction, limiting the taxonomic `is-a' relation to classifier hierarchies of words in the lexicon. A given input morpheme can only be one of a few kinds of things: an operator with specified argument requirement, a primitive argument (roughly, a concrete noun), an argument-indicator like -ing, the operator-indicator -s, or a product of certain precisely specifiable reductions of strings to more compact, and more conventional, form. Because each morpheme has at most only a very few possible syntactic roles--frequently, just one--computer analysis of text has much less structural ambiguity to cope with than in other approaches. In this talk, I will show how these two approaches to natural language processing may be combined in a system for construing (as opposed to parsing) natural language input that should be readily adaptable to text generation as well. I will sketch extensions similar to Naomi Sager's system for automatically incorporating new text information into subject-matter specific data bases. ------------------------------ Date: 9 Sep 85 11:09:38 EDT From: Jeanne.Bennardo@CMU-RI-ISL1 Subject: Seminar - Corporate Distribution Management (CMU) Topic: Presentation of Inet Project Speakers: Ramana Reddy and Nizwer Husain Place: DH3313 Date: Wednesday, September 11 Time: 11:30am - 12:30pm The Inet project is an application of Knowledge Based Simulation(KBS) techniques to the domain of corporate distribution management. Corporate distribution management provides a rich environment for studying new techniques developed in KBS. Consider a typical manufacturing organization which manufactures a number of products and whose components are manufactured in a number of widely separated locations. These components are warehoused and merged at different locations and distributed to reseller locations. In such a system there are numerous decisions that have to be made about the transportation, warehousing, manufacturing and order administration policies. The purpose of I-NET is to provide a simulation model which can be understood, modified and used by managers directly without the assistance of a programmer. These facilities should provide the manager with an indepth understanding of the distribution network and aid in decision making. ------------------------------ Date: Mon 9 Sep 85 10:45:56-PDT From: Anne Richardson Subject: Seminar - Belief, Awareness, and Limited Reasoning (SU) DAY October 1, 1985 EVENT Computer Science Colloquium PLACE Skilling Auditorium TIME 4:15 TITLE Belief, Awareness, and Limited Reasoning PERSON Dr. Joe Halpern FROM IBM Corporation BELIEF, AWARENESS, AND LIMITED REASONING Classical possible-worlds models for knowledge and belief suffer from the problem of logical omniscience: agents know all tautologies and their knowledge is closed under logical consequence. This unfortunately is not a very accurate account of how people operate! We review possible-worlds semantics, and then go on to introduce three approaches towards solving the problem of logical omniscience. In particular, in our logics, the set of beliefs of an agent does not necessarily contain all valid formulas. One of our logics deals explicitly with awareness, where, roughly speaking, it is necessary to be aware of a concept before one can have beliefs about it, while another gives a model of local reasoning, where an agent is viewed as a society of minds, each with its own cluster of beliefs, which may contradict each other. The talk will be completely self-contained. ------------------------------ Date: 27 Aug 85 10:33 EDT From: (Herb Bernstein) Subject: Symposium on Fact. Aut. & Robotics [Forwarded from the MIT bboard by SASW@MIT-MC.] Reminder: The Symposium on Factory Automation and Robotics A Forum for Industrial and Academic Robotics Engineers and Scientists will be held 9-11 September 1985 by the Courant Institute of Mathematical Sciences, NYU in honor of Marvin Denicoff sponsored by the National Science Foundation Registration $35 ($25 for NYU faculty and staff), in advance to NYU/CIMS Symposium on Fac. Aut. and Robotics Courant Institute of Mathematical Sciences 251 Mercer Street, New York, N.Y. 10012 Attn: Herbert J. Bernstein Or at the meeting, Eisner and Lubin Auditorium, Loeb Student Center, 566 LaGuardia Place (corner of LaGuardia Place and Wash. Sq. South). For more information or to RSVP, mail to yaya@nyu (on ARPANET), or call 212-533-3363 or 212-460-7444. ------------------------------ Date: 6 Sep 1985 13:30-EDT From: cross Subject: Aerospace Applications of AI Conference Registration is still open for the First Annual Aerospace Applications of Artificial Intelligence, September 17-19, 1985 in Dayton Ohio. The number to call for registration information is (513) 426-8430. The conference will be held at the Dayton Convention Center and the conference hotel, Stouffer's Dayton Plaza, is adjacent. Stouffer's phone number is (513) 224-0800. The registration cost of $225.00 includes the two conference luncheons and the banquet. The program is listed below: First Annual Aerospace Applications of Artificial Intelligence Conference Program Tuesday Morning, 9:00 AM - 9:15 AM Welcome to Dayton Mayor Paul Leonard Welcome to AAAIC'85 Jack Schira, AAAIC'85 General Chairman Capt Stephen E. Cross, AAAIC'85 Program Chairman Tuesday Morning, 9:15 AM - 11:30 AM Management Session Session Moderator: Brig Gen Philippe O. Bouchard Vice Commander, Aeronautical Systems Division Speakers: Brig Gen Philippe O. Bouchard Vice Commander, Aeronautical Systems Division Dr. Woodrow Bledsoe MCC and U. of Texas at Austin Dr. Joseph Watson Vice President of the Data Systems Group, Texas Instruments Dr. Clinton Kelly III Defense Advanced Research Projects Agency Tuesday Luncheon, noon - 1:30 PM, Stouffer's Dayton Plaza Dr. Ed Taylor, TRW Tuesday Afternoon, 2:00 PM - 4:30 PM Avionics Session Session Moderator: Maj James R. Johnson, AFWAL Keynote Speaker: Dr. Tom Garvey, SRI International, AI Center "Keeping the Pilot in Command: AI and Avionics" Speakers: Dick Feldman and Hal Cambell, Systran "Expert System Pilot Aid - an Update" Dr. Bruce Anderson, Christa McNulty, and Garr S. Lystad "Expert Systems for Aiding Combat Pilots" Dr. Michael R. Fehling, Teknowledge Inc. "Research Issues for Knowledge Based Planning" Programming Languages Session Moderator: Dr. Gary Lamont, AFIT Keynote Speaker: Dr. Kenneth Kahn, Xerox PARC "The Integration of Multiple Paradigms for AI Programming" Speakers: Charles T. Kitsmiller, J. Boose, T. Jardine Boeing Computer Services "Coupling Symbolic and Numerical Computing in Expert Systems" Bruce Reed Jr., Goodyear Aerospace "An Implementation of LISP on a SIMD Parallel Processor" Dick Naedel, Intellimac "Ada and Artificial Intelligence" Mark Miller, Computer Thought "Ada and Artificial Intelligence" Wednesday Morning, 9:00 AM - 11:30 AM Manufacturing Session Moderator: Dr. Vince Russo, AFWAL Keynote Speaker: Dr. Mark Fox, Robotics Institute, Carnegie Mellon Univ. "Artificial Intelligence in Manufacturing" Speakers: Dr. Petros Papus, Westinghouse Electric Corp. "ISIS Project in Review" Robert Joy, Northrup Corp. "Lisp Machine Based Generative Process Planning and Object Oriented Simulation" Capt Thomas Triscari, AFIT, and Dr. William M Henghold, Universal Technology Institute "Research Needs for AI in Manufacturing" Man-Machine Interfaces Session Moderator: Dr. Tom Furness, AAMRL Keynote Speaker: Dr. William Rouse, Search Technology Inc. "Human Interaction with Intelligent Systems" Speakers: D. Woods and E. Roth, Westinghouse R&D Center "Joint Person-Machine Cognitive Systems: Issues in Intelligent Decision Support" Norm Geddes, Georgia Institute of Technology "Intent Inferencing Using Scripts and Plans" Dr. Russ Hunt, Search Technology Inc. "Human Factors of Intelligent Computer-aided Display Design" Wednesday Afternoon, 2:00 PM - 4:30 PM Maintenance Session Moderator: Cpt Rob Milne, Army AI Center, Pentagon Keynote Speaker: Dr. B. Chandrasekaran, Ohio State University "Artificial Intelligence Applications to Diagnostics and Maintenance" Speakers: Mr. R. Cantone, Automated Reasoning Corp., and Dr. Don Allen, Northrup Corp. "Technical Diagnosis by Automated Reasoning" Dr. Joseph Hintz, Raytheon Co. "Expert Systems in Higher Echelon Maintenance Activities" Dr. F. Pippitone and Dr. K DeJong, Naval Research Lab "FIS: An Electronics Fault Isolation System Based on Qualitative Causal Modeling" New Architectures Session Moderator: Dr. Barry Deer, Systran Keynote Speaker: Dr. Victor Lesser, Univ. of Massachusetts at Amherst "Overview of Important Issues in Distributed Problem Solving" Speakers: Dr. Barry Deer, Hal Cambell, Jack Schira, and Dick Feldman, Systran "Architecture-Based Machine Intelligence" Cpt Richard Routh and Dr. Matthew Kabrisky, AFIT "Cortical Thought Theory: A New Computing Architecture Based on the Human Brain" Bruce Reed, Goodyear Aerospace "The ASPRO Parallel Inference Engine (A Real Time Production Rule System)" Wednesday Evening Banquet, 7:00 PM - 9:00 PM Dr. Mark Stefik, Xerox PARC Thursday Morning, 9:00 AM - 11:30 AM Decision Support Systems Session Moderator: Dr. Yan Yufik, NCR Keynote Speaker: Prof Donald Michie, The Turing Institute "The Automated Development of Decision Support Systems" Speakers: Cpt Rob Milne, Army AI Center, Pentagon "An Equipment Distribution Expert System" Dr. Thomas Sheridan, MIT, and Dr. Yufik, NCR "Hybrid Knowledge Based System for Operation Planning" Dr. Jeffrey Schwartz, Grumman-CTEC "Determining the Relevance of Cues: A New Type of Decision Support" Expert System Tools Session Moderator: Mr. David Dietz, System Research Laboratories Inc. Keynote Speaker: Dr. Earl Sacerdoti, Teknowledge Inc. "Overview of Expert System Building Tools" Speakers: Dr. William Faught, IntelliCorp "Aerospace Application and the Use of KEE" Linda Brainard, System Research Laboratories Inc. "Developing Portable Expert Systems" Mark Maletz, Inference Corp., and C. Cuthbert, NASA "Monitoring Real-Time Navigation Processes Using the Automated Reasoning Tool (ART)" ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Thu Sep 12 23:05:17 1985 Date: Thu, 12 Sep 85 23:05:13 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by csnet-relay.arpa id a006849; 12 Sep 85 13:30 EDT Date: Thu 12 Sep 1985 09:31-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #122 To: AIList@SRI-AI Received: from rand-relay by vpi; Thu, 12 Sep 85 22:33 EST AIList Digest Thursday, 12 Sep 1985 Volume 3 : Issue 122 Today's Topics: Queries - Expert Systems for Advising & Autonomous Vehicle, Bindings - KRYPTON Team, AI Tools - Prolog and Lisp, Obituary - Professor George Polya, Literature - AI Report, SEP 1985 ---------------------------------------------------------------------- Date: Tue, 10 Sep 85 09:57:34 cdt From: Don Subject: expert systems for advising Can anyone provide me with information and/or a bibliography on expert systems to advise undergraduate students vis-a-vis planning their curricula? Don Kraft kraft%lsu@csnet-relay ------------------------------ Date: Tuesday, 10-Sep-85 17:45:01-GMT From: GORDON JOLY (on ERCC DEC-10) Subject: Autonomy >From a recent AIList (Vol 3 # 119) announcement of a meeting (Army AI) a discussion was to take place on a ``Robotic Ranger: Recent Testbed Results/Path to Autonomy...'' Can we really look forward to an autononous system? And in such a setting? Gordon Joly (now gcj%qmc-ori@ucl-cs.arpa) ------------------------------ Date: Tue 10 Sep 85 23:55:41-PDT From: FIKES@USC-ECL.ARPA Subject: Your Inquiry About KRYPTON John, The KRYPTON project resulted in papers at AAAI-82, AAAI-83, AAAI-84, and IJCAI-85, in addition to the one in IEEE Computer. The KRYPTON "team" is currently dispersed as follows: Ron Brachman is at AT&T Bell Laboratories, Hector Levesque is at the University of Toronto, and Victoria Gilbert and I are at IntelliCorp. richard fikes ------------------------------ Date: Tue 10 Sep 85 12:15:06-EDT From: "Fanya S. Montalvo" Subject: Prolog and Lisp In-Reply-To: From: Hewitt However, it is not possible to make a commercially viable Common Lisp implementation on Prolog. This means that any good software written for a stand alone Prolog system will soon appear on the Lisp Systems but NOT vice versa. Therefore the stand alone Prolog systems will always have impoverished software libraries by comparison with the Common Lisp systems and will not be commercially viable in the long run. This type of argument strikes one as historical accident not as anything fundamental. And by that accident I mean vagaries of the market place. Could you say more about how it's fundamental, or do you agree that it's historical accident? ------------------------------ Date: Sun 8 Sep 85 14:28:05-PDT From: Mark Crispin Subject: Professor George Polya [Forwarded from the Stanford bboard by Laws@SRI-AI.] Dr. George Polya, professor emeritus at Stanford and a leading research mathematician, died Saturday at his home after a long illness. He was 97. Memorial services are pending; the family prefers memorials be contributions to the George Polya Memorial Book Fund, Stanford University Department of Mathematics, Stanford 94305. ------------------------------ Date: 10 Sep 1985 09:13-EST From: leff%smu.csnet@csnet-relay.arpa Subject: AI Report, SEP 1985 Artificial Intelligence Report, September 1985, Volume 2, No. 9 REPORT ON IJCAI-85 (interesting facts not reported by me from other sources) over 6000 attendees, 250 papers, five dozen commercial display booths, fourteen tutorials, Xerox announced new 1185 and 1186 AI work stations at $9,9995 and $15,865 are comptabile with the IBM-PC. Symbolics anounced the development of a workstation which will sell at approximately half the price of present machines. Hewlett Packard demonstrated an integrated circuitry photolithography advisor and natural language analyzer. Intellicorp previewed KEE 3.0 which has an updated version of its object oriented graphcis package (scheduled for shipment in January). Intellicorp also announced KEEWorlds, a tool that compares and merges complementary worlds of knowledge, a system for delivering expert systems on a personal computer and a manufacturing simulation package. They will be opening a European Office in Munich. Palladian Software announced a Financial Adivisor running on a Symbolics 3640 connected to a major mainframe. The economic strategies were provided by Professor Steward Myers of the Sloan School of Management. Among the first commercial will be the CIGNA Corporation. Symbolics announced a record fourth quarter and fiscal 85 sales. It has shipped its 1,250th machine. Their new units will use Symbolics release 6.1 and will run Common Lisp. TI demonstrated its PC-Scheme. Inference Corporation announced the ARTIST graphics environment and the ART STUDIO knowledge base browsing material. It signed an agremement with the Insurance Company of North America to develop expert systems for the financial industry. Teknowledge released Version 2 of its M.1 expert system and has rewritten S.1 in the C programming language. Teknowledge has announced an agreement with Computer Thought company to convert S.1 to ADA programming language. Apollo Computer and Sun announced agreements with LUCID to sell and support LUCID's implementation of COMMON Lisp. Membership in AAAI is over 10,000. AAAI next conference to be held in Philadelphia, August 11-15 1986 will have two tracks, engineering and scientific. REPORT ON FRENCH AI PROGRAM which listed areas being studied and government agencies supporting AI. Also includes a comment by Geoffroy d'Aumale, Editor of La Lettre da l'Intelligence Artificiel that unless something is done about French research in AI, the fifth generation will be out of reach of French Industry THE CONNECTION MACHINE discusses the Connection Machine Project of Thinking Machine Company. Thinking Machine Company also will be offering a program that indexes natural language for online text browsing. It can generate indexes at the rate of 200,000 characters per hour. It runs on Symbolic Machine and will soon run on other systems running the C language. THE TURING INSTITUTE This is the commercially independent AI system in Glasgow, Scotland. It has been founded by Donald Michie and has the charter to develop intelligent computers without interference from 'systems analysts, programmers and operators.' They are affiliated with the company behind Expert-Ease, Radian Corporation. AION CORPORATION: This company is building expert systems on personal computer that can access large mainframe databases. EXPERT-EASE SYSTEMS Expert-Ease Systems of Menlo Park has received a Department of Energy contract to 1) develop an expert system to enhance reliability-based decision making in power plants 2) apply knowledge engineering to power plant heat rate performance monitoring List of quotes overhead at the Gartner Group Forum on AI book reviews of: %A Shimon Y. Nof %T Handbook of Industrial Robotics %I John Wiley and Sons %C Somerset, New Jersey %X 1358 pages $76.95 %A International Society for Optical Engineering %T Applications of Artificial Intelligence II %E Mary S. Pickett %E John W. Boyce %T Solid Modelling by Computers From Theory to Applications %I Plenum Press %A Stephen J. Andriole %T Applications in Artificial Intelligence %I Petrocelli Books %C Princeton, New Jersey ------------------------------ End of AIList Digest ******************** From csvpi@vpics1 Mon Sep 16 23:05:22 1985 Date: Mon, 16 Sep 85 23:05:09 edt From: csvpi@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a006687; 16 Sep 85 14:24 EDT Date: Mon 16 Sep 1985 10:07-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #123 To: AIList@SRI-AI Received: from rand-relay by vpi; Mon, 16 Sep 85 22:37 EST AIList Digest Monday, 16 Sep 1985 Volume 3 : Issue 123 Today's Topics: Linguistics - TaleSpin Story Generator Reference, Humor - Psychotherapy, AI Tools - LISP to C & More Xerox Announcements at IJCAI & New Lists for TI Explorer Discussion & Connectionist Network Simulator & Discussion of AI Languages, Information Retrieval - Interactive Encyclopedia & Technical Foreign Language Material ---------------------------------------------------------------------- Date: Thu 12 Sep 85 12:00:25-PDT From: Matt Heffron Subject: Re:TaleSpin Re: Children's story generator <7-Sep-85 Steve.Hoffman@CMU-CS-K> The program you're interested in is TALE-SPIN, by James Meehan. He is currently at: James R. Meehan Cognitive Systems Inc. 234 Church St. New Haven, CT 06510 MEEHAN@YALE - Matt Heffron ------------------------------ Date: Monday, 9-Sep-85 16:26:12-GMT From: GORDON JOLY (on ERCC DEC-10) Subject: Analysis of ... Re: Expert Systems In Psychiatry (Vol 3 # 116) Psychotherapy is debugging for humans... Gordon Joly. [I'm not sure what the intent of this message is. I'll pass it along under a "humor" label, but to avoid any "Polynomial" debacle would like to point out that psychotherapy is not a joking matter. -- KIL] ------------------------------ Date: Thu 12 Sep 85 12:03:19-PDT From: Matt Heffron Subject: Re: LISP to C Re: Lisp to C <20-Aug-85 duke@mitre.ARPA> I know of (no endorsement, no experience with) a system called SILL which is built on top of PSL on the Apollo. It can "... output standard PASCAL (or other conventional languages). This capability enables the user to port SILL developed code to other environments." Contact: SILMA Incorporated 1800 Embarcadero Palo Alto, CA 94303 (415)-493-0145 -- Matt Heffron From: Matt Heffron : Beckman Instruments Inc. ------------------------------ Date: 12 Sep 85 15:12 PDT From: Fischer.pa@Xerox.ARPA Subject: More Xerox announcements at IJCAI The 1185 and 1186, though they can run IBM-PC software, do not use the 8086 to run Interlisp. The primary processor is microprogrammable, constructed using bitslice chips. A second IO processor is, in fact, an 8086. IBM compatability is provided by a yet third processor, an 8086, on a plug in board. Performance is about 15% greater overall than the Dandelion; we're still benchmarking. These machines also have a new larger 19" screen availible as an option, with more pixels at the same density. Also announced was a version of Quintus Prolog for D-machines, using microcode support, which benchmarks at 51,000 LIPS. Xerox Commonlisp was announced for 2nd quarter 1986. It is to be fully integrated with the Interlisp environment. (ron) ------------------------------ Date: Fri 13 Sep 85 15:16:25-PDT From: Richard Acuff Subject: New Lists for TI Explorer Discussion In order to facilitate information exchange among DARPA sponsored projects using TI Explorers, two ArpaNet mailing lists are being created. INFO-EXPLORER will be used for general information distribution, such as operational questions, or announcing new generally available packages or tools. BUG-EXPLORER will be used to report problems with Explorer software, as well as fixes. Requests to be added to or deleted from these lists should be sent to INFO-EXPLORER-REQUEST or BUG-EXPLORER-REQUEST, respectively. All addresses are at SUMEX-AIM.ARPA. These lists signify no commitment from Texas Instruments or Stanford University. Indeed, there is no guarantee that TI representatives will read the lists. The idea of the lists is to provide communication among the users of Explorers. -- Rich Acuff Stanford KSL ------------------------------ Date: 13 Sep 1985 1557-EDT (Friday) From: Hon Wai Chun Subject: Connectionist Network Simulator CONNECTIONIST NETWORK TEACHING / LEARNING TOOL A connectionist network teaching / learning tool called AINET-1 is available for distribution (educational and research purposes only) from the Computer Science Department, Brandeis University. AINET-1 is a graphic-oriented software package which can be used to interactively create, manipulate, and experiment with connectionist networks. Most commands are conveniently driven by a mouse. Nodes in AINET-1 are shaded to reflect their activation levels. Once a network is created, the user can run an animated simulation (network relaxation). In the simulation, AINET-1 will change the various node shadings as the activation levels change during each run cycle. After a simulation, the user can plot the results or display tables of previous activation levels. Networks can be stored into binary files and reloaded later for further editing. AINET-1 is intended to be used mainly as a learning tool to give the user a flavor of how connectionist networks behave. A more sophisticated version, called AINET-2 (under development), may be useful for development work. AINET-1 is written in Symbolics Common Lisp and presently runs on Symbolics Lisp machines (Release 6.0). The system is offered on a non-commercial, non-disclosure, and as-is basis for a nominal fee. The fee is $150 for universities, and $250.00 for laboratories. Interested parties should send requests to (or call). Hon Wai Chun hon@brandeis.csnet Computer Science Brandeis University Ford 232A Waltham, MA 02254 617-647-2650 or 617-647-2119 (main-office) ------------------------------ Date: 14 Sep 1985 07:21 EDT (Sat) From: Wayne McGuire Subject: Lisp vs. Prolog vs. ? Predicting what language will be most used for AI is problematic since there seems to be little agreement about what AI is. Let's assume, however, that over the next decade or two ''AI'' will refer primarily to expert systems. In that case, one might speculate that perhaps the bulk of AI code will be written neither in Lisp nor Prolog (not even an enhanced Prolog which can elegantly manipulate and coordinate in the same conceptual space multiple worlds, logics, and beliefs), but a higher-level language, perhaps using Lisp and/or Prolog as a base. One of the major tasks in the coming years will be tranferring the expert knowledge from many domains--economics, medicine, sociology, political science, literature, law, etc.--into expert systems. Experts in these fields have dedicated their lives to mastering their respective fields, not to learning the art of writing compact and elegant Lisp code. These experts are not computer scientists or even computer programmers. This situation implies three methods for transferring the knowledge of domain experts into computer programs: (1) Natural language understanding systems which can translate raw text directly into working knowledgebases. We probably won't see such systems on a large scale, which can operate with any degree of reliablity, for at least another twenty-five years, and perhaps much longer. (2) The laborious interviewing of domain experts by expert system experts (if you will), and the transcription of those interviews into programs. (3) The direct encoding of knowledge into expert systems by domain experts themselves. If the third method does indeed become the preferred method for writing expert programs, then whatever higher-level language and user interface best supports that activity (and I doubt it will be Lisp or Prolog, which are relatively low-level) will probably become the language which is most widely used for AI. ------------------------------ Date: Mon, 26 Aug 85 08:22:25 edt From: Ben Shneiderman Subject: The Interactive Encyclopedia System (TIES) [Excerpted from IRList 1.8 by Laws@SRI-AI.] The Interactive Encyclopedia System (TIES) --- ----------- ------------ ------ ------ Ben Shneiderman, Department of Computer Science Janis Morariu, College of Library and Information Services University of Maryland, College Park, MD 20742 June 1985 The Interactive Encyclopedia System (TIES) has been under development at the University of Maryland since Fall 1983. It allows novice users to explore information resources in an easy and appealing manner. They merely touch (or use arrow keys to move a light bar onto) topics that interest them and a brief definition appears at the bottom of the screen. The users may continue read- ing or ask for details about the selected topic. An article about a topic may be one or more screens long. As users traverse articles, TIES keeps the path and allows easy reversal, building confidence and a sense of control. Advanced features include the ability to view an index of articles or print out arti- cles of interest. [...] The TIES authoring software guides the author in writing a title, brief defin- ition (5-25 words), text (50-1000 words, typically), and synonyms for each article title. The author marks references in the text by surround them with a pair of tildes. TIES collects all references, prompts the user for synonym relationships, maintains a list of articles, and allows editing, addition, and deletion of articles. A simple word processor is embedded in the authoring software, but users can create articles on their own word processor, if they wish. There are no commands to memorize, every operation is done by selection from options on the screen. [...] In the study comparing the arrow keys (maybe better termed "jump" keys because the cursor would jump to the closest target in the direction pressed) to the mouse, the arrow keys proved to be and average of 15% faster and preferred by almost 90% of the subjects. We conjecture that when there are a small number of targets on the screen and when jump keys can be implemented, they provide a rapid, predictable, and appealing mechanism for selection. [...] We did find touchscreen was easier to teach people than arrow keys, and that arrow keys were a solid winner against the mouse when there are a small number of large targets on the screen. -- Ben Shneiderman [A mouse could be programmed for similar "jump selection", of course. It would be interesting to know whether this would be more distracting than helpful. -- KIL] ------------------------------ Date: 13 Sep 1985 1209-PDT (Friday) From: eugene@AMES-NAS.ARPA (Eugene Miya) Subject: Technical foreign language material Lately, there have been significant technical advances from non-English speaking countries: Japan and the Continent. How many know the Japanese equivalent to the CACM? What is the German equivalent of the IEEE? It is too easy to say that such organizations and publications are not significant. We have been accused of parochialism. Our problems in the computer industry are rather unique as colleagues in other fields such as nuclear fusion report that most of their colleagues are, for all practical purposes, forced to come to the U.S. This is not the case with computing Just as we have file servers and process servers, we have a distributed system. Our greatest resource are not the machines, but the people with special skills. To this end I propose the following: Propose: 1) to identify individuals who are capable of providing simple translation. It would help if the Universities could do this. Perhaps, Universities could get assistance from foreign language departments. 2) Identify various foreign language publications of technical interest. Quickly identify articles of wide interest. This information could be posted to general interest Usenet newsgroups such as net.research and net.mag as well as the special interest groups such as the AI List, net.lang, and so forth. We should not create news groups, but work on top of existing groups. 3) Help fund subscription and translations. Perhaps, individuals without technical translation expertise can get together to pay for technical translations [commercial], and/or help fund the subscription of those with technical translation expertise. Dymond@nbs-vms.ARPA has started an info-japan and a nihongo discussion group on the ARPAnet, but it would be difficult to get Usenet participation. I specifically do not want to create new newsgroups. This structure can be placed atop the existing news group structure. The Usenet has several advantages for the circulation of this type of material: 1) it has the links into Japan, Korea, Australia, Germany, France, and the rest of Europe not on the ARPAnet. 2) since there is no global authority, industrial companies can participate more easily. 3) There are a diversity of news groups which make news dissemination easier: net.mag for instance is used for posting the TOCs of various publications, ideal for this type of dissemination. Other significant groups include: net.ai, net.cse, net.announce, net.physics, net.arch, net.math, net.mag, net.research, net.bio, net.graphics, net.wanted, net.nlang It appears our most critical needs are in the Eastern Asian languages such as Japanese, Korean, and Chinese. Other useful work would include French, German, and the other European languages. We have to look to the Universities for much of our assistance, but private organizations and government can also help. We can certainly make inquires. The Usenet extends into Japan, France, and other non-English native countries. We must take benefit of these contributors. Similarly, we can contribute to these countries by tagging significant English language documents. I am willing to act as a clearing house for determining finding individuals and groups, and specific journals. For this purpose, I am giving my address an ARPA/uucp gateway. Send the mail inquiries there. More in a couple of weeks. >From the Rock of Ages Home for Retired Hackers: --eugene miya NASA Ames Research Center {hplabs,ihnp4,dual,hao,decwrl,allegra}!ames!amelia!eugene eugene@ames-nas ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Wed Sep 18 22:45:27 1985 Date: Wed, 18 Sep 85 22:45:10 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a000386; 18 Sep 85 14:29 EDT Date: Wed 18 Sep 1985 09:14-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #124 To: AIList@SRI-AI Received: from rand-relay by vpi; Wed, 18 Sep 85 22:31 EST AIList Digest Wednesday, 18 Sep 1985 Volume 3 : Issue 124 Today's Topics: Query - AI Conference Listings, Correction - Expert Systems in Government, Volunteers Needed - Expert Systems in Government, Call for Papers - Knowledge-Based Expert Systems (IEEE Software), Seminars - Cognitive Science Calendar (MIT) & Learning Mathematical Abstractions (UCB) & Programming in Equational Logic (CMU) & Explanation of Quantitative Models (CMU) & Automating CAD Design (GMR), Conference - Workshop on Argument Structure (Brandeis) Course - The Logic of Robot Design (SU) ---------------------------------------------------------------------- Date: Wed, 18 Sep 85 09:47 EST From: Atul Bajpai Subject: AI Conferences Can somebody out there in the computer world provide me with a list of major AI conferencs/symposiums/tutorials that are scheduled through the end of 1986? Location and dates of these activities would be useful. Thank you. --Atul Bajpai-- CSNET: bajpai%gmr.csnet@csnet-relay [A couple of good sources for such information are the ACM SIGART newsletter and the monthly Communications of the ACM. IEEE Computer carries both a calendar and calls for papers, and the AI Magazine from AAAI has quite a few conference announcements. Yoni Malachi (YM@SAIL) has been keeping an indexed list of conference announcements in file confer.txt[2,2] at SAIL (Stanford AI Lab). Back issues of AIList are a pretty good source as well. -- KIL] ------------------------------ Date: Fri 13 Sep 85 23:38:29-PDT From: Gary Martins Subject: False advertising for "Expert Systems in Gov't" Ailist V3 #115 includes a message dated August 28, from Marhshall Abrams at Mitre, describing the program for a forthcoming conference on "Expert Systems In Government". My name appears as a panelist in a session entitled "Frontiers of KBES: Pro & Con". AIList readers should know that neither I nor anyone else from Intelligent Software Inc. will be appearing in any capacity at this festival of hype. I have a written promise from Marshall Abrams to desist from this false advertising. He has known for several weeks that this announcement is false. Misrepresentation, exaggeration, and falsehood are important elements of contemporary AI. We would only ask that these be confined to the technical presentations, and not spill over into administrative and procedural announcements. Thanks. Gary R. Martins ------------------------------ Date: 18 Sep 85 11:12:05 EDT (Wed) From: Marshall D. Abrams Subject: Gary Martins will not be at ESIG Due to a clerical error, the preliminary program for Expert Systems in Government indicates that Gary Martins will participate on a panel discussion. I apologize for any inconvenience this error may have caused. Sincerely, - Marshall D. Abrams, phone: (703) 883-6938 The MITRE Corporation, 1820 Dolley Madison Blvd. Mail Stop W458, Mc Lean, VA 22102 ------------------------------ Date: 12 Sep 85 08:53:08 EDT (Thu) From: Kamal N. Karna Subject: Second EXPERT SYSTEMS IN GOVERNMENT CONFERENCE 1986 The second Expert Systems in Government Conference, sponsored by the IEEE/CS and the MITRE Corporation, will be held in October 1986 in Washington D.C. metropolitan area. Volunteers at all levels are solicited to participate in the next year's program. ESIG 1986 is anticipated to be much larger and broader in scope. The ESIG 1986 conference shall include one day of tutorials followed by the sessions on unclassified and classified topics. There will be two technical co-program chairmen to organize the technical programs. People interested in participating in ESIG 1986 please contact Dr. Kamal N. Karna Conference Chairman Second Expert Systems in Government Conference 1986 The MITRE Corporation 1820 Dolley Madison Blvd. McLean, Virginia 22102. (Tel.) (703) 883-5866 (O) (301) 921-0392 (H) KARNA@MITRE----ARPANET ------------------------------ 18-Sep-85 09:35:14-PDT,1332;000000000001 Date: Tuesday, 17 September 1985 14:52:06 EDT From: Duvvuru.Sriram@cive.ri.cmu.edu Subject: Call for submissions to IEEE Software CALL FOR PAPERS In addition to the regular features, the March 1986 IEEE Software special issue on Knowledge-based Expert Systems (KBES) for Engineering Applications will have a section on research being conducted on the applications of KBES for engineering. Authors should submit a 3 page (doubly spaced) paper, focusing on the following issues: - goal of the project; - architecture of the system; - current status; and - future plans. All submissions should be sent before October 15th, 1985 to: D. Sriram/M. Rychener Civil Engg. and Construction Labs. Department of Civil Engineering Carnegie-Mellon University Pittsburgh, PA 15213 ARPAnet address: sriram@cive.ri.cmu.edu or sriram@cmu-ri-cive.arpa (Net mail is preferable) ------------------------------ Date: Sun, 15 Sep 1985 11:42 EDT From: Peter de Jong Subject: Cognitive Science Calendar Reply-to: Cog-Sci-Request%MIT-OZ@MIT-MC [Forwarded from the MIT bboard by SASW@MIT-MC.] The Cognitive Science Calendar is a weekly listing of Cognitive Science talks with their abstracts which are given at MIT and the surrounding area. The listing includes the areas of Artificial Intelligence, Cognitive Psychology, Philosophy, and Linguistics. If you would like to join the listing or have talks listed please reply to COG-SCI-REQUEST%MIT-OZ@MIT-MC.ARPA. ------------------------------ Date: Thu, 12 Sep 85 09:03:50 PDT From: chertok%ucbcogsci@Berkeley (Paula Chertok) Subject: Seminar - Learning Mathematical Abstractions (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Fall 1985 Cognitive Science Seminar -- IDS 237A TIME: Tuesday, September 17, 11:00 - 12:30 PLACE: 240 Bechtel Engineering Center (followed by) DISCUSSION: 12:30 - 1:30 in 200 Building T-4 SPEAKER: Alan H. Schoenfeld, Education & Mathematics, UCB TITLE: ``Obstacles To Making Sense of Mathematical Notions, or, The Transfer Problem Rears its Ugly Head Once Again'' It can be argued that the fundamental difficulty in mathemat- ics learning is the transfer problem. That is, the power of mathematics lies in the potential applicability of mathemati- cal ideas to new situations. It doesn't matter whether the idea is, for example, function, group, number, or triangle. Once any particular mathematical entity is recognized as belonging to an identified class of objects, everything known about that class of objects applies to that entity. In such abstaction resides much of the power and utility of mathemat- ics. This paper explores some theoretical and some pragmatic obstacles to students' abstraction of mathematical notions. We look at two domains, whole number arithmetic and plane geometry. Some parallels between the two domains are drawn, to indicate that the processes of abstraction are similar in both. In the case of number, we examine a theoretical para- dox: the use of good ``hands on'' manipulatives to help stu- dents make sense of base 10 addition and subtraction may make it harder to understand the nature of ``number.'' In the case of geometry, we discuss an empirical obstacle. When things are compartmentalized in the curriculum, connections that we would hope are ``natural'' turn out to be very hard to make. ------------------------------ Date: 17 September 1985 1308-EDT From: Theona Stefanis@CMU-CS-A Subject: Seminar - Programming in Equational Logic (CMU) Name: Michael J. O'Donnell - The University of Chicago Date: Monday, 23 September Time: 3:00 Place: WeH 5409 Title: Equational Logic as a Programming Language In logic programming languages programs are logical assertions with no explicit procedural information, and execution consists of the efficient derivation of certain logical consequences of a program. Prolog, and relational database query languages are both logic programming languages based on the predicate calculus. The advantages of logic programming are clarity of programs, simplicity of semantics, and the potential for parallel execution without timing dependence. In this talk, I describe a programming language based on the logic of equations. A prototype implementation exists, and has been used in a number of experiments. The talk will focus on examples illustrating the advantages of equational programming, and the differences between equational programming and Prolog programming. Mike O'Donnell ------------------------------ Date: 17 Sep 85 16:16:10 EDT From: Jeanne.Bennardo@CMU-RI-ISL1 Subject: Seminar - Explanation of Quantitative Models (CMU) Intelligent Systems Lab Seminar Topic: Presentation of Ergo Project Speaker: Dr. Donald Kosy Place: DH3313 Date: Friday, September 20 Time: 11:00am - 12:00noon The Ergo project is an investigation into computer methods for explaining results produced by quantitative planning models. It is an outgrowth of previous research in which we developed a procedure that explains differences in results by comparing their derivations. For example, given a suitable quantitative model and a series of results from it such as: 1982 1983 1984 Profit $683.00 $676.40 $951.60 this procedure can answer "why" questions about the results such as: Why did profit go down in 1983? Profit went down in 83 primarily because overhead cost went up and profit = gross margin - overhead cost. Although gross margin went up by 19%, overhead cost went up by 41% and the latter outweighed the former. Would you like me to continue? The explanation can be continued all the way down to the lowest level of the model, i.e. down to its input variables. The intent of the current work is to extend the explanatory power of this procedure and to evaluate its potential for practical use. In particular we are interested in extensions to cover: *Models that involve simultaneous equations *Models that involve conditional expressions *Explanations of differential magnitude, e.g. Why did overhead cost go up so much? *Inferring the referents of comparison, e.g. Why is production cost high in 83? *Explaining lack of change, e.g. Why did material cost remain constant? *Explaining differences between "what-if" cases and a base case, e.g. Why is profit in case 1 higher than for the base case? ------------------------------ Date: Thu, 12 Sep 85 14:24 EST From: "S. Holland" Subject: Seminar - Automating CAD Design (GMR) Presentation is to be held at General Motors Research Laboratories in Warren, Michigan. Function, Form and Fabrication: Considerations in Automating Design James R. Rinderle Assistant Professor Carnegie-Mellon University Monday, September 16, 1985 Any design modification requires knowledge of whether changed features affect the functionality of a product, impact the producibility or are simply arbitrary specifications. Good designers simultaneously consider the form of the product, the functional requirements and the means for fabrication. Even the most modest attempts at automating design are doomed to fail unless these considerations are included at some level. A CAD database should consist of multiple representations of a product in terms of function, form and fabrication analogous to the traditional specification list, drawings and process plan. The relationships among these representations is the basis for design. Design modification may be facilitated by developing a syntax for describing function, form, and fabrication and by developing strategies for manipulating the descriptions. Dr. James R. Rinderle is an Assistant Professor of Mechanical Engineering at Carnegie-Mellon University. He was awarded the Ph.D. degree by the Mechanical Engineering Department of the Massachusetts Institute of Technology in 1982. He also received the Master of Science and Bachelor of Science degrees from MIT. He is a member of Sigma Xi, Pi Tau Sigma, the ASME, Robotics International and CASA of SME. He was named a Presidential Young Investigator in 1985. -Steve Holland ------------------------------ Date: Sat, 14 Sep 1985 03:00 EDT From: INGRIA%MIT-OZ@MIT-MC.ARPA Subject: Workshop on Argument Structure - Brandeis The Linguistics and Cognitive Science Programs Brandeis University Present A Workshop on Argument Structure Friday, September 20th 9AM to 5PM Sachar International Center Presentations will be one (1) hour long with time for questions. Speakers: 9:30 Ken Hale ``A View from the Middle'' 11:00 Ray Jackendoff ``The Role of Thematic Relations in Linguistic Theory'' 1:30 Edwin Williams ``Argument Structure and Heads'' 2:45 Armin Mester and Jane Grimshaw ``Light Verbs in Japanese' 4:00 Howard Lasnik ``Subjects of NPs?'' 5:00 - 7:00 Reception - Sachar International Center For more information, call (617)-647-2986. ------------------------------ Date: Wed 18 Sep 85 08:22:53-PDT From: Leslie Kaelbling Subject: New course: The Logic of Robot Design (SU) [Forwarded from the Stanford bboard by Laws@SRI-AI.] THE LOGIC OF ROBOT DESIGN This course will explore theoretical issues in the design of software for intelligent agents. Its aim is to provide conceptual tools for coping with complexity in robot design, covering processes from the sensorimotor level through reasoning, planning, and linguistic communication, emphasizing the role of formal methods in analysis and synthesis of robot software. The following topics will be covered: - applications of epistemic and temporal logic to robotics - automata-theoretic models of knowledge - inference and planning - logic-based tools for programming intelligent robots. Some familiarity with basic logic and computer programming will be assumed. Coursework will consist of problem sets and one programming assignment. Instructor : Stan Rosenschein (stan@sri-ai; 859-4167) Time : TTh 11-12:15 Place : 460-252 Course number : CS428 Units : 3 TA : Leslie Kaelbling (kaelbling@sri-ai, pack@su-sushi, k.kaelbling@su-lots-b; 859-2578) ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Sat Sep 21 06:02:58 1985 Date: Sat, 21 Sep 85 06:02:54 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a006841; 20 Sep 85 14:29 EDT Date: Fri 20 Sep 1985 10:16-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #125 To: AIList@SRI-AI Received: from rand-relay by vpi; Sat, 21 Sep 85 05:55 EST AIList Digest Friday, 20 Sep 1985 Volume 3 : Issue 125 Today's Topics: Queries - FRL Sources & Parallel Rule Execution & Information Retrieval & Lisp/Prolog for IBM4361, AI Tools - Xerox 1185 & Prolog vs. Lisp, Expert Systems - Intellectual Honesty and the SDI ---------------------------------------------------------------------- Date: Thu, 19 Sep 85 10:01:08 cdt From: neves@wisc-ai.arpa (David Neves) Subject: FRL sources I remember a message a year ago about someone having the sources to FRL. Unfortunately I don't remember who that person was. Could anyone who has the sources send me mail? -Thanks, David Neves Usenet: {allegra,heurikon,ihnp4,seismo,uwm-evax}!uwvax!neves Arpanet: neves@uwvax ------------------------------ Date: Tue, 17 Sep 85 09:04:36 pdt From: Thomas L. Zimmerman Subject: Parallel Rule Execution The Naval Ocean Systems Center (NOSC) and Goodyear Aerospace are working on a series of experiments to demonstrate the feasibiliy of running expert systems on the Goodyear ASPRO parallel processor. A unique representation for rules and data has been developed which on paper allows the ASPRO to test 2,000,000 rules per second for satisfaction. This representation scheme does put some limitations on the system involved - it appears to require a very pure production system with no embedded control or functions in the rules. So far a small (500 rule) system was written with this application in mind and run on both a Symbolics and the ASPRO sucessfully. We would now like to convert an existing sequential expert system for parallel execution in order to determine the degree of speedup actually available and to discover the limitations of converting a system not originally designed for this application. Unfortunatly I am having trouble finding a system to convert for this demonstration - which is why I am appealing to all of you. We need a reasonably sized (200-700 rule) system, preferably military in character, that meets the above limitations that we can attempt to run on our parallel inference engine. This would be a no-cost way for someone to have their system speeded up by an estimated three orders of magnitude. Any takers? If you're interested please contact me: Lee Zimmerman Naval Ocean Systems Center Code 421 San Diego CA 92152 (619) 225-6571 or zimmer@nosc ------------------------------ Date: 18 Sep 85 15:30:36 EDT From: MARS@RED.RUTGERS.EDU Subject: NLP for knowledge acquisition Hi: I am interested in info about projects which use Natural Language Processing Techniques to analyse scientific articles or abstracts with the aim of deriving knowledge bases from them. I am aware of a few projects in that field (UCLA, IBM Heidelberg, Leiden University, Chemical Abstracts), but I would appreciate any further pointers. Please reply directly to me, and I will summarize to the net. Thanks. Nicolaas J.I. Mars [I have forwarded this message and the next to the information retrieval list, IRList%VPI.CSNet@CSNet-Relay.ARPA. -- KIL] ------------------------------ Date: Wed, 18 Sep 85 09:08 EST From: Ramesh Astik Subject: query - Information Retrieval I was looking for some references in synthetic organic chemistry on a Chemical Abstract Database system.The first hit was 10,000 followed by narrowing down to 400 ! The same search by an expert bibliographer or search assistant gave me exactly 23 article list. This is the difference in eye-balling and machine-search. We had a lot of debate on the mental process of the human expert doing the job and whether that can be mimicked on a computer or not. Does any one know of any expert-system which can save us so much paper work in searching and retrieving the information? Our University has access to approximately 300 databases and after the Automated search list is obtained,most of us do equally long eye-balling!! Kindly send any information to RAMPAN@NORTHEASTERN. ------------------------------ Date: Mon, 16 Sep 85 14:23:22 EDT From: "Martin R. Lyons" <991@NJIT-EIES.MAILNET> Subject: Info on Lisp/Prolog for IBM4361 Greetings all. Does anyone have any leads where I might obtain a LISP or Prolog implementation that would run on an IBM 4361? I am looking for public domain or reasonably priced packages; and wouldn't you know it, time is of the essence. If anyone has any leads please contact me at the address below. I will summarize and post here if there is sufficient interest. As always, thanks in advance! MAILNET: Marty@NJIT-EIES.Mailnet ARPA: Marty%NJIT-EIES.Mailnet@MIT-MULTICS.ARPA or @MIT-MULTICS.ARPA:Marty@NJIT-EIES.Mailnet USPS: Marty Lyons, CCCC/EIES @ New Jersey Institute of Technology, 323 High St., Newark, NJ 07102 USA (201) 596-2932 "You're in the fast lane....so go fast." ------------------------------ Date: 16 Sep 85 15:28 PDT From: Fischer.pa@Xerox.ARPA Subject: Correction: Xerox 1185 uses 80186 not 8086 Being as close as I am to the subject I'm embarassed to say (but overjoyed to know) that I was wrong and that the 1185 and 1186 workstations use the Intel 80186 processor chip both in the IO processor and on the IBM PC emulator boards. Their (micro programmable) main processor is built with bitslice devices. But note that I never claimed to be a faultless spokes-thing for Xerox or Xerox AI Systems, just another random attendee of IJCAI. Sorry folks, (ron) ------------------------------ Date: Tue, 17 Sep 1985 06:28 EDT From: Hewitt@MIT-MC.ARPA Subject: Prolog and Lisp I would like to respond to the message in AILIST from Fanya Montalvo who wrote: From: Hewitt However, it is not possible to make a commercially viable Common Lisp implementation on Prolog. This means that any good software written for a stand alone Prolog system will soon appear on the Lisp Systems but NOT vice versa. Therefore the stand alone Prolog systems will always have impoverished software libraries by comparison with the Common Lisp systems and will not be commercially viable in the long run. From: Montalvo This type of argument strikes one as historical accident not as anything fundamental. And by that accident I mean vagaries of the market place. Could you say more about how it's fundamental, or do you agree that it's historical accident? This is a very good question! However, in this case I believe that the commercial marketplace is reflecting some very real deficiencies in Prolog and its underlying conceptual basis of LOGIC as a PROGRAMMING language. As far as I can tell no one in the Prolog community believes that they will EVER be able to construct a commercially viable Common Lisp on Prolog. That indicates that there are some critical limitations of Prolog that are not just historical accidents. I believe that the deficiencies of Prolog cannot be repaired within the framework of LOGIC as a PROGRAMMING language. ------------------------------ Date: Wed, 18 Sep 85 18:05 EDT From: Hewitt@MIT-MC.ARPA Subject: Lisp vs. Prolog vs. ? I agree with Wayne McGuire who wrote as follows to this list: ... one might speculate that perhaps the bulk of AI code will be written neither in Lisp nor Prolog (not even an enhanced Prolog which can elegantly manipulate and coordinate in the same conceptual space multiple worlds, logics, and beliefs), but a higher-level language, perhaps using Lisp and/or Prolog as a base. However, I would like to point out that Prolog is not a suitable base to implement the kind of higher-level languages that Wayne envisions since it does not provide the appropriate primitives. Implementing higher-level Artificial Intelligence languages requires efficient data structure and control primitives that are not part of Prolog. I agree that Common Lisp is too low level to use very much to directly implement applications. However, Lisp has historically been an excellent implementation language for implementing higher-level Artificial Intelligence languages. Indeed some of the best Prolog systems and other logic systems such as FOL (Wheyhrauch et. al.), MRS (Genesereth et. al), the Pure Lisp Theorem Prover (Boyer and Moore), and LogLisp (Robinson et. al.) are implemented on Lisp. ------------------------------ Date: 18 Sep 85 15:48 EDT From: WAnderson.wbst@Xerox.ARPA Subject: Intellectual honesty and the SDI At the recent IJCAI at UCLA I picked up a couple of papers at the GE exhibit booth. One of these, entitled "A Tutorial on Expert Systems for Battlefield Applications," (delivered at a meeting of the Armed Forces Communications and Electronics Association last May) states that "AI systems that incorporate human expertise may be the only way" to fill the gap between availability of people and complexity of military hardware. In defense of this strategy the author states: - In contrast with humans, AI systems are good at handling the myriad details of complex situations, such as often occur in military settings. - In contrast with other computational approaches that are more formal and algorithmic, AI systems are more robust: they are designed to deal with problems exhibiting uncertainty, ambiguity, and inaccuracy. I find it appalling (and frightening) that statements like this can be presented in a technical paper to military personnel. The author (according to the references) has contributed widely to the AI field at many conferences. It's simply ludicrous to state that current AI systems are better in battlefield situations than humans. What was the last AI system that could drive a tank, carry on a conversation, and fix a broken radio whilst under enemy fire? The second comment is equally misleading. To contrast "formal and algorithmic" with "robust" seems to imply that algorithms and formal procedures are inherently not robust. On what is this claim based? (There is no reference attached to either statement.) It sounds like a recipe for unreliable software to me. How can someone write this stuff? I know, to make money. But if this is the kind of information that is presented to the military, and upon which they make decisions, then how can we expect any kind of fair assessment of the possible projects in the Strategic Computing (and Defense) Initiatives? How can this kind of misinformation be rebutted? Bill Anderson P.S. The full reference is available on request. ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Sun Sep 22 21:03:22 1985 Date: Sun, 22 Sep 85 21:03:17 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a005729; 22 Sep 85 1:46 EDT Date: Sat 21 Sep 1985 21:56-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #126 To: AIList@SRI-AI Received: from rand-relay by vpi; Sun, 22 Sep 85 20:53 EST AIList Digest Sunday, 22 Sep 1985 Volume 3 : Issue 126 Today's Topics: Expert Systems - Hype ---------------------------------------------------------------------- Date: Sat 21 Sep 85 17:40:46-PDT From: Gary Martins Subject: Are We Ready For This ? In reading and replying to Bill Anderson's msg in a recent edition of AIList, it occurred to me that there may be broader interest out there in a discussion of the question of objectivity and truthfulness in the fields of "AI", "expert systems", "knowledge engineering", etc. I have repeatedly observed the following at conferences, symposia, briefings, etc., and in "AI" journals and magazines: - non-existent systems are described and debated as if they were real - unsuccessful developments are described as operationally validated - expensive and ineffective methods and "tools" are said to solve difficult problems in computing This happens too often to be accidental or aberrational. Those responsible include highly placed figures from some of our most prestigious institutions. It would greatly interest me to understand: - why this happens ? - is this good or bad for "AI" ? - does this happen in all high-tech fields, or is "AI" unique ? - what can or should be done about it ? by whom ? Would AIList readers and contributors like to address these issues, or is this set of topics too "sensitive" for the community to address at this time ? Many thanks! Gary R. Martins ------------------------------ Date: Fri 20 Sep 85 20:33:22-PDT From: Gary Martins Subject: Phony claims in AI Bill - I read your recent AIList comment with a mixture of amusement and amazement. Will you pardon my asking: where have you been ? So far as I have been able to probe, the entire edifice of "AI" -- and most especially "expert systems" -- is built on a foundation of the most outrageous baloney. At an endless procession of conferences, symposia, press briefings, etc., the most outrageous claims are relentlessly presented for the performance of a number of "AI" systems. I have personally been associated with several of these developments, and I can testify that not a single one of them can honestly be said to "work" in any authentic sense of that word. There are apparently a few utterly trivial systems that "work", after a fashion. But the astronomical development costs of these toys should make any rational user shrink from following a similar path. Yet, despite these plain and rather obvious facts, military and industrial audiences are daily told about the "successes" of "AI" and "expert systems". The sorts of claims you refer to are entirely ordinary and routine in this context. One has to wonder, is this what modern science and technology is all about ? Or is "AI" just a special case of extreme dishonesty ? Gary R. Martins PS -- Yes, send me the references, just for the record! ------------------------------ Date: Fri, 20 Sep 85 23:50:57 PDT From: Richard K. Jennings Subject: AI and Satellite Control As one of the military (Capt USAF) standing guard against over-enthusiastic claims by DoD contractors, I would like to assure readers of this net that the USAF is not as gullable as Bill Anderson fears in his recent message. My job for the past year is to develop an architecture which is compatible with SDI which incorporates Expert Systems as appropriate. Essentially Beau Shields conveyed the essence of our thinking in his recent article published in Computer Design. Expert Systems assist experts with tasked well understood by experts, providing more time for experts to handle the tough problems. To my knowledge, no person is seriously considering cutting people out of the loop any more than you can completely replace the engine in your car with a turbo charger. We (the Air Force Satellite Control Facility, Plans & Programs Division) plan to issue the next version of our masterplan in late December, which will describe our thinking in detail. If you can come up with a good reason why I should send you a copy, send a request to: AFSCF/XRP Attn: Capt Richard Jennings PO Box 3430 Sunnyvale, CA 94088-3430 on letterhead requesting a copy of REVISION G, and stating your reason. The document is not classified, but for obvious reasons, distribution is limited, and I may have to argue for your copy on a case by case basis. People have to do a lot more than write fiction about their expert systems to get our serious interest. Rome Air Development Center, and the AFSCF both now have Symbolics 3670's to evaluate these systems: RADC in the context of the current state of the art, and the AFSCF in the context of satellite control. The AFSCF is also in the process of putting IBM-PC AT's into operations areas to evaluate the PC-AT as a delivery vehicle in the context of distributed shells such as KEE. One large defense contractor also know for dominating the PC marketplace, as in *** PC, has tried for 4 years to solve one of our operational problems *using their own funds* without acceptance. Back to GE, they are visiting us next week, and will get a chance to show their system to the people who fly satellites for a living if they sufficiently impress the Plans and Programs people. Regards, Rich. PS. Standard Disclaimer: I definitely hold opinions, but I am not always successful at conveying them to my employer -- so they should be considered my own personal opinions. PSS. Perhaps I have been going after a gnat with a terminal air defense system, but the concerns raised by Bill Anderson seemed to be a good leadin to a request for information (by me) about what we should be doing. ARPA: jennings@aerospace AV: 799-6427 ATT: 408 744-6427 sNAIL: AFSCF/XRP(Jennings), PO Box 3430, Sunnyvale CA, 94088-3430. ------------------------------ Date: Sat, 21 Sep 1985 03:57 EDT From: MINSKY%MIT-OZ@MIT-MC.ARPA Subject: AIList Digest V3 #125 I am amused at Bill Anderson's flame, in view of his righteous indignation about an AI author's boasts about the merits of AI programming. It's simply ludicrous to state that current AI systems are better in battlefield situations than humans. >From what we could see of the paper in question, there was no suggestion about being better than humans. The suggestion was that AI systems are better than conventional software. What was the last AI system that could drive a tank, carry on a conversation, and fix a broken radio whilst under enemy fire? To my knowledge, ONLY AI systems, so far, can drive cars, carry on conversations, and debug electronic systems. They don't do these jobs very well yet, but they're coming along -- and have no competition in those areas from any other kind of software. So one could certainly say that Anderson's representation is "appalling". The second comment is equally misleading. To contrast "formal and algorithmic" with "robust" seems to imply that algorithms and formal procedures are inherently not robust. On what is this claim based? It sounds like a recipe for unreliable software to me. I think it is a fair claim. This is because it appears infeasible to prove the correctness of non-trivially complex programs, especially because of the profound weakness of all known formal specification languages, without which formal systems are entirely impotent. In such circumstances, AI methods which employ many kinds of redundancy and plausibility tests, e.g., comparing plans to models, are the best methods available. They have a long way to go, but I suspect that, for sufficiently complicated jobs, even the crude "expert systems" of today are already ahead of all other practical forms of commercial or theoretical programming methods. How can someone write this stuff? I know, to make money. But if this is the kind of information that is presented to the military, and upon which they make decisions, then how can we expect any kind of fair assessment of the possible projects in the Strategic Computing (and Defense) Initiatives? How can this kind of misinformation be rebutted? This is a complicated subject and it won't clarify it by making that kind of accusation. I have not heard enough good ideas to be convinced, incidentally, that SDI is a feasible replacement for MAD. But, I certainly am dismayed by the strange arguments I've heard from the CS community about why the hard problem with it is "software". It seems to me that the hard problem is centered around the proposed defensive weapons, and if they're any good (which I doubt) then aiming and controlling them should not be unusally difficult. The arguments I've seen to the contrary all seem to be political flames. So is this, I suppose, hence I don't plan to defend what I've said here in more messages. ------------------------------ Date: Sat, 21 Sep 85 10:35 EST From: Carole D Hafner Subject: Honesty and the SDI: Reply to Bill Anderson I was pleased to see Bill Anderson's comments on AILIST, and I admire his courage for publicly criticizing the "Expert Battlefield Management System" research. He is not alone - there are many people in the AI field and Computer Science in general who view these projects - with their definite schedules for implementation of the various components - with alarm. However, to say or imply that unscrupulous people are making these promises just to "make money" is an oversimplification. >From the beginning of Computer Science as a separate subject in the early 1960's (or perhaps a bit earlier), much if not most of the research funding has come from the DOD. This is especially true for AI. This is not the case in most other Western countries, where there are specific agencies for funding scientific research, and the military services are more focused on military projects. Over the years, the DOD-supported research groups provided a wonderful environment to pursue AI research - the most money, the best equipment, access to ARPANET, etc. And the DOD allowed the researchers a great deal of freedom in pursuing their interests. As a result, many of the best researchers ended up working in these groups. I have always felt that this is, structurally, a very dangerous situation both for Computer Science and for the country. For a very simple reason: if the livelihood of a majority of AI researchers is dependent on the DOD, how can we have a free and open debate on the use of computers in the military? Now it looks as if some of my fears are coming true. I know some of the researchers involved in SDI have severe misgivings about it - but if you have a 20-30 person group who all depend on the DOD for their jobs, it's a tough situation. I personally would like to see groups such as "Computer Professionals for Social Responsibility" attack the structural problem rather than "Star Wars" per se. It is likely that the promises being made for the battlefield management systems will not be fulfilled - since researchers in industrial labs are still struggling with the problem of recognizing stationary objects in a "bin of parts", and most industrial vision systems have to use special lighting to recognize separate parts moving on a conveyer belt. Furthermore, speech understanding systems require ideal conditions and even then only work with very limited vocabularies. So it's interesting to wonder how the description of the complex events taking place during the battle will be communicated to the computer. Perhaps the field of AI is fortunate that the SDI is happening now instead of 20 years from now. We have a chance to get our research funded on a different basis, so that this unfortunate situation won't happen again. Carole Hafner College of Computer Science Northeastern University csnet: hafner@northeastern ------------------------------ End of AIList Digest ******************** From csvpi@vpics1 Mon Sep 23 04:49:51 1985 Date: Mon, 23 Sep 85 04:49:47 edt From: csvpi@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a003438; 23 Sep 85 2:41 EDT Date: Sun 22 Sep 1985 22:46-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #127 To: AIList@SRI-AI Received: from rand-relay by vpi; Mon, 23 Sep 85 04:32 EST AIList Digest Monday, 23 Sep 1985 Volume 3 : Issue 127 Today's Topics: Seminars - Spencer-Brown Seminar in San Francisco & Knowledge Representation (SRI) & Knowledge-Directed Database Management (IBM-SJ) & Learning Spatial Concepts (CSLI) & 2nd-Order Lambda Calculus (UPenn) & Computer Tutor for Programming Recursion (UCB), Course - AI Theories of Belief and Action (SU) ---------------------------------------------------------------------- Date: Wed, 18 Sep 85 13:15:23 pdt From: william@aids-unix.ARPA (william bricken) Subject: Spencer-Brown seminar in San Francisco G. Spencer-Brown, the author of LAWS OF FORM, will be presenting a five-day seminar at the Miyako Hotel in San Francisco, from October 7 through 11, 1985. Morning sessions will address the technical methodology of Laws of Form. Afternoon sessions will address "open intelligence", Spencer Brown's ideas on life and living. Registration costs: $650 for both sessions, $300 for afternoons only. Information: UNI-OPS 260 Marshall Drive Walnut Creek, CA 94598-2833 phone Walter Zintz, (415) 945-0048 PERSONAL COMMENTS: Spencer-Brown's work on the 4-color map theorem was discussed in this list early last year. The man is an iconoclast, and has managed to alienate a significant portion of most audiences. The afternoon session may be anything from EST training (which Spencer-Brown is said to have originated) to metaphysical ecstacy. The application of Brownian mathematics to representation theory and automated theorem proving in AI is profound. Followers of his work range from mystics to mathematicians; he is both. I have heard that he is not talking to mathematicians. william ------------------------------ Date: Wed 18 Sep 85 15:19:44-PDT From: LANSKY@SRI-AI.ARPA Subject: Seminar - Knowledge Representation (SRI) THE SKY IS A BLUE COLOR Marcel Schoppers SRI International AI Center 11:00 AM, MONDAY, September 23 SRI International, Building E, Room EJ228 (new conference room) I present a representation which will allow us to encode and access much of the information contained in simple descriptive statements. "The sky is a blue color" entails that blue is a color, that the sky has a color, that the sky is blue, that the sky is visible, and that the sky is located both spatially and temporally. These generalizations are so trivial that they border on presuppositions, and they have consequently been taken for granted in semantic nets and frames. Making such information explicit greatly increases the density and usefulness of stored knowledge. One interesting application is to disambiguate an adjective/predicate to suit a given noun/extension. My representation is parsimonious, having O(three) primitive con- structs (link types); is highly irredundant, since blue(sky) and color(blue) reference the same blue; and is static, being inten- ded to formalize and implement "massively parallel" deterministic connectionist question-answering systems. Predicates, relations, and simple forms of quantification all emerge as by-products of function applicability and set inclusion. Viewed as a logic the representation is potentially O(w), intensional and inconsistent. The talk will touch on issues in philosophy of logic and linguistics. I will especially appreciate constructive criticism in those areas, as I am a novice there. ------------------------------ Date: Wed, 18 Sep 85 15:34:00 PDT From: IBM-SJ Calendar Subject: Seminar - Knowledge-Directed Database Management (IBM-SJ) IBM San Jose Research Lab 5600 Cottle Road San Jose, CA 95193 CALENDAR SEPTEMBER 23 - 27, 1985 Thurs., Sept. 26 Computer Science Seminar 10:00 A.M. PROBE: A RESEARCH PROJECT Aud. B IN KNOWLEDGE-DIRECTED DATABASE MANAGEMENT Conventional record-based DBMSs will be inadequate for many of the knowledge-intensive information processing applications (e.g., business and industrial automation, CAD/CAM, and military command and control) of the future. These applications require integrated access to a variety of information types (e.g., images, maps, signals, text) not currently supported by DBMSs. Also, they rely on specialized knowledge or expertise for processing the new information types; for many of these types, specialized storage devices and processors (e.g., workstations, image enhancers, solid modellers), are or will be available. Currently, DBMSs have no general facilities for efficiently assimilating and utilizing this special knowledge or for incorporating these specialized processors into their own processing. The objective of the PROBE project is to develop an advanced DBMS effective for these knowledge-intensive applications. Our approach is to enhance existing DBMSs with (a) user-defined object classes as the basis for defining new information types and operations and for integrating specialized processors, (b) dimensional (space and time) concepts, which are a common characteristic of many of the new information types, and (c) recursive predicates and queries, which provide intensional knowledge processing capabilities essential for many of the applications. In each case, it is necessary to augment both the logical (data model, query language) components and the physical (storage structures, access methods, query processor) components of the DBMS. In this talk, we describe approaches to addressing all these issues. Dr. U. Dayal, Computer Corporation of America Host: C. Mohan ------------------------------ Date: Thu 19 Sep 85 08:14:26-PDT From: Emma Pease Subject: Seminar - Learning Spatial Concepts (CSLI) [Excerpted from the CSLI Newsletter by Laws@SRI-AI.] ``Crossing the Rubicon: From a Physics of Dead Coordinate Spaces to a Physics of Living Coordinate Spaces'' Dr. Peter Kugler, The Crump Institute for Medical Engineering, UCLA Monday, September 23, 1985, 2:15pm, Ventura Hall This talk will be about self-organizing systems that involve low-energy (nonforce) coupling and the nature of the predicates that constitute the low-energy descriptors, and will be organized around issues pertaining to general problems of language and information. The emphasis will be on systems that generate (self-assemble) new levels of description. These new levels constitute new languages parasitic on the lower level languages but not reducible to their predicates. In the self-organizing systems of interest it is the ``coordinate spaces,'' which are themselves evolving, that become the important objects of study. Instead of assuming a fixed coordinate space, when the interest focuses on trajectories, attention is devoted to the coordinate space itself, since this is what provides the semantics. This approach is very similar to developments in computer architecture that focus on parallel processing. In these machines (connection machines, Boltzmann, etc.) the machine language self-organizes (e.g. programs itself through the emergence of new stable configurations), and the new predicate descriptions play the role of symbols in terms of their opacity with respect to the lower level language. The machine language `gives birth' to the symbolic level of description. This situation contrasts dramatically with that of von Neumann machines, for which the symbolic language is ontologically independent of the machine language. A symbolic language can run on any of an infinite variety of mechanistic substrates, the primacy of the symbol prevailing over the substrate machine. The approach advocated here, puts the focus on the machine level of interaction, thus preserving an ontological continuity and avoiding mind/body, syntactic/semantic, etc. problems. ------------------------------ Date: Fri, 20 Sep 85 11:06 EDT From: Tim Finin Subject: Seminar - 2nd-Order Lambda Calculus (UPenn) THE 2ND ORDER LAMBDA CALCULUS - Dale Miller, Penn CIS Joint Mathematics / Computer Science Logic Colloquium 4:40 Monday 23 September 1985, DRL 4E17, University Of Pennsylvania In this talk we will present the description of an extended type lambda calculus where types can be used as values. We will illustrate how this language can be used to perform computation in novel fashions and what semantics might work with it. ------------------------------ Date: Wed, 18 Sep 85 11:12:07 PDT From: davies%ucbcogsci@Berkeley (Catherine Davies) Subject: Seminar - Computer Tutor for Programming Recursion (UCB) BERKELEY COGNITIVE SCIENCE PROGRAM Fall 1985 Cognitive Science Seminar -- IDS 237A TIME: Tuesday, September 24, 11:00 - 12:30 PLACE: 240 Bechtel Engineering Center (followed by) DISCUSSION: 12:30 - 1:30 in 200 Building T-4 SPEAKER: Peter Pirolli, School of Education, UC Berkeley TITLE: ``A Cognitive Model and Intelligent Computer Tutor for Programming Recursion'' Recursion is typically a novel concept for programming stu- dents that causes them considerable grief and difficulty. Thus, the study of how people learn to program recursive pro- grams provides a useful domain for addressing the psychologi- cal issue of how fundamentally new knowledge is acquired as well as the instructional issue of how to teach a difficult programming concept. I will present a production system model that addresses expert and novice problem-solving, problem- solving by analogy, and skill acquisition in programming recursive functions. This research served as the basis for the development of recursion lessons in an intelligent com- puter tutor for programming LISP. Specifically, a simulation model of ``ideal'' and ``buggy'' novice problem-solving was con- structed for coding recursion. Using this model, the LISP tutor provides instruction, hints, and feedback in the context of programming. The LISP tutor also maintains a model of the skill development of individual students. Evaluations show that the LISP tutor is more effective in teaching introductory LISP programming than good classroom instruction and approaches the effectiveness of human tutors. ------------------------------ Date: Wed 18 Sep 85 09:26:04-PDT From: Kurt Konolige Subject: Course - AI Theories of Belief and Action (SU) [Forwarded from the Stanford bboard by Laws@SRI-AI.] Announcement of a new course in Artificial Intelligence: CS429: Formal AI Theories Of Belief and Action Instructor: Kurt Konolige, SRI International and CSLI Description: We will discuss some formal commonsense theories of belief and action that have emerged over the last 5-7 years. This course is intended both as a survey of recent research in this area, and as an introduction to the application of techniques from formal logic to AI problems. The emphasis is on acquiring a facility for working with the tools of logic, especially by analyzing and critiquing current AI research. The following is a list of topics we will cover: 1. Knowledge and Belief - Kripke and sentential semantics - Modal logics for knowledge and belief - Proof methods for quantified modal logics, including recent resolution methods 2. Formal planning theories - The situation calculus - Integration of action and belief 3. Further topics - Introspective belief theories - The relation between introspection and nonmonotonic reasoning Prerequisites: Some familiarity with basic concepts from first-order logic will be assumed, e.g., students should know what what a model is, how to construct proofs from axioms and rules of inference, and so on. Requirements: Graduate-level course for CS students, 3 units. Students will be expected to read 1-2 papers a week. There will be one problem set a week, and either a project or final exam. Time: MWF 11am (50 min), MJH 352, Fall 1985 ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Tue Sep 24 09:33:35 1985 Date: Tue, 24 Sep 85 09:33:31 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,RDJ,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a013353; 24 Sep 85 0:32 EDT Date: Mon 23 Sep 1985 20:35-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #128 To: AIList@SRI-AI Received: from rand-relay by vpi; Tue, 24 Sep 85 09:25 EST AIList Digest Tuesday, 24 Sep 1985 Volume 3 : Issue 128 Today's Topics: Query - Expert Systems for Knowledge Engineering, Knowledge Representation - Cooperative Structuring of Information, Literature - AI Interactions, Vol. 1, No. 1 and 2 & Aerospace Applications of AI Proceedings, Expert Systems - Hype ---------------------------------------------------------------------- Date: Mon, 23 Sep 85 12:13:28 mdt From: crs%a@LANL.ARPA (Charlie Sorsby) Subject: Knowledge Engineering > Date: 14 Sep 1985 07:21 EDT (Sat) > From: Wayne McGuire > Subject: Lisp vs. Prolog vs. ? > > Predicting what language will be most used for AI is problematic since > there seems to be little agreement about what AI is. Let's assume, > however, that over the next decade or two ''AI'' will refer primarily > to expert systems. > ... > (1) Natural language understanding systems which can translate > raw text directly into working knowledgebases. We probably won't see > such systems on a large scale, which can operate with any degree of > reliablity, for at least another twenty-five years, and perhaps much > longer. > > (2) The laborious interviewing of domain experts by expert system > experts (if you will), and the transcription of those interviews into > programs. > > (3) The direct encoding of knowledge into expert systems by > domain experts themselves. What work is being done toward the objective of combining (2) and (3)? I. e. who is working on "expert system" expert systems incorporating the knowledge of these expert system experts into an expert system that will interview experts in other fields to free the human expert system experts from the laborious interviewing tasks so that they can do more creative work? I just read that paragraph! All those "experts" and "systems" sure make it read as double talk but it is an honest question. Is any work being done in this area? Thanks. Charlie Sorsby ...!{cmcl2,ihnp4,...}!lanl!crs crs@lanl.arpa ------------------------------ Date: 14 Sep 1985 16:07-EDT From: Lowe@NYU-CSD2 Subject: Cooperative structuring of information [Excerpted from the IRList by Laws@SRI-AI.] Readers of IRList may be interested in research I have been doing on methods for information retrieval that are not based on the use of keywords. [...] Therefore, I have been developing a structured representation for debate in which the computer maintains a record of the reasoning behind each decision. Rather than simply voting on the correctness of each item in the database, users are required to indicate which items of evidence support or refute a particular conclusion. Not only are users more likely to agree on whether specific evidence supports a conclusion than they are to agree on the conclusion in the abstract, but the representation provides a record for each user of what others have considered to be the best available evidence bearing on each conclusion. The representation is used not only to debate aspects of presentation and indexing, but also to represent the content of much of the material in the database as a snapshot of the reasoning process that links the concepts in mind of each user. The specific representation that is used for debate is derived from the theory of argument developed by the British philosopher Stephen Toulmin. There is not space here to give a full explanation of the system, but I have written a fairly detailed paper on the topic. This paper was published as "The representation of debate as a basis for information storage and retrieval" by David G. Lowe, AFIPS Conference Proceedings Volume 53, 1984 National Computer Conference, pp. 595-603. A more extensive version of this paper will soon be published in the International Journal of Man Machine Studies. I will be happy to mail copies to anyone who sends me their U.S. mail address. I can be reached at LOWE@NYU-CSD2 on the ARPANET or the following address: Prof. David Lowe Courant Institute of Mathematical Sciences 251 Mercer Street New York, NY 10012 [...] My own research background is in artificial intelligence, but I have come to believe that the best route to progress lies in having the computer represent the content of information in the manner of AI systems while leaving the input task up to human users. This type of system is well within the scope of existing technology and would greatly increase the range of applications for information retrieval. ------------------------------ Date: 22 Sep 1985 14:17-CST From: leff%smu.csnet@CSNET-RELAY.ARPA Subject: AI Interactions, Vol 1, No 1 and 2 AI Interactions is published by the Texas Instruments' Data Systems Group AI Interactions, Volume 1 Number 1, August 1985 summary: Discussions of TI products: Explorer (Lisp Machine), Personal Consultant (Expert System building tool), Arborist (decision tree tool), NaturalLink (menu based natural language system) and Speech Command (speech input). Discussion of Campbell's Soup developing expert system to diagnose large "cookers" which produce soup. The California Firm, The Scientific Press, is developing a textbook on decision analysis based on Arborist. TI is supporitng expert system development projects at various universities including: Statistical Consultant, Carleton College Weld Selector, Colorado School of Mines Analysis and prevention of mechanical failures, Duke University Material Handling Equipment Selector, North Carolina State University Controlling Plant Life in Ponds, North Texas State University Credit Limits for Industrial Customers, University of Delaware Health Care Billing Advisor, Ohio State University Utilizing Part Characteristics to Determine Feeding and Orienting Devices for Automatic Assembly, Texas A&M University Expert Linear Programming System, The American University Predicting and Measuring the Risk of a Small Business Becoming Insolvent, University of Texas at Dalls Expert General Library Reference Work, Drexel University AI Interactions, Volume 1 Number 2, September 1985 Summary: Discussion of 42 million dollar Explorer contract by Sperry Corporation Work done by Marc Victor in using Arborist to help lawyers decide whether to continue with a law suit and settle. Some technical tips on using Arborist and Personal Consultant TI is selling a Personal Computer Plus for $2950. It supports compiled lisp and 2000 knowledge base elements (rules and unique parameters). It also adds graphics and extended frame capability. Personal Computer Consultant itself is selling for $950 or with comprehensive training for $1750. Infomart, the first shopping mall devoted solely to information technology, is using a personal computer based expert system called SNAP to help first time users help them decide what kind of computer they need. Carnegie-Mellon and National Bureau of standards has developed an expert system to evaluate soil prior to excavation of shallow trenches. This is designed to help prevent cave ins. ------------------------------ Date: 23 Sep 1985 21:40-EDT From: cross@wpafb-afita Subject: Conference Proceedings - Aerospace Applications of AI The proceedings for the First Annual Aersopace Applications of Artificial Intelligence are available. The cost is $30.00. Send a check or money order to: AAAIC'85 PO Box 31250 Dayton, Ohio 45431-0250 For information call (513) 426-8530. ------------------------------ Date: Sun 22 Sep 85 17:16:17-PDT From: Bill Poser Subject: exaggerated claims In response to Bill Anderson's observation about grossly exaggerated claims for AI systems, I don't think that this has a purely pecuniary motivation, althought that certainly may play a role. As Herbert Dreyfus documents in the first part of his "What Computers Can't Do", grossly exaggerated if not blatantly false claims about the capabilities of AI programs have been common from the very beginning, even in cases (such as chess playing programs) where there was no monetary gain in sight. ------------------------------ Date: Sun, 22 Sep 85 19:44:48 PDT From: Richard K. Jennings Subject: SDI/AI/Free and open Debate The Strategic Computing Program (DARPA) and SDI are opportunities for technologists to convince the US Military that they have something to offer. Contrary to some of the recent comments on this net (and on ARMS-D) the US Military is not constituted from defunct latin american dictatorships. There is a raging debate within the military on the utility of AI for battle management, and the USAF *pays* people to shoot holes in it. For those interested in the history of technology, most of the things we take for granted (microelectronics, automobiles, planes, interstate highway system) were gestated and field tested by the US Military. SDI (ie. Space Development Initiative) is laying the ground work for the commercialization of space which we will all take for granted in 2000 or so. The AI community (Minsky et al) feel that they have something to offer, and I concur with providing them funding to put up or shut up. As usual, we will probably find that their initial claims were a bit optimistic, but in the end they will have made a fundamental contribution to the fabric of the incomparable standard of living afforded by our nation. If you are willing to stay off the interstate higways, the inland waterways, airplanes and other fruits of technology ripened by close association (computers, and computer networks as has been pointed out) -- worry about the military and AI and SDI. But upon close inspection, I think it is better that the military have the technology and work the bugs out on trivial things like autonomous tanks BEFORE it is an integral part of an artificial life support system. Rich. ------------------------------ Date: 23 Sep 85 09:22:00 EDT From: "CUGINI, JOHN" Reply-to: "CUGINI, JOHN" Subject: AI hype I've been reading the laments, complaints, etc regarding AI hype with some interest; here's my $.02 worth. I believe that the level of promotional gas *is* higher in expert systems, AI, etc, than in other aspects of the computer field (e.g., graphics, DBMS), and than in many sciences (chemistry..) and engineering disciplines (bridge-building...). Howcome?? Well, it seems to me that a unique aspect of AI is that it is involved with commercial products for which we have *a priori* expectations as to performance, because we are already familiar with a system that does the same thing. Notice the difference in reaction: if someone tells you (before you've ever heard of VCRs) that he's got a marvelous machine that will let you record and play back TV shows, you're happy that such a thing is possible at all. You are willing to accept extra constraints and features as "part of the package" (eg you can't record and play at the same time, you can pre-set to record at some future time, a tape is good for 6 hours, ...). But if someone tells you he's got a machine that will: diagnose blood diseases, read a map, drive a car, compose music, play chess, do arithmetic, etc, etc, the immediate question is: does the machine do it better or worse than me, or some other representative of the species? If the machine is a lot better (200 googol floating-point square roots per nanosecond or whatever) we are suitably impressed and will buy several. But if the map-reader can't tell the difference between a secondary road and a river, well... Take a physical analogy: suppose someone were selling a machine that would chop and stack firewood (all by itself). Aside from the cognitive capabilities involved, wouldn't we expect that such a machine could stack at least as neatly as people? Handle wood chunks of at least a reasonable size? Complete the task at least as fast as a person? Justifiably or not, we would probably ask whether we were better off buying the machine, or just paying someone to do the job. Since AI, by definition, seeks to replicate areas of human cognitive competence, its results will tend to be judged in light of human performance. And, lurking in the background is the economic question: Am I better off hiring humans or buying expert systems to get this job done? No such issue arises with VCRs, or with DBMSs, for that matter. That is, hiring people is not a practical alternative - either the capability is worth the price or it's not. And so, in semi-conscious response to this attitude, purveyors of AI software feel compelled to make their wares sound impressive, not only with respect to what's been done a year ago, but with respect to human capabilities. John Cugini Institute for Computer Sciences and Technology National Bureau of Standards Bldg 225 Room A-265 Gaithersburg, MD 20899 phone: (301) 921-2431 ------------------------------ End of AIList Digest ******************** From comsat@vpics1 Thu Oct 3 16:20:46 1985 Date: Thu, 3 Oct 85 16:20:32 edt From: comsat@vpics1.VPI To: france@opus (FRANCE,JOSLIN,ROACH,FOX) Subject: From: AIList Moderator Kenneth Laws Status: R Received: from sri-ai.arpa by CSNET-RELAY.ARPA id a001368; 1 Oct 85 20:03 EDT Date: Sun 29 Sep 1985 11:14-PDT Reply-to: AIList@SRI-AI US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 Subject: AIList Digest V3 #129 To: AIList@SRI-AI Received: from rand-relay by vpi; Thu, 3 Oct 85 15:59 EST AIList Digest Sunday, 29 Sep 1985 Volume 3 : Issue 129 Today's Topics: Queries - FRANZ Questions, AI Tools - Public domain Prolog and Hope, Psychology - A Counterexample to Modus Ponens, Literature - New CSLI Reports & Recent Technical Reports, Articles ---------------------------------------------------------------------- Date: Mon, 23 Sep 85 17:39:06 cdt From: Raj Doshi Subject: FRANZ-unix question... > In Franz, how can I access the following:- (1) The user's name (not just the login name, but also the actual name from the '.plan' (or whatever) file ??? (2) The date. Thank you very much. --- raj doshi, University of Minnesota doshi%umn.csnet@csnet-relay.arpa Raj Doshi 2030 Wilson Avenue, Apt #27 Saint Paul, MN 55119 (612)-739-2353 (612)-739-2151 ------------------------------ Date: Tue, 24 Sep 85 20:58:58 cdt From: Raj Doshi Subject: unknown prop.lists .. **** QUESTION about FRANZ-LISP, atoms & their properties :- Suppose that I have access to an atom (i.e. I know its NAME). But I don't know anything more about it. Now, is there a FRANZ function, whereby I can ask franz to RETURN/LIST all the properties, (given to the atom via PUTPROPs by the user). if any, (and maybe their values) to me ??? Maybe the creators of FRANZ didn't see the need for such a function or maybe they did not think about this, but, I am sure FRANZ has to keep track of an atom's properties (probably in an array or frame like structure). HOW DOES FRANZ actually STORE THE properties OF ATOMS ?? If I know this, I could (probably?) write the function myself. Thanks in advance. --- raj doshi, University of Minnesota [Full address in first message of this digest. -- KIL] ------------------------------ Date: Tue, 24 Sep 85 21:53:59 cdt From: Raj Doshi Subject: i AND o .... **** Question about CONCURRENT i/o to the SAME file. I am trying to do the following in Franz-Lisp:- I have a file which has some stuff in it (= it is non-empty). First, I want to *append* something to it (that is, I want to write something FROM its end-of-file; I want to preserve its original contents). Then, I want to read something from the start-of-the-file. Then, I want to *append* something-new to the new-version of this file. Now, I have tried the following:- Lets say that the file name is fn. TRY #1 : setq portout (outfile 'fn) fseek portout (filestat:size (filestat 'fn)) ;Filestat take only 2 param. 0) (defun p-raj () (patom "Hi-raj" portout)) (p-raj) (p-raj) ---------------- The problem with this is that the >setq portout (outfile 'fn) seems to AUTOMATICALLY and PERMANENTLY put the r/w-cursor at the START of the file (without my permission). Also, once this is done, FSEEK become impotent. It will always send back a zero. Also, a FILEPOS has no effect. Basically, you cannot move the @<@!!# cursor unless you write (and therefore overwrite the original contents) something to the file. Note however that, if I had not done setq portout (outfile 'fn) then, >(filestat:size (filestat 'fn)) does return the true (unix) size of the file. @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ TRY #2 : (setq inout (infile 'fn)) (fileopen 'fn 'w+) ; FILEOPEN takes only 2 parameters. ; you can also try the following ; (fileopen 'fn 'a+) (filepos portio) [this gives back a zero, which is ok.] (filestat:size (filestat 'junk)) [this does give its true size, say 232 blocks.] (filepos portio (filestat:size (filestat 'junk))) [this does put the r/w-cursor at 232.] (filepos portio) [this confirms that.] (patom "IS this really going to get appended ?" portio) [this prints the above string on the TERMINAL, not onto the file fn.] (filepos portio) [the cursor is STILL at 232.] Basically, I think that the reason it won't write to the file fn in this second case is that the was defined for reading and not for writing. {Is this the correct impression ?} [I have tried many many different permutations also.] SO, in brief, a automatically puts the cursor at the start-of-the-file; and the FILEOPEN, FILEPOS, FSEEK dont seem to have any effect. and, a never allows me to write onto the file atall even if I do a . >>>>>> QUESTION: What am I missing here ?? <<<<<< Thanks in advance. --- raj doshi, University of Minnesota [Full address in first message of this digest. -- KIL] ------------------------------ Date: Mon, 5 Aug 85 10:09:19 pdt From: Peter Ludemann Subject: Public domain Prolog, Hope [Forwarded from the Prolog Digest by Laws@SRI-AI.] The August 1985 issue of BYTE magazine has a number of articles on Declarative Languages (Prolog, Hope, FP). Public domain versions of Prolog (from Automata Design Associates) and Hope (from Imperial college) for MS-DOS machines are apparently available from BYTEnet at (617) 861-9774. [...] -- Peter Ludemann ------------------------------ Date: Fri, 27 Sep 85 10:57:18 edt From: John McLean Subject: A Counterexample to Modus Ponens In the most recent issue of The_Journal_of_Philosophy, there is an article by Vann McGee that presents several counterexamples to modus ponens. I am not sure whether to count them as counterexamples or as cases where we hold inconsistent beliefs. If the latter view is right, it should be of interest to those who model belief systems. One example of McGee's suffices to give the flavor of his article. Before the 1980 presidential election, many held the two beliefs below: (1) If a Republican wins the election then if the winner is not Ronald Reagan, then the winner will be John Anderson. (2) A Republican will win the election. Yet few if any of these people believed the conclusion: (3) If the winner is not Reagan then the winner will be Anderson. John ------------------------------ Date: Wed 25 Sep 85 16:54:08-PDT From: Emma Pease Subject: New CSLI Reports [Excerpted from the CSLI Newsletter by Laws@SRI-AI.] NEW CSLI REPORTS Report No. CSLI-85-31, ``A Formal Theory of Knowledge and Action'' by Robert C. Moore, and Report No. CSLI-85-32, ``Finite State Morphology: A Review of Koskenniemi'' by Gerald Gazdar, have just been published. These reports may be obtained by writing to David Brown, CSLI, Ventura Hall, Stanford, CA 94305 or Brown@SU-CSLI. ------------------------------ Date: 27 Sep 1985 19:49-CST From: leff%smu.csnet@CSNET-RELAY.ARPA Subject: Recent Technical Reports Addresses for requests: Carnegie Mellon University, CS Department, Pittsburgh, PA 15213 Stanford University, Department of Computer Science, Stanford, CA 94305 ____________________________________________________________________________ %A Zohar Manna %A Richard Waldinger %T The Origin of the Binary Search Paradigm %R STAN-CS-85-1044 %I Stanford University Department of Computer Science %D MAR 1985 %X $2.75 - shows how binary search based algorithms in numerical analysis would be derived by an automatic program-synthesis system %A Anne von der Leith Gardner %T An Artificial Intelligence Approach to Legal Reasoning %R STAN-CS-85-1045 %I Stanford University Department of Computer Science %D JUN 1984, 205 pages (microfiche only $2.00_ %A Jeffrey D. Ullman %A Allen Van Gelder %T Testing Applicability of Top-Down Capture Rules %R STAN-CS-85-1046 %I Stanford University Department of Computer Science %D APR 1985 %X $2.50 We extend the theory of "Capture rules", introduced in Ullman (1984) and Sagiv and Ullman (1984), as a way to plan the evaluation of queries in a "knowledge base." The central issue of the paper is how to adorn the nodes of a rule/goal graph with limited amounts of information that can be used to test wehtehr one can answer a query "top-down" as a Prolog would. Moreover, the test must be performed quickly, preferably in time that is polynomial in the size of hte logical rules in the "knowledge base." We define the "uniqueness" property for rules and give an efficient algorithms to generate a set of equalities among the sizes of arguments in sets of such rules. Satisfaction of these inequalities is sufficient for the top-down processing of rules to cnverge. We then give an efficient test for satisfaction of these inequalities. There is, of course, no polynomial test that is both necessary and sufficient for applicability of this or most any interesting capture rule. %A Zohar Manna %A Richard Waldinger %T Special Relations in Automated Deduction %R STAN-CS-85-1051 %I Stanford University Department of Computer Science %K relation replacement rule relation matching rule polarity %D MAY 1985 %X $4.00 %A Martin Abadi %A Zohar Manna %T Nonclausal Temporal Deduction %D JUN 1985 %R STAN-CS-85-1056 %I Stanford University Department of Computer Science %D JUN 1985 %K propositional temporal logic %X 2.75 %A Ian A. Mason %A Carolyn L. Talcott %T Memories of S-expressions, Proving properties of Lisp-like programs that destructively alter memory %D JUN 1985 %R STAN-CS-85-1057 %I Stanford University Department of Computer Science %X $3.50 %A Masaru Tomita %T An Efficient Context-free Parsing Algrithm for Natural Languages and its Applications %D MAY 1985 %I Carnegie Mellon Computer Science %A Gary L. Bradshaw %T Learning to Recognize Speech Sounds: A Theory and Model %D JUN 1985 %I Carnegie Mellon Computer Science %A Masaru Tomita %T Feasibility Study of Personal/Interactive Machine Translation Systems %D JUL 1985 %I Carnegie Mellon Computer Science %A Jaime G. Carbonnell %A Masaru Tomita %T New Approaches to Machine Translation %D JUL 1985 %I Carnegie Mellon Computer Science %A Robert E. Frederking %T Syntax and Semantics in Natural Language Parsers %D MAY 1985 %I Carnegie Mellon Computer Science %A Jeannette M. Wing %A Farhad Arbab %T Geometric Reasoning: A New Paradigm for Processing Geometric Information %D JUL 1985 %I Carnegie Mellon Computer Science %A Jeannette M. Wing %A Mark R. Nixon %T Adding Temporal Logic to Ina Jo %D JUL 1985 %I Carnegie Mellon Computer Science %K temporal logic formal specification %A Ketan Mulmuley %T A Mechanizable Theory for Existence Proofs of Inclusive Predicates %D JUL 1985 %I Carnegie Mellon Computer Science ------------------------------ Date: 27 Sep 1985 20:02-CST From: leff%smu.csnet@CSNET-RELAY.ARPA Subject: Recent Articles D BOOK15 Applications of Artificial Intelligence II\ %D April 9-11\ %I International Society for Optical Engineering (SPIE)\ %C Bellingham, Washington D BOOK16 Solid Modeling by Computers From Theory to Applications\ %D SEP 25-27 1983\ %I Plenum Press\ %O (sponsored by) General Motors Research Laboratories of Warren Michigan D BOOK17 Applications in Artificial Intelligence\ %I Petrocelli Books\ %C Princeton, New Jersey\ %E Stephen J. Andriole %A Paul J. Besl %A Ramesh C. Jain %T Three-Dimensional Object Recogniton %J Computing Surveys %D March, 1985 %A Elain Marsh %A Carol Friedman %T Transporting the Linguistic String Project from a Medical to a Navy Domain %J ACM Transactions on Office Information Systems %D APR 1985 %A Jonathan Slocum %A Carol F. Justus %T Transportability to Other Languages: The Natural Language Processing Project in the AI Program at MCC %J ACM Transactions on Office Information Systems %D APR 1985 %A Samuel S. Epstein %T Transportable Natural Language Processing Through Simplicity %J ACM Transactions on Office Information Systems %D APR 1985 %A Bozena Hernisz Thompson %A Frederick B. Thompson %T ASK is Transportable in Half a Dozen Ways %J ACM Transactions on Office Information Systems %D APR 1985 %A Fred J. Damerau %T Problems and Some Solutions in Customization of Natural Language Database Front Ends %J ACM Transactions on Office Information Systems %D APR 1985 %A Carole D. Hafner %A Kurt Golden %T Portability of Syntax and Semantics in Datalog %J ACM Transactions on Office Information Systems %D APR 1985 %A Graham Birtwistle %T Artificial Intelligence, Graphics and Simulation %I Society for Computer Simulation %D JAN 1985 %X $20.00, 119 pages, ISSN 07359276 %A Willard M. Holmes %T Artificial Intelligence and Simulation %I Society for Computer Simulation %D MAR 1985 %X $20.00 75 pp ISBN 0911801057 %A Strategic Incorporated %T Artificial Intelligence: Computer-Aided Instruction (CAI): Markets, Issues, Suppliers and Technology Trends %I Strategic Corporation %D FEB 1985 %C Cupertino, California %X price $1950.00 %A Perkins %A Laffey %A Nguyen %T Rule-based Interpreting of Aerial Photographs Using LES %J BOOK15 %A Captain Robert Milne %T Functional Reasoning for Fault Diagnosis Expert Systems %J BOOK15 %A Broadwell %A Smith %A Barnette %A Staros %T Decision Aiding for Tactical Aircraft %J BOOK15 %A Appelbaum %A Ruspini %T ARIES: A Tool for Inference Under Conditions of Imprecision and Uncertainty %J BOOK15 %A Klinger %T Search Processes for the Application of Artificial Intelligence %J BOOK15 %A Levitt %A Kirby %A Muller %T A Model-Based System for Force Structure Analysis %J BOOK15 %A Hardt %A Rosenberg %T Developing an Expert Ship Message Interpreter-Theoretical and Practical Conclusions %J BOOK15 %A Rosenberg %T ERIK, An Expert Ship Message Interpreter: New Mechanism for Flexible Parsing %J BOOK15 %A A Adams %A Deutsch %A Harrison %T A hierarchical Planner for Intelligent Systems %J BOOK15 %A Obermeier %A de Hilster %T DIID -- A Data-independent Interface for Databases -- The AI Perspective %J BOOK15 %A Haralick %A Shapiro %T Image Segmentation Techniques %J BOOK15 %A Chestek %A MUller %A Chelberg %T Knowledge Based Terrain Analysis %J BOOK15 %A Forman %T Robot Vision for Depalletizing Steel Cylindrical Billets %J BOOK15 %A Bazakos %A Panda %T Stereopsis and Scene Partititoning for Terrain Interpretation %J BOOK15 %A Lenger %A Cipovic %T Shape Recognition of Complex Objects by Syntactical Primitives %J BOOK15 %A Castore %T Solid Modeling, Aspect Graphs and Robot Vision %J BOOK16 %A Lozano-perez %A Brooks %T An Apporoach to Automatic Robot Programming %J BOOK16 %A Descotte %A Latombe %T GARI, an Expert System for Process Planning %J BOOK16 %A Paul Lehner %A Stephen Barth %T Expert Systems on Microcomputers %J BOOK17 %A Roger Schank %A Steven Shwartz %T The Role of Knowledge Engineering in Natural Language Systems %J BOOK17 %A Jaime Carbonnel %T The Role of User Modeling in Natural Language Interface Design %J BOOK17 %A Gerald Hice %A Stephen Andriole %T Artificial Intelligent Videotex %J BOOK17 %A Jean-Daniel Dessimoz %T Vision for Industrial Robots %J BOOK17 %A Dexter Fletcher %T Intelligent Instructional Systems in Training %J BOOK17 %A Jonathan Weiss %T GenTree A Content Oreinted Aid to Decision Problem Structuring %J BOOK17 %A Roger C. Schank %A Peter G. Childers %T The Cognitive Computer: On Language, Learning, and Artificial Intelligence %X available from Library of Computer and Information Science for members price of $14.50 ------------------------------ End of AIList Digest ********************