From in%@vtcs1 Sun Apr 26 04:10:44 1987 Date: Sun, 26 Apr 87 04:10:28 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #100 Status: R AIList Digest Monday, 20 Apr 1987 Volume 5 : Issue 100 Today's Topics: Queries - Legal Modelling & Embedded Lisp and Ada on 68000 & Request for a Rule Base & OPS5 Programs & Benchmarking Production Systems & Tough Speech Recognition Examples & Training Applications of Expert System Shells & Efficient Implementation of Knowledge Representations & Cognitive Science Grad Schools, News - LMI Bankruptcy & Travel Grant Support for IJCAI-87 & Canadian Artificial Intelligence, April 1987, No. 11 ---------------------------------------------------------------------- Date: 7 Apr 87 16:29:25 EST From: Roger Jagoda Sibley FTOP Subject: Legal Modelling For a change of pace on this net I'd like to ask if anyone out there has any information or experience with Legal (as in LAW not lawful) expert systems. I myself am from the engineering disciplines, but the Law School here is interested in developing a learning tool with a bank of legal precedences as the rule set. The inference engine will be designed by the students as part of the legal argument entered to the computer "judge". The concept sounded so interesting I thought I'd probe the nets and see if there were any of you out there that had some ideas for starting points. If there's enough interest/response I'll summarize the responses back to the list. Thanks in advance. Roger Jagoda Cornell University/CCS Internet: FQOJ%CORNELLA.BITNET@WISCVM.WISC.EDU ------------------------------ Date: 9 Apr 1987 20:43-EDT From: LCELEC@A.ISI.EDU Subject: Embedded Lisp & Ada on 68000 Does anyone know of: 1. An embedded Lisp system, or 2. A 68000-based system that supports Lisp and Ada? We are trying to implement a small real-time program, originally written in 68000, in both Lisp and Ada. Since we would eventually like to do some benchmarking, we would like to keep the Ada and Lisp on the same 68000 machine. Telesoft Ada supports an embedded Ada but there does not seem to be any embedded Lisp. Due to cost constraints, our next alternative is to use some kind of PC. IBM PC supports both Lisp and Ada but is not 68000 based. Any information would be helpful. -- Tracy Mullen (Please respond directly to LCELEC@A.ISI.EDU) ------------------------------ Date: 10 Apr 87 08:05:10 EDT From: ABBOTT@RED.RUTGERS.EDU Subject: request for a rule base A colleague of mine is doing some work on optimization of production systems and needs a rule base or two to test his system. Can anyone provide a reference to a rule base of 50 or more rules? A backward-chaining system is preferred, but not absolutely necessary. All he needs is a listing of the rules themselves, not source code (although source code would certainly be acceptable). Any help would be greatly appreciated. Kathy Abbott abbott@red.rutgers.edu Mail Stop 156A NASA Langley Research Center Hampton, Va. 23665 (804) 865-3621 ------------------------------ Date: 15 Apr 87 21:26:25 GMT From: columbia!cheshire.columbia.edu!al@seismo.css.gov (Alexander Pasik) Subject: OPS5 programs Here at Columbia, we are doing extensive research on production systems especially in the realm of parallel processing. We are in the process of building a public service library of OPS5 programs for use in research and benchmarking. Once installed, anyone will be able to retrieve the systems stored there anonymously through FTP. We are requesting contributions to this library. Any contibutions would be most helpful both to our research and to others in the future. If you have an interesting OPS5 system, place it in a directory with all necessary files and a README file describing the system and how it is used. Then send me (al@cheshire.columbia.edu) the location of the UNPROTECTED files and I will copy them into the library. When the library is in place, I will post its location and instructions for access. Thanks, Alexander Pasik (al@cheshire.columbia.edu). ------------------------------ Date: 9 Apr 87 22:14:18 GMT From: cadre!pitt!wvucsb!rsr@pt.cs.cmu.edu (Ravi S Raman) Subject: Wanted: Benchmarking Production Systems Has anybody seen any benchmark or comparative study of the various production system engines? I am specifically interested in information regarding: * the implementation language/environment (lisp/ops5/loops/psrl/kee/emycin...) * the benchmark program * the number of rules they fire/minute, * the size and complexity of the rules that were employed, * the size and complexity of the knowledge-base that was employed, * the match algorithm employed by the system (Rete...) as well as its speed/limitations. I am aware that CMU's Anoop Gupta did quite a bit of comparasion studies; however they were primarily on CMU systems employing OPS5. I'd like to hear from other researchers/users in the field. Please E-mail directly to me. If there is sufficient interest/response I'll post a summary. - ravi - Ravi S. Raman Department of Statistics and Computer Science West Virginia University Morgantown, WV 26506 (304)-293-3607 NET ADDRESS: pitt!wvucsb!wvucswv!rsr@cadre ------------------------------ Date: 17 Apr 87 07:19:20 GMT From: pioneer!eugene@ames.arpa (Eugene Miya N.) Subject: Tough speech recognition examples I am looking for tough speech generation and recognition examples: discriminating tests. I've seen people present examples to training systems, and things like DECtalk. For instance, one example I've heard and seen given is: How to recognize speech. How to wreck a nice beach. I would like to find others. As tests of discrimination. I will not only collect to summarize, I will maintain the list electronically. Sort of reminds me of the Ishihara Color Blindness test. >From the Rock of Ages Home for Retired Hackers: --eugene miya NASA Ames Research Center eugene@ames-aurora.ARPA "You trust the `reply' command with all those different mailers out there?" "Send mail, avoid follow-ups. If enough, I'll summarize." {hplabs,hao,ihnp4,decwrl,allegra,tektronix,menlo70}!ames!aurora!eugene ------------------------------ Date: 16 Apr 87 07:40:07 GMT From: mcvax!ukc!its63b!epistemi!rda@seismo.css.gov (Robert Dale) Subject: Training Applications of Expert System Shells Can anyone give me pointers to case studies where PC-based expert system shells have been used in training applications? If there is sufficient interest, I will post a summary of what I receive to the net. Thanks in advance R -- Robert Dale University of Edinburgh, Centre for Cognitive Science, 2 Buccleuch Place, Edinburgh, EH8 9LW, Scotland. UUCP: ...!ukc!cstvax!epistemi!rda ARPA: rda%epistemi.ed.ac.uk@ucl.cs JANET: rda@uk.ac.ed.epistemi ------------------------------ Date: Tue, 14 Apr 87 14:32:54 GMT From: unido!tadam!michael@seismo.CSS.GOV (Michael Beetz) Subject: Efficient implementation of knowledge representations We are interested in information on implementation techniques for object oriented knowledge representation languages on SYMBOLICS Lisp machines/Genera 7.0. We need an efficient implementation for maintaining and interpreting large amounts of objects. Does anybody have comparisons of efficiency for various implementation techniques like Flavors, Defstructs, generic functions ....?? Or does anybody have experience in implementing such languages. Any hints, pointers, references will be greatly appreciated ! Reply to stripe.sri.com!unido!taeva!tadam!michael Michael Beetz Gaby Streck ------------------------------ Date: Tue, 14 Apr 87 13:15:26 est From: Amy Winarske Subject: Cognitive Science Grad Schools I was very glad to see Carol Seger's letter, as I'm a junior at Wellesley College in a similar position. Although I'm not going to Kenya next year and I'm not quite sure what I want to study, (something to do with language and cognitive science at this point), I would LOVE to know which schools are doing what, and hear what the people there think of their programs. It is rather difficult to get information on this field without knowing who has such programs, since it isn't listed in any of the "guide books" and is a relatively unknown field to people not involved in it. (I'm really tired of people asking me "You're majoring in WHAT?") If you have any words of wisdom or think anybody on the net might, my address is: winarske@wellesley.edu Thanks! -Amy Winarske ------------------------------ Date: Mon, 13 Apr 1987 03:49 CST From: Leff (Southern Methodist University) Subject: NEWS FLASH! Lisp Machine Inc. filed for Chapter 11 Bankruptcy. Source: Computerworld, April 6, 1987, page 110. ------------------------------ Date: Thu, 16 Apr 87 13:29:58 est From: walker@flash.bellcore.com (Don Walker) Subject: Travel Grant support for IJCAI-87 TRAVEL GRANTS FOR IJCAI-87 IJCAII has submitted a proposal to NSF to provide travel allowances for U.S. participants attending IJCAI-87 in Milan. It also plans to provide an equal amount of IJCAII funds to support participants from other countries. The amounts awarded would probably cover no more than discount air fares and would vary depending on location and on the number of persons applying. The intent is to help about 100 people. Priority will be given to younger members of the AI community who are presenting papers or are on panels and who would not otherwise be able to attend because of lack of travel funds. Note that U.S. applicants must use U.S. air carriers. Applications should be submitted as soon as possible, even though we have not received confirmation from NSF about a grant award. The application should briefly describe benefits expected from attendance; identify expected form of conference participation (e.g., presenting paper); state current sources of research funding; and list travel support from other sources. A brief resume should be attached, and students should include a letter of recommendation from a faculty member. Five copies of the application should be sent, no later than 1 June 1987, to: Priscilla Rasmussen IJCAI-87 Travel Grants Laboratory for Computer Science Research Hill Center, Busch Campus Rutgers, the State University New Brunswick, NJ 08903, USA ------------------------------ Date: Sat, 11 Apr 1987 20:43 CST From: Leff (Southern Methodist University) Subject: Summary of Canadian Artificial Intelligence, April 1987, NO. 11 Discussion of the "Canadian Working Group on Prolog Standardization" first meeting. There is a newsletter available on LISP called "Lisp Pointers" available free from: Mary S. Van Deusen, Editor IBM Research P. O. Box 704 Yorktown Hieghts, NY 10598, USA maida@ibm.com A new consulting firm in expert systems: Expert Solutions, 8 Olympus Avenue, Toronto (Dr. Peter Davies) Article on expert system activities of the Canadian railways. Report from the first Workshop on Knowledge Acquisition for Knowledge- Based Systems was sponsored by the American Association of ARtificial Intelligen ce James Bradford of Brock University is developing AI based tools to offer spontaneous advise to those using commercial packages on PC's. This will include evaluation of user productivity and satisfaction in field trials. He is also developing a natural language student advisor. At University of Alberta, the Schubert and Pelletier natural language system is being modified to handle quantifiers such as "some" and "every" combined with "and" and "not". Also a Generalized Phrase Structure Grammar with a left-corner parser is being developed which generates something close to first-order logic with identity. Other work at University of Alberta: THINKER, a natural deduction system for first-order predicate logic with identity. qualitative physics including liquid flow system for handling shared logic databases including consistency and completeness and concurrency issues robot planning using first-order logic new search algorithms including a parallel alpha-beta algorithm which was used in the first place World Computer Chess Championship (on 20 Sun workstations) incremental learning of conjunctive ocnepts by example genetic learning algoirthms List of papers on the workshop "The Challenge of Commonsense Knowledge Representation in Artificial Intelligence" Expert Systems and Common Sense R. Narasimhan, Tata Institute of Fundamental Research in Bombay Knowledge Reprentation: What is it? N. Circone, University of Victoria Some Uncommon Sense About Commonsense A. Kelkar, Deccan College in Pune Contributions of Semioptics to the Issue of Commonsense Knowledge Representation P. Bouissac of Victoria College at the University of Toronto Commonsense and the Interpretation of Human Phenomena J. C. Gardin, CNRS at Paris Knowledge Representation Issues in Automated Tutoring G. McCallas of the University of Saskatchawan Markovian Connotation Models for the Exploration of Commonsense Knowledge P. Miranda of Laval University >From Meaning to Text: Semantic Representation in the Meaning Text Linguistic Theory I. Melcuk of l'Universite de Montreal Neurollinguistics: From Static Representational STructures to Dynamic Processes J. L. Nespoulous Biology of Natural Language A. R. Lecours of Centre Hospitalier de la Reine Marie in Montreal Concluding Paper S. Ramani of the Tata Institute in Bombay Reviews of Roy Davies, Intelligent Information Systems: Progress and Prospects Kokichi Sugihara, Machine Interpretation of Line Drawing Michael L. Brodie and John Mylopoulos, On Knowledge Base Management Systems: Integrating Artificial Intelligence and Database Technologies ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun Apr 26 04:10:24 1987 Date: Sun, 26 Apr 87 04:10:14 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #101 Status: R AIList Digest Monday, 20 Apr 1987 Volume 5 : Issue 101 Today's Topics: Comments - Text Critiques & Statistical Expert Systems & Demons, AI Tools - Demons in Simulated Annealing Optimization & Neural Networks Survey Paper & Multilayer Connectionist Theory ---------------------------------------------------------------------- Date: Thu 16 Apr 87 17:45:55-PDT From: PAT Reply-to: HAYES@[128.58.1.2] Subject: Re: AIList Digest V5 #95 Let me briefly add a seconding voice to Linda Means comments on the horrible output of the style-criticising programs illustrated a while ago. That people should suggest using such things to influence children almost makes me agree with Weizenbaum. The thesis behind AI is that intelligence is computation, but not TRIVIAL computation. Obviously nothing that could run on a PC could possibly do a good job of such a very subtle and information- -rich task as critiquing English style, and these things do a TERRIBLE job. But perhaps the worst aspect of them used as pedagogical tools is not how well they do the job, but that they so obviously work by applying some simple and superficial rules in a context-insensitive fashion. Any kid who was 'taught' by one of these would quickly learn these rules. A few experiences like this, though, and (s)he would learn that most problems are solved by applying a few superficial rules without any need for deeper thinking, which is a worse and more dangerous lesson. Im all for the application of AI to education, but lets not get it confused with the thoughtless use of mediocre code to subvert education. Pat Hayes ------------------------------ Date: Fri, 17 Apr 87 00:52:10 EDT From: lubinsky@topaz.rutgers.edu (David Lubinsky) Subject: Re: Statistical Expert Systems I have been working in approximately this field for the last year at Bell Labs in Murray Hill with Bill Gale and Daryl Pregibon, two of the most active researchers in the field. Hand is probably aware of Bill's recent book 'AI in Statistics', where you can find a whole host of people working in this area. Personally, I have been working on a system called TESS, (Tree based Environemnt for Statistical Strategy). TESS allows an expert statistician to define, implement and critique strategies for particular data analysis tasks. So far we have implemented two strategies, one for analysing univariate batches, and one for bivariate analysis. I can send copies of Tech. Reports, if you want or if you can wait, look out for a paper called "Data Analysis as Search" in a special statistical computing edition of Technometrics in the fall. David ------------------------------ Date: Sat 18 Apr 87 08:46:45-PST From: Oscar Firschein Subject: re demons The Selfridge citation should be 1958 not 1858. Oscar ------------------------------ Date: Mon 13 Apr 87 10:03:12-PST From: Stephen Barnard Subject: demons Everyone is familiar with Maxwell's demon, the tiny sprite that reverses the increase of entropy dictated by the 2nd Law of Thermodynamics. He sits at a trapdoor between two chambers containing a gas in equilibrium (i.e., with maximum entropy) and segregates the molecules into low- and high-energy populations, thereby moving the system away from equilibrium and *decreasing* its entropy. If Maxwell's demon could exist (and be tamed), we could build perpetual motion machines. The thermal gradient between the chambers could drive a heat engine. Brillouin killed the demon by considering the connection between thermodynamics and information theory. The demon would have to acquire information about the position and velocity of the molecules (for example, by bouncing photons off them), but this information would be gained only at a cost that would balance the decrease in entropy due to its actions. Demons of another kind are still alive and well in physics, however. Creutz described a Monte Carlo algorithm that simulates a system in thermal equilibrium, much like the Metropolis algorithm used in simulated annealing. The difference is that Creutz samples from the *microcanonical ensemble*, in which the system is considered to be thermally insulated (constant energy). When the state of the system changes randomly, its potential energy usually changes, and this difference is absorbed or emitted by a demon, which carries kinetic energy. What does this have to do with AI? Simulated annealing is an effective optimization technique. It's been used for several vision problems. Creutz's algorithm can be used in a new variant of simulated annealing that is simpler, more efficient, and more easily controlled than the standard Metropolis version. references: Brillouin, L., Science and Information Theory, Academic Press, New York, 1962. Creutz,M., Microcanonical Monte Carlo simulation, Physical Review Letters, vol. 50, no. 19, May 9, 1983, pp. 363-373. Barnard, S., Stereo matching by hierarchical, microcanonical annealing, SRI technical note 414 (to appear in Proc. IJCAI87). ------------------------------ Date: 13-APR-1987 15:46 From: SIMPSONP@COD.NOSC.MIL Subject: ANS Survey Paper [Forwarded from the Neuron Digest by Laws@STRIPE.SRI.COM.] A Survey of Artificial Neural Systems Patrick K. Simpson Unisys San Diego Systems Engineering Center 4455 Morena Boulevard San Diego, CA 92117 619/483-0900 Abstract This paper is a survey of the field of Artificial Neural Systems (ANSs). ANSs have a large number of highly interconnected processing elements that demonstrate the ability to learn and generalize from presented patterns. ANSs represent a possible solution to previously difficult problems in areas such as speech processing and natural language understanding. This paper presents a brief history of ANSs, examples of ANS models and areas where the technol- ogy has been applied. Also discussed is the connection between Artificial Intelligence (AI) and ANS, computer architectures that are evolving from this field, and two ANS algorithms. [Copies are available from simpson@cod.nosc.mil or the address listed above - MTG] ------------------------------ Date: 3-APR-1987 14:46 From: @C.CS.CMU.EDU:JOSE@LATOUR.ARPA Subject: Multilayer Connectionist Theory [Forwarded from the Neuron Digest by Laws@STRIPE.SRI.COM.] Knowledge Representation in Connectionist Networks Stephen Jose Hanson and David J. Burr Bell Communications Research Morristown, New Jersey 07960 Abstract Much of the recent activity in connectionist models stems from two important innovations. First, a layer of independent, modifiable units (hidden layer) that can model the statistics of the domain and in turn perform significant associative mapping between stimulus pairs. Second, a learning rule that dynamically creates representation in the hidden layer based upon constraints from a teacher signal. Both Boltzmann machine and back-propagation models share these two innovations and interestingly ones that were apparently well known by Rosenblatt[14]. Although presently, many complex perceptual and cognitive models have been constructed using these methods the exact computational nature of the networks in terms of their clustering, partitioning, and generalization behavior is not well understood. In this paper we present a uniform view of the computational power of multi-layered learning (MLL) models. We show that MLL models represent knowledge by applying Boolean combination rules to partition the problem space into regions. A by-product of these rules is that knowledge is represented as distributed patterns of activation in the hidden layers. Their partitioning capability is related to both the neural device model and the network complexity in terms of numbers and layers of neurons. The device model determines the shape of an elementary boundary segment and the network determines how to combine the segments into region boundaries. For continuous problem spaces two hidden layers are sufficient to form arbitrary regions (or Boolean functions) in the space, and for binary-valued spaces a single layer suffices. Finally we show that networks can produce probabilistic combination rules which closely approximate the Bayes risk. You can get a copy of this paper by replying to this message or writing to jose@bellcore or djb@bellcore, comments appreciated. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun Apr 26 04:11:02 1987 Date: Sun, 26 Apr 87 04:10:43 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #102 Status: R AIList Digest Tuesday, 21 Apr 1987 Volume 5 : Issue 102 Today's Topics: Seminars - Problems in Nonmonotonic Reasoning (MCC) & Constraints, Planning, and Design (TI) & Order-Sorted Unification (SRI) & Conceptual Thinking for Restructuring and Insight (CMU) & A Synthesis of Higher-Order Unification (CMU) & Graphical Access to an Expert System (Rutgers) & Reactive Learning (CMU) & Equivalences of Logic Programs (Rutgers) ---------------------------------------------------------------------- Date: Tue 14 Apr 87 15:24:13-CDT From: Charles Petrie Reply-to: Petrie@MCC Subject: Seminar - Problems in Nonmonotonic Reasoning (MCC) Michael Reinfrank NML/RMS-Group, Dept. of CS, Univ. of Linkoeping XPSLAB ZTI INF 31, SIEMENS AG, Munich PROBLEMS IN NONMONOTONIC REASONING MCC Auditorium 10:30 April 16 Nonmonotonic reasoning now has been a topic of interest for more than fifteen years, although substantial research into its theoretical foundations did not begin until the late seventies. Recently, some doubts arose concerning the achievements in this field, in particular concerning the question whether the techniques developed so far can solve those problems they are intended to solve. A survey of the history of nonmonotonic reasoning will be given and major unresolved issues in the current theories identified. ------------------------------ Date: Wed, 15 Apr 87 13:27:12 cdt From: "Michael T. Gately" Subject: Seminar - Constraints, Planning, and Design (TI) From: NGSTL1::LINDAHL "Multihack -- lindahl%ngstl1@ti-eg.csnet" From: TILDE::"BEF@HOME" Texas Instruments Computer Science Center Lecture Series CONSTRAINTS, PLANNING, AND DESIGN: THERE IS A REASON FOR EVERYTHING UNDER THE SUN PROF. DANIEL WEISE (STANFORD UNIVERSITY) 10:00 am, Friday, 1 May 1987 Semiconductor Building Main Auditorium Every design decision has a set of rationales and a set of ramifications. These ramifications affect other design decisions. I believe that algorithms and expert systems fail for automatic design synthesis because they do not explicitly reason about rationales or ramifications. They also fail because they do not react to the design being built. In this talk I will outline the problems of automatically designing hardware, show why current approaches must fail, and describe a new methodology, based on communicating constraint based problem solvers, which might succeed. BIOGRAPHY Daniel Weise received both his Masters and Ph.D. degrees at the MIT Artificial Intelligence Laboratory. He did his dissertation on verifying MOS circuits. He is now an assistant professor at Stanford University working on design automation and silicon compilation. ---------------------------------------------------------------------- The lecture will be given in the Semiconductor Building Main Auditorium at the Dallas Expressway site. Visitors to TI should contact Dr. Bruce Flinchbaugh (214-995-0349) in advance and meet in the north entrance lobby of the Semiconductor Building by 9:45am. ------------------------------ Date: Thu, 16 Apr 87 10:27:48 PDT From: lunt@april.csl.sri.com (Teresa Lunt) Subject: Seminar - Order-Sorted Unification (SRI) ORDER-SORTED UNIFICATION Jose Meseguer SRI International Computer Science Laboratory Monday, April 27 at 4:00 pm SRI International, Computer Science Laboratory, BN182 Jose Meseguer will speak on his work with Joseph Goguen of SRI International and Gert Smolka of Universitat Kaiserslautern. Order-sorted logic is the logic of multiple inheritance and overloading polymorphism. It provides a rich type theory that permits easy and natural expression of many problems in knowledge representation, natural language processing, theorem proving, etc. Order-sorted logic is also the basis for the logical languages OBJ3 and Eqlog. Despite its considerable expressive power, all the usual results of equational and first-order logic generalize to order-sorted logic. The present work develops a general theory of order-sorted E-unification, and characterizes the cases where there is a minimal family of unifiers, a finite family of unifiers, and a unique most general unifier. The latter case has a simple syntactic characterization and also a quasi-linear unification algorithm a la Martelli-Montanari that is in fact more efficient than ordinary unification, due to its type-checking. ------------------------------ Date: 16 Apr 1987 1049-EDT From: Elaine Atkinson Subject: Seminar - Conceptual Thinking for Restructuring and Insight (CMU) SPEAKER: Dr. Stellan Ohlsson, LRDC, University of Pittsburgh TITLE: "A theory of conceptual thinking applied to the phenomena of restructuring and insight" DATE: Tuesday, April 21 TIME: 12:00 - 1:20 p.m. PLACE: Adamson Wing, Baker Hall ABSTRACT: Current theories of problem solving focus on the nature and function of problem solving strategies. However, novel problems cannot, by definition, be solved by applying a pre-existing strategy; rather, they are solved by trying to understand the problem situation, a process to be called "conceptual thinking". According to studies by the Gestalt psychologists, conceptual thinking exhibits the phenomena of restructuring and insight. A first approximation theory of restructuring and insight and some relevant data will be discussed. ------------------------------ Date: 15 Apr 87 10:08:23 EDT From: Conal.Elliott@theory.cs.cmu.edu Subject: Seminar - A Synthesis of Higher-Order Unification (CMU) Area Qualifier Talk Speaker: Conal Elliott Date: April 21 Time: 10:00-11:30 Place: WeH 7220 Topic: A Synthesis of Higher-Order Unification Program synthesis is the derivation of implementations from noneffective specifications. Higher-order unification is unification in the typed lambda calculus with alpha, beta, and eta conversion. It has been used in - program manipulation, - theorem proving in higher-order logic, - logic programming, and - mechanizing natural deduction. In this talk, we - give a new, useful conceptualization of the unification problem, - synthesize a family of ``pre-algorithms'' for unification, unifiablity, matching, matchability, with some efficiency improvements, and - present a new synthesis methodology, which may be viewed as a new interpretation, justification, and generalization of Burstall & Darlington's methodology. ------------------------------ Date: 16 Apr 87 14:14:26 EDT From: KALANTARI@RED.RUTGERS.EDU Subject: Seminar - Graphical Access to an Expert System (Rutgers) RUTGERS COMPUTER SCIENCE COLLOQUIUM SCHEDULE - SPRING 1987 DATE: Thursday, April 23, 1987 SPEAKER: Ted Shortliffe AFFILIATION: Visiting Professor of Computer and Information Science University of Pennsylvania and Associate Professor of Medicine and Computer Science Medical Computer Science Group Knowledge Systems Laboratory Stanford Medical School TITLE: GRAPHICAL ACCESS TO AN EXPERT SYSTEM: THE EVOLUTION OF THE ONCOCIN PROJECT TIME: 2:50 (Coffee and Cookies will be setup at 2:30) PLACE: Hill Center, Room 705 ABSTRACT The research goals of Stanford's Medical Computer Science group are directed both toward the basic science of artificial intelligence and toward the development of clinically useful consultation tools. Our approach has been eclectic, drawing on fields such as decision analysis, interactive graphics, and both qualitative and probabilistic simulation as well as AI. In this presentation I will discuss ONCOCIN, an advice system designed to suggest optimal therapy for patients undergoing cancer treatment, as well as to assist in the data management tasks required to support research treatment plans (protocols). A prototype version, developed in Interlisp and SAIL on a DEC-20, was used between May 1981 and May 1985 by oncology faculty and fellows in the Debbie Probst Oncology Day Care Center at the Stanford University Medical Center. In recent years, however, we have spent much of our time reimplementing ONCOCIN to run on Xerox 1100 series workstations and to take advantage of the graphics environment provided on those machines. The physician's interface has been redesigned to approximate the appearance and functionality of the paper forms traditionally used for recording patient status. The Lisp machine version of ONCOCIN was introduced for use by Stanford physicians earlier this year. In response to the need for an improved method for entering and maintaining the rapidly expanding ONCOCIN protocol knowledge base, we have also developed a graphical knowledge acquisition environment known as OPAL. This system allows expert oncologists to directly enter their knowledge of protocol- directed cancer therapy using graphics-based forms developed in the Interlisp-D environment. The development of OPAL's graphical interface led to a new understanding of the natural structure of knowledge in this domain. ONCOCIN's knowledge representation was accordingly redesigned for the Lisp machine environment. This has involved adopting an object-centered knowledge base design which has provided an increase in the speed of the program while providing more flexible access to system knowledge. ------------------------------ Date: 17 Apr 87 15:59:21 EDT From: Patricia.Mackiewicz@isl1.ri.cmu.edu Subject: Seminar - Reactive Learning (CMU) TOPIC: Reactive Learning: Experimentation and Decompilation SPEAKER: Jaime Carbonell, CMU WHEN: Tuesday, April 21, 1987, 3:30 p.m. WHERE: Wean Hall 5409 Most symbolic learning approaches have been purely empirical (inductive) or purely analytical. The former extracts a general concept from a set of empirical observations, whereas the latter composes primitive concepts into larger units (chunks, macro-operators, "explanations", etc.). Analytical methods include explanation-based learning, capable of exploiting a complete domain theory to learn complex concepts from very few instances. However, the domain theory may be partial, and judicious integration of empirical and analytical methods may prove far superior to either method alone. Reactive experimentation is a case in point: partial domain knowledge is used to formulate hypotheses, and empirical data from the experiments is used to formulate new concepts or modify existing ones. Decompilation maps complex empirical observations into comprehensible operational units using analytical techniques. Both methods for combining analytical and empirical approaches are explored with the objective of creating robust learning systems. ------------------------------ Date: 19 Apr 87 04:18:08 EDT From: KALANTARI@RED.RUTGERS.EDU Subject: Seminar - Equivalences of Logic Programs (Rutgers) SPECIAL RUTGERS COMPUTER SCIENCE COLLOQUIUM DATE : Tuesday, April 21st SPEAKER: Michael J. Maher TITLE: Equivalences of Logic Programs AFFILIATION: IBM T.J. Watson Center TIME: 1:30 pm PLACE: Hill 423 One of the most important relationships between programs in any programming language is the equivalence of such programs. This relationship is at the basis of most, if not all, programming methodologies. This talk provides a systematic comparison of the relative strengths of various formulations of equivalence for logic programs. These formulations arise naturally from several well-known formal semantics. These comparisons are useful in reasoning about program behavior, verification of correctness and termination of programs, the correctness of ad hoc source-to-source transformations such as occur in program development, and, at a more abstract level, the establishment of the correctness and other properties of automated transformation systems which can be used both in program development and as a pre-compilation optimization. --------------------------------------------------------------------------- DATE : Friday, April 24 SPEAKER: Dr. Susan Epstein TITLE: An Introduction to GT, the Graph Theorist AFFILIATION: Hunter College (CUNY) TIME: 1:30 (Coffee and Cookies will be setup after the talk at 2:30) PLACE: Hill 705 ABSTRACT GT, the Graph Theorist, is a knowledge-intensive, domain-specific learning system which uses algorithmic class descriptions to discover new mathematical concepts and relations among them. GT is based upon a set of powerful representation languages for object classes. The definition of a graph theory concept is an expression in one of these languages. GT generates correct examples of any of its concepts, constructs new concepts, and conjectures and proves relations among concepts. Beginning from only the concept of "graph," GT has developed its own version of graph theory and discovered such concepts as "tree," "acyclic," "connected," and "bipartite." GT has also conjectured and then proved such theorems as "The set of acyclic, connected graphs is precisely the set of trees" and "There is no odd-regular graph on an odd number of vertices." This talk presents initial results and outlines the theoretical foundations for this work. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun Apr 26 04:11:30 1987 Date: Sun, 26 Apr 87 04:11:05 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #103 Status: R AIList Digest Tuesday, 21 Apr 1987 Volume 5 : Issue 103 Today's Topics: Conferences - A typo and an addition to the MAICSS schedule & Theoretical Aspects of Reasoning about Knowledge & Third Institute, UT Year of Programming & Second Workshop on Large Grained Parallelism ---------------------------------------------------------------------- Date: Fri, 17 Apr 87 13:05:26 cdt From: Kris Hammond Subject: Conference - A typo and an addition to the MAICSS schedule A slight change of venue for the MAICSS conference and an additional speaker - The First Annual Meeting of The Midwest Artificial Intelligence and Cognitive Science Society The University of Chicago April 24th and 25th ----> Ryerson 251 ----> 1100 58th Street ----> Chicago, Illinois Also, Professor Larry Travis will be giving an overview talk on the AI work at the University of Wisonsin. And, if you haven't called us yet, do so now. (312) 702-8070. Kris Hammond CS Department University of Chicago ------------------------------ Date: 17 April 87 14:41-PDT From: VARDI%ALMVMA.BITNET@wiscvm.wisc.edu Subject: Conference - Theoretical Aspects of Reasoning about Knowledge Call for Papers The Second Conference on THEORETICAL ASPECTS OF REASONING ABOUT KNOWLEDGE March 6-9, 1988, Monterey, California The 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, sponsored by the International Business Machines Corporation and the American Association for Artificial Intelligence, will be held March 6-9, 1988, at the Asilomar Conference Center in Monterey, California. While traditionally research in this area was mainly done by philosophers and linguists, reasoning about knowledge has been shown recently to be of great relevance to computer science and economics. The aim of the conference is to bring together researchers from these various disciplines with the intent of furthering our theoretical understanding of reasoning about knowledge. Some suggested, although not exclusive, topics of interest are: Semantic models for knowledge and belief Resource-bounded reasoning Minimal knowledge proof systems Analyzing distributed systems via knowledge Knowledge acquisition and learning Knowledge and commonsense reasoning Knowledge, planning, and action Knowledge in economic models You are invited to submit ten copies of a detailed abstract (not a complete paper) to the program chair: Moshe Y. Vardi IBM Research Almaden Research Center K53-802 650 Harry Rd. San Jose, CA 95120-6099, USA Telephone: (408) 927-1784 Electronic address: vardi@ibm.com, vardi@almvma.bitnet Submissions will be evaluated on the basis of significance, originality, and overall quality. Each abstract should 1) contain enough information to enable the program committee to identify the main contribution of the work; 2) explain the importance of the work - its novelty and its practical or theoretical implications; and 3) include comparisons with and references to relevant literature. Abstracts should be no longer than ten double-spaced pages. Program Committee: J. Barwise (Stanford University) P. van Emde Boas (University of Amsterdam) H. Kamp (University of Texas at Austin) K. Konolige (SRI International) Y. Moses (Weizmann Institute of Science) S. Rosenschein (SRI International) T. Tan (University of Chicago) M. Vardi (IBM Almaden Research Center) The deadline for submission of abstracts is August 31, 1987. Authors will be notified of acceptance by November 1, 1987 (authors who supply an electronic address might be notified earlier). The accepted papers will be due by December 15, 1987. Proceedings will be distributed at the conference, and will be subsequently available for purchase through the publisher. We hope to allow enough time between the talks for private discussions and small group meetings. In order to ensure that the conference remains relatively small, attendance will be limited to invited participants and authors of accepted papers. Support for the conference has been received from IBM and AAAI for partial subsidy of participants' expenses; applications for further support are pending. ------------------------------ Date: Wed 1 Apr 87 16:38:24-CST From: Hamilton Richards Subject: Conference - Third Institute, UT Year of Programming Preliminary Announcement The 1987 UT Year of Programming with the support of the U. S. Office of Naval Research announces The Institute on Logical Foundations of Functional Programming Scientific Director: Dr. Gerard Huet, INRIA Austin, Texas 8-12 June 1987 There is a growing realization that mathematical logic provides a foundation on which programming languages and environments for software engineering can be soundly based. Such a foundation should include a highly expressive notation for formalisation of requirements, an efficiently implementable language for coding programs, and a means of systematically deriving each program from its specification, together with such proofs of correctness as are needed. This Institute concentrates on a particularly simple paradigm. The type verification rules of a programming language such as PASCAL or ADA may be seen as a logical inference system. The rules of inference can be extended in a uniform manner to check the validity of a program with respect to more general formalized comments, assertions, and specifications. A powerful constructive logic may thus be considered as the backbone of a pure, strongly typed, functional programming language. We may thus envision programming environments for such languages in which programs are designed consistently with formal specifications. In such a system, a well-typed program serves as its own proof of correctness, which may be checked by type-checking throughout the period of program development. There is hope that in the future some of the more routine parts of programs can be generated with machine assistance. This approach to software engineering is currently the subject of much speculation and research, involving both theory and practical implementation. One of the leading research projects is Project Formel, which is jointly sponsored by INRIA (Rocquencourt, France) and Ecole Normale Superieure (Paris) and led by Dr. Gerard Huet of INRIA and Prof. Guy Cousineau of ENS. The Year of Programming has invited Dr. Huet and his senior colleagues to present their work in the Institute on the Foundations of Functional Programming. The first three days of the Institute will be a tutorial on type theory, functional programming, and their relationship to one another. It will prepare students with some background in theoretical computer science for the more advanced Research Seminar on Thursday and Friday, at which presentations will be made of research in progress in several countries around the world. The tutorial on functional programming and type theory will present a unified view of computational structures described by categorical combinators. These combinators may be seen as proof combinators from a sequent formulation of intuitionistic logic, or alternatively as the building blocks of an environment-manipulating machine well suited for executing lambda-calculus and other functional programming languages. This introduces the Categorical Abstract Machine (CAM) (a simplification of Landin's SECD machine) for executing call-by-value lambda-calculus. The language CAML (Categorical Abstract Machine Language) is closely derived from languages such as ML and Hope. The compilation of CAML on the CAM will be discussed and compared with related projects (ML on the FAM and the G-machine, Amber on the Amber machine). Polymorphic types and the problems of type synthesis will be discussed at two levels: ML's parametric polymorphism, and full polymorphism in Girard's second-order lambda-calculus. A very general logical framework, the Calculus of Constructions, will be described. It will be shown how this formalism combines the expressive power of Girard's higher-order polymorphic lambda-calculus, Martin-Lof's theory of types, and de Bruijn's AUTOMATH. The tutorial will be taught by Prof. Cousineau and Dr. Huet, the scientific leaders of Project Formel where CAM, CAML, and the Calculus of Constructions have been designed and implemented. An implementation of CAML on SUN workstations will be available for demonstrations and practical exercise sessions. The Research Seminar will present research topics in Linear Logic and Constructive Semantics. Linear Logic, a new formalism designed to serve as a logical foundation for parallel programming, will be presented by its inventor, Prof. Jean-Yves Girard, Groupe de Logique Mathematique, Universite Paris 7. Under the general title of Constructive Semantics, recent research in Type Theory under way at various centres in the USA and in Japan will be presented by four research leaders in the field: Prof. Albert Meyer (MIT), Dr. John Mitchell (AT&T Bell Laboratories), Dr. Susumu Hayashi (RIMS, Kyoto University), and Prof. Andre Scedrov (U. of Pennsylvania). The Seminar program will be augmented by short communications of research work in progress by the seminar participants. It is recommended that potential participants in the seminar register early. In order to facilitate interaction, the number of participants will be limited. Tentative schedule. 1. Tutorial on Functional Programming and Type Theory (June 8-10) Monday. 8-10 Elements of category theory (GH) 10-12 Introduction to the ML language (GC) 2-4 A tutorial on lambda-calculus (GH) 4-5 Programming session: CAML Tuesday. 8-10 Polymorphic type-checking (GC) 10-12 Natural deduction, the Propositions as Types principle (GH) 2-4 The Categorical Abstract Machine (GC) 4-5 Programming session: CAM Wednesday. 8-10 The polymorphic lambda-calculus (GH) 10-12 Compiling functional languages; CAML Implementation (GC) 2-4 Type theory, the Calculus of Constructions (GH) 4-5 Programming session: Constructions 2. Research Seminar on Linear Logic and Constructive Semantics (June 11-12) Thursday. 8-12 Qualitative domains, Coherent spaces. (J.Y. Girard) 2-330 Guest Lecture 1 (A. Meyer) 330-5 Guest Lecture 2 (J. Mitchell) Friday. 8-12 Linear Logic. (J.Y. Girard) 2-330 Guest Lecture 3 (S. Hayashi) 330-5 Guest Lecture 4 (A. Scedrov) Prerequisites: same as for graduate-level course in theoretical computer science; programming experience is recommended. Recommended readings: G. Cousineau, P.L. Curien and B. Robinet, eds., Combinators and Functional Programming Languages. Springer-Verlag, Lecture Notes in Computer Science 242, 1986. L. Cardelli and P. Wegner. "On Understanding Types, Data abstraction, and Polymorphism". ACM Computing Surveys 17, 4 (Dec. 1985): 471-522. J. R. Hindley and J. P. Seldin. Introduction to combinatory logic and lambda calculus. Cambridge University Press, 1986. H. Abelson and G. J. Sussman. Structure and Interpretation of Computer Programs. MIT Press 1985. J. Lambek and P. J. Scott. Introduction to higher order categorical logic. Cambridge University Press, 1986. The U. T. Year of Programming The Institute on Logical Foundations of Functional Programming is the third in a series of Programming Institutes comprising the 1987 U. T. Year of Programming, which is underwritten principally by the U.S. Office of Naval Research, with supplementary funding from the University of Texas, Lockheed Missiles and Space Company, and other sponsors. The other Institutes in the series are: Concurrent Programming (23 February - 6 March) C.A.R. Hoare (Texas and Oxford) Encapsulation, Modularization, and Reusability (1-10 April) D. Gries (Cornell) Formal Specification and Verification of Hardware (29 June - 3 July) M.J.C. Gordon (Cambridge) Declarative Programming (24-29 August ) D.A. Turner (Kent) Specification and Design (14-25 September) J.R. Abrial (Paris) Formal Development of Programs and Proofs (autumn) E.W. Dijkstra (Texas) FOR FURTHER INFORMATION To receive announcements and application forms for individual Programming Institutes (this one or any of the others), please contact the Year of Programming Office at one of the following addresses: U. T. Year of Programming INTERNET: cs.ham@R20.UTEXAS.EDU Department of Computer Sciences INTERNET: ham@SALLY.UTEXAS.EDU Taylor Hall 2.124 The University of Texas at Austin telephone: 512-471-9526 Austin, Texas 78712-1188 ------------------------------ Date: Friday, 17 April 1987 10:18:22 EST From: Mario.Barbacci@sei.cmu.edu Subject: Conference - Second Workshop on Large Grained Parallelism PRELIMINARY CALL FOR ABSTRACTS SECOND WORKSHOP ON LARGE GRAINED PARALLELISM OCTOBER 11-14, 1987 HIDDEN VALLEY, PENNSYLVANIA Organized by the Software Engineering Institute and the Department of Computer Science, Carnegie Mellon University, with the cooperation of the Computer Society of the IEEE (pending approval). The Second Workshop on Large Grained Parallelism is being organized to bring together researchers in the areas of programming languages, methodologies, and formalisms for loosely-coupled computer networks, and developers of applications who would benefit from such work. Issues of interest within these areas include, but are not limited to, performance, fault tolerance, real-time execution, and heterogeneity of the environment. Attendance is by invitation only. Researchers interested in participating must submit five (5) copies of a short (1 or 2 pages long) abstract describing their activities in the areas of interest outlined above. The workshop technical sessions will consist of a combination of formal presentations, panel sessions, and working group meetings. Only a subset of the participants will address the audience in the formal sessions. All of the abstracts will be published as conference proceedings and will be available to the participants upon arrival. The participants will have the option of submitting a revised version of their abstracts a few weeks prior to the meeting. Submit abstracts to: Relevant dates: Professor Jeannette M. Wing Deadline for Abstracts: July 15, 1987 Department of Computer Science Invitation to Authors: August 14, 1987 Carnegie Mellon University Deadline for Registration and Pittsburgh, PA 15213-3890 Revised Abstracts: September 11, 1987 Telephone: (412) 268-3068 ArpaNet: WING@K.CS.CMU.EDU Workshop Committee: Mario Barbacci (Carnegie Mellon University), Maurice Herlihy (Carnegie Mellon University), Paul Leach (Apollo Computer), Jack Stankovic (University of Massachusetts), and Jeannette Wing (Carnegie Mellon University) Location: The Hidden Valley Resort Community and Conference Center is located in the scenic Allegheny mountains, 60 miles east of Pittsburgh, and is easily reachable via the Pennsylvania Turnpike. The Software Engineering Institute is a Federally Funded Research and Development Center, sponsored by the Department of Defense. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun Apr 26 04:11:44 1987 Date: Sun, 26 Apr 87 04:11:22 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #104 Status: R AIList Digest Tuesday, 21 Apr 1987 Volume 5 : Issue 104 Today's Topics: Conference - The Brain: Philosophy, Neurology, and AI ---------------------------------------------------------------------- Date: Sat, 11 Apr 87 14:32:14 PDT From: Kenneth Schaffner Subject: Conference - The Brain: Philosophy, Neurology, and AI Bruce Buchanan suggested that I send you the following for posting on the AI LIST Bulletin Board. If you have any questions, you may contact me at SCAHFFNER@SUMEX-AIM.ARPA, though inquiries about the Conference should go to the Special Events Office as listed below. Thanks. ---Ken Schaffner A CONFERENCE ON THE BRAIN: PHILOSOPHY, NEUROLOGY, AND ARTIFICIAL INTELLIGENCE In Commemoration of the Bicentennial of the University of Pittsburgh and the Centennial of the School of Medicine The nature of the relationship of the mind to the human brain and the process by which thinking occurs have been perennial philosophical problems. Attempts to understand these issues through the centuries have progressively involved new sciences and new ways of approaching these classic questions. Psychology, neurology, and the neurosciences are relatively new recruits to the interdisciplinary company whose mission is to comprehend the mind and the brain, and they have been even more recently joined by computer science and artificial intelligence. The past five years has seen the rapid emergence of a revolutionary computational framework which suggests a new and exciting approach to mind- brain relations and to thought itself. This approach, which goes by the various names of "connectionism," "parallel distributed processing," and "neural network theory" has been described as a paradigm shift in the cognitive sciences. Problems in perception, memory, language, and thought that were recalcitrant to previous approaches have yielded startling solutions when pursued from the perspective of connectionism. This new viewpoint, which adopts an explicitly parallel architecture on which to base its models, is also consistent with developments occurring in the design of so called "supercomputers." Both connectionism and supercomputer design studies are critical of traditional "von Neumann style" computer architecture and processing, and have proposed novel human brain-like models which already offer extraordinary promise in the areas of speech recognition and pattern detection. This Conference, which is being held as part of the celebration of the University of Pittsburgh's bicentennial and its School of Medicine's centennial, is designed to critically examine this developing revolution in our comprehension of thought and the brain from an interdisciplinary perspective. The implications of the revolution for our understanding of consciousness, learning, memory, language, and knowledge in general will be examined by psychologists, computer scientists, physicians, and philosophers. The extent to which neurological data and theories can suggest novel directions for both psychological and computer-based research, and vice versa, will be a recurrent theme of the Conference. Possible though as yet futuristic therapeutic implications such as partial brain reconstitution with the aid of "neural chips" will be considered. Ethical and legal issues associated with both current brain research and such possible futuristic advances will be examined as well. The Conference brings together a group of scholars who have collectively had a phenomenal impact on our current understanding of the mind and its relations to the brain. Dr. Minsky who will lead off the Conference with a Keynote address is generally recognized as the preeminent theoretician of artificial intelligence and its application to theories of the mind. Drs. Rumelhart and McClelland are cognitive psychologists whose recently edited two volume collection of papers on Parallel distributed Processing is already recognized as the "bible" of connectionism. Dr. Joynt is a distinguished neurologist who brings extensive clinical experience to the Conference's interdisciplinary subject matter. Drs. Paul and Patricia Churchland, Dennett, and Haugland are all nationally recognized philosophers of science and of mind who have made major contributions to these areas. Dr. Hinton has been one of the major developers of parallel distributed processing theory, and Dr. Reggia is a neurologist and computer scientist who has developed pioneering applications of neurological data to artificial intelligence models of the brain. Dr. Miller is a nationally prominent medical ethicist, and Prof. Meisel is a leading figure in both health law and bioethics. These major speakers will also be joined by nationally prominent University of Pittsburgh faculty from philosophy, psychology, neuroscience, neurology, neurosurgery, and computer science who will serve as commentators on the Conference material. PROGRAM THE BRAIN: PHILOSOPHY, NEUROLOGY, AND ARTIFICIAL INTELLIGENCE ALL SESSIONS WILL BE HELD IN THE WESTERN PSYCHIATRIC INSTITUTE AND CLINIC AUDITORIUM, 2ND FLOOR, 3811 O'HARA STREET, UNIVERSITY OF PITTSBURGH Tuesday, May 5, 1987: 8:30 a.m. REGISTRATION Morning - Session I 9:00 a.m. INTRODUCTION....................Thomas Detre, M.D. Senior Vice President for Health Sciences, University of Pittsburgh WELCOME.........................Wesley W. Posvar, Ph.D. President University of Pittsburgh 9:15 a.m. INTRODUCTION TO THEMES..........Kenneth F. Schaffner, M.D.,Ph.D. Professor, Department of History and Philosophy of Science 9:30 a.m. Keynote address: THE SOCIETY OF MIND..............Marvin Minsky, Ph.D. Donner Professor of Science Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology 10:30 a.m. Coffee Break 10:45 a.m. PARALLEL DISTRIBUTED PROCESSING IN COGNITIVE SCIENCE..........................David Rumelhart, Ph.D. Co-Director, Institute of Cognitive Science University of California, San Diego Afternoon - SESSION II: Chairperson - John Moossy, M.D. Professor of Pathology and Neurology Chief, Division of Neuropathology University of Pittsburgh 1:00 p.m. REPRESENTATION AND COMPUTATION: BIOLOGICAL VARIETIES AND PHILOSOPHICAL CONSEQUENCES........Paul Churchland, Ph.D. Professor Department of Philosophy and Cognitive Science Program University of California, San Diego 2:00 p.m. THINKING ABOUT THINKING...........Robert J. Joynt, M.D., Ph.D. Dean and Vice-President Professor of Neurology University of Rochester School of Medicine and Dentistry 3:30 p.m. Coffee Break 3:45 p.m. HUMAN CONSCIOUSNESS AS A VIRTUAL VON NEUMANN MACHINE...............Daniel Dennett, Ph.D. Director, Center for Cognitive Studies Tufts University 4:45 p.m. General Discussion 5:15 p.m. Adjournment 6:00 p.m. Cocktails (location to be announced) Wednesday, May 6, 1987 Morning - Session III Chairperson - S.K. Chang, Ph.D. Chairperson, Computer Science Department University of Pittsburgh 9:00 a.m. LEARNING REPRESENTATIONS IN A PARALLEL NETWORK................Geoffrey Hinton, Ph.D. Associate Professor Department of Computer Science Carnegie-Mellon University 9:45 a.m. UNDERSTANDING NATURAL LANGUAGE THROUGH PARALLEL DISTRIBUTED PROCESSING........................James. L. McClelland, Ph.D. Professor Department of Psychology Carnegie-Mellon University 10:30 a.m. COOPERATION THROUGH COMPETITION IN ASSOCIATED MEMORY MODELS.......James Reggia, M.D., Ph.D. Departments of Neurology and Computer Science University of Maryland 11:15 a.m. Coffee Break 11:30 a.m. UNIVERSITY OF PITTSBURGH PANEL DISCUSSION Panelists: Gordon Banks, M.D., Ph.D.(Neurology) Eric Frank, Ph.D.(Neurobiology, Anatomy and Cell Science) Alan Lesgold, Ph.D.(Psychology) Harry E. Pople, Ph.D. (Decision Systems Laboratory) John Vries, M.D. (Neurosurgery) Richmond Thomason, Ph.D. (Linguistics and Philosophy) Afternoon - Session IV Chairperson Kurt Baier, D. Phil. Distinguished Service Professor of Philosophy University of Pittsburgh 1:30 p.m. KNOWLEDGE, BENEFITS, AND RIGHTS: ETHICAL ISSUES IN BRAIN RESEARCH..Bruce Miller, Ph.D. Professor and Chairman Department of Philosophy Michigan State University 2:15 p.m. ON THE OBLIGATION TO "VOLUNTEER" FOR BRAIN RESEARCH................Alan Meisel, J.D. Professor of Law and Psychiatry University of Pittsburgh 3:00 p.m. Coffee Break 3:15 p.m. EPISTEMOLOGY IN THE AGE OF NEUROSCIENCE.....................Patricia Churchland, Ph.D. Professor of Philosophy and Cognitive Science Program University of California, San Diego 4:00 p.m. TWO MODELS OF INTELLIGENCE.......John Haugeland, Ph.D. Professor Department of Philosophy University of Pittsburgh 5:00 p.m. Adjournment All individuals who wish to attend should register for the Conference. There is no Registration Fee for the Conference, but a form containing the following information should be received by the University of Pittsburgh Health Sciences Office of Special Events, M-211 Scaife Hall, Pittsburgh PA 15261, no later than April 20th, 1987. Space is limited and early registration is advised. A block of rooms has been reserved for registrants at the University Inn in the Oakland section near the University of Pittsburgh; telephone 800-245-6675 (in Pennsylvania 800-242-1498). When registering, please identify yourself as being with this Conference. For individuals attending the Conference, a 20% reduced air fare is available from U.S. Air; contact the Special Events Office below for information. This Conference meets the criteria for twelve credit hours in Category 1 of the Physician's Recognition Award of the American Medical Association. (1.2 CEUs are awarded to health professionals.) REGISTRATION FORM: (Please Print) Name: Degree: Office Address: Home Address: Telephone: (Home) (Office) Affiliation: For further information contact the Special Events Office: (412) 648-9006. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun Apr 26 04:12:21 1987 Date: Sun, 26 Apr 87 04:11:58 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #105 Status: R AIList Digest Wednesday, 22 Apr 1987 Volume 5 : Issue 105 Today's Topics: Bibliography - Leff ai.bib52AB ---------------------------------------------------------------------- Date: Sat, 11 Apr 1987 20:43 CST From: Leff (Southern Methodist University) Subject: ai.bib52AB %A Luis Pastor %A Jose Maria Sebastian %T A Least-Squares Algorithm for Interframe Displacement Estimation. Application to Stereo Vision %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 101-108 %K O06 AI06 %X ISBN 0931215129 %A Zhong-Rong Li %A Da-peng Zhang %T An Intelligent Vision System for Robot %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 119-128 %K AA27 AI07 AI06 satellite landsat geosensing %X ISBN 0931215129 .br br Describes having a satellite for landsat type applications only send relevant material rather than transmit all the data for the purpose of reducing use of bandwidth in communication between ground and satellite. The proposed system uses region growing as well as a variety of convolution operators as well as special purpose hardware. The system achieved 97% accuracy in recognition of type of area (farmfield, mountain, shadow, etc.) %A K. K. Ong %A R. E. Seviora %A P. Dasiewicz %T Knowledge-Based Position Estimation for a Multisensor House Robot %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 119-130 %K AI06 AI07 AA19 blackboard %X ISBN 0931215129 .br br A Hero-I robot containing a cheap light sensor and a sonar sensor was interfaced to an IBM-PC containing a Hearsay-like system for determining which room the robot was in. This system achieved an 87% success rate. %A W. L. Whitaker %A B. Motazed %T Interpretation of Pipe Networks by Magnetic Sensing %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 131-139 %K AA05 AI06 %X ISBN 0931215129 .br br Describes system to interpret magnetic sensor readings for such as evaluating the position of iron reinforcements within concrete and locating underground pipes. %A W. T. Keirouz %A D. R. Rehak %A I. J. Oppenheim %T Object-Oriented Domain Modelling of Constructed Facilities for Robotic Operations %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 141-150 %K AI07 AI16 AA05 %X ISBN 0931215129 .br br describes goals and methods for organizing data structures to manage robots in a construction site. %A Nancy E. Orlando %T Interfacing Intelligent Software to Robotic Peripherals %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 151-162 %K AA10 AA27 AI07 satellite Langley %X ISBN 0931215129 .br br draws analogies between animal behavior and robotic systems. Also discusses research at Nasa Langley Research Center which include simulation systems and attempts to get robots to perform removal and replacement of a module on a satellite as well as refueling of satellites. %A Michel Bidoit %A Francesca Losavia %T Automatic Programming Techniques Applied to Software Development An Approach Based on Exception Handling %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 165-178 %K AA08 digital telephony %X ISBN 0931215129 .br br Describes a system for generation of ADA program in telephony systems. %A Hirooaki Saito %A Masaru Tomita %T On Automatic Composition of Stereotypic Documents in Foreign Languages %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 179-192 %K AI02 %X ISBN 0931215129 .br br Describes a system that will take input for various standard situations such as a move and prepare a letter in the appropriate language including all politeness type sentences appropriate for the target language. %A Meng Li-Ming %T Natural Language Interface to Relational Data Base Systems %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 193-200 %K AI02 AA09 %X ISBN 0931215129 .br br Description of the overall architecture of a system that they built. %A J. Korn %A J. D. Cumbers %A F. Huss %T Computer Aided Systems Modelling %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 202-213 %K AI02 T02 %X ISBN 0931215129 .br br discusses the design of a system to read text with an example given from an newspaper article about the sale of public woodlands to private investors in Britain. %A Kingsley Harrop-Williams %T Artificial Intelligence in Soil Exploration %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 229-237 %K AA05 AI04 O04 AI06 %X ISBN 0931215129 .br br This system interprets cone penetrometer data in a geotechnical survey. It uses learning techniques and interprets information as readings are taken so as to allow decisions on which readings to take next to be influenced by the interpretation of those already taken in the past. Pattern recognition techniques are used to separate the M soil types from the observed measurement vectors and fuzzy techniques are used to represent various beliefs about the characteristics of the site. %A Rense Lange %T Stat: A Probabilistic Knowledge Based Induction Program for Building Expert Systems %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 239-246 %K AI04 AI01 %X ISBN 0931215129 .br br Describes a clustering system of the Michalski type with applications to expert systems. %A Felix S. Wong %A Weimin Dong %T Fuzzy Information Processing in Engineering Analysis %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 247-260 %K O04 AI01 AA05 AT08 %X ISBN 0931215129 .br br discussion of fuzzy logic techniques %A John J. Granacki %A Alice C. Parker %T A Natural Language Interface for Specifying Digital Systems %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 215-226 %K AA04 AI02 %X an interface to the VLSI design system ADAM using Conceptual Dependencies. New Conceptual Dependencie classes were created for digital design in such a manner that the system developed will work with any CD based Natural Language design system. %A W. M. Dong %A H. C. Shah %A A. C. Boissonnade %T Treatment of Vague Information in the Development of a Risk Evaluatin System - Application to Seismic Risk Analysis %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 247-260 %K O04 AA05 AI01 %X Fuzzy rules are used to represent various socio-economic considerations in measuring the impact of an earthquake while more structured rules are used to represent various analysis tools for earthquake engineering. %A C. C. Thiel %A A. C. Boissonnade %T System Identification and Information Processing in Seismic Vulnerability Analysis of Structures %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 277-285 %K AA05 O04 %X The use of fuzzy modelling and cascading models in generating earthquake vulnerability assessments %A Adele Howe %A Paul Cohen %A John Dixon %A Melvin Simmons %T Dominic: A Domain-Independent Program for Mechanical Engineering Design %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 289-299 %K AA05 %X an optimization system for evaluate and redesign engineering. The emphasis is on "parameter selection" for a system whose basic configuration is known. I. E. in a belt and pulley system, the exact sizes and locations of the pulleys would be chosen when the configuration of what belt is attached to which pulley has been predetermined. %A Farrokh Mistree %A H. M. Karandikar %A Saiyid Kamal %T Rule-Based Post Solution Analysis of Decision Support Problems: Some Preliminary Results %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 302-315 %K linear programming sensitivity analysis optimization AI01 %X describes methods for assisting the user in analyzing the results of a linear programming run. Examples of changes that can be examined are changes in the coefficients of the constraints or the inclusion of a new variable. %A Bertrand Neveu %A Pierre Haren %T SMECI: An Expert System for Civil Engineering Design %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 317-325 %K AA05 AI01 %X an expert system for harbor and breakwater design. %A Michael G. Dyer %A Margot Flowers %A Jack Hodges %T Edison: An Engineering Design Invention System Operating Naively %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 327-342 %K AI03 AA05 AI01 %X A system to handle naive physical reasoning in connection with simple physical objects such as can openers and transmission systems. The system works in brainstorming mode (to discover new devices ala Lenat) and problem solving mode. %A J. S. Gero %A M. Balachandran %T Knowledge and Design Decision Processes %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 343-352 %K Pareto optimality optimization NISE %X design under conditions of Pareto optimality, that is with multiple items that need to be "optimized." Rules are used to reduce the time to compute the Pareto optimal set and to determine the shape of the optimal set qualitatively. %A D. Sriram %A M. L. Maher %T The Representation and Use of Constraints in Structural Design %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 355-368 %K AA05 AI01 AI16 %X discussion of some of the knowledge engineering and constraint representation issues in the HI-RISE and ALL-RISE building design systems %A Navin Chandra %A David H. Marks %T Intelligent Use of Constraints for Activity Scheduling %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 369-382 %K operations research scheduling AI01 AI03 %X A rule-based scheduling system and a language for representing constraints in a scheduling system %A David C. Brown %A Robert Breau %T Types of Constraints in Routine Design Problem-Solving %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 383-390 %K AA05 package design AI16 AI01 %X discusses the work of those designing packaging for computer terminals and other equipment. Reviews observations on real engineers doing this work, various types of constraints that exist and methods used in failure handling to backtrack. %A Robert Milne %T Constraint Drive Distribution Scheduling %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 391-399 %K AI01 AA18 %X describes expert systems to handle the fielding of equipment to large organizations including the handling of priorities of which group gets which equipment first and the disposition of old equipment being replaced. %A Bernt A. Bremdel %A Svein Kristiansen %T Concept Definition in Marine System Design %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 403-421 %K AA03 AI01 AA05 %X describes goals of expert systems for the overall design of offshore oil drilling systems and the systems and plans to lift equipment onto an offshore structure being constructed. %A S. C. Y. Lu %A C. R. Blattner %T A Knowledge-Based Expert System for Drilling Station Design %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 423-443 %K IDRILL AI01 AA26 %X An expert system for the design of drilling stations in large scale manufacturing transfer lines is described. %A Jack Aldridge %A John Cerutti %A Willard Draisin %A Michael Steuerwalt %T Expert Assistants for Design %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 445-455 %K AI01 nuclear weopon AA05 AA26 AA18 AA28 PROCON APPRENTICE %X these systems provide an interface to simulation systems and although of general use, have been applied to nuclear warhead design. APPRENTICE provides graphical input and assists the engineer in designing. %A K. G. Swift %A A. Matthews %A C. Syan %T The Application of IKBS in Design for Assembly and Surface Treatment Selection %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 459-471 %K AA26 AA05 AI01 %X The coating system chooses polymeric coatings for objects. It has achieved an error rate of 5% compared to human error rate of 3%. .br br The assembly system is resident in the CAD workstation and presents its data as annotations and proposed revisions %A Paul J. Nolan %T An Intelligent Assistant for Control System Design %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 473-481 %K AA05 AI01 %X This expert system designs linear time-invariant control systems and includes the simplification into block diagrams or signal flow graphs to canonical form, selection of compensator type and analysis/ synthesis approach. %A B. S. Lim %A J. A. G. Knight %T Holdex - Holding Device Expert System %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 483-493 %K AA26 AA05 AI01 %X A system for tooling design in manufacturing. The discussion emphasizes the type of drilling to be used. It also appears that there is an interface to PADL for getting geometric information about the part to be manufactured. %A Jacques Calmet %A Denis Lugiez %T A Knowledge-Based System for Computer Algebra %J SIGSAM Bulletin %V 21 %N 1 %D FEB 1987 %P 7-13 %K AA15 AI14 %X outline of such a system, includes a description of software engineering aspects as well. %A Monique Grandbastien %A Jean Maroldt %T Towards an Expert System for Troubleshooting Diagnosis in Large Industrial Plants %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 503-511 %K AA20 AA21 AA05 AI01 %X A demonstration expert system for a gas blast furnace was developed with emphasis on the gas analysis aspects. A complete expert system is being prototyped. %A A. DiLeva %A P. Giolito %T Data Models and Process Models for Computer Integrated Manufacturing Systems %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 513-526 %K AA26 AA21 AA05 AI01 AA09 AI16 petri net entity relation model %X The Entity Relation Model for Databases and a Transaction Definition Language as well as Petri Nets are used to represent manufacturing systems. %A P. J. Nolan %A M. A. McCarthy %T AI Frame-Based Simulation in System Dynamics %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 527-538 %K AA11 AA28 continuous system simulation CSMP dynamo frame %X This system provides a representation for common components of social and biological continuous system simulations such as simple inventory system, time delay population model, and summing junction. This provides a way for the user to specify DYNAMO and CSMP simulations at a higher level. %A D. L. Crandall %T Automated Valve Expertise Capture %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 539-544 %K AI01 AA05 component selection %X This system is used in experimental energy production equipment design for the selection of valves. In addition to comparing the valve request with a data base, it invokes special features for special problems in valve selection such as high temperature requirements. %A W. A. Taylor %T Development of a Knowledge Based System for Process Planning in Welding %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 545-562 %K metallurgy hardenability steel AI01 AA05 AA26 offshore oil wells %X This rule based expert system develops appropriate welding procedures for arc welding a specific range of steel grades. %A H. C. Brockelsby %A D. L. Crandall %T Information Processing in the Non-Homogenous Environment %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 563-572 %K AA05 %X describes the engineering functions at Idaho National Engineering Laboratory and how they can be served by an integrated engineering automation system which would probably include AI components. %A D. E. Reynolds %A C. B. Boulton %A S. C. Martin %T AI Applied to Real Time Control: A Case Study %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 573-583 %K AI01 AI09 AI06 AA19 AA18 %X Applications to the control of a mine hunting surface ship which typifies problems in which standard multi-variable control theory can be used but different control strategies must be used at various times while the system is running. The system uses "plan scripts" to structure the database of actions and uses signal interpretation to determine what state it is in. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun May 3 19:16:29 1987 Date: Sun, 3 May 87 19:16:20 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #106 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sun, 3 May 87 19:13 EDT Received: from relay.cs.net by RELAY.CS.NET id aa04113; 3 May 87 17:27 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa20544; 3 May 87 17:23 EDT Date: Sun 3 May 1987 13:54-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #106 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 4 May 1987 Volume 5 : Issue 106 Today's Topics: Administrivia - AIList Interruption & MDee Mailer Troubles, Queries - Robot Planning & LISP Engine Speed & Canonical List of Commercial AI Products under UNIX & Tech Report Contact Info & Performance of Rule-Based Systems & Singapore KEE Users Seeking Other KEE Users & Flavors & XENIX Expert Shells & HEX & Go & Theorem Proving Text & Sun/Lucid Environment & Meta-Level Architectures for Rule Systems ---------------------------------------------------------------------- Date: Thu 30 Apr 87 09:48:17-PDT From: Ken Laws Subject: AIList Interruption Sorry for the delay in getting the digest out. An unbalanced quote in my distribution list took four days to discover and fix; then I came down with a case of flu so bad that I couldn't bear to read for several days. I'm nearly recovered, and I also have my home terminal back from the repair shop, so I should be able to get the digest going again. -- Ken ------------------------------ Date: 30 Apr 87 23:15:00 GMT From: mdee!md@eddie.mit.edu Subject: Mailer Troubles Would anyone who sent us electronic mail between April 26th and April 30th please resend -- our incoming mailer was broken. Sorry for the inconvenience. Marilyn Dee Associates, Inc. "Specialists in Artificial Intelligence" One Kendall Square, Suite 2200 Cambridge, Massachusetts 02139 (617) 577 8881 {seismo, genrad, allegra}!mit-eddie!mdee!md ------------------------------ Date: 20 Apr 87 04:31:36 GMT From: friedman@topaz.rutgers.edu (Gadi ) Subject: robot planning papers request. I am writing a paper on current work in Robot planning. I would like stuff from the '80s.. I already have some from the early seventies. (72,73,74). Any references would be appreciated. Gadi -- ARPA: friedman@topaz.rutgers.edu UUCP: {harvard, seismo, ut-sally, sri-iu, ihnp4!packard}!rutgers!topaz!friedman CMS: RUTGERS!SYSOP (CMS is DOWN. Long live CMS) ------------------------------ Date: Mon, 20 Apr 87 13:26:50+0900 From: "Jin H. Kim" Subject: LISP Engine Speed I am writing an introductory paper about Lisp Workstations such as Symbolics 3600, TI's Explorer, and Lambda machine. Does anybody have speed comparisions between the Lisp Engines and conventional workstations such as Sun and Apollo in executing LISP programs. Jin H. Kim Korea Advanced Institute of Science and Technology Computer Science Department ------------------------------ Date: 21 Apr 87 20:56:54 GMT From: bagwill@decuac.dec.com (Bob Bagwill) Subject: canonical list of commercial AI products under UNIX Has anyone compiled such a list? Thanks. -- ------------------------------------------------------------------------------- Bob Bagwill Are we not men? UUCP: {decvax,seismo,cbosgd}!decuac!bagwill INET: bagwill@decuac.DEC.COM ------------------------------ Date: Wed, 22 Apr 87 18:00:24 AST From: brant@linc.cis.upenn.edu (Brant Cheikes) Subject: Call for Tech Report Contact Info Every time I need a technical report published at another institution, I always find myself going through the same hassle, usually involving several phone calls and transfers, until the "right person" is found. Is there any list or "lookup service" where one can, given an institution, find out the name (and perhaps network address) of the person to whom requests for technical reports can be addressed? If anyone knows of such a thing, please let me know. If I hear anything useful, I'll pass it on to the community. Thanks. ----------------------------------------------------------------------------- Brant Cheikes University of Pennsylvania ARPA: brant@linc.cis.upenn.edu Computer and Information Science ============================================================================= [Lawrence Leff maintains such a list of report sources. Write to him as Leff%smu.csnet@relay.cs.net, or as E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU. -- KIL ] ------------------------------ Date: Thu, 23 Apr 87 11:14:24 WUT From: ADELSBER%AWIWUW11.BITNET@wiscvm.wisc.edu Subject: performance of rule-based systems subject: performance of rule-based systems I am currently working on a methodology for defining the performance of rule-based expert systems. I would like to discuss and to compare the performance of different inference-strategies. To get comparable results it seems to me important to classify and to evaluate different rule- representations and to find a measure for specific rule-bases. This measure should include attributes like complexity, granularity, depth etc. A main goal of this work is to find a method for the selection of the best representation and inference strategy for a specific kind of rule-based knowledge. Is there anybody working on the same object ? I would be thankful for hints, information and (or) references. Marcus Oppitz, Technical University Vienna Please send your answer to vipvax!marcus%tuvie.uucp@cernvax (marcus oppitz) or adelsber at awiwuw11 (bitnet) ------------------------------ Date: Fri, 24 Apr 87 08:23:54 cdt From: "Michael T. Gately" Subject: KEE users seeking other KEE users From: TILDE::"UCBCAD!AMES!SEISMO!ROCHESTER!RITCV!SPW2562@UCBVAX.BERKELEY.EDU" Posted for a friend without access to netnews... Pls respond to iss@tataelxsi, NOT to me. ============================================================================== In space no one hears you scream! Loneliness got to me finally. We are an isolated group of KEE users in Singapore (South East Asia), feeling lonely and chilly due to the thousands of miles of empty space to the nearest the KEE civilization. We need someone to talk to, please respond! We face lots of technical problems and once in a while feeling that we are reinventing some tools. Our site is running a TI Explorer with KEE version 3.0. We have something to offer too: tools for compact bitmap storage and displaying, and bitmap cutting from screen. plse e-mail to.. ...sun!elxsi!tataelxsi!iss or ISSAD@NUSVM (bitnet) looking forward to hearing from all of you 8-) Loo Peing Ling Institute of Systems Science ============================================================================== Steve Wall @ Rochester Institute of Technology UUCP: ..{allegra|seismo}!rochester!ritcv!spw2562 Unix 4.3 BSD BITNET: SPW2562@RITVAXC VAX/VMS 4.4 ------------------------------ Date: 24 Apr 87 15:41:48 GMT From: rochester!kodak!murthy%svax.cs.cornell.edu@seismo.CSS.GOV (Chet Murthy) Reply-to: murthy@svax.cs.cornell.edu (Chet Murthy) Subject: Flavors anyone? Hi. I am looking for a copy of flavors that will run on Franz LIsp under 4.3. (Opus 38.92). The version of flavors that comes with Franz is a bit (putting it lightly) broken. Anybody out there have anything? (Please reply to me, since I figure most people have real lisps to work with. Thanks in advance, --chet-- In Real Life: Chet Murthy ARPA: murthy@svax.cs.cornell.edu SnailMail: Chet Murthy Gaslight Village Apts 21-B Uptown Road Ithaca, NY 14850 Office: 4162 Upson (607) 255-2219 MaBellNet: (607)-257-5709 -- --chet-- In Real Life: Chet Murthy ARPA: murthy@svax.cs.cornell.edu SnailMail: Chet Murthy Gaslight Village Apts 21-B Uptown Road Ithaca, NY 14850 Office: 4162 Upson (607) 255-2219 MaBellNet: (607)-257-5709 ------------------------------ Date: 26 Apr 87 00:21:14 GMT From: jsrobin@ra.ee.umd.edu (John S. Robinson) Reply-to: jsrobin@ra.UUCP () Subject: Expert Shells for PC/AT XENIX - what's good, what's bad? I am posting this for a friend: I am in the process of developing an expert system on an IBM PC/AT under the XENIX operating system. I would like to find out people's views on expert system shells that run under XENIX on IBM PC/AT's. Any information about these tools (pros and cons) would be greatly appreciated. Thank you. Please reply to jsrobin@ra.UUCP, or jsrobin@eneevax.umd.edu, or post responses to the appropriate newsgroups. Thanks in advance for your responses. ------------------------------ Date: 27 Apr 87 15:47:03 GMT From: mcvax!cernvax!bcfl@seismo.css.gov (bcfl) Subject: asking infos on HEX game Hi there.I hope that somebody on the net knows a board game called HEX, consisting of a 11 x 11 board of hexagonal cases.The winner is the first one who completes a chain joining two parallel sides.I used to play some years ago,but have not kept in touch with the players community.I was told that the game is played in the US,so I would appreciate infos about the following points: 1)What about the mathematical researach?Did anybody find a winning strategy for the first player? 2)Do intelligent probgrams exist?What sort of algorithm do they use?Are they commercially available? 3)Do dedicated playing machines exist? I gratefully thank in advancec anyone who will provide me with infos on any of the points above. Giulio Prisco. CERN EP Division. ------------------------------ Date: 28 Apr 87 22:13:34 GMT From: andrew.cmu.edu!lord#@pt.cs.cmu.edu (Tom Lord) Subject: recorded go games <> Does anyone out there have a library of go games, played by humans, in a machine readable format? I would like to use such a library to test some notions I have about how to build a selective search for the game. Machine readable libraries of joseki, tesuji problems and the like would also be of use. Thanks, Thomas Lord lord@andrew.cmu.edu or tbl@k.cs.cmu.edu ------------------------------ Date: Tue, 28 Apr 87 16:05 EDT From: DON%atc.bendix.com@RELAY.CS.NET Subject: Theorem Proving Text recommendation What is a good, up-to-date, intermediate or advanced automated theorem proving book? If there isn't a list which someone can send me from the archives, I'll collect responses and post. Don Mitchell Don@atc.bendix.com Bendix Aero. Tech. Ctr. Don%atc.bendix.com@relay.cs.net 9140 Old Annapolis Rd. (301)964-4156 Columbia, MD 21045 ------------------------------ Date: 29 Apr 1987 12:23-EDT From: VERACSD@A.ISI.EDU Subject: Symbolics & Sun-3 + Lucid Dev Envs I'm interested in the viability of the Sun-3/160 running Lucid Common Lisp (with Lucid's version of Flavors) as a Lisp development environment. My standard for the comparison are Symbolics 36xx's, which I have a strong predilection toward. I'm especially interested in opinions/remarks by experienced Symbolics programmers who have used Sun-3's with Lucid for more than a few hours. Some specific areas I would like to see addressed are: o the completeness is Lucid's Flavors o the quality of editing and debugging tools o gc o major wins/losses vis-a-vis Symbolics o rough estimate of development time vis-a-vis Symbolics I will be glad to summarize and post if the response warrants it. -- Cris Kobryn ---------------------------------------------------------------------------- Cris Kobryn ARPA: VERACSD.CK@A.ISI.EDU Advanced Systems Development BELL: (619)457-5550 VERAC, Inc. 9605 Scranton Rd., Suite 500 San Diego, CA 92121 ------------------------------ Date: Tue, 28 Apr 87 17:36:01 GMT From: unido!tadam!michael@seismo.CSS.GOV (Michael Beetz) Subject: efficient implementation of meta-level architectures for rule-systems We are currently developing a production rule interpreter that processes explicit and declarative representations of control knowledge. Therefore, we are interested to get contact to people working at the same topics. Our interpreter processes rules like rules in OPS5, meta rules like the rules of the TEIRESIAS system. Rules are partitioned in rule sets and the user can specify phase sequences describing the order in which rule sets are applied within an interpretation process. Or the user can specify conflict resolution rules if more than one rule set is applicable (with each rule set a precondition is associated). We are working at the following topics: 1. Extending the RETE algorithm such that - it can process objects (inheritance!) - it can increase the efficiency of matching by exploiting the partitioning of rule bases in rule sets - can match meta rules (rules that contain patterns of object rules in their condition part) 2. languages for specifying meta-level architectures for rule-based systems. 3. Efficient implementations of RETE algorithms on a SYMBOLICS LISP machine Genera 7.0. Thanks in advance Michael Michael Beetz c/o Gerhard Kraetzschmar Schweppermannstr 5 8500 Nuernberg 10 Federal Republic of Germany ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun May 3 19:26:54 1987 Date: Sun, 3 May 87 19:26:43 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #107 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sun, 3 May 87 19:23 EDT Received: from relay.cs.net by RELAY.CS.NET id aa04473; 3 May 87 18:58 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa20950; 3 May 87 18:54 EDT Date: Sun 3 May 1987 15:31-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #107 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 4 May 1987 Volume 5 : Issue 107 Today's Topics: AI Tools - Kyoto Common Lisp Distribution, Review - Spang Robinson Report, Vol. 3, No. 4, Applications - Tough Speech Recognition Examples (Summary) & Checking Rule-Based Expert Systems ---------------------------------------------------------------------- Date: Thu, 30 Apr 1987 16:57 EDT From: "Scott E. Fahlman" Subject: Notice on Kyoto Common Lisp distribution Mr. Yuasa asked me to pass the following announcement along to the appropriate mailing lists in the U.S.: We, the Kyoto Common Lisp people have decided to distribute KCL through channels other than a commercial company, free of charge out of Japan. We are looking for a best possible channel but it may take some time. Please note the following: 1. We always claimed that no fee is charged for the source of KCL, and if any fee is charged, it is exclusively for the service of distribution, maintenance, etc. of the software. 2. We never received any kind of royalty out of the software or service for it up to present. Research Institute for Mathematical Sciences Kyoto University Reiji Nakajima Taiichi Yuasa Masami Hagiya ------------------------------ Date: Sat, 2 May 1987 19:29 CST From: Leff (Southern Methodist University) Subject: Spang Robinson Report, Vol. 3, No. 4 Summary of Spang Robinson Report April 1987, Volume 3 No. 4 The lead article of the issue is Expert Systems in Japan. A recent survey of Japanese companies indicated that half of them are actively involved in expert systems use or development. They found 50 in prototype stage, 31 being field tested, 19 operating and 5 in commercial use. The majority of Japanese expert systems are on mainframes. BRAINNS (from Toyo Information Systems) and ESHELL are popular tools for expert system development. Japanese AI development is estimated at $170 million/year with fourty percent coming from US imports. [I reported in AILIST elsewhere that U. S. AI revenues were about two hundred million.- LEFF] ADL reports that large Japanese companies are becoming discouraged with ICOT for being out of schedule and insufficient ROI. There is a new joint development project involving 200 companies called SIGMA for automating software generation. It will take natural language input in Japanese and English and generate code automatically. Funding is 160 million over four years. Marty Tenenbaum states that the Japanese are not behind the US in expert systems develop[ment and they are emphasizing applications to real problems. +_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_ An article on the new TI Compact Lisp Machine Some of the information in this article that I have not seen in articles on the CLM that have been reported in AILIST elsewhere is - There are discussions of integrating the TI Explorer Chip into Apple's new machine. - TI may be selling boards to be integrated into commercial as well as military products _+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+ An article on commercial implications of AI Hundreds of expert systems have been "fielded" Dramatic Successes: Hitachi's expert system for floor planning main frame installations has reduced the task from eight hours to fifteen minutes. Canon's expert system for lens design has reduced design time from eight man-months to two man-weeks IBM's storage system saves five million a year (it was developed in six man months) DEC's XCON saves eighteen million a year while costing two million a year to maintain. Most expert systems are small (<300 rules) and are running on micros. _+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+ Applications of expert Systems Nisssan Auto - engine control system diagnosis (fielded) Sanwa Bank - investment consultation system for clients (in use at six branch offices) Tokyo Electric - substation design (in field test), design time reduced by a factor of ten Nihon Steel - blast furnace diagnosis (80 percent accuracy) Seibu Saison - diet consultation gift selection -+-+-+-+-+-+-+-+-+-+-+-+-+-+-+SHORTS-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ The expert system, ACORN, from Gold Hill Computers will now be called GOLDWORKS due to a conflict with Acorn Computers. Inference Corporation's ART is now available under VMS. Intellicorp's KEE is now available on the SUN. They are committed to developing a Japanese version. They have already sold 90 copies in Japan. MAD intelligent systems is bundling a Relational Lisp which supports both classical relational operators and functions for complex and recursive relations. ExperTelligence's Common Lisp on a Macintosh II runs 53 percent faster than a Symbolics Lisp machine (as indicated by the Gabriel DDERIV benchmark) Arthur D. Little is involved in a research project for the Post Office for applying AI to several areas. Intelligent Applications will be selling in the US, a machine-health monitoring system based on vibrations, a tool kit, an Analogue Interface Expert and a Fault Diagnosis and Schematic Capture System. Teknowledge has named Peter Weber President and Chief Operation Officer. He comes from FMC Corporation where he established their AI system. Symbolics has appointed Annie Brooking as marketing director. ++++++++++++++++++++++++++++++++++++++++++++++++++ Also a listing of some papers reporting on Japan's AI research. ------------------------------ Date: 29 Apr 1987 1435-PDT (Wednesday) From: Eugene Miya N. Subject: Tough speech recognition examples (summary) Attached are my so far collected examples of tough speech problems (synthesis and recognition). I am a bit disappointed with the list: smaller, poorer quality, and have not heard from people who are really doing lots of this work. {messages were sent to ailist, comp.ai on the usenet, nihongo on the ARPAnet [Japanese being a significantly difficult language and the NGCProj]}. My plan is to keep this list {collective ailist memory} and ask for new contributions every year (along with my other lists). It will be ftpable from a machine at Ames, as soon as I decide where to put it probably (aurora). My hope is to have a ready list of tests for speech processing naive people to gain some understanding of the problems. I am posting this summary now in hopes of getting a few last examples. >From the Rock of Ages Home for Retired Hackers: --eugene miya NASA Ames Research Center eugene@ames-aurora.ARPA "You trust the `reply' command with all those different mailers out there?" "Send mail, avoid follow-ups. If enough, I'll summarize." {hplabs,hao,ihnp4,decwrl,allegra,tektronix,menlo70}!ames!aurora!eugene ============================================================= From: elman@amos.ling.ucsd.edu (Jeff Elman) Subject: Re: Tough speech recognition examples Raj Reddy (at CMU) has a couple of examples of difficult utterances they gave to HEARSAY and HARPY. One of these was "In mud eels are, in tar none are". The lack of semantic support, plus the ambiguity of segmentation make it almost impossible for someone to understand this sentence when you read it to them at a normal rate of speech. I'd like to hear what responses you get. Would you let me know? Thanks, Jeff Elman Phonetics Lab, C-008 Univ. of Calif., San Diego La Jolla, CA 92093 Internet: elman@amos.ling.ucsd.edu ================================================================== From: mcguire@aero2.aero.org >From my days many years ago in a linguistics laboratory I remember some examples showing the importance of phonetic juncture: grey day / grade A euthanasia / youth in Asia "Whats that up in the road" ahead / a head? Happy collecting Another cute example (though it may not what you are looking for) is to say to somebody: "Take off your hat and dloves" and then ask them what you said. 99% of all people will insist that you said the word "gloves". ================================================================== From: minow%thundr.DEC@decwrl.DEC.COM (Martin Minow THUNDR::MINOW ML3-5/U26 223-9922) I'd be happy if you could do the digits, including "Oh", and Yes/No. Continuous digits, telephone quality, no training, male and female voice. DECtalk should be very easy, as it's predictable. Martin Minow (ex-DECtalk developer) The problem is in distinguishing "oh" from "no". Getting the alphabet (not "alpha", "bravo", but "aye", "bee") would be nice, too. Martin. ================================================================== From: Marc Majka Here one that my office mate Nou Dadoun came up with: I love you Isle of View ================================================================== >From Joseph_D._Becker.osbunorth@Xerox.COM Fri Apr 24 10:06:44 1987 I think you need at least one example in Chinese, and here's my favorite (because I actually said it by mistake). The numbers after the words are phonic "tones". What I meant to say was: Wo(3) hen(3) xiang(3) shui(4)-jiao(4) -- I want to go to sleep ... but what I actually ended up saying was: Wo(3) hen(3) xiang(4) shui(3)-jiao(3) -- I am like a boiled ravioli Joe ================================================================== "ice cream"/"I scream" "beginning"/"big inning" "soccer"/"sock her" "its hardware problems are intermittent"/"it's hard where problems ..." from Mark Twain: "Good-bye God, I'm going to Missouri."/"Good, by God, I'm going to Missouri." --Stephen Slade Slade@Yale.Arpa Came across this last night "attacks"/"a tax" --Stephen ------------------------------ Date: Wed, 22 Apr 87 14:29:14 WET From: "G. Joly" (Birkbeck) Subject: Checking Rule-Based Expert Systems (Response to Info Request). Below is a list of the references I have received to date on the various aspects of checking rule-based systems, together with some related items. Gordon Joly, Dept. of Computer Science, Birkbeck College, University of London. ARPA: gjoly@cs.ucl.ac.uk BITNET: UBACW59%uk.ac.bbk.cu@AC.UK UUCP: ...{seismo,decvax,ucbvax}!mcvax!ukc!bbk-cs!gordon %A F. Barachini %T Konsistenzprufung von Wissensbasen medizinischer Expertensysteme (Consistency checking of knowledge bases of medical expert systems) %I thesis, Tech. Univ. Vienna, Austria %D Feb 1984 %P 153 (in German) %K consistency %A Blum, R.L. %T Computer-Assisted Design of Studies Using Routine Clinical Data: Analyzing the Association of Prednisone and Serum Cholesterol %J Annals of Internal Medicine %V 104 %N 6 %P 858-868 %D June, 1986 %A Boose, John H %A Bradshaw, Jeffrey M %T A Knowledge Acquisition Workbench for Eliciting Decision Knowledge %B Proceedings of the Twentieth Annual International Conference on System Sciences %P 450-459 %D 1987 %A Robert S Boyer (ed) %A J Strother Moore (ed) %T The Correctness Problem in Computer Science %I Academic Press %D 1981 %A Manfred Broy %A Bernhard Moller %A Peter Pepper %A Martin Wirsing %T Algebraic Implementations Preserve Program Correctness %J Sci Comput. Programming %V 7 %D 1986 %N 1 %P 35-53 %A W. Chehire %T SYPRUC: a knowledge representation and manipulation system %B 6th International Workshop on Expert Systems and their Applications %C Avignon, France %D April 1986 %P 933-946 (in French) %K consistency %A Eshelman, Larry %A McDermott, John %T MOLE: A Knowledge Acquisition Tool That Uses Its Head %J Proceedings of the American Association of Artificial Intelligence %P 950-955 %D 1986. %A D. W. Etherington %T Formalizing Nonmonotonic Reasoning Systems %J Artificial Intelligence %V 31 %N 1 %D 1987 %P 41-86 %A Ginsberg, Allen %T A Metalinguistic Approach to the Construction of Knowledge Base Refinement Systems %B Proceedings of the American Association of Artificial Intelligence %P 436-441 %D 1986 %A Ginsberg, Allen %A Weiss, Sholom %A Politakis, Peter %T SEEK2: A Generalized Approach to Automatic Knowledge Base Refinement %B Proceedings of the Ninth International Joint Conference on Artificial Intelligence %P 367-374 %D 1985 %A E. J. Horwitz %A D. E. Heckerman %T The Inconsistent use of Measures of Certainty in Artificial Intelligence Research %E Kanal %B Uncertainty in Artificial Intelligence %I North Holland %D 1986 %A H. Langmaack %T A New Transformational Approach to Partial Correctness Proof Calculi for ALGOL68-Like Programs with Finite Modes and Simple Side Effects %P 73-102 %D 1985 %A Loveland, D.W. %A Valtorta, M. %T Detecting Ambiguity: An Example in Knowledge Evaluation %B Eigth International Joint Conference on Artificial Intelligence %P 182-184 %D 1983 %A Jim A. McMannama %T A Non-cognitive Formal Approach to Knowledge Representation in Artificial Intelligence %I US Air Force Institute of Technology (University MicroFilms). %D 1986 %A Michalski, R.S. %A Baskin, A.B. %A Spackman, K.A. %T A Logic Approach to Conceptual Database Analysis %B Proceedings of the Sixth Annual Symposium on Computer Applications in Medical Care %P 792-796 %D 1982 %A Michalski R.S. %A Baskin, A.B. %A Uhrik, C. %A Channic, T. %T The ADVISE.1 Meta-Expert System: The General Design and a Technical Description %R Report No. UIUCDCS-F-87-962, Department of Computer Science University of Illinois, Urbana %D 1987 %A Nguyen, T. A. %T Verifying Consistency of Production Systems %B Proc. of the 3rd IEEE Conference on Artificial Intelligence Applications %C Orlando, Florida %P 4-8 %D February 1987 %A Nguyen, T.A. %A Perkins, W.A. %A Laffey, T.J. %A Pecora, D. %T Checking an Expert Systems Knowledge Base for Consistency and Completeness, %B Ninth International Joint Conference on Artificial Intelligence %P 375-378 %D 1985 %A E. Pipard %T Detection of contradictions in knowledge bases %B 5th International Workshop on Expert Systems and their Applications %C Avignon, France %D May 1985 %P 995-1010 (in French) %K consistency %A P. G. Politakis %A Sholom M. Weiss %R Technical Report CBM-TR-113 %I Rutgers University, Department of Computer Science %T Designing Consistent Knowledge Bases: An Knowledge Acquisition Approach to Expert Systems %D September 1980 %D March 1982 %K consistency %A P. G. Politakis %A Sholom M. Weiss %T Using Empirical Analysis to Refine Expert System Knowledge Bases %J Artificial Intelligence %V 22 %N 1 %P 23-48 %D 1984 %A Quinlan, J.R. %T Consistency and Plausible Reasoning %B Eigth International Conference on Artificial Intelligence %P 137-144 %D 1983 %A Reubenstein, Howard B. %T OPMAN: An OPS5 Rule Base Editing and Maintenance Package %I MIT %B Master's Thesis, Department of Electrical Engineering and Computer Science %P 115 %D 1985 %A Reinke, Robert E. %T Knowledge Acquisition and Refinement Tools for the ADVISE Meta-Expert System %R Report No. UIUCDCS-F-84-921 %I Department of Computer Science, University of Illinois %D 1984. %A J. T. St.Johanser %A R. M. Harbidge %T Validating expert systems: problems and solutions in practice %B KBS 86: Knowledge Based Systems. Proc. of the International Conference %C London, England %D July 1986 %P 215-219 %K validation %A Spackman, Kent Alan %T QUIN: Integration of Inferential Operators in a Relational Database %B Masters Thesis %I Department of Computer Science, University of Illinois, Urbana Illinois %D 1982. %A Stachowitz, Rolf A. %A Combs, Jacqueline B. %T Validation of Expert Systems %B Proceedings of the Twentieth Annual Hawaii Conference on System Sciences %P 686-695 %D 1987 %A R. Steinmetz %A S. Theissen %T Integration of Petri nets into a tool for consistency checking of expert systems with rule-based knowledge representation %B 6th European Workshop on Applications and Theory of Petri Nets %C Espoo, Finland %D June 1985 %P 35-52 %K consistency %A Suwa, W. %A Scott, A.C. %A Shortliffe, E.H. %T An Approach to Verifying Completeness and Consistency in a Rule-Based Expert System %J AI Magazine %P 16-21 %D Fall 1982. %A Adrian Walker (Ed.) %A Michael McCord %A John F. Sowa %A Walter G. Wilson %T Knowledge Systems and Prolog - A Logical Approach to Expert Systems and Natural Language Processing (Addison-Wesley) %D 1987 %A Wilkins, David C. %A Buchanan, Bruce G. %T On Debugging Rule Sets When Reasoning Under Uncertainty %B Proceedings of the American Association of Artificial Intelligence %P 448-454 %D 1986. The following will appear in the proceedings of the Avignon-87 meeting, "Expert Systems and their Applications", May 15-18 1987, Avingnon, France. G. Soula et al: A multi-validation of the PROTIS expert system. S. Puuronen: A tabular rule-checking method M.-C. Rousset: On knowledge-base validity: The COVADIS system. E.F. Miller: Expert systems validation and verification: Issues and approaches. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun May 3 19:37:21 1987 Date: Sun, 3 May 87 19:37:13 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #108 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sun, 3 May 87 19:35 EDT Received: from relay.cs.net by RELAY.CS.NET id ad04509; 3 May 87 19:09 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa21031; 3 May 87 19:10 EDT Date: Sun 3 May 1987 15:50-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #108 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 4 May 1987 Volume 5 : Issue 108 Today's Topics: Linguistics - Grammar and Style Checkers, Humor - Text Critiquing ---------------------------------------------------------------------- Date: Mon, 20 Apr 87 12:15:28 CST From: g-chapma@gumby.wisc.edu (Ralph Chapman) Subject: re: grammar checkers I was asked to forward this message in response to the article by Linda G. Means: Date: Thu, 16 Apr 87 15:18:42 CDT From: sklein@rsch.wisc.edu (Sheldon Klein) Message-Id: <8704162018.AA06807@rsch.wisc.edu> Subject: Re: grammar checkers I accept the note as one more piece of evidence that the field of Comp Sci, Comp Ling & AI are providing the prosthetic devices to allow otherwise unemployable segments of the World population to function for pay in occupations for which they would have been congenitally unqualified in an earlier era. Those capable of constructing complex sentences which, to some pundits of an earlier era reflected the ability to think complex thoughts, will have to abandon their elitist modes of cognition for the greater benefit of the larger segment of humankind. ------------------------------ Date: Fri, 24 Apr 87 17:11:39-1000 From: scubed!sdcsvax!uhccux.UHCC.HAWAII.EDU!nosc!humu!todd@seismo.CSS.GOV (The Perplexed Wiz) Subject: re: writing style checkers Path: uhccux!todd From: todd@uhccux.UUCP (The Perplexed Wiz) Newsgroups: comp.ai.digest Subject: Re: AIList Digest V5 #95 Message-ID: <443@uhccux.UUCP> Date: 24 Apr 87 01:25:22 GMT References: <12295086246.19.HAYES@SPAR-20.ARPA> Reply-To: todd@uhccux.UUCP (The Perplexed Wiz) Distribution: world Organization: U. of Hawaii, Manoa (Honolulu) Lines: 40 In article <12295086246.19.HAYES@SPAR-20.ARPA> HAYES@SPAR-20.ARPA writes: >Let me briefly add a seconding voice to Linda Means comments on the horrible >output of the style-criticising programs illustrated a while ago. That >people should suggest using such things to influence children almost makes >me agree with Weizenbaum. ...[comment that it couldn't be good if it runs on a PC was here] >and superficial rules in a context-insensitive fashion. Any kid who was >'taught' by one of these would quickly learn these rules. A few experiences >like this, though, and (s)he would learn that most problems are solved by >applying a few superficial rules without any need for deeper thinking, which is >a worse and more dangerous lesson. I think that we have two extreme views here. I agree that the style checkers available for microcomputers are not very sophisticated. I also agree that such tools should not be used exclusively to teach children (or any other age group for that matter). However, to say that these microcomputer based style checkers have no place in teaching children to write in not correct. I think that if these style checking tools are used in conjunction with the efforts of a good teacher of writing, then these style checkers are of great benefit. It is better that children learn a few rules of writing to start with than no rules at all. Of course, reading lots of good examples of writing and a good teacher are still necessary. [And no, I don't claim to be a good writer :-)] On another level... I happened to discuss my response above with one of my dissertation committee members. His reaction? He pulled out a recent thesis proposal filled with red pencil marks (mostly grammatical remarks) and said, "So what if the style checkers are superficial? Most mistakes are superficial. Better that the style checker should find these things than me." Todd, Ogasawara -- PhD. Psychology 1987 (if the phase of the moon is right, I cross my fingers enough, etc. :-) -- Todd Ogasawara, U. of Hawaii Computing Center UUCP: {ihnp4,seismo,ucbvax,dcdwest}!sdcsvax!nosc!uhccux!todd ARPA: uhccux!todd@nosc.MIL INTERNET: todd@uhccux.UHCC.HAWAII.EDU ------------------------------ Date: Tue, 21 Apr 87 9:43:04 EDT From: Bruce Nevin Subject: text critiquing redux (humor) The following is a copy of some correspondance which took place between an editor and a Mr. Lewis Carroll: Dear Mr. Carroll, The publisher has referred to me your latest work, a poem called "Jabberwocky," for editing. "Jabberwocky" seems rife with misspellings and typos; I assumed that these were unintentional and the fault of your typist. Fortunately, we have recently purchased PROFS (Professional Office Systems), a new IBM package that includes a sophisticated proofreader and spelling checker. This program is able to guess quite accurately as to what the misspelled word may actually be. PROFS also offers synonyms and alternatives for words, and it can note redundant, awkward or wordy phrases. I have run "Jabberwocky" through this program. Granted, your obvious intent is to produce a work of fantasy, so I've taken some of your proper nouns to be creations of your imagination. Certain words, however, weren't clear. For example, the first line of your original text read: "Twas brillig, and the slithy toves." The only words recognized by the PROFS proofreader were "and the." When I hit a key marked "aid," I get a list of what PROFS construes to be possible spellings of a flagged word. With "slithy," PROFS came up with slithery, slimy, slither, slimly, silty, slinky, and slight. Your typist must have inadvertently dropped the "er" from "slithery" and come up with the nonsense "slithy." Of course, I fixed the word to say "slithery." And so it goes. I continued to make repairs as I deemed fit. But Mr. Carroll, the mistakes were not always clear. For example, in the first verse your text read: "All mimsy were the borogoves." The computer thought that you had meant to say: "All misty were the bongoes," but bongoes is a far shot from borogoves. What did you mean by borogoves? In the second verse, you warn to "shun the frumious Bandersnatch!" "Frumious" is obviously a misspelling of "furious"; however, I have no idea as to just what a Bandersnatch might be. Our computer has suggested "Ballerinas," but I suspect that you had something better in mind. Mr. Carroll, I've edited many fantasies, so I must warn you that I am familiar with all forms of sword, be they elfish, dwarfish or otherwise. I have already heard of the "vorpal sword" you mentioned in verse three. It seems to have gained popularity among role-playing game enthusiasts,(1) but I'm not sure its reference is appropriate here. The computer certainly doesn't have "vorpal" in its memory, so I'm not sure that the public would appreciate your using the word. I have let the computer substitute "verbal" for "vorpal," and I believe that you will find the result has a nice ring to it. Some of the other gems that your secretary came up with include an "uffish" thought, "whiffling" when you certainly meant "waffling," and some sort of wood. She called it a "tulgey wood." Again the computer came through: Did you mean "turkey wood?" Admittedly, the computer had quite a time with "turkey wood"; it insisted that it should have been "turkey would." But that would have been nonsense. A good editor shouldn't be afraid to override a computer. When I first saw the word "chortled" I was sure that you had made it up!(2) The computer didn't flag it as being misspelled, but it couldn't offer any synonyms for it either. On looking it up, I was amused to discover that it was meant to be a cross between a chuckle and a snort. How clever of you to find it! Well, enough criticism. I'm sure your poem is salvageable. It's a pity, though, that even "cleaned up" this poem would be far too difficult for children to read. One function of the PROFS proofreader is to check the comprehension level of a word. I'm afraid that some of the words you use are level 16, i.e., a person would have to be a graduate student or better to understand the word. That's too bad, because there's quite a market for children's verse. Anyway, I've underlined the unrecognizable words in your original and I'm returning it to you. I've also enclosed the result of my collaboration with the computer; I believe that you will find the corrected version to be pleasing, understandable and in keeping with your reputation. Let me know what you think. I hope you understand that there are few publishers out there who care to take the time to work with promising authors. Yours truly, xxxxx xxxxxx -------------------- (1) To "Dungeons and Dragons" players, a "vorpal sword" has the power to sever limbs when the player rolls 18 or higher. The word is a Carroll creation. (2) "Chortle," a word coined by Carroll, has worked its way into standard dictionaries. JABBERWOCKY 'Twas brillig, and the slithy toves ----- ------- ------ ----- Did gyre and gimble in the wabe: ---- ------ ---- All mimsy were the borogoves, ----- --------- And the mome raths outgrabe. ---- ----- -------- "Beware the Jabberwock, my son! ---------- The jaws that bite, the claws that catch! Beware the Jubjub bird, and shun ------ The frumious Bandersnatch!" -------- ------------ He took his vorpal sword in hand: ------ Long time the manxome foe he sought -- ------- So rested he by the Tumtum tree, ------ And stood awhile in thought And, as in uffish thought he stood, ------ The Jabberwock, with eyes of flame, ---------- Came wiffling through the tulgey wood, -------- ------ And burbled as it came! One, two! One, two! And through and through The vorpal blade went snicker-snack! ------ He left it dead, and with its head He went galumphing back. ---------- "And hast thou slain the Jabberwock? ---- Come to my arms, my beamish boy! ------- O frabjous day! Callooh! Callay!" -------- ------- ------ He chortled in his joy. 'Twas brillig, and the slithy toves ----- ------- ------ ----- Did gyre and gimble in the wabe: ---- ------ ---- All mimsy were the borogoves, ----- --------- And the mome raths outgrabe. ---- ----- -------- JABBERWHACKY 'Twas broiling, and the slithery toes Did gore and gimlet in the wave: All misty were the bongoes, And the mole rats outraged. "Beware the Jabberwock, my son! The jaws that bite, the claws that catch! Beware the Jubjub bird, and shun The furious Ballerinas!" He took his verbal sword in hand: Long time the meantime foe he sought -- So rested he by the Tumtum tree, And stood awhile in thought And, as in iffiest thought he stood, The Jabberwock, with eyes of flame, Came waffling through the turkey wood, And burbled as it came! One, two! One, two! And through and through The verbal blade went snicker-snack! He left it dead, and with its head He went galloping back. "And hast thou slain the Jabberwock? Come to my arms, my beaming boy! O fabulous day! Callooh! Callay!" He chortled in his joy. 'Twas broiling, and the slithery toes Did gore and gimlet in the wave: All misty were the bongoes, And the mole rats outraged. [For the record, a mailer history (in reverse order): Resent-From: Jane Doherty Resent-Date: Mon, 20 Apr 87 15:58:42 EDT From: Jack Allen 381-2141 Date: Friday, 17 Apr 1987 06:43:02-PDT From: DSSDEV::EPPES "her shoes were full of feet From: ABACUS::WOOD "If we couldn't laugh we would all go insane 16-Apr-1987 -BN] ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sun May 3 20:28:28 1987 Date: Sun, 3 May 87 20:28:13 edt From: vtcs1::in% To: ailist@stripe.sri.com Subject: AIList Digest V5 #109 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Sun, 3 May 87 20:23 EDT Received: from relay.cs.net by RELAY.CS.NET id ad04531; 3 May 87 19:15 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa21056; 3 May 87 19:15 EDT Date: Sun 3 May 1987 15:55-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #109 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 4 May 1987 Volume 5 : Issue 109 Today's Topics: Bibliography - Leff Bibliography ai.bib54AB ---------------------------------------------------------------------- Date: Tue, 14 Apr 1987 00:07 CST From: Leff (Southern Methodist University) Subject: ai.bib54AB %A Elizabeth Corcoran %T Strategic Computing: A Status Report %J IEEE Spectrum %D APR 1987 %V 24 %N 1 %P 50-54 %K AA18 AI06 ABE Teknowledge KEE AI15 AI09 H03 Mach RP3 Princeton Massive Memory Machine AI05 AI01 %X 1987 budges for DARPA strategic computing AI related activities .DS L DS L Naval Battle Management $5.3 million Pilot's Associate $5.3 million 'Smart' Weopons $5.6 million Adries-Scorpius $5.3 million Autonomous Land Vehicle $5.3 million Air-land battle management $3.6 million Vision $5.5 million Speech Recognition $5.2 million Knowledge Based Systems $4.5 million Natural Language $4.2 million Planning $1.8 million Integrated Interfaces $1.3 million Design and Manufacturing $900 thousand (The article provides 1989 and 1992 projected amounts as well) .DE DE .sp sp Early successes in this program include a data compression method 10,000 times more powerful than anything else. .sp sp There is also a nice matrix indicating which contractors are working on which phases of the project. %A Charles Babcock %T Cullinet Plans SQL-Based Line %J ComputerWorld %V 21 %N 14 %D APR 6, 1987 %P 6 %K AA09 AI01 COBOL VAX %X Cullinet will be offering expert system development environment for VAXEN and software to allow people to embed expert systems in their mainframe COBOL environments. %A James Ledbetter %T Technology Transfer %J ComputerWorld %V 21 %N 14 %D APR 6, 1987 %P 63-68 %K AT18 U. S. West %X describes efforts at U. S. West in getting users to identify meaningful applications for artificial intelligence in their own departments. %A J. F. Watson %T A Grammar Rule Notation Translator %J SIGPLAN Notices %V 22 %N 4 %D APR 1987 %P 16-27 %K Turbo-Prolog T02 %X This article includes the source of a Turbo-Prolog program that will convert Grammar Rule Notation to Prolog. The Prolog it produces should run under any standard PROLOG, not necessarily Turbo-Prolog. %A D. Harel %T Logic and Databases: A Critique %J SIGPLAN Notices %V 22 %N 3 %D MAR 1987 %P 14-20 %K AA09 AI10 %A W. Hankley %T Feature Analysis of Turbo Prolog %J SIGPLAN Notices %V 22 %N 3 %D MAR 1987 %P 111-118 %K C-Prolog H01 AT17 T02 %X This paper extends Weeks review of six microcomputer Prologs to include Turbo Prolog. Turbo Prolog misses virtual memory and a clause grammar (represented by the "->" notation.) It does provide access to bios calls, MS-DOS commands and code written in other languages, the capability of compilation, a context editor and modularization. There is also a list of built-in predicates indicating which ones C-PROLOG and TURBO-PROLOG possess. %A J. A. Goguen %A J. Meseguer %T Remarks on Many-Sorted Equational Logic %J SIGPLAN NOtices %V 22 %N 4 %D APR 1987 %P 41-48 %K AI10 AI16 %X Discusses soundness and completeness results for many-sorted equational logic and models that permit empty carriers. Also discussion of alleged misstatements in Loeckx, J. and Bernd Mahr, A Note on the Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets, Technical Report A 58/01, Fachbereich Informatik, Universitat des Saarlandes, 1985 and Ehrig and Mahr 85, Ehrig, Hartmut and Bernd Mahr, Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, Springer-Verlag, 1985. %A T. W. Jerardi %T Puzzles, PROLOG and Logic %J SIGPLAN NOtices %V 22 %N 4 %D APR 1987 %P 63-69 %K T02 AI16 humor %X A humorous piece about the responses of Gerhard Gentzen, John von Neumann, Alfred Tarski and David Hilbert to a computational logic conference. %A David M. Harland %A Bruno Beloff %T Objekt: A Persistent Object Store with an Integrated Object Store With An Integrated Garbage Collector %J SIGPLAN NOtices %V 22 %N 4 %D APR 1987 %P 70-79 %A Alexander Wolfe %T TI Puts Its Lisp Chip Into a System for Military AI %J Electronics %D MAR 19, 1987 %P 95-96 %K H02 AA18 %V 60 %N 6 %X The TI Lisp Process chip will become part of the Military ARIES system a shoe box sized computer for embedded AI systems. %T Want to Open an AI Office in Dayton, Ohio, Talk to the Air Force %J Electronics %D MAR 19, 1987 %P 102 %K AA18 %V 60 %N 6 %X The Wright Patterson Air Force Base is taking bids for a vendor to provide quick response AI studies and provide training. %A Ernest R. Tello %T The GCLISP 286 Developer %J Byte %D APRIL 1987 %V 12 %N 4 %P 241-244 %K T01 H01 AT17 %X Review of GOld Hill's Common Lisp System. The interpreter needs 1.5 meg of memory and the compiler needs 3 meg of memory and 700K of hard disk space. This system supports "stack groups", a Zeta Lisp feature not part of the Common Lisp standard which allows multiple environments to exist and communicate like coroutines. The system includes comparisons of the system with VAX 750, Xerox Dandelion and Symbolics 3600. %T What's New %J Byte %D APRIL 1987 %V 12 %N 4 %P 42 %K AI05 AT02 %X Voice-Scribe 1000 recognizes 1000 words with 99.3& accuracy. It costs $1195.00 %T CAN AI Vault into the Banking Industry %J ComputerWorld %V 21 %N 10 %D March 9, 1987 %P 72-73 %K AA06 Cogensys Syntelligence Wells Fargo First Wachovia Bank AI01 AI02 SWIFT electronic fund transfer %X Cognitive Systems and Citibank Information Resources are marketing systems to assist in formatting and understanding SWIFT messages for electronic fund transfer. Cognitive Systems developed Courtier for Societ de Generale de Bankque in Brussells. This system is a porfolio management system with natural language interface. %A Alan J. Ryan %T Hiring AI Pros Can be Tricky %J ComputerWorld %V 21 %N 10 %D March 9, 1987 %K personnel Robert Half %X Robert Half sees little market for AI specialists. Some vendor companies are laying off which lowers the demand. %A Dwight B. Davis %T Artificial Intelligence Goes to Work %J High Technology %D APR 1987 %V 7 %N 4 %P 16-24 %K American Express ART Bob Flast Laurel Miller AI01 AA06 AA05 AA04 AA26 APEX Applied Expert Systems AA18 Westinghouse electric power distribution relay AI07 Ford Motor AA21 Linda Farrell Home Owners Warranty AI06 AA09 %X American express Corporation has an AI system to help approve charge authorizations that are outside the typical credit patterns. One of the original purchasers of Plan Power says that for simple plans it provides "A-quality" plans and for "very complex" plans, it works at a "C+-quality" Northrop is using AI to develop plans for the manufacture of parts in military aircraft. The system interfaces iwth PC's for the part description data and a simulation package (SIMKIT) to verify the plans. They are working to interface the system directly to the CAD/CAM database. The system also discusses the CORA system to help specify and customize relay-protection systems for utilities. Ford Motor is developing a ROBOT diagnosis system on IBM PC's. The system is already in use and they are making available the system code to any interested robot supplier. They found that 20% of the necessary rules handle 60 to 80 percent of the problems. More/2 helps direct mailers optimize their mailings. It examines the results of previous mailings and limited test mailings. Also a discussion of Home Owner's Warranties with Artificial Intelligence's Intellect natural language database interface. %A Alan J. Ryan %T RCA to Spruce Voice Package %J Computer World %V 21 %N 12 %D MAR 23, 1987 %K AT16 Verbex RCA AI05 %X RCA will integrate VERBEX's continuous speech technology in research and development projects. %A Henry Firdman %T Use English to Sell AI %J Computer World %V 21 %N 12 %D MAR 23, 1987 %P 19+ %K AT22 %X Argument that AI company salesman should address the customer's problems. Also calls for a rise of companies that integrate AI tools with custom programming to solve a customer's application. England has two companies AI Ltd and Vanilla Flavor Co. that does this sort of work. %T Software and Services %J Computer World %V 21 %N 12 %D MAR 23, 1987 %P 34 %K Waterloo Watcom Products Mystech Associates T02 T03 AT02 %X Watcom Products from Waterloo has announced a Prolog interpreter for the IBM mainframe for $1800.00. Mystech Associates sells expert system tools for Xerox Corp. 1100 ($3500.00), Common Lisp under IBM PC ($1500 to $2000.00) and C under IBM PC ($2000.00 to $2500.00) %T Hard Bits %J Computer World %V 21 %N 12 %D MAR 23, 1987 %P 64 %K H03 BBN Butterfly MITRE FMC NRL %X BBN Butterfly sales include Mitre Corporation, FMC, Naval Research Laboratories and Indiana University %T Palantir Enhances Processing %J Computer World %V 21 %N 12 %D MAR 23, 1987 %P 68 %K AT02 AI06 Palantir %X Palantir is now selling scanners which includes software to deal with the reading of poor quality photocopies. They cost $3500.00 %T Software Helps Manage Expert-System Database Storage %J Computer %D MAR 1987 %P 92 %V 20 %N 3 %K AT02 AA09 AI01 Software A&E Knowledge-Based Engineering H01 %X DBA Assistant helps manage data base storage. Current versions are for the IBM PC to work with Cullinet IDMS/R2. Later versions will support IBM DB2 and Sperry dMS-100. %T Golden Retrieval Uses AI to Find and Fetch Text %J Computer %D MAR 1987 %P 92 %V 20 %N 3 %K AT02 H01 AA14 %X a system to search files for text that can handle queries where spelling is unclear or the order of words is unknown. S. K. Data, P. O. Box 413, Burlington, MA 229-8909, $99.00 %T Common Lisp System Interfaces to Microsoft C %J Computer %D MAR 1987 %P 90 %V 20 %N 3 %K H01 AT02 T01 %X TransLisp Common Lisp runs on IBM PC and interfaces ith Microsoft C. Solution Systems, $195.00 %T AI Tools Helps Design Application Interfaces %J Computer %D MAR 1987 %P 90 %V 20 %N 3 %K T01 H01 AT02 %X Expertelligence has linked their Common Lisp language to various application tools on the Macintosh to do application interfaces. %A James Connolly %T Builders Will Test Engine %J ComputerWorld %V 21 %N 11 %D MAR 16, 1987 %P 51+ %K AT02 H03 H02 Bettex %X Bettex will be selling an engine supporting both symbolic processing and parallel processing. It has 1 million pixel/second graphics and special hardware/software for desktop publishing type applications. %A James A. Martin %T IBM Recruits Syntelligence %J ComputerWorld %V 21 %N 11 %D MAR 16, 1987 %P 89+ %K AT16 AI01 AA06 %X IBM will be joint marketing Syntelligence's expert systems for insurance underwriting and commercial lending. %A Theodore F. Lehr %A Robert G. Wedig %T Toward a GaAs Realization of a Production System Machine %J Computer %D April 1987 %P 36-46 %V 20 %N 4 %K OPS5 RETE H02 AI01 %X Describes a uniprocessor configuration for the implementation of such languages as OPS5 and the RETE Algorithm. %T Symbolics Signs Two Resellers %J Electronic News %V 33 %N 1648 %D MAR 30, 1987 %P 38 %K AT16 H02 Symbolics Evans and Sutherland Thinking Machines AI12 %X Symbolics has signed var agreements with the makers of the Connection Machine and the Pixar graphics unit. %A Charles Bermant %T Hand Scanner Reads Data Into Programs %J Infoworld %V 9 %N 13 %D MAR 30, 1987 %P 1+ %K AI06 AT02 H01 %X Saba Technologies is selling a hand-held reader for typewritten, laser-printer, line-printed and dot-matrix printed text with an error rate of 1 in 1300 (better than typing). %T Expert System Designed for Apollo Workstations %J Infoworld %V 9 %N 13 %D MAR 30, 1987 %P 1+ %K Apollo Palladian AI01 AA06 AT02 AT16 %X Palladian's Management advisor has been ported from Lisp Machines to the Apollo Workstation. %A Jeff Angus %T Avyx Develops Specialized Scheduling System for NASA %J Infoworld %V 9 %N 13 %D MAR 30, 1987 %P 10 %K scheduling project management AI01 AT02 H01 %X An MS-DOS AI based project scheduling system, originally developed for NASA, is available from Avyx for $995.00 %A Edward Warner %T Arity Uses Lotus Funding to Ready AI Applicato/n %J Infoworld %V 9 %N 13 %D MAR 30, 1987 %P 27 %K AI01 H01 AT16 T02 %X Arity will be introducing a business tool with financing from Lotus and Bank of America. They also anticipate a new version of its PROLOG with windows and built in editor. Users of Arity Prolog with percentage of Arity Prolog sales attributable to each use. .DS L DS L software developer 50% education and R&D Labs 20% government and contractors 10% industrial users 10% commercial users 10% .DE DE %A Y. V. Reddy %A Ravi S. Raman %A Rafal T. Dziedzic %A Alan W. Bucher %A Narendar A. Reddy %T A Unified Approach to AI Programming %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 587-594 %K AA03 T01 AA28 %X describes an integrated AI tool including standard expert system stuff, knowledge-based simulation, database interface, object based programming, alternate worlds that is written in C. Also includes a brief discussion of AI applications to coal mining. %A Nayel El-Shafei %T Quantitative Discovery and Reasoning about Failure Mechanisms in Pavement %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 595-608 %K AA05 AI03 %X The application here is to deal with a field in which new theories for pavement failure are being developed and it is desired to integrate these with test cases to help. Th learning work is an extension on BACON in that it uses dimensional analysis to insure that theories proposed have physical meaning. It also uses step-wise regression. %A Michael J. Freiling %A Steven Rehfuss %A James H. Alexander %A Steven L. Messick %A Sheryl J. Shulman %T The Ontological Structure of a Troubleshooting System for Electronic Instruments %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 609-620 %K AI16 AI01 AA04 AA21 AI15 HIPE SPOONS oscilloscope Tektronix entity relationship model denotational semantics %X This is a system to allow the entry of the data needed to diagnose faults in electronic instruments such as oscilloscopes. This describes a formal approach for defining the physical properties of the objects, the state space and heuristics using denotational semantic techniques. %A Jean Patrick Tsang %T Genericity in Expert Process Planning Systems %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 621-637 %K machining AA05 assembly AA26 AI01 %X Describes a generic expert system for machining and assembly. %A D. V. Zelinski %A R. N. Cronk %T ES/AG: An Expert System Generating Environment and Its Use in Engineering Applications %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 639-649 %K OPS5 AA05 inductor magnetic configuration local area network T01 T03 %X Describes an expert system tool that evolved from a configuration/ordering expert system for 5ESS telephone switches. The system has been used in local area network expert systems nad the design of magnetic components such as inductors. It has been benchmarked against OPS4 and performed the same task in 1/20 of the time. It is also interfaced with the Franz Lisp and XLISP systems. %A R. H. Allen %T Design Guidelines for Expert Systems %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 1 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 651-658 %K AT08 T03 AI01 %X describes a classification for expert systems and a list of types of expert system tools. %A John L. Wilson %A George K. Mikroudis %A Hsai-Yang Fang %T GEOTOX: A Knowledge-Based System for Hazardous Site Evaluation %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 661-671 %K AA03 AA10 AA05 O04 AI01 %X This system assists an engineer in evaluating hazardous waste dumps providing expertise in hydrology, civil engineering, geology, chemistry, demography and climatology needed for this task. %A Jorgen Bo Nielsen %T A Learning System for Identification and Ranking of Severe Storms %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 673-685 %K meteorology oil drilling North Sea AI01 AI04 AA16 AA03 %X This system will look at the meteorological data and identify those storms that are the most severe and determine the sea-states that those storms would have caused. The system has been validated and used in North Sea offshore oil drilling platforms. %A Sten Lindberg %A Jorgen Bo Nielsen %T Modelling of Urban Storm Sewer Systems %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 687-696 %K AA05 AI01 MOUSE AA15 %X An expert system is to be integrated in the MOUSE system for sewer design to provide consulting expertise and to assist the user in resolving numerical instability problems. An installation expert system already exists. %A Ashok Gupta %A Arvind K. Jain %T Application of Artificial Intelligence in Offshore Structures %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 699-706 %K AI01 AA05 %X provides a general framework for expert system for analysis and design of offshore structures. %A John C. Kunz %A Thomas Bonura %A Marilyn J. Stelzner %A Raymond E. Levitt %T Contingent Analysis for Project Management Using Multiple Worlds %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 707-718 %K AI13 AI16 Intellicorp AA03 offshore oil drilling AI15 AI01 AA05 %X Project plans for concrete gravity offshore oil drilling platforms in the North Sea are treated in a decision support environment. The Intellicorp "multiple world" feature is used to help the user understand results of various decisions. %A R. Pearse %A M. Rosenbaum %T The Evaluation of Proposed Road Corridors by the Use of an Expert System %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 699-706 %K AI01 AA05 T02 AI12 AI15 %X This proposed system considers engineering factors, social, economic and environmental factors in choosing the path for a road. %A Ian C. Taig %T Expert Aids to Finite Element System Applications %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 759-770 %K PATRAN mesh generation optimization AA05 AI01 AI03 domain expert %X This finite element analysis system aid assists in mesh generation, helps decide how to model joints ando ther features, negotiates iteratively the problem size, mesh size to insure that the analysis can be done in the available computer time and space. It has no interface to the finite element system. It is a 2000 rule expert system and was produced by a finite element analysis expert (a compiler of the NAFEMS Guidelines to Finite Element Practice). Other efforts to be done include interface to PATRAN and use with shape optimization. %A Michael A. Rosenman %A John S. Gero %A Rivka Oxman %T An Expert System for Design Codes and Design Rules %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 745-758 %K O01 Build T03 T02 SUN AA05 architecture kitchen Australian Model Uniform Building Code %X This system assists in the design of buildings and is based upon design codes. It includes an interface that allows a display of the drawing of a house layout while the expert system is being consulted. %A P. H. Milne %T An Expert System for Road Curve Design and Setting Out %B Applications of Artificial Intelligence in Engineering Problems %E D. Sriram %E R. Adey %V 2 %I Computational Mechanics Publications %C Woburn, Massachussetts %D 1986 %P 733-743 %K AI01 Apple II-C Basic H01 AA05 surveying theodolite %X This system allows for the design of the curves necessary in a road to make turns, allow banking of cars or to deal with changes in height. It also assists with the survey task in the field in actually building the road. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Wed May 6 16:16:23 1987 Date: Wed, 6 May 87 16:16:17 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #110 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Wed, 6 May 87 16:13 EDT Received: from relay.cs.net by RELAY.CS.NET id af19672; 6 May 87 1:09 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa03720; 6 May 87 1:07 EDT Date: Tue 5 May 1987 21:49-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #110 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Wednesday, 6 May 1987 Volume 5 : Issue 110 Today's Topics: Queries - Common Lisp Books & CAD Document Scanning & CSG --> Octree Spatial Representation Translation & DataFlow & Expert Systems for Networking & Extracting Knowledge From Databases, AI Tools - OPS5 Addresses & Kyoto Common Lisp Addendum, Application - Grammar Checkers ---------------------------------------------------------------------- Date: 4 May 87 21:23:19 GMT From: bill@hao.ucar.edu (Bill Roberts) Subject: Good Common Lisp books Can anyone make a comparison between Wilensky's "CommonLispCraft" and Tatar's "A Programmer's Guide to Common Lisp"? What are the strengths and weaknesses of each book? I know about Steele's book but it is in a different class. Thanks in advance for any input. Bill Roberts NCAR/HAO Boulder, CO !hao!bill ------------------------------ Date: 4 May 87 18:37:06 GMT From: nsc!amdahl!ptsfa!jeg@decwrl.dec.com (John Girard) Subject: RFI - CAD Systems that can scan existing documents RFI - CAD This is a request for information from the *academic* sector. There are several other people working on the commerical sector offerings. Our company has a significant number of hand-drawn diagrams depicting sites and equipment. We would like to get these documents into electronic media *and* simultaneously develop an automated inventory. The documents are fairly consistent and contain a limited number of symbols, although sometimes the symbols may be touching. The length of lines connecting the symbols and the types of lines is important. The known alternatives are: Manual data base entry and manual CAD composition Video scan of documents followed by "touch up" and manual data base entry Highly automated scan of documents with automatic touch up, automatic object identification, and automatic data base entry - manual monitoring and minor manual adjustments. Obviously the 3rd alternative is the best. Is anyone working on this type of problem? Please contact LALEH FARR PACIFIC BELL 2600 CAMINO RAMON ROOM 2S500T SAN RAMON, CALIF. U.S.A. 94583 415-823-7277 ------------------------------ Date: Mon, 4 May 87 22:56:41 PDT From: dmittman@Jpl-VLSI.ARPA Subject: CSG --> Octree Spatial Representation Translation Does anyone know of a Common Lisp (Symbolics, perhaps) implementation of a conversion between Constructive Solid Geometry and Octree representations of spatial configurations? Whatever you have would be appreciated. I hate to reinvent tools which already exist. - David Mittman DMITTMAN@JPL-VLSI.ARPA ------------------------------ Date: 4 May 87 23:55:35 GMT From: jade!lemon!c60a-3ed@ucbvax.Berkeley.EDU (Sugih Jamin) Subject: DataFlow I don't know if this is the right news group for this question, but, can anyone tell me what is the best introductory/reference book to Data Flow system/language/architecture(?) ? Sugih Jamin (c60b-jk@buddy.Berkeley.Edu) ------------------------------ Date: 5 May 87 13:13:51 GMT From: super.upenn.edu!operations.dccs.upenn.edu!shaffer@RUTGERS.EDU (Earl Shaffer) Subject: Expert Systems for networking Hello: We are looking for a PC or VAX based expert system that is capable of handling rules that describe network fault diagnosis. Therefore, its rule base capability must be significant, and its inference capabilities must be rich (backward, forward, mix). The PC version would be a "portable expert", whereas the VAX version would be smarter, bigger, and unmovalbe. Cost is a factor! Forget ART of KEE. Any help would be appreciated. thanx, ------------------------------ Date: 5 May 87 20:51:19 GMT From: decvax!necntc!ci-dandelion!bunny!gps0@ucbvax.Berkeley.EDU (Gregory Piatetsky-Shapiro) Subject: Extracting Knowledge From Databases ******* This is not a line-eater line ****** I am interested in extracting Knowledge from Databases. For example, by analyzing a medical database, a system can discover new effects of known drugs (such project was done by Blum & Wiederhold at Stanford, 1982); by analyzing the planet movements, one may discover Kepler's third law (this project was done by Kepler). A more prosaic application is analyzing a telephone company customer database to find what types of customers order what types of services. In general, the discovered knowledge may have the form of rules, functional dependencies, causal dependencies, or statistical correlations. A closely related topic is Statistical Expert Systems, which intelligently use statistical methods and packages to find statistical correlations in data. If you know of work in these areas, please email the appropriate references to me. I would be very grateful and will summarize the responces to the net. Gregory Piatetsky-Shapiro at GTE Laboratories. gps0@gte-labs.relay.cs.net ======== A standard disclaimer ======= ------------------------------ Date: 17 Apr 87 00:32:18 GMT From: decvax!wanginst!masscomp!dlcdev!eric@ucbvax.Berkeley.EDU (eric van tassell) Subject: OPS5 To all those of you who asked me to mail OPS5 to them and only gave arpa addresses of the form. foo@bar.baz, please help a net neophyte at a uucp only site comprehend how to translate this into a path from my machine that won't upset the mailer at mit-eddie. Eric Van Tassell Data Language Corp. 617-663-5000 clyde!bonnie!masscomp!dlcdev!eric harvard!mit-eddie!dlcdev!eric dlcdev!eric@eddie.mit.edu ------------------------------ Date: Tue, 5 May 1987 21:24 EDT From: "Scott E. Fahlman" Subject: Kyoto Common Lisp addendum A clarification from Mr. Yuasa: To whom it may concern, It seems that the previous note of ours, announcing that we are looking for a free channel for KCL distribution, may have brought confusions and misunderstandings to many people. It may be mostly because only the facts were mentioned, with no explanation of the background necessary to understand our intention. Our intention is to make it clear that KCL is an academic free software. By "free", we mean that any one can get it free of charge, if he agrees the conditions we put in the License Agreement. It does NOT mean that anyone has any *free*dom for KCL. In particular, we have no intention to put KCL into the public domain. We would rather like to keep the identity of KCL, so that we can keep up its high quality. Some commercial organizations are now distributing KCL and they charge a certain amount of fees to their customers. These fees are exclusively for the distribution costs and the service they offer to their customers. We require no royalties to them. We are happy if more people have got the chance to use this software. It is a voluntary work if we give them technical help on their requests. Unfortunately, some people believe that we are receiving royalties for KCL. In order to overcome this wrong belief, we decided to look for a free channel for KCL distribution. Apparently, some KCL users (including potential users) do not need any maintenance service at all. We are glad to make KCL available to such users for free. Note that we do not intend to restrict the activities of commercial organizations for KCL distribution. We intend to give a choice to the user and to make it clear what the user is charged for by commercial organizations. Note also that some KCL versions require additional programs developed by commercial organizations and we cannot force them to make their code open to the public, though we expect them to do so. We are now seriously looking for a free channel. We already found some candidates, but it will take some time before we decide the best appropriate channel for our purpose. In case we cannot find an appropriate channel, we ourselves will directly distribute KCL. However, this will require a lot of work and we will have to spend a lot of time. So, this should be the last solution. Thanks. Taiichi Yuasa, Dr. Research Institute for Mathematical Sciences Kyoto University ------------------------------ Date: Mon, 4 May 87 12:18 EST From: "Linda G. Means" Subject: re: grammar checkers mom: toaster oven, kimono Todd Ogasawara writes in AILIST Digest v.5 #108: >I think that if these style checking tools are used in conjunction >with the efforts of a good teacher of writing, then these style >checkers are of great benefit. It is better that children learn a >few rules of writing to start with than no rules at all. Of course, >reading lots of good examples of writing and a good teacher are still >necessary. Sure, but the problem is the bogus rules that the child is likely to infer from the output of the style-checking program, like never write a sentence longer than x words, or don't use passive voice, or try not to write sentences with multiple clauses. >On another level... I happened to discuss my response above with one >of my dissertation committee members. His reaction? He pulled out >a recent thesis proposal filled with red pencil marks (mostly >grammatical remarks) and said, "So what if the style checkers are >superficial? Most mistakes are superficial. Better that the style >checker should find these things than me." Sounds like a rather irresponsible attitude to me, given the state of the art of automatic style checkers. Your prof needs a graduate student slave if he dislikes having to correct student grammar errors. Let's consider separately the issues of grammar correction and stylistic advice (the two worlds partially overlap, but remain distinct some areas). 1. Grammar. As your prof points out, lots of grammar errors are superficial, but your commercial grammar checker will fail to find all of them, correct perceived mistakes which really aren't, and give plenty of bad advice. Those programs "know" less about grammar than the students who use them. Any bonafide grammatical errors which can be found by the commercially available software could also be found by the writer if he were to proof his paper carefully. It grieves me to think of students failing to proof their own papers because the computer can do it for them. 2. Style. The analysis of writing style is not a superficial task; it is, in fact, a kind of expertise not found in many "literate" individuals. In my experience, the best way to learn to write well is to scrutinize your work in the company of a good writer who will think aloud with you while helping you to rewrite sentences. I've successfully taught various people to write that way. The second best method is a patient teacher's red pen. In both cases, your prose is being evaluated by someone who is trying to understand what you are trying to communicate in your writing. You must understand that this is not the case with the computer. It probably has no way of representing the discourse as a whole; all analysis is performed at the sentence level with a heavy emphasis on syntax and with no semantic theory of style. The result? Stylistic advice which is so superficial as to be useless. Many years of research in the area of computational stylistics have provided evidence that although some (few) stylistic discriminators can be found through syntactic analysis, the features which contribute to textual cohesion and to a given writer's "stylistic fingerprint" cannot. Researchers are still stymied by the problem of identifying stylistically significant features of a text. Yet the program advocated by Carl Kadie feigns an understanding of the effect that the prose will have on its reader; it generalizes from syntactic structure to stylistic impact. Look at the summary generated at the end of the text. The program equates active voice and short sentences with "directness". I won't take the time here to argue against the use of fuzzy adjectives like 'direct', 'expressive', 'fresh', and so on to describe prose, since the use of such imprecise language is a longstanding tradition in the arena of literary criticism. I can't tell you exactly how to make your writing "direct", but I know that directness cannot always be computed empirically, which is how your machine computes it. A paragraph of non sequiturs probably shouldn't be characterized as direct, even if all sentences are short and contain only active verbs. An aside to Ken Laws: You questioned whether the topic of automatic style checkers is appropriate to AILIST: is it AI? I believe it is. The study of computational stylistics is a difficult natural language problem with a long history. Topics range from authorship studies of anonymous works to trying to identify stylistic idiosyncrasies to automatic style advisors. In general, many theoretical issues carry over from other areas of natural language processing, like discourse analysis and understanding human reasoning processes. Think of a favorite author. You may sometimes recognize a sample of his writing without even knowing who wrote it, or you may say of another writer, "Gee, his style reminds me of X". You may put down a book which you started reading because the style is too "obtuse". How specifically does a writer use the language to produce that effect? What characteristics of a text must we identify to enable a computer to make judgments about style? Of course, any advances made in tackling these issues may also be of use in the area of text generation. - Linda Means GM Research Laboratories means%gmr.com@relay.cs.net ------------------------------ Date: Sun, 3 May 1987 23:35 EDT From: MINSKY%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU Subject: AIList Digest V5 #108 I agree with Todd, Ogasawara: one should not criticise to extremes. I found RightWriter useful and suggestive. It was helpful in detecting obnoxious passive constructions and excessively long sentences. In final editing of "The Society of Mind" I used spelling checkers to notify me of unfamiliar words, and I often replaced them by more familiar ones. I also used it to establish a "gradient". The early chapters are written at a "grade level" of about 8.6 and the book ends up with grade levels more like 13.2 - using RightWriter's quaint scale. Naturally the program makes lots of errors, but they are instantly obvious and easily ignored. I imposed a "style gradient" upon "The Society of Mind" because I wanted its beginning to be accessible to non-specialists. I cheerfully assumed that any reader who gets to the end will by then have become a specialist. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Sat May 9 03:30:37 1987 Date: Sat, 9 May 87 03:30:29 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #111 Status: RO Received: from relay.cs.net by vtcs1.cs.vt.edu; Sat, 9 May 87 03:10 EDT Received: from relay.cs.net by RELAY.CS.NET id ag02593; 7 May 87 23:07 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa07962; 7 May 87 23:03 EDT Date: Thu 7 May 1987 09:22-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #111 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Thursday, 7 May 1987 Volume 5 : Issue 111 Today's Topics: Queries - Pattern Recognition Application & IJCAI Information & Multiexpert Knowledge Systems, Review - Books on Common Lisp and Prolog, Linguistics - Style Checkers, Speech Understanding - Difficult Speech Examples ---------------------------------------------------------------------- Date: Wed 6 May 87 11:22:00-PDT From: Ken Laws Subject: Wanted: Pattern Recognition Application I'm trying to work up a proposal for research in classificatory neural networks. The computational end is easy, but I need an application that will provide the data for experimentation. I need either real-world data or (perhaps even better) a way to synthesize interesting data. I'm already aware of some work in image analysis, speech recognition, and character recognition, but would be interested to hear from people who have current problems that are not being adequately addressed. Can you suggest any other pattern recognition problem or "signal" of particular interest to the Air Force, Navy, Army, NASA, NSF, or other funding agency? -- Ken Laws LAWS@STRIPE.SRI.COM (415) 859-6467 ------------------------------ Date: 5 May 87 20:35:45 GMT From: hao!gatech!akgua!emory!cmb@ames.arpa (Chang Bang) Subject: help me (1) I am getting no information about IJCAI in Italy. Help me. (2) I would like to know an economical way to attend IJCAI in Italy. Help me. ------------------------------ Date: Thu, 7 May 87 09:59:03 edt From: dg1v#@andrew.cmu.edu (David Greene) Subject: Multiexpert Knowledge Systems Does anyone have information on "multiexpert knowledge systems" (MKS). Specifically a recent blurb in Business Week (May 11, pg.141) mentioned a system by Major Stephen R. LeClair of the AI group at the Materials Lab. at Wright-Patterson A.F.B. The system combines expert knowledge from multiple domains to solve complex problems in manufacturing. I'm currently starting work on a learning program which attempts to coordinate disperate knowledge bases to solve a problem so I would greatly appreciate any information on MKS (or relevant areas). Thanks. dg1v@andrew.cmu.edu ------------------------------ Date: Wed 6 May 87 20:03:29-EDT From: John C. Akbari Subject: books on common lisp & prolog >Can anyone make a comparison between Wilensky's "CommonLispCraft" and Tatar's >"A Programmer's Guide to Common Lisp"? What are the strengths and weaknesses >of each book? I know about Steele's book but it is in a different >class. >... > Bill Roberts Having spent some time working with several people in learning to become programmers, I have a few comments regarding books available (titles are approximate, don't have them in front of me): in general, experience points to several important needs when teaching & selecting stuff: - students learn well by studying *working* examples, both in terms of how to program as well as details like style, data abstraction, etc. providing well-documented examples motivates all sorts of queries regarding syntax, efficiency, portability, etc. as well. - the trade-off between presenting concepts & gory details is a personal matter, but i've found that some amount of both needs to done at the beginning. once the student begins to think in the mind-expanding frame of lisp (rather than, say, c), more & more details can be presented, relying on the student himself to find out about implementation details on his own. COMMON LISP not familiar with tartar's book. the following three are the best I know of for learning. would recommend using winston & horn and wilensky almost concurrently initially (personal choice as to which offers a clearer intro to lisp concepts), followed by the second half of winston & horn for applications. those interested in learning much more about hacking should spend more time with wilensky. steele tends to be useful after one has learned a fair amount about lisp hacking in general. would use with abelson & sussman _structure & interpretation of computer programs_ (mit press) for great intro to concepts (streams, data-driven programming, ...). steele. _common lisp: the language_ digital press, 1984. besides being the de facto standard in most ways, it is also helpful when trying to port across machines (much easier than lugging around documentation for symbolics, ti, lucid, vax lisp...). also good for those late-night hacking sessions (steele manages to imbue mind-boggling minutiae [spelling?] with a dash of humor). not necessarily recommended bedtime reading, however (except for masochists). wilensky. _commonlisp craft_ norton. an excellent, readable intro to common lisp hacking, with just the right blend of tutorial & documentation. tends to go much more into the details of common lisp than does winston & horn, but still in a readable, useful format. last chapter or so presents a pattern matcher. winston & horn. _lisp_ (2nd edition) addison-wesley. good, readable intro to lisp in general, with common lisp almost an incidental choice of dialect. tends to rapidly leave low-level details in preference for looking at ai applications of lisp. very helpful in introducing people to concepts that have been robustly developed elsewhere (e.g., there is a simple frame system, simple intro to object oriented programming via FLAVORS, mathematical examples, pattern matcher, expert system inference engine, etc.). PROLOG prolog is as different from lisp as lisp is from c, at least in terms of teaching it. would begin with bratko, followed by sterling & shapiro after student has done a bit of prolog programming. introduce clocksin & mellish somewhere in between. bratko. _introduction to prolog programming for artificial intelligence_. addison-wesley. great intro to the language. presents just enought about backtracking, unification, etc. along with examples to be of real value. gives many examples & exercises. not too much humor, though. examples of searching, expert system shells, games, etc. sterling & shapiro. _the art of prolog_. mit press. excellent book on advanced topics in prolog: garbage collection, efficiency, top-down vs. bottom-up construction of data structures, etc. many such topics have not been covered elsewhere, and are done very well. would not recommend to inexperienced, motivated people; first part tends to be a mathematical intro which may not be appealing to some. clocksin & mellish. _prolog_ springer-verlag. standard text. a little hard to read at times, tends to bog down in gory details before reader has feel for language as whole. let me know if this helps. john c akbari ARPANET & Internet akbari@CS.COLUMBIA.EDU BITnet akbari%CS.COLUMBIA.EDU@WISCVM.WISC.EDU uucp & usenet ...!seismo!columbia!cs!akbari DECnet akbari@cs PaperNet 380 riverside drive, no. 7d new york, new york 10025 usa SoundNet 212.662.2476 ------------------------------ Date: 6 May 87 12:46:57 GMT From: gilbert@aimmi.UUCP (Gilbert Cockton) Reply-to: gilbert@hci.hw.ac.uk (Gilbert Cockton) Subject: Style checkers In article <8704250321.AA15773@uhmanoa.ICS.HAWAII.EDU> todd@humu.UUCP (The Perplexed Wiz) writes: >In article <12295086246.19.HAYES@SPAR-20.ARPA> HAYES@SPAR-20.ARPA writes: >>Let me briefly add a seconding voice to Linda Means comments on the horrible >>output of the style-criticising programs illustrated a while ago. That >>people should suggest using such things to influence children almost makes >>me agree with Weizenbaum. >I think that we have two extreme views here. I agree that the style >checkers available for microcomputers are not very sophisticated. I also >agree that such tools should not be used exclusively to teach children >(or any other age group for that matter). However, to say that these >microcomputer based style checkers have no place in teaching children >to write in not correct. A few simple grammatical rules (concord, apostrophes, tense structure, clausal agreement), as these style checkers stand, you are most incorrect - and I am even more surprised at such comments when they come from a psychology grad - unless you're doing AI or rat research that is in which case you're probably a long way from mainstream psychology:-). The problem with most checkers is that the rules they embody have often just been made up by technical writing pundits. As long as they stick to indoctrinating those engineers and other culturally deprived students WHO NEED HELP WITH THEIR WRITING (not all do), I don't mind - they probably do improve the writing of some people from dreadful and unintelligible to ugly and constipated :-). However, the minute their jibberish is proposed as something for the whole school population, then the authority of the armchair philistines has to be scrutinised carefully. There is not an ounce of decent psychological research on text comprehension behind most of the pronouncements of technical writing rednecks. As for literary aesthetics, this doesn't get a look in - anyone care to stick a novel through one of these joke programs? So, the first prerequisite for style checkers in schools is proper experimental validation of the rule base - breaking/obeying rules must be shown to have a measurable effect on comprehension performance. The second prerequisite is the harder one and takes us into the Weizenbaum camp - the rules checked in the experiments must be translated faithfully into a program - not easy as we know that our current formal representations of language and knowledge are wholly inadequate, and given the nature of computation may never be adequate. Philosophical objections apart, I will never trust programmers with no background in what they are programming to get the job right unless the domain experts have a cast iron way of validating the program (this works well for many science and engineering problems, as well as for simple data processing). So, the current style rules aren't rules, and even if they were their encapsulation in a computer program cannot be proven. -- Gilbert Cockton, Scottish HCI Centre, Ben Line Building, Edinburgh, EH1 1TN JANET: gilbert@uk.ac.hw.aimmi ARPA: gilbert%aimmi.hw.ac.uk@cs.ucl.ac.uk UUCP: ..!{backbone}!aimmi.hw.ac.uk!gilbert ------------------------------ Date: 4 May 1987, 16:32:35 EDT From: Norman Haas Subject: Difficult Speech Examples Two speech recognition trickies from Eng. Lit.: Our Glass Lake (Hourglass Lake) -- Nabokov Make-Believe Express (Maple Leaf Express) -- Thurber ------------------------------ Date: 4 May 1987 2252-PDT (Monday) From: Eugene Miya N. Subject: Updated list of speech examples For future purposes, I will be placing a copy of my speech examples lists on the ames-aurora.arpa host. (Don't check yet.) I've posted them here and for the comp.ai group on usenet. In the future, I will separate the ACKs as below for possible liability reasons and to credit the group as a whole. I will update yearly. The last addition is particularly interesting. See that type of "writing" has a use after all. FYI, aurora is an upgrade of a system which originally did speech synthesis on an old V*x system, so I only think it appropriate it goes there. Happy hunting with this little bit of `network memory.' P.S. I was asked for more Japanese examples, so if anyone in Japan is working on the subject, I would appreciate examples, I won't be going there until Fall of 1988 (Cray User Group meeting and more). And this appears to be a critical area. --eugene miya NASA Ames Research Center eugene@ames-aurora.ARPA "You trust the `reply' command with all those different mailers out there?" "Send mail, avoid follow-ups. If enough, I'll summarize." {hplabs,hao,ihnp4,decwrl,allegra,tektronix,menlo70}!ames!aurora!eugene Acknowledgements: elman@amos.ling.ucsd.edu (Jeff Elman) mcguire@aero2.aero.org minow%thundr.DEC@decwrl.DEC.COM Martin Minow (ex-DECtalk developer) Marc Majka Joseph_D._Becker.osbunorth@Xerox.COM Stephen Slade@Yale.Arpa Keith F. Lynch George Swetnam m06242%mwvm@mitre.ARPA Erik A. Devereux "In mud eels are, in tar none are". grey day / grade A euthanasia / youth in Asia "Whats that up in the road" ahead / a head? "Take off your hat and dloves" and then ask them what you said. 99% of all people will insist that you said the word "gloves". I'd be happy if you could do the digits, including "Oh", and Yes/No. Continuous digits, telephone quality, no training, male and female voice. The problem is in distinguishing "oh" from "no". Getting the alphabet (not "alpha", "bravo", but "aye", "bee") would be nice, too. I love you Isle of View I think you need at least one example in Chinese, and here's my favorite (because I actually said it by mistake). The numbers after the words are phonic "tones". What I meant to say was: Wo(3) hen(3) xiang(3) shui(4)-jiao(4) -- I want to go to sleep ... but what I actually ended up saying was: Wo(3) hen(3) xiang(4) shui(3)-jiao(3) -- I am like a boiled ravioli "ice cream"/"I scream" "beginning"/"big inning" "soccer"/"sock her" "its hardware problems are intermittent"/"it's hard where problems ..." "attacks"/"a tax" from Mark Twain: "Good-bye God, I'm going to Missouri."/"Good, by God, I'm going to Missouri." A notion of water/an ocean of water. [New York accent only] An arm and a leg/a nominal egg. Years ago at Bell Labs, I heard the following: "Joe took mother's shoe bench out; she was waiting at my lawn." With regard to difficult speech recognition problems, I just saw variations of the following on the wall of a mens room, so credit goes to anonymous students at the University of Texas: ``Our understanding of urine formation was clearly wrong.'' ``Our understanding of your information was clearly wrong.'' ------------------------------ Date: Wed, 6 May 87 09:58:39 pdt From: Eugene Miya N. Subject: Speech.examples installed on ames-aurora.arpa For some reason, our news system is not receiving the AI list. I have installed the file pub/speech.examples for anonymous login. Someone else noted the lack of AI and cognitive "biggies" donating examples. Don Norman contributed an additional example from his book, so if you are concern with this topic you can try ftp. Someone can let me know if it works. See you all in a year when I ask for updates. [January] >From the Rock of Ages Home for Retired Hackers: --eugene miya NASA Ames Research Center eugene@ames-aurora.ARPA "You trust the `reply' command with all those different mailers out there?" "Send mail, avoid follow-ups. If enough, I'll summarize." {hplabs,hao,ihnp4,decwrl,allegra,tektronix,menlo70}!ames!aurora!eugene ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Mon May 11 03:22:31 1987 Date: Mon, 11 May 87 03:22:22 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #112 Status: RO Received: from relay.cs.net by vtcs1.cs.vt.edu; Mon, 11 May 87 03:07 EDT Received: from relay.cs.net by RELAY.CS.NET id ab19206; 10 May 87 20:14 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa07257; 10 May 87 20:14 EDT Date: Sun 10 May 1987 16:45-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #112 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 11 May 1987 Volume 5 : Issue 112 Today's Topics: Presentation - Columbia AI/VLSI Project, Course - Automated Mathematical Reasoning, Conferences - Automated Reasoning Workshop & Volunteers still needed for AAAI & Hawaii Conf. on System Sciences & ACL Applied Natural Language Conference ---------------------------------------------------------------------- Date: Tue, 28 Apr 87 07:56 EST From: TAKEFUJI%scarolina.csnet@RELAY.CS.NET Subject: Presentation - Columbia AI/VLSI Project [I apologize for the late distribution of this and other announcements. The list has been a bit more than I could handle this last month due to illness and personal circumstances. -- KIL] From: Dr. Yoshiyasu Takefuji To: whom it may concern Subjects: INVITATION TO AI & VLSI Project presentation/demonstration Date: May 4, 1987 Time: 4 PM Place: On the third floor at Engineering Building in Columbia, South Carolina Hello. We will have project presentation/demonstration on the following subjects: 15 graduate students are involved in these projects. 1. Fuzzy inference VLSI parallel-engine 2. Expert system for determination of fuzzy inference engine architecture 3. Function Description Translator from behavior description to VLSI layout level (CIF or Magic file) 4. Terminal-based local network project to eliminate RS232c wire-jungle 5. Neuron Network Simulators 6. Error Correction Circuits based on Neuron Networks 7. Petri-to-FSM translator Let me know whether you can come to see our demo. csnet: takefuji%scarolina.edu usenet: ncrcae!usccmi!takefuji Thank you. ------------------------------ Date: Tue, 21 Apr 87 17:37:43 cst From: stevens@anl-mcs.ARPA (Rick L. Stevens) Subject: Course - Automated Mathematical Reasoning UNIVERSITA' DI CATANIA Dipartimento di Matematica Viale A. Doria, 6 95125 CATANIA - ITALY First Announcement CATANIA SICILY, ITALY JUNE 8-12, 1987 INTERNATIONAL COURSE ON NEW TRENDS IN AUTOMATED MATHEMATICAL REASONING The meeting will consists of 3 six hours courses form Monday through Friday given by the following lecturers - Prof. WU WEN-TSUN - Institute of Systems Science, Academia Sinica, University of Beijng - CHINA "Automated Theorem Proving in Geometry and Differential Geometry". - Prof. JACOB T. SCHWARTZ - Department of Computer Science, Courant Institute of Mathematical Sciences - New York University - USA. "Pragmatic Issues in Verification of Programs and Mathematical Theorems". - Prof. JIAWEI HONG - Beijng Computer Institute and University of Chicago - USA. "Proving by Example in Geometry". Director of the course - Prof. Alfredo Ferro - Department of Mathematics, University of Catania - ITALY Admission and General Information --------------------------------- A $ 50 (80,000 Italian lire) registration fee which includes social dinner on Thursday evening is required. An excursion to Taormina will be organized on Friday afternoon. Participants will be accommodated at the beautiful residence "La Perla Ionica". Full board for each day: double room L. 57,500 per person single room L. 72,500 per person. Half board for each day: double room L. 48,300 per person single room L. 63,300 per person. For any information, hotel reservations, buses from the airport, etc., please contact TRINACRIA VIAGGI via L. Rizzo 19/A - Catania - Italy - tel. 095/325155 - Telex 970134. Several daily flights connect Catania to Rome and Milan. Also, Catania is connected to Paris, Frankfurt, and London by weekly flights. Deadline for hotel reservations: May 22, 1987. Please send applications to dott. G. Gallo, Dipartimento di Matematica - Viale A. Doria 6, 95125 Catania - Italy. ------------------------------ Date: Tue, 21 Apr 87 17:30:38 cst From: stevens@anl-mcs.ARPA (Rick L. Stevens) Subject: Conference - Automated Reasoning Workshop Automated Reasoning Workshop 1987 Mathematics and Computer Science Division Argonne National Laboratory You are invited to a workshop on automated reasoning to be held at Argonne National Laboratory on June 23 and 24, 1987. This workshop, the sixth of its kind, will take the form of a set of tutorials. No background is needed in automated reasoning, simply curiosity and an interest in the subject. Our first objective is to acquaint people with the basic aspects of automated reasoning and with the possible applications. Thus we shall discuss some of the previously open questions we have solved and feature topics such as the design of logic circuits, the validation of existing circuit designs, and proving properties of computer programs. Our second objective is to learn of new problems on which the current methodology might have an impact. In fact, the preceding workshops did lead to such discoveries, as well as to collaborative efforts to seek solutions to these prob- lems. Enclosed is a tentative schedule that briefly describes the various talks. On the first day, we shall begin with an introductory lecture on what automated reasoning is. We shall illustrate the various concepts first with puzzles. Next, we shall focus on some applications of automated rea- soning. We shall include a demonstration of an automated reasoning program (ITP) that is portable, runs on relatively inexpensive machines, and is available to other users. On the second day we shall give an introduction to Prolog, dis- cuss additional applications, and focus on state/space prob- lems. On both days, we have scheduled reviews of the material and open discussions. We welcome you to this 1987 workshop on automated rea- soning. Participation will require a small charge, no more than $60. Included in this fee will be the cost of the book Automated Reasoning: Introduction and Applications, written by Wos, Overbeek, Lusk, and Boyle and published by Prentice-Hall. This book covers the field of automated rea- soning from its basic elements through various applications. Its tutorial nature will guide our approach to the workshop. We urge you to respond to this invitation as soon as possible for, to retain the tutorial atmosphere of the workshop, we may be forced to limit the number of partici- pants. The order in which requests are received will be an important parameter in issuing invitations to attend the workshop. Sincerely, L. Wos Senior Mathematician Schedule for Automated Reasoning Workshop 1987 June 23-24, 1987 Argonne National Laboratory Argonne, Illinois Tuesday, June 23 9:00 - 9:15 Preliminary remarks - Larry Wos 9:15 - 10:15 Introduction to automated reasoning - Larry Wos 10:15 - 10:30 Break 10:30 - 11:30 Solving reasoning puzzles - Brian Smith 11:30 - 12:30 Lunch 12:30 - 1:15 Choices of strategies and inference rules - Rusty Lusk 1:15 - 1:30 Demonstration 1:30 - 1:45 Break 1:45 - 2:45 Proving properties of computer pro- grams - Jim Boyle 2:45 - 3:00 Closing discussion - Larry Wos Wednesday, June 24 9:00 - 9:15 Discussion - Larry Wos 9:15 - 10:15 Introduction to Prolog - Rusty Lusk 10:15 - 10:30 Break 10:30 - 11:30 State-space problems - Rusty Lusk 11:30 - 12:30 Lunch 12:30 - 1:15 Circuit design and validation - Jim Boyle 1:15 - 1:45 Open problems in mathematics and logic - Rusty Lusk 1:45 - 2:00 Break 2:00 - 2:45 Detailed solution of an open prob- lem in logic - Larry Wos 2:45 - 3:15 Our automated reasoning software - Rusty Lusk 3:15 - 3:30 Closing remarks - Larry Wos ------------------------------ Date: 24 Apr 87 23:08:36 GMT From: feifer@locus.ucla.edu Subject: Conference - Volunteers still needed for AAAI conf. ANNOUNCEMENT: Student Volunteers Still Needed for Artificial Intelligence Conference AAAI-87 AAAI-87 (American Association on Artificial Intelligence) will be held July 13-17, 1987 in beautiful Seattle, Washington. Student volunteers are needed to help with local arrangements and staffing of the conference. To be eligible for a Volunteer position, an individual must be an undergraduate or graduate student in any field at any college or university. This is an excellent opportunity for students to participate in the conference. Volunteers receive FREE registration at AAAI-87, conference proceedings, "STAFF" T-shirt, and are invited to the volunteer party. More importantly, by participating as a volunteer, you become more involved and meet students and researchers with similar interests. If you are interested in participating in AAAI-87 as a Student Volunteer, apply by sending the following information: Name Electronic Mail Address USMail Address Telephone Number(s) Dates Available Student Affiliation Advisor's Name to: feifer@locus.ucla.edu or Richard Feifer UCLA Center for the Study of Evaluation 145 Moore Hall Los Angeles, California 90024 Thanks, and I hope you join us this year! Richard Feifer Student Volunteer Coordinator AAAI-87 Staff - Richard ------------------------------ Date: Tue 21 Apr 87 13:36:42-EDT From: Gail E. Kaiser Subject: Conference - Hawaii Conf. on System Sciences Subject: revised call for papers: 20->26pp CALL FOR PAPERS 21ST ANNUAL HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES (HICSS-21) Papers are invited for the minitrack on Use of AI Techniques in Software Design and Implementation in the software track of the 21st annual Hawaii International Conference on System Sciences (HICSS-21), to be held in Kona, Hawaii next January 5-8, 1988. Topics of interest include, but are not limited to, the following artificial intelligence areas as they apply to software design and implementation, particularly for large-scale software systems. Techniques may apply to any or all phases of the software development process: project management, requirements, functional specification, design specification, modular decomposition, coding, integration, testing, maintenance, documentation, delivery, etc. Example applications are given in parentheses. - Automatic deduction (detecting inconsistencies among programmers' assumptions, automatic programming) - Knowledge representation (semantic nets, frames, etc. for representing programming information) - Learning (self-tuning of software tools to specific programs, generalization of program fragments to support reusability) - Natural language (matching functionality of program parts with the corresponding program documentation, explaining program components and their interactions to new project member) - Planning (detecting interactions among planned changes) - Rule-based systems (program transformation, performance tuning) - Search (retrieval of reusable program fragments) Six copies of the full paper (maximum 26 double-spaced pages) should be sent to the session chairman at the address given below. Papers must arrive by July 1, 1987. Authors will be notified of acceptance by September 7, 1987. Camera-ready copies will be due by October 19, 1987. Minitrack chairman: Prof. Gail E. Kaiser, Columbia University, Department of Computer Science, New York, NY 10027. Phone: 212-280-3856. Electronic mail: kaiser@cs.columbia.edu, ...seismo!columbia!cs!kaiser Software track chairman: Dr. Bruce D. Shriver, IBM T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598. Phone: 914-789-7626. Electronic mail: shriver@ibm.com ------------------------------ Date: Mon, 27 Apr 87 18:02:30 edt From: walker@flash.bellcore.com (Don Walker) Subject: Conference - ACL Applied Natural Language Conference "CALL FOR PAPERS" SECOND CONFERENCE ON APPLIED NATURAL LANGUAGE PROCESSING 9-12 February 1988, Austin, Texas, USA Organized by the Association for Computational Linguistics CONFERENCE SUMMARY: This meeting will focus on the application of natural language processing techniques to real world problems. It will include invited and contributed papers, panel discussions, tutorials, exhibits, and demonstrations. Original papers are being solicited in areas such as human-machine interfaces (including databases, expert systems, report writers, etc.), speech input and output, information retrieval, text generation, machine translation, office automation, writing aids, computer-aided instruction, tools for natural-language processing, and applications to medical, legal, or other professional areas. Papers may present applications, evaluations, limitations, and general tools and techniques. Papers that critically evaluate a formalism or processing strategy are especially welcome. Papers or panel proposals discussing end-user experience with natural language systems are also encouraged. REQUIREMENTS FOR SUBMISSION: Authors should submit ten copies of a 6-8 page summary (single-spaced, exclusive of references, pica or elite size type). The first page should begin with the title, the name(s) of the author(s), complete address(es), and a short (5-6 line) abstract. Papers should be sent to: Bruce Ballard AT&T Bell Laboratories, 3C-440A Murray Hill, NJ 07974 (201)582-5440 allegra!bwb@ucbvax.berkeley.edu The submission should identify distinctive aspects of the work and clearly indicate the extent to which an implementation has been completed; vague or unsubstantiated claims will be given little weight. Submissions should be substantively different from papers currently under review or to be submitted elsewhere before the notification date. All papers will be reviewed by members of the Program Committee , which is composed of Bruce Ballard, chair (AT&T Bell Laboratories), Madeleine Bates (BBN Laboratories), Tim Finin (University of Pennsylvania), Ralph Grishman (New York University), Carole Hafner (Northeastern University), George Heidorn (IBM Corporation), Paul Martin (SRI International), Graeme Ritchie (University of Edinburgh), and Harry Tennant (Texas Instruments). SCHEDULE: Papers must be received by September 1, 1987. Notification of acceptance will be sent by October 5, 1987. Camera-ready versions of the full paper must be received by November 30, 1987. OTHER ACTIVITIES: The meeting will include one day of tutorials by noted contributors to the field. Facilities for exhibits and system demonstrations will also be available. Persons wishing to arrange an exhibit or present a demonstration should contact Kent Wittenburg or Carl Weir, MCC, 3500 W. Balcones Center Drive, Austin, TX 78759; (512)338-3626 or 338-3616; wittenburg@mcc.com or weir@mcc.com. CONFERENCE INFORMATION: Local arrangements are being handled by Jonathan Slocum and Barbara Smith, MCC, 3500 W. Balcones Center Drive, Austin, TX 78759; (512)338-3571 and 338-3527; slocum@mcc.arpa and barbara@mcc.arpa. For additional information on the conference or about the ACL, contact Donald Walker, Bell Communications Research, 445 South Street, MRE 2A379, Morristown, NJ 07960; (201)829-4312; walker@flash.bellcore.com or ucbvax!bellcore!walker. In addition to the persons named above, the Conference Committee includes Norman Sondheimer, USC/Information Sciences Institute, General Chair; Martha Palmer, UNISYS, Tutorials; Jeffrey Hill and Brenda Nashawaty, Artificial Intelligence Corporation, Publicity. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Mon May 11 03:22:52 1987 Date: Mon, 11 May 87 03:22:39 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #113 Status: RO Received: from relay.cs.net by vtcs1.cs.vt.edu; Mon, 11 May 87 03:10 EDT Received: from relay.cs.net by RELAY.CS.NET id ae19231; 10 May 87 20:25 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa07295; 10 May 87 20:25 EDT Date: Sun 10 May 1987 16:49-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #113 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 11 May 1987 Volume 5 : Issue 113 Today's Topics: Conferences - Production Planning, Control & ICALP '87 & Matrix of Biology Workshop & AI and Law, Final Schedule ---------------------------------------------------------------------- Date: Sun, 3 May 1987 18:48 CST From: Leff (Southern Methodist University) Subject: Conferences - Production Planning, Control & ICALP '87 AI at Upcoming Conferences Expert Systems and the Leading Edge in Production Planning and Control May 10-13, Charleston, South Carolina Keynote Addresses "Managing Knowledge for Production Planning" Thomas Kehler, Chairman, Intellicorp "Integration of Manufacturing Policy and Corporate Strategy with the Aid of Decision Support Systems" Gabriel Bitran, Professor of Management, Sloan School of Management, Massachusetts Institutes of Technology May 11 Tutorial I-- Production Planning and Control William Berry, University of Iowa Lee Krajewski, Ohio State University Tutorial II _ Knowledge-based Expert Systems: Theory and Practice Mark Fox, Director, Intelligent Systems Laboratory, Carnegie Mellon University May 12 Keynote Address Tracy O'Rouke, President, The Allen Bradley Company JIT - Then AI James Butcher, Materials Control Manager, 3M Corporation Design of Flexible Manufacturing Systems Kathy Stecke, Operations Management, University of Michigan Factor Representaiton and Design Ed Fisher, Department of Industrial Engineering, North Carolina State U. Exploiting Group Technology in Expert Process Designers Bruce Johnson, Partner in Charge of Ai, Arthur Anderson Knowledge-based and Collaborative Design Tools Sanjay Mittal, Xerox University An Intelligent Decision Support System for Integrated Distribution Planning Darwin Klingman and Nancy Phillips, MIS and Information Systems, University of Texas-Austin Knowledge-based Simulation and Manufacturing John Kuntz, Senior Knowledge Systems Engineer, Intellicorp Panel Discussion: Integrating Planning Frontiers Ed Davis, University of Virginia, Jim L. Goedhart, GE Calma Integration of People, Automation and Computers in Job-Shop Electronics John Lorei, Manager, Computer INtegrated Manufacturing Rockwell International Manufacturing Planning Systems for the 1990s Thomas Vollman, Department of Operations Management, Boston University Merrill Ebner, Department of Manufacturing Engineering, Boston University Artificially Intelligent Tools for Manufacturing Process Planners Karl Kempf, Senior Computer Scientist, FMC Panel Discussions: Workshops in Aerospace Applications for AI, Textile Technology, Scheduling Applications, Flexible Manufacturing Systems, Product Design Systems, Advanced Automation (AI and OR) May 13 Keynote: Rapid Prototyping for Expert Systems Brian Gaines, Department of Computer Science, University of Calgary Production Control Issues and Challenges Steve Melnyk, Management, Michigan State University FMS Producitoon Planning and Control Problems Kathy STecke, University of Michigan >From the ARMF to the Factory of the Future: AI Tools in Process and Production Planning and Control Dennis Swyt, Deputy Director, National Bureau of STandards Using Knowledge Technology to Gain a Competitive Advantage in Manufacturing Neil Cahill, Vice President, Manufacturing Technology, Institute of Textile Technology Knowlege-Based Process Management Applications Michael Fehling, Principal Scientist, Rockwell Science Center Panel Discussion Scheduling Research: Past, Present, Future William L. Maxwell, Cornell University KNowledge-Based Scheduling Systems Jack Kanet, Clemson University Knoweldge-Based Scheduling and Resource Allocation in the CAMPS Architecture Richard Brown, MITRE Corporatio/n A Knowledge Based Framework for Reactive Management of Factory Schedules Steve Smith, Intelligent Systems Lab, Carnegie Mellon University Panel Discussion Closing Session %^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^%^ ICALP 87, July 13-17, 1987, Karlsruhe, West Germany July 13 Invited Lecture, Recent Developments in the Theory of Learning, L. Valiant, Harvard University Probability and Plurality for Aggregations of Learning Machines, L. Pitt (University of Illinois), C. H. Smith (University of Maryland) Inverse Image Analyse P. Dybjer, University of Goteborg A Unification Algorithm for Confluent Theories S. Holldobler, Universitat der Bundeswehr, Munchen On the Knuth Bendix Completion for Concurrent Processes V. Diekert, Technische Universitat Munchen On Word Problems in Equational Theories J. Hsiang, State University of New York, M. Rusinowitch, CRIN, Vandoeuvre-les- Nancy Semantics for nondeterministic, Asynchronous Broadcast Networks R. K. Shyamasundar, K. T. Narayana, T. Pitassi, Pennsylvania State University Another Look at Abstraction in Process Algebra J. C. M. Baeten, University of Amsterdam, R. J. van Glabeek, Centre of Mathematics and Computer Science, Amsterdam July 14 Computation Tree Logic CTL* and Path Quantifiers in the MOnadic Theory of the Binary Tree, T. Hafer, W. Thomas, RWTH Aachen Modelchecking of CTL Formulae under Liveness Assumptions B. Josko, RWTH Aachen A Model Logic for a Subclass of Event Structures K. Lodaya, Tata Institute of Fundamental Research Bombay P. S. Thiagarajan, Aarhus University Term Matching on Parallel Computers R. Ramesh, R. M. Verma, T. Krishnaprasad, I. V. Ramakrishnan, SUNY, New York July 17 Invited Lecture: The Geometry of Robot Motion Planning J. Schwartz, New York University Nancy Phillips, Associate Profesor, Department of MIS ------------------------------ Date: Thu 23 Apr 87 17:34:04-EDT From: "Patrick H. Winston" Subject: Conference - Matrix of Biology Workshop **************** OPPORTUNITY FOR PARTICIPATION **************** WORKSHOP ON THE MATRIX OF BIOLOGICAL INFORMATION ARTIFICIAL INTELLIGENCE, DATA BANK MANAGEMENT, COMPUTER ANALYSIS OF MACROMOLECULES --- APPLIED TO CELLULAR BIOLOGY TO DEVELOP AN APPROACH TO GENERALIZATIONS AND OTHER THEORETICAL INSIGHTS IN BIOLOGICAL SCIENCE. We have today a unique opportunity to merge research at the forefront of Artificial Intelligence with efforts to provide a new conceptual framework for the laws, models, empirical generalizations and physical foundations of the modern biological sciences. The Matrix of Biological Knowledge is an attempt to use advanced computer methods to organize the immense and growing body of experimental data in the biological sciences, in the expectation that there are a significant number of as yet undiscovered ordering relations, new laws and predictive relations embedded in the mass of existing information. Workshop participants will attempt to define the interrelations of the matrix of biological knowledge, and to demonstrate its feasibility by applying the modern tools of computer science to a small set of case studies. This is an outgrowth of a report from the Natl. Academy of Sciences, "Models for Biomedical Research: a New Perspective," produced in response to a request by the Natl. Institutes of Health (NIH). A brief summary and description appears in "An Omnifarious Data Bank for Biology?," SCIENCE 228(4706), 21 June 1985. The workshop is intended to introduce a number of young scientists to the matrix concept and to explore with these investigators the possibilities of new theoretical developments and conceptual frameworks. The workshop will run July 13 - August 14 at St. Johns College in Santa Fe, in the Sangre de Cristo mountains of northern New Mexico (AAAI attendees may miss the first week). Participants will be supported with housing, meals and travel as necessary. Thirty participants (graduate students, post-doctoral fellows, and working scientists) are expected to be selected by application from throughout the United States. Eight groups will be directed by senior scientists: "Artificial Intelligence," Patrick Winston, A.I. Laboratory, MIT; "Management of Large Scale Data Bases," Robert Goldstein, U. Brit. Columbia; "Computers Applied to Macromolecules," Peter Kollman, U. Cal. San Francisco; "The Organization of Biological Knowledge," Harold Morowitz, Yale University; "Cell-Cell Interactions," Hans Bode, U. of Calif., Irvine; "Toxicology," Robert Rubin, Johns Hopkins University; "Information Flow from DNA to Cells," Richard Dickerson, UCLA, Harvey Hershman, UCLA, and Temple Smith, Harvard University; "Peptides and Signalling Molecules," Christian Burks, Los Alamos Natl. Lab., and Derek LeRoith, NIH. A brief description of background and desire to participate, together with two letters of recommendation, should be sent to Santa Fe Institute, attn. Ginger Richardson P.O. Box 9020 Santa Fe, New Mexico, 87504 - 9020 (phone (505) 984-8800) (Applicants should first review the NAS report or the SCIENCE article, above, available in most science libraries.) The workshop has been previously announced in other forums and the formal application deadline is 1 May 1987. Applicants who will have difficulty meeting that deadline should telephone Ginger Richardson and notify her of their intent to submit an application, as few if any positions will be available after that date. Applicants are strongly encouraged to apply expeditiously so that an early decision about participation may be reached. Some representative connections between Artificial Intelligence and the Matrix Workshop follow, but the list is suggestive only. NATURAL LANGUAGE: What constraints on form and content must be met for a scientific Abstract to be machine-readable? It is generally a single paragraph in a very restricted form of declarative prose. If tolerable constraints could be found they would probably be widely adopted. KNOWLEDGE REPRESENTATION: How much of what knowledge must be captured, and how, to enable scientific reasoning? Is a single unified representation scheme possible or must each sub-field have a specialized representation to support a specialized vocabulary and ontology? ``In the Knowledge lies the Power.'' How can we organize this tremendous amount of knowledge to extract the power everyone believes is there? ANALOGICAL MAPPING: How can we notice when analogous biological functions are implemented by analogous structures? Can we discover and validate analogical animal models of human systems? Can we explain an unknown response in an organism by analogy to a better-understood system? Given an experimental system, description or outcome, could we index and retrieve analogous situations and/or literature references? MACHINE LEARNING: How can we re-structure the large existing databases to automate induction from data? Can we use more knowledge-intensive forms of learning in this knowledge-intensive domain? Can existing learning paradigms be extended to cope with the noisy data that any real application must face? RULE-BASED EXPERT SYSTEMS: How much of the expert scientist's knowledge can be formalized explicitly as rules? Could we produce an expert system which, given a problem or request for information, could infer which database contained the answer? Could expert knowledge, say of toxicology, be used to produce a Toxicology Advisor which knew how to access databases to find answers to questions not covered by its rules? Could we create expert systems which continually scanned new additions to databases to update their rules, or at least flag areas where the new addition conflicts with or supplants an existing rules? TRUTH MAINTENANCE: Suppose an Abstract always contained an explicit statement of the proposition(s) argued for or against by the paper. Could this be entered into a dependency network, with the paper as justification? Could we then query the TMS to determine, for some proposition, whether it is generally believed, disbelieved, or controversial; and pick out the relevant literature citations? If a new paper supports or contradicts a result from a neighboring field, can this be detected reliably? QUALITATIVE PROCESS THEORY: Can an organism be modeled as a cooperating system of processes? Can we organize this so as to find similar process systems shared by different organisms? Can we reliably predict the effects of perturbing an organism's processes, e.g. in the study of toxicology or medicine? SCIENTIFIC REASONING AND DISCOVERY: We have the opportunity to structure a large, continuously-updated body of real-world scientific knowledge. What form of Knowledge Base would best facilitate discovering the unexpected regularities in the data? Could a program (possibly using a dependency network of experimental results) suggest crucial experiments and reason about implications of possible outcomes? SCHEMA COMPLETION: Can an experiment be understood in terms of a setting which instantiates an ``experiment schema''? Can we use this to group results that are ``schematically close'', even if they occur in different biological models or in related but distinct sub-fields? Can we fill in the default assumptions underlying a description of the experiment and results? DISCOURSE/STORY UNDERSTANDING: Could a scientific article be analyzed as a narrative describing an experimental setting, a group of observations, and some conclusions? Given a new story (experiment), could we retrieve closely related or similar stories we've heard before? Could a highly abridged summary of the story be produced? Could several stories be automatically merged, and an overall summary produced? This list is obviously indicative, not exhaustive. ------------------------------ Date: Fri, 1 May 87 15:23:59 ADT From: hafner%corwin.ccs.northeastern.edu@RELAY.CS.NET Subject: Conference - AI and Law, Final Schedule The First International Conference on Artificial Intelligence and Law May 27-29, 1987 Northeastern University, Boston, MA 02115 Sponsored by: The Center for Law and Computer Science, Northeastern University In Cooperation with ACM SIGART Registration: Ms. Rita Laffey, (617) 437-3346 Information: Prof. Carole Hafner (617) 437-5116 SCHEDULE OF EVENTS WEDNESDAY, May 27 8:30-12:30 Tutorials A. "Introduction to Artificial Intelligence (for lawyers)" Prof. Edwina L. Rissland, University of Massachusetts and Harvard Law School B. "Applying Artificial Intelligence to Law: Opportunities and Challenges" Profs. Donald H. Berman and Carole D. Hafner, Northeastern University 2:00-2:30 Welcome; Opening Remarks. 2:30-4:00 Legal Expert Systems I 2:30 "Expert Systems in Law: Out of the Research Laboratory and into the Marketplace" Richard E. Susskind Ernst & Whinney, London, England 3:00 "Expert Systems in Law: The DataLex Project" Graham Greenleaf, Andrew Mowbray and Alan L. Tyree University of Sydney, Australia 3:30 "Explanation for an Expert System that Performs Estate Planning" Dean A. Schlobohm and Donald A. Waterman Stanford University, The Rand Corporation 4:00-4:30 Coffee 4:30-6:00 Conceptual Legal Retrieval Systems I 4:30 "Conceptual Legal Document Retrieval Using the RUBRIC System" Richard M. Tong, Clifford A. Reid, Peter R. Douglas and Gregory J. Crowe Advanced Decision Systems 5:00 "Conceptual Organization of Case Law Knowledge Bases" Carole D. Hafner Northeastern University 5:30 "Designing Text Retrieval Systems for Conceptual Searching" Jon Bing Norwegian Research Center for Computers and Law 6:30-8:30 Welcoming Reception, Northeastern U. Faculty Center THURSDAY, May 28 9:00-10:30 Models of Legal Reasoning I 9:00 "A Process Specification of Expert Lawyer Reasoning" D. Peter O'Neil Harvard Law School 9:30 "A Case-Based System for Trade Secrets Law" Edwina L. Rissland and Kevin D. Ashley University of Massachusetts, Amherst 10:00 "But, See, Accord: Generating Blue Book Citations in HYPO" Kevin D. Ashley and Edwina L. Rissland University of Massachusetts, Amherst 10:30-11:00 Coffee 11:00-12:30 Legal Expert Systems II 11:00 "A Natural Language Based Legal Expert System for Consultation and Tutoring -- The LEX Project" F. Haft, R.P. Jones and Th. Wetter IBM Heidelberg Scientific Centre, West Germany 11:30 "The Application of Expert Systems Technology to Case-Based Law" J.C. Smith and Cal Deedman University of British Columbia 12:00 "Some Problems in Designing Expert Systems to Aid Legal Reasoning" Layman E. Allen and Charles S. Saxon The University of Michigan, Eastern Michigan University 12:30-2:00 Lunch 2:00-3:00 Panel: "The Impact of Artificial Intelligence on the Legal System" Moderator: Cary G. DeBessonet, Law and Artificial Intelligence Project, Louisiana State Law Institute 3:00-4:00 Conceptual Legal Retrieval Systems II 3:00 "Conceptual Retrieval and Case Law" Judith P. Dick University of Toronto 3:30 "A Connectionist Approach to Conceptual Information Retrieval" Richard K. Belew University of California, San Diego 4:00-4:30 Coffee 4:30-6:00 Expert Systems and Tax Law 4:30 "A PROLOG Model of the Income Tax Act of Canada" David M. Sherman The Law Society of Upper Canada 5:00 "An Expert System for Screening Employee Pension Plans for the Internal Revenue Service" U.S. Internal Revenue Service Gary Grady and Ramesh S. Patil 5:30 "Handling of Significant Deviations from Boilerplate Text" U.S. Internal Revenue Service Gary Morris, Keith Taylor and Maury Harwood 7:00 Reception and Banquet, The Colonnade Hote Banquet Address: Non-Monotonic Reasoning Prof. John McCarthy, Stanford University FRIDAY, May 29 9:00-10:30 Applications of Deontic Logic 9:00 "Legal Reasoning in 3-D" Marvin Belzer University of Georgia 9:30 "On the Relationship Between Permission and Obligation" Andrew J.I. Jones University of Oslo, Norway 10:00 "System = Program + Users + Law" Naftaly H. Minsky and David Rozenshtein Rutgers University 10:30-11:00 Coffee 11:00-12:30 Legal Expert Systems III 11:00 "Support for Policy Makers: Formulating Legislation with the Aid of Logical Models" T.J.M. Bench-Capon Imperial College of Science and Technology, London 11:30 "Logic Programming for Large Scale Applications in Law: A Formalisation of Supplementary Benefit Legislation" T.J.M. Bench-Capon, G.O. Robinson, T.W. Routen and M.J. Sergot Imperial College of Science and Technology, London 12:00 "Knowledge Representation in DEFAULT: An Attempt to Classify General Types of Knowledge Used by Legal Experts" Roger D. Purdy University of Akron 12:30-2:00 Lunch 2:00-3:00 Panel: Modeling the Legal Reasoning Process: Formal and Computational Approaches Moderator: Prof. L. Thorne McCarty, Rutgers University 3:00-4:00 Models of Legal Reasoning II 3:00 "Precedent-Based Legal Reasoning and Knowledge Acquisition in Contract Law: A Process Model" Seth R. Goldman, Michael G. Dyer and Margot Flowers University of California, Los Angeles 3:30 "Reasoning about 'Hard' Cases in Talmudic Law" Steven S. Weiner Harvard Law School, MIT 4:00-4:30 Coffee 4:30-6:00 Legal Knowledge Representation 4:30 "OBLOG-2: A Hybrid Knowledge Representation System for Defeasible Reasoning" Thomas F. Gordon GMD, Sankt Augustin, West Germany 5:00 "ESPLEX: A Rule and Conceptual Model for Representing Statutes" Carlo Biagioli, Paola Mariani and Daniela Tiscornia Instituto per la Documentazione Giuridica, Florence, Italy 6:00 "Legal Data Modeling: The Prohibited Transaction Exemption Analyst" Keith Bellairs Computer Law Systems, Inc. ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Mon May 11 03:23:10 1987 Date: Mon, 11 May 87 03:22:54 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #114 Status: RO Received: from relay.cs.net by vtcs1.cs.vt.edu; Mon, 11 May 87 03:13 EDT Received: from relay.cs.net by RELAY.CS.NET id ab19243; 10 May 87 20:31 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa07312; 10 May 87 20:29 EDT Date: Sun 10 May 1987 16:53-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #114 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 11 May 1987 Volume 5 : Issue 114 Today's Topics: Conference - Artificial Life Workshop & IFIP Workshop on Intelligent CAD & 4th International Conference on Logic Programming ---------------------------------------------------------------------- Date: Fri, 8 May 87 15:24:26 MDT From: cgl@LANL.GOV (C G Langton) Subject: Conference - Artificial Life Workshop About a year ago, I posted a query about work being done on the computer simulation of life. From the replies to that query and from what I have been able to dig up in the literature, it has become apparent that there is an imminent explosion of research in the simulation and synthesis of life, both in computers and in the laboratory. Therefore, I am organizing the following workshop: ARTIFICIAL LIFE An Interdisciplinary Workshop on the Synthesis and Simulation of Living Systems organized by Chris Langton Center for Nonlinear Studies Los Alamos National Laboratory Los Alamos, New Mexico 87545 September 21-25 1987 Artificial life is the study of artificial systems that exhibit behavior characteristic of natural living systems. This includes computer simulations, biological and chemical experiments, and purely theoretical endeavors. Processes occurring on molecular, cellular, neural, social, and evolutionary scales are subject to investigation. The ultimate goal is to extract the logical form of living systems. Microelectronic technology and genetic engineering will soon give us the capability to create new life forms "in-silico" as well as in-vitro. This capacity will present humanity with some of the most far-reaching technical, theoretical, and ethical challenges it has ever confronted. The time seems appropriate for a gathering of those involved in attempts to simulate or synthesize aspects of living systems. This workshop will provide a forum to address the fundamental problems inherent in such an enterprise. The goals of this first workshop on artificial life are: To bring the field of artificial life into focus. To present current work in artificial life, and to provide an historical perspective. To open a channel of communication between researchers from disciplines whose work is relevant to artificial life. To produce a list of fundamental questions that the field should address. To identify ways in which work on artificial life can contribute to theoretical biology. To organize the literature in the field by compiling an annotated bibliography. -------- (cut here and post above on appropriate bulletin boards) ---------- I have posted a more complete announcement to "news.announce.conferences", which contains further information about the workshop and includes a registration form to fill out and return. In the interest of brevity, I have not included the full posting here. If you are interested in attending or contributing to a workshop on computer - and other - models of life, its constituent processes, or the processes that living systems support, please see the more complete posting in "news.announce.conferences". One of the primary activities at the workshop will be an "artificial 4H show" with prizes for the most life-like models or simulations submitted. You need not attend the workshop to submit an entry to the "4H-show". So, if you have some simulation of a living system, an origin of life model, an evolving population of "bugs", a model of social dynamics, a self-replicating Meccano set, or something else you have been working on - whether as your primary line of research or as a project that you've been doing on the side - dust it off, polish it up, and send it (or a brief description) to the address listed below. I am hoping for a workshop with a large number of hands-on demonstrations and exhibits, combined with a few selected talks and panel discussions, so that we can really exchange ideas on a personal level in a computater-rich environment, allowing us to test new ideas or model parameters on the spot. I want to avoid the typical format of bumper-to-bumper talks with little time for discussion in between. I will provide a number of Sun workstations running 4.2 BSD UNIX, Apple Macintoshes, IBM PC's, and a CAM-6 cellular automaton machine. If your system requires other equipment, let me know the details and I will try to obtain it. More information will be available as the workshop evolves. ---------------------------------------------------------------------------- Chris Langton email: cgl@lanl.gov Center for Nonlinear Studies phone: 505-665-0049 (office) Los Alamos National Laboratory 505-667-1444 (messages) Los Alamos, New Mexico 87545 ------------------------------ Date: Wed, 6 May 87 22:07:46 pdt From: farhad%arbab3b2.uucp@usc-cse.usc.edu Subject: Conference - IFIP Workshop on Intelligent CAD CALL FOR PAPERS IFIP W.G.5.2 Workshop on Intelligent CAD October 6-8, 1987 Massachusetts Institute of Technology Cambridge, Massachusetts U.S.A. OBJECTIVES ---------- The purpose of this workshop is to provide a forum for discussion of theories and methodologies of intelligent CAD, aiming at better realization of practical systems. This workshop is the first in a series of three, to be held in successive years in the U.S.A., Europe and Japan. Future CAD systems capable of providing intelligent assistance in design activities or of autonomous design activity will be of large practical importance. Major theoretical and practical problems must be solved, however, before such systems can be realized. Design is a complex human activity, involving a variety of high-level cognitive tasks. There are few unifying principles and little consensus as to the basic nature of the design process, the types of knowledge or reasoning mechanisms involved or basic approaches to generic systems. At this first workshop in the series, the organizers wish to bring together researchers in the fields of artificial intelligence and computer-aided design with the goal of identifying and developing basic theoretical foundations for future intelligent CAD systems. This workshop will be a unique opportunity for the exchange of views and ideas. The second workshop will focus on the specialization of intelligent CAD systems, and in the third workshop, practical applications of intelligent CAD systems based on new theories are expected to appear. The organizers would like to encourage your participation in the first workshop of this challenging and important series. WORKSHOP TOPICS --------------- - Design theory and methodology - Cognitive models of the design process - Artificial intelligence in the design process - Design knowledge and representations - Paradigms for intelligent CAD CALL FOR PAPERS --------------- Potential participants are invited to submit three copies of a 1000 word abstract or a full paper before June 30, 1987. The abstracts or full papers should be position papers indicating the viewpoints of the prospective participant in the workshop. Contributors whose abstracts are accepted are requested to send revised abstracts or full papers by September 10, 1987. Notification of acceptance for participation will be issued by July 31, 1987. CONFERENCE FORMAT ----------------- The number of participants will be limited to about 40. 2 or 3 presentations will be made by invited speakers. A number of subgroups will be formed during the workshop to discuss specialized topics. Each subgroup will consist of discussion by the participants, though some papers may be presented as appropriate. The preliminary schedule is as follows: - October 6 - Morning Presentation by 2 or 3 invited speakers Afternoon Discussion about the format of the workshop and the formation of subgroups - October 7 - All day Discussion and presentations in subgroups - October 8 - Morning Discussion and presentation in subgroups Afternoon Summary and remarks by chairmen of subgroups, discussion of future plans LANGUAGE -------- The official language of the workshop will be English. CONFERENCE FEE -------------- The registration fee for the workshop will be $200. The payment method will be noticed with the notification of acceptance. BOOK ---- The proceedings of the workshop will be published by North Holland. The Organizing Committee will ask some of the participants to write papers for this book. TIMETABLE --------- June 30 Deadline for abstracts or full papers July 31 Notification of acceptance Sept. 10 Deadline for revised abstracts or full papers ORGANIZING COMMITTEE -------------------- - Chairmen - Yoshikawa, H. University of Tokyo, Japan Gossard, D. Massachusetts Institute of Technology, U.S.A. - Secretary - Kimura, F. University of Tokyo, Japan - Members - Arbab, F. University of Southern California, U.S.A. Bo, K. Productivity Support AS, Norwary Chairman of W.G. 5.2 IFIP Forbus, K.D. University of Illinois, U.S.A. Fox, M. Carnegie Group, U.S.A. Onosato, M. University of Tokyo, Japan Popplestone, R. J. University of Massachusetts, U.S.A. Suzuki, H. University of Tokyo, Japan ADDRESS FOR CORRESPONDENCE -------------------------- Professor Hiroyuki Yoshikawa, Dept. of Precision Machinery Engineering, Faculty of Engineering, University of Tokyo 7-3-1 Hongo, Bunkyo-ku Tokyo 113, Japan Phone: (03) 812-2111, ext. 6446 Fax: (03) 812-8849 Telex: 272 2111 FEUT J ========================================================================== IFIP W.G.5.2 Workshop on Intelligent CAD October 6-8, 1987 Massachusetts U.S.A. Please complete and return this separate form with your abstract or paper before June 30, 1987. Family Name:____________________________ First Name:_____________________ Company/Institute_________________________________________________________ Title/Position:___________________________________________________________ Mail Address:_____________________________________________________________ __________________________________________________________________________ Country:__________________________________ Business Phone:_____________________ ext. ( ) Telex:_________________ Title of your Paper (Abstract):___________________________________________ __________________________________________________________________________ ------------------------------ Date: Tue, 05 May 87 10:38:39 +1000 From: munnari!mulga.oz!kgm@seismo.CSS.GOV Subject: Conference - 4th International Conference on Logic Programming could you please post this to comp.ai.digest ...thanks ---------------------------------------------------------- 4th International Conference on Logic Programming University of Melbourne, Australia 25-29 May 1987 The 4th International Conference on Logic Programming is to be held at the University of Melbourne. Melbourne is a city in the south east of Australia. It is located beside a large bay and has a population of around 3 million. During May the weather is expected to be clear and sunny but bring an umbrella(!). Accommodation is available at the adjacent University Col- leges, a nearby hotel and a hotel in the city itself. Delegates staying at the University Colleges are requested to check in at the registration desk at Trinity College which will be staffed on the Sunday and Monday. There is a Sky Bus coach service from Tullamarine (Mel- bourne) Airport to central Melbourne about 25km away. It departs on the hour and half hour and the cost is about $6 per person. When boarding the coach delegates should tell the driver the name of the hotel they are staying at. Delegates staying at the University Colleges should ask to be dropped off at Trinity College. Anybody still requiring a registration form or more informa- tion concerning the conference should contact either Ms Buzz McCarthy Director Bloomsbury Conference Services 319 Lennox Street Richmond, 3121, Victoria, Australia Telephone: (03) 428 1983 Telex: AA 36224 or UUCP: iclp@munnari.uucp ARPA: iclp%munnari.oz@seismo.css.gov CSNET: iclp%munnari.oz@australia JANET: iclp%munnari.oz@uk.ac.ukc The preliminary conference programme follows. Monday 25 May (Tutorials Only) 09:00 - 13:00: Tutorial A Topic: Introduction to Logic Programming Speakers: L. Naish, K. Ramamohanarao (University of Melbourne) 09:00 - 13:00: Tutorial B Topic: Natural Language Processing Speaker: V. Dahl (Simon Fraser University) 14:00 - 18:00: Tutorial C Topic: Logic Programming for Expert Systems Speaker: M. Sergot (Imperial College) 14:00 - 18:00: Tutorial D Topic: Parallel Logic Programming Languages Speaker: K. Ueda (ICOT) 14:00 - 18:00: Tutorial E Topic: Advanced PROLOG Programming Speaker: L. Sterling (Case Western Reserve University) Tuesday 26 May 09:00 - 10:00: Keynote Address: J.A. Robinson (Syracuse University), Chairperson: J-L. Lassez (IBM T.J. Watson Research Center) 10:40 - 12:20: Session on Warren Abstract Machine, Chairper- son: E. Lusk (Argonne National Lab) * Advantages of Implementing PROLOG by Microprogramming a Host General Purpose Computer, J. Gee, S.W. Melvin and Y.N. Patt (Univ. of California, Berkeley) * Efficient Implementation of a Defensible Semantics for Dynamic PROLOG Code, T. Lindholm and R.A. O'Keefe (Quintus Computer Systems) * Freeze, Indexing and Other Implementation Issues in the WAM, M. Carlsson (SICS) * A Performance Comparison between PLM and an M68020 PROLOG Processor, H. Mulder and E. Tick (Stanford University) 13:30 - 15:35: Session on Databases, Chairperson: R.W. Topor (University of Melbourne) * A Database-Complete Proof Procedure based on SLD- Resolution, L. Vieille (ECRC) * Implementation of Recursive Queries for a Data Language based on Pure Horn Logic, D. Sacca (CRAI) and C. Zaniolo (MCC) * Stratification and Knowledge Based Management, C. Lassez, K. McAloon (IBM T.J. Watson Research Center) and G.S. Port (University of Melbourne) * Set Grouping and Layering in Horn Clause Programs, O. Shmueli and S. Naqvi (MCC) * Concurrent Database Updates in PROLOG, L. Naish, J.A. Thom and K. Ramamohanarao (University of Melbourne) 16:05 - 17:20: Session on Constraints, Chairperson: R. Nasr (MCC) * Methodology and Implementation of a CLP System, J. Jaffar (IBM T.J. Watson Research Center) and S. Michaylov (Monash University) * Answer Sets and Negation-as-Failure, K. Kunen (University of Wisconsin) * Forward Checking in Logic Programming, P. van Hentenryck and M. Dincbas (ECRC) 17:20 - 18:05: Invited Talk: K.L. Clark and S. Gregory (Imperial College), PARLOG and PROLOG United, Chairperson: H. Tamaki (Ibaraki University) Wednesday 27 May 09:00 - 09:45: Invited Talk: F. Pereira (SRI International), Grammars and Logics of Partial Information, Chairperson: R.A. O'Keefe (Quintus Computer Systems) 10:15 - 12:20: Session on Parallelism - Part I, Chairperson: S. Morishita (IBM Tokyo Research Lab) * A Distributed Implementation of Flat GHC on the Multi- PSI, N. Ichiyoshi, T. Miyazaki and K. Taki (ICOT) * Multiple Reference Management in Flat GHC, T. Chikayama and Y. Kimura (ICOT) * PARLOG and ALICE: a Marriage of Convenience, M. Lam and S. Gregory (Imperial College) * An OR-parallel Execution Algorithm for PROLOG and its FCP Implementation, E. Shapiro (Weizmann Institute) * KL1 Execution Model for PIM Cluster with Shared Memory, M. Sato, H. Shimizu, A. Matsumoto, K. Rokusawa and A. Goto (ICOT) 13:30 - 15:35: Session on Implementation Issues, Chairper- son: M. Carlsson (SICS) * Making Exhaustive Search Programs Deterministic, Part II, K. Ueda (ICOT) * Stream-based Compilation of Ground I/O PROLOG into Committed-choice Languages, H. Tamaki (Ibaraki University) * Meta-level Programming: a Compiled Approach, H. Bacha (Syracuse University) * Hash Tables in Logic Programming, J. Barklund and H. Millroth (Uppsala University) * Evaluating Logic Programs via Set-valued Functions, C. Cecchi, D. Sartini and L. Aiello (Universita di Roma) Thursday 28 May 09:00 - 09:45: Invited Talk: M. Sato (Tohoku University), Quty: A Concurrent Language based on Logic and Functions, Chairperson: K. Kunen (University of Wisconsin) 10:15 - 12:20: Session on Language Issues, Chairperson: C. Palamidessi (Universita di Pisa) * Near-Horn PROLOG, D.W. Loveland (Duke University) * A Theoretical Combination of SLD-resolution and Nar- rowing, A. Yamamoto (Kyushu University) * Inductive and Deductive Control of Logic Programs, A.R. Helm (University of Melbourne) * An Efficient Logic Programming Language and its Applica- tion to Music, K. Ebcioglu (IBM T.J. Watson Research Center) * Symbolical Construction of Truth Valued Domain for Logic Programs, S. Morishita, M. Numao and S. Hirose (IBM Tokyo Research Lab) 13:30 - 15:35: Session on Parallelism - Part II, Chairper- son: N. Ichiyoshi (ICOT) * Relating Goal-scheduling, Precedence and Memory Management in AND-parallel execution of Logic Programs, M.V. Hermenegildo (MCC) * Experiments with OR-parallel Logic Programs, T. Disz, E. Lusk and R. Overbeek (Argonne National Lab) * A Performance-oriented Design for OR-parallel Logic Pro- gramming, P. Tinker and G. Lindstrom (University of Utah) * Parallel Evaluation of Logic Programs: the REDUCE-OR Pro- cess Model, L.V. Kale (University of Illinois, Urbana- Champaign) * Implementing Backward Execution in Non-deterministic AND-parallel Systems, J.S. Conery (University of Oregon) 16:05 - 17:20: Session on Applications, Chairperson: P. Cox (Tech. Univ. of Nova Scotia) * PYTHON: An Expert Squeezer, L. Sterling and Y. Nygate (Case Western Reserve University) * CLP(R) and Some Electrical Engineering Problems, N.C. Heintze, S. Michaylov and P.J. Stuckey (Monash University) * Logical Secrets, M.S. Miller, D. Bobrow, E.D. Tribble and J. Levy (XEROX PARC) 17:20 - 18:05: Invited Talk: H. Gallaire (ECRC), Boosting Logic Programming, Chairperson: F. Kluzniak (Warsaw Univer- sity) Friday 29 May 09:00 - 09:45: Invited Talk: K. Ramamohanarao and J.A. Shepherd (University of Melbourne), Answering Queries in Deductive Database Systems, Chairperson: C. Zaniolo (MCC) 10:15 - 12:20: Session on Program Analysis, Chairperson: M.J. Maher (IBM T.J. Watson Research Center) * Finite Fixed-point Theorems, R.A. O'Keefe (Quintus Compu- ter Systems) * Construction of Logic Programs based on Generalised Fold/Unfold Rules, T. Kanamori and K. Horiuchi (Mitsubishi Research Lab) * A System of Precise Modes for Logic Programs, Z. Somogyi (University of Melbourne) * Type Synthesis for Ground PROLOG, F. Kluzniak (Warsaw University) * Derivation of Polymorphic Types for PROLOG Programs, J. Zobel (University of Melbourne) 13:30 - 15:35: Session on Concurrent Languages, Chairperson: S. Gregory (Imperial College) * Channels: a Generalization of Streams, E.D. Tribble, M.S. Miller, K. Kahn, D.G. Bobrow, C. Abbott (XEROX PARC) and E. Shapiro (Weizmann Institute) * Logic Semantics for a Class of Committed-choice Programs, M.J. Maher (IBM T.J. Watson Research Center) * An Approach to the Declarative Semantics of Synchroniza- tion in Logic Languages, G. Levi and C. Palamidessi (Univer- sita di Pisa) * An Object-oriented Programming Language based on the Parallel Logic Programming Language KL1, M. Ohki, A. Takeu- chi and K. Furukawa (ICOT) * Logic Operating Systems: Design Issues, I.T. Foster (Imperial College) 16:05 - 16:55: SICS Presentation, S. Sundstrom 16:55 - 18:05: Panel Discussion: What are the Novel Applica- tions of Logic Programming?, Chairperson: F. Mizoguchi (Science University of Tokyo) ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Fri May 15 04:07:13 1987 Date: Fri, 15 May 87 04:07:07 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #115 Status: R Received: from relay.cs.net by vtcs1.cs.vt.edu; Fri, 15 May 87 03:14 EDT Received: from relay.cs.net by RELAY.CS.NET id ab19258; 10 May 87 20:37 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa07404; 10 May 87 20:38 EDT Date: Sun 10 May 1987 16:57-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #115 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 11 May 1987 Volume 5 : Issue 115 Today's Topics: Seminars - Reporting the Non-Monotonic News (BTL) & Should McCarthy and Feigenbaum Talk to Each Other (SU) & Qualitative Mechanical Reasoning (UPenn) & Semi-Automatic Construction of Control Software (UPenn) & Explaining and Refining Decision-Theoretic Choices (UPenn) & General E-Unification (UPenn) ---------------------------------------------------------------------- Date: Thu 23 Apr 1987 13:50:34 From: dlm.allegra%btl.csnet@RELAY.CS.NET Subject: Seminar - Reporting the Non-Monotonic News (BTL) May 7th 10:30 AM AT&T Bell Laboratories - Murray Hill 1E-449 REPORTING THE NON-MONOTONIC NEWS: Keeping the Beat Local Benjamin Grosof Stanford University "Non-monotonic" reasoning systems are ones in which some conclusions have a default or retractable status. A prime motivation for such systems is to build agents that revise their beliefs in response to news from their environment. Efficient updating is problematic, however, because adding new information in general may require the revision of many, or even all, previous retractable conclusions. An understanding is needed of the "partial monotonicities" of updating, i.e. of the irrelevance of updates to parts of the previous retractable conclusions. To define non-monotonic theories, we introduce a formalism based on McCarthy's circumscription that directly expresses, as axioms, both default beliefs and preferences among default beliefs. It has a strong semantics based on first- and second-order logic. We characterize non-monotonic theories as hierarchically decomposable in a manner more analogous to programming languages than to ordinary monotonic logics. We then give a set of results about partial monotonicities of updating. We discover some surprising differences between updates consisting of default axioms and those consisting of non-retractable axioms. These results bear on a wide variety of applications of non-monotonic reasoning. Sponsor: R.J.Brachman ------------------------------ Date: 22 Apr 87 1556 PDT From: Vladimir Lifschitz Subject: Seminar - Should McCarthy and Feigenbaum Talk to Each Other (SU) SHOULD JOHN MCCARTHY AND ED FEIGENBAUM TALK TO EACH OTHER? Thursday, April 23, 4:15pm Bldg. 160, Room 161K Matt Ginsberg In this talk, I discuss one possible way to bridge the apparently widening gap between the "neats" and the "scruffies" in AI. According to Kuhn, a necessary step in resolving the differences between the two camps is that one attack problems of interest to the other. I attempt to do this by suggesting that the scruffy programs are doing essentialy two things: a recognizable approximation to first-order inference (such as MYCIN's backward chaining), and some sort of bookkeeping with the results returned (e.g., manipulation of certainty factors). Formalizing this bookkeeping is attractive for a variety of reasons: it will allow precise statements to be made about what the scruffies' programs are doing, and may lead to more effective implementations of their ideas. There are also advantages for the neats, since understanding some of the proposed extensions to first-order inference in this fashion appears to lead to computationally tractable algorithms for some simple non-mononotonic logics. If time permits, I will present a formalization which appears to have the properties described in the previous paragraph. ------------------------------ Date: Fri, 24 Apr 87 22:29:33 AST From: tim@linc.cis.upenn.edu (Tim Finin) Subject: Seminar - Qualitative Mechanical Reasoning (UPenn) Qualitative reasoning of mechanical devices and repair automation Pearl Pu COmputer and Information Science University of Pennsylvania 216 Moore School 1pm April 28, 1987 A knowledge representation scheme, QUORUM (QUalitative reasoning of Repair and Understanding of Mechanisms), has been constructed to apply qualitative techniques to the mechanical domain, which is an area that has been neglected in qualitative reasoning field. In addition, QUORUM aims at providing foundations for the construction of a repair expert system. The problem in constructing a representation is the difficulty of recognizing a feasible ontology with which we can express the behavior of mechanical devices and, more importantly, faulty behaviors of a device and its cause. Unlike most other approaches, our ontology employs the notion of force and energy transfer, and motion propagation. We discuss how the overall behavior of a device can be derived from the knowledge about the structure and topology of the device, and how faulty behaviors can be predicted based on information about the perturbation of some of the original conditions of the device. Necessary predicates and functions are constructed to express the physical properties of a wide variety of basic and complex mechanisms, and the interconnection relationships among the parts of a mechanism. Several examples analyzed with QUORUM include a pair of gears, a spring-driven cam mechanism, and a pendulum clock. An algorithm for the propagation of force, motion, and causality is proposed and examined. ------------------------------ Date: Mon, 27 Apr 87 16:31:00 EDT From: tim@linc.cis.upenn.edu (Tim Finin) Subject: Seminar - Semi-Automatic Construction of Control Software (UPenn) CIS COLLOQUIUM UNIVERSITY OF PENNSYLVANIA The Semi-Automatic Construction of Large Software Control System David Bourne, Research Scientist, Robotics Institute, Carnegie Mellon Large manufacturing software systems have taken many man-years of effort to build in the past. For example, it is not uncommon for even a small robotic cell to take several man years of effort to construct. Most of this effort is spent over-coming the communication incompatibilities (protocols and programming languages) that exist between machines from multiple vendors. This talk presents a new AI programming language (CML - the Cell Management Language) that greatly simplifies these major difficulties. In addition, control systems for manufacturing will be logically decomposed into several layers, and for each layer a semi-automatic software tool will be described for constructing that layer in a new application. Thursday, April 30, 1987 3:00 - 4:30 Room 216 The Faculty Lounge 2:30 - 3:00 ------------------------------ Date: Tue, 28 Apr 87 23:59:45 EDT From: tim@linc.cis.upenn.edu (Tim Finin) Subject: Seminar - Explaining and Refining Decision-Theoretic Choices (UPenn) EXPLAINING AND REFINING DECISION-THEORETIC CHOICES Doctoral Thesis Proposal Dave Klein Computer and Information Science University of Pennsylvania As the need to make complex choices among competing alternative actions is ubiquitous, the reasoning machinery of many intelligent systems will include an explicit model for making choices. Decision analysis is particularly useful for modelling such choices, and its potential for use in intelligent systems motivates the construction of facilities for automatically explaining decision-theoretic choices and for helping users to incrementally refine the knowledge underlying them. The proposed thesis addresses the problem of providing such facilities. Specifically, we propose the construction of a domain-independent facility called UTIL for explaining and refining a restricted but widely applicable decision-theoretic model called the additive multiattribute value model. We anticipate that this research will provide contributions to both AI and decision analysis. In this talk, the relevant issues are addressed in the context of examples from the domain of intelligent process control. Thursday, 30 April 1987 10:00 AM 5th floor conference room Committee: Dr. T.W. Finin (advisor) Dr. N.I. Badler (chairman) Dr. A.K. Joshi Dr. E.K. Clemons (Wharton/Penn CIS) Dr. E.H. Shortliffe (Stanford) Dr. M.O. Weber (Institute fuer Wirtschaftswissenschaften, RWTH Aachen, Germany) ------------------------------ Date: Wed, 29 Apr 87 00:04:32 EDT From: tim@linc.cis.upenn.edu (Tim Finin) Subject: Seminar - General E-Unification (UPenn) PhD Dissertation Proposal General E-Unification: Complete Transformations for Equational Theorem Proving and Logic Programming Wayne Snyder Computer and Information Science University of Pennsylvania There has been much work in the past two decades on the problem of incorporating methods for equational reasoning into computational logic. Unfortunately, the ``substitution of equals for equals'' which forms the basis of equational reasoning is fundamentally different from the analytic methods used for non-equational reasoning, which are based on an interpretation of the connectives in the language. This dicotomy has convinced many researchers that we should stratify theorem provers into a (non-equational) refutation mechanism and an E-unification mechanism which performs equational reasoning during unification steps, so that two terms E-unify if they are unifiable modulo the congruence on terms induced by the set of equations E. Many special purpose E-unification procedures have been designed for particular equational theories, and several also for the class of theories which can be compiled into rewrite rules via the Knuth-Bendix procedure. So far the problem of E-unification for arbitrary equational theories has received little attention, and in general there seems to be a need for some integrated approach which will show the structure of the class of all E-unification problems. Our current research attempts to address the problem of general E-unification and higher-order unification by extending the method of transformations on term systems, developed in the context of standard unification by Martelli and Montanari. We hope that this approach will provide not only a basis for practical procedures, but also a means for analysing unification problems in an abstract and mathematically elegant fashion. Our results so far include a completeness proof for our procedure and a new analysis of the occur check problem in E-unification. We propose to extend these methods to refutation methods incorporating equality, to a fundamentally new form of E-unification which has come up in the study of equational matings, and to the problem of higher-order E-unification. It is our hope that this research will not only yield interesting theoretical results, but will also help us to find practical algorithms for theorem proving and logic programming in the presence of equality. Friday, May 1, 10:00am 556 Moore (Conference Room) Supervisor: Dr. Jean Gallier Committee: Dr. Dale Miller (Chairman) Dr. Peter Buneman Dr. Frank Pfenning (CMU) Dr. Paliath Narendran (GE) Dr. Andre Scedrov ------------------------------ End of AIList Digest ******************** From in%@vtcs1 Mon May 11 03:23:23 1987 Date: Mon, 11 May 87 03:23:09 edt From: in%AIList@stripe.sri.com@vtcs1 To: ailist@stripe.sri.com Subject: AIList Digest V5 #116 Status: RO Received: from relay.cs.net by vtcs1.cs.vt.edu; Mon, 11 May 87 03:17 EDT Received: from relay.cs.net by RELAY.CS.NET id aa19327; 10 May 87 20:53 EDT Received: from stripe.sri.com by RELAY.CS.NET id aa07425; 10 May 87 20:44 EDT Date: Sun 10 May 1987 17:01-PDT From: AIList Moderator Kenneth Laws Subject: AIList Digest V5 #116 To: AIList@stripe.sri.com Reply-to: AIList@stripe.sri.com US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025 Phone: (415) 859-6467 AIList Digest Monday, 11 May 1987 Volume 5 : Issue 116 Today's Topics: Seminars - Automatic Equation Derivation (SU) & Managing Uncertainties: Prospective Reasoning (CMU) & A Shell for Intelligent Help Systems (UPenn) & A Computational Model of Creative Writing (UPenn) & Speaking to a Computer (CMU) & BB* Layered Environment for AI Systems (HP) ---------------------------------------------------------------------- Date: 27 Apr 87 1318 PDT From: Vladimir Lifschitz Subject: Seminar - Automatic Equation Derivation (SU) AUTOMATIC DERIVATION OF THE EQUATION OF MOTION OF A PENDULUM Thursday, April 30, 4:15pm Bldg. 160, Room 161K Michael Beeson (beeson@csli.stanford.edu) San Jose State University Some knowledge of elementary physics has been formalized in first-order logic. The domain of discourse includes physical objects and their relations, mathematical formulas, and the semantic relation between formulas and objects. The knowledge in question has been written in Prolog and is sufficient to support an automatic derivation of the differential equation of motion of a pendulum. The inference engine makes use of the Knuth-Bendix method and also of a symbolic computation system for algebra and calculus. Perhaps this is the first program to use both knowledge representation in logic and symbolic computation. ------------------------------ Date: 30 Apr 87 14:50:08 EDT From: Patricia.Mackiewicz@isl1.ri.cmu.edu Subject: Seminar - Managing Uncertainties: Prospective Reasoning (CMU) AI SEMINAR TOPIC: Managing Uncertainties: The MU System For Prospective Reasoning SPEAKER: Paul Cohen, University of Massachusetts, Amherst WHEN: Tuesday, May 5, 1987, 3:30 p.m. WHERE: Wean Hall 5409 ABSTRACT: I will describe a style of problem solving, prospective reasoning, and a development environment, MU, for building prospective reasoning systems. Prospective reasoning is a form of planning in which knowledge of the state of the world and the effects of actions is incomplete. I will illustrate one implementation of prospective reasoning in MU with examples from medical diagnosis. ------------------------------ Date: Mon, 4 May 87 11:50:36 EDT From: tim@linc.cis.upenn.edu (Tim Finin) Subject: Seminar - A Shell for Intelligent Help Systems (UPenn) COLLOQUIUM Computer and Information Science University of Pennsylvania A Shell for Intelligent Help Systems Joost Breuker, Radboud Winkels, Jacobijn Sandberg University of Amsterdam Department of Social Science Informatics The research reported here is part of a project aimed at the construction of an environment for building intelligent help systems. A help system supports the user in handling and mastering an information processing system. Core of this environment is a shell that contains all domain independent procedures and knowledge. A comprehensive help system not only answers questions of users, but also 'looks over their shoulders' and interrupts when appropriate. This means that a help system is equiped with a PERFORMANCE INTERPRETER, consisting of a PLAN RECOGNISER, a DIAGNOSER, and a QUESTION INTERPRETER. Part of this shell and focus of this paper is a generic COACH. In a help system a COACH has two functions: to assist the user with a current problem and to teach the user about the IPS. The proposed COACH consists of three layers: 1) A DIDACTIC GOAL GENERATOR which genrates an overlay of domain concepts that may be taught, 2) STRATEGY PLANNER which constructs coaching strategies, and 3) TACTICS which are the terminal elements of strategies. They are the speech acts finally "uttered" by the COACH. In this paper these three layers are discussed in greater detail and are related to empirical research. Tuesday, May 12, 1987 Room 216 3:00 to 4:30 Refreshements Available The Faculty Lounge 2:30 to 3:00 ------------------------------ Date: Tue, 5 May 87 10:49:58 EDT From: tim@linc.cis.upenn.edu (Tim Finin) Subject: Seminar - A Computational Model of Creative Writing (UPenn) CIS Colloquium Computer and Information Science University of Pennsylvania A COMPUTATIONAL MODEL OF CREATIVE WRITING Masoud Yazdani Dept. of Computer Science University of Exeter, UK The overal aim of the project is to examine a computational model model of creativity based on the process of meta-level inspection and control of loosely controlled simulations. The test bed for this study is the act of creative writing. Various proposals for computational story writing are considered and one of them, TALE-SPIN, is critically evaluated. A more comprehensive model for storywriting is then presented to account for the shortcomings pointed out. The model presented consists of five distinct processes of plot-making, world-making, simulation, narration and text generation. These processes are further expanded within a computational framework. A computer program, ROALD, is described which attempts to produce stories within this general framework. ROALD, although basically the simulation part of the model, acts as a test bed for the more general idea of controlled simulation. we also look at other areas (picture making and machine learning) where related work is being carried out. Our argument can be stated at three levels of generality: 1. That the core of the act of creative writing is simulation of life 2. That this simulation needs to be part of a model which provides situations within which the simulations occur as well as providing sources of constraints so that the results are consistant and interesting. 3. That not only creative writing but other creative acts can be be viewed as the process of a loosely controlled simulation with metal-level validation and revision of the results. Wednesday, May 13, 1987 Room 216 3:00 to 4:30 Refreshments Available 2:30 to 3:00 The Faculty Lounge ------------------------------ Date: 5 May 1987 1002-EDT From: Elaine Atkinson Subject: Seminar - Speaking to a Computer (CMU) SPEAKER: Alexander Hauptmann TITLE: "Speaking to a Computer" DATE: Tuesday, May 5 TIME: 12:00 - 1:20 p.m. PLACE: Adamson Wing, Baker Hall ABSTRACT: This talk describes an empirical study of man-computer speech interaction. I will describe the experiment, its goals and outline the experimental design and the many results. The experiment shows that speech to a computer is not as ill-formed as one would expect. People speaking to a computer are more disciplined than when speaking to each other. There are large differences in the usage of spoken language compared to typed language, and several phenomena which are unique to spoken or typed input respectively. Usefulness for work in speech understanding systems for the future is considered. ------------------------------ Date: Thu 7 May 87 19:08:52-PDT From: Ted Kamins Reply-to: KAMINS@Sierra.Stanford.EDU Subject: Seminar - BB* Layered Environment for AI Systems (HP) HEWLETT-PACKARD LABORATORIES COMPUTER COLLOQUIUM Speaker: Barbara Hayes-Roth Senior Research Associate Stanford Knowledge Systems Lab Subject: BB*: A modular and layered environment for AI systems Time: Thursday, May 14, 1987, 4 pm Place: Hewlett-Packard 5M Auditorium 1501 Page Mill Road Palo Alto Non-HP Employees: Welcome! Please come to the lobby shortly before 4 pm so that you can be escorted to the auditorium. Refreshments will be served following the talk. Host: Barry Bronson (857-3033) Stanford contact: Ted Kamins (kamins@sierra) Abstract: An intelligent system reasons about--controls, explains, learns about--its actions, thereby improving its efforts to achieve goals and function in its environment. In order to perform effectively, a system must have knowledge of the actions it can perform, the events and states that can occur, and the relationships among instances of those actions, events, and states. The BB* environment represents this knowledge in an abstraction hierarchy and defines uniform standards of knowledge content and representation for modules within each of three hierarchical levels: architecture, framework, and application. The speaker will illustrate BB* with some of its current modules: (a) the BB1 blackboard control architecture; (b) the ACCORD framework for arrangement-assembly tasks; and (c) several domain-specific applications of BB1-ACCORD. BB* advantages for system representation and performance, system design and implementation, reusable knowledge modules, and open systems integration will be discussed. ------------------------------ End of AIList Digest ********************