[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference heron::euro_swas_ai

Title:	Europe-Swas-Artificial-Intelligence

Moderator:	HERON::BUCHANAN

Created:	Fri Jun 03 1988
Last Modified:	Thu Aug 04 1994
Last Successful Update:	Fri Jun 06 1997
Number of topics:	442
Total number of notes:	1429

21.0. "AIlist DIGEST" by HERON::ROACH (TANSTAAFL !) Mon Jul 25 1988 15:37

    AIlist DIGEST entries, as collected from the INFOnet, will be
    posted in this note.
    
    Please consider this a READ ONLY note which will contain only AIlist
    DIGEST entries. If you would like to comment on, or start a discussion
    about any of the entries, please do so via a separate note.
    
    The AIlist DIGEST comments on general AI topics, mostly from an
    academic point of view. Topics range from the social ramifications
    of the technology through advanced neural net implementation
    techniques.

T.R	Title	User	Personal Name	Date	Lines
21.126	YES	HERON::ROACH	TANSTAAFL !	`Fri Apr 21 1989 19:28`	2032
	Printed by: Pat Roach Document Number: 007013 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 20-Apr-1989 10:38am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@STATOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #9 AIList Digest Thursday, 20 Apr 1989 Volume 9 : Issue 9 Announcements: Annual Conference of the Intl. Assoc. of Knowledge Engineers 1st Intl. Conf. on Principles of KR and Reasoning - Toronto (KR'89) ACL Annual Meeting - Vancouver Neural Networks for Defense Conference Neural Network Models of Conditioning and Action IJCNN'89 Volunteers IEEE Conf. on Computer Vision and Pattern Recognition (CVPR89) 5th Alvey Vision Conference - Reading (AVC89) Workshop on AI for the Hearing Impaired 2nd Intl. Symposium on AI - Monterey 4th Intl. Supercomputing Symposium - Santa Clara American Society for Cybernetics Meeting Model Based Diagnosis Workshop - Paris AI and Law Conference - Vancouver (ICAIL-89) ---------------------------------------------------------------------- Date: Fri, 31 Mar 89 14:41 EST From: CHRISTOPHER LOWE <IAKE%[email protected]> Subject: Annual Conference of the Intl. Assoc. of Knowledge Engineers FINAL CALL FOR PAPERS For the Annual Conference of The International Association of Knowledge Engineers Conference Theme: "KNOWLEDGE ENGINEERING TODAY'S MARKETPLACE"-- Advancing the Science, Technology and Practice Behind the Commercial, Academic and Governmental Demand for Builders of Intelligent Systems. The INTERNATIONAL ASSOCIATION OF KNOWLEDGE ENGINEERS, with cosponsorship by the University of Maryland University College Graduate School, will present its annual conference June 26, 27 and 28, 1989, at the University Center, College Park, MD, campus. Papers from both basic research and applied practical expertise will be considered on the following topics. Research in Knowledge Engineering for Language-Based Systems and Neural Networks INDUSTRY (Management, Manufacturing, Banking, Medical and Retail): * Digital and Neural Expert System Design * Natural Language Processing * Pattern Matching GOVERNMENT (Defense, Space Science and Logistics Support) Application of Expert, NLP and Vision System Theory to: * Machine Learning at the Engineering Level * Signal Processing * Control Systems * Decision Theory ACADEMIA (Artificial Intelligence Theoretical Extraction for Knowledge Engineering): * Machine Learning * Digital and Neural System Modeling * Neurobiological Theory * Cognitive Science * Relationship of Genetic Algorithms to Artificial Intelligence * Automata Theory in System Definition * Formal Language Theory Practice and Profession of Knowledge Engineering PROFESSIONAL: * Status of Knowledge Engineers * Qualification for Certification in Knowledge Engineering * Topics in Commercialization * Laws and Axioms for Knowledge Engineering TECHNICAL (Knowledge-Based System Crafting in): * AI: LISP, Prolog, Others * Procedural: ADA, C, Popular Knowledge Engineering using PCs, Others * Future Applications * Genetic Algorithm at the Engineering Level Topics from other technical areas as well as the social, physical and medical sciences are also acceptable as long as they demonstrate meaningful research or practice in application of knowledge engineering. PROCEDURE FOR SUBMISSION: (1) Original abstracts of 200-400 words should be sent by May 1, 1989 to: Dr. Michael Teague, Chairman IAKE/UofM Committee for Conference Papers International Association of Knowledge Engineers Georgetown P.O. Box 25461 Washington, DC 20007 ([email protected]) (2) Authors will be notified of selection by May 20, 1989. (3) Authors also should submit a letter authorizing the publication of their paper by the International Association of Knowledge Engineers. Papers should not exceed 5,000 words. ------------------------------ Date: Thu, 6 Apr 89 17:20:15 EDT From: [email protected] Subject: 1st Intl. Conf. on Principles of KR and Reasoning - Toronto (KR'89) KR'89: THE FIRST INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING Monday, May 15, 1989 - Thursday, May 18, 1989 Royal York Hotel Toronto, Ontario, CANADA PLEASE NOTE: Conference brochures (with registration material) were mailed out several weeks ago to AAAI members, those who submitted papers to KR'89, and those who helped out with the conference. Apparently, not all of the brochures reached their final destinations. If you did not receive a brochure, or would like information about registration and accommodations, please contact Ray Reiter, at (416) 978-6324 or [email protected]. Registration material can be sent to you electronically. PLEASE REGISTER EARLY, AS SPACE IS LIMITED. Reduced fees for early registrants are available until April 14. Also please note that some of the paper titles and authors have changed since the brochure was printed. The titles and authors specified below are correct. KR'89 CONFERENCE SCHEDULE ======================================================================== SUNDAY, MAY 14 -- EVENING 7:00 Opening Reception Ballroom ======================================================================== ======================================================================== MONDAY, MAY 15 -- MORNING --------------- Ontario Room: Nonmonotonic Reasoning I --------------- 9:00 A Simple Solution to the Yale Shooting Problem Andrew B. Baker -- Stanford University 9:35 Did Newton Solve the "Extended Prediction Problem"? Manny Rayner -- Swedish Institute of Computer Science 10:10 == break == 10:30 Defaults and Probabilities; Extensions and Coherence Eric Neufeld -- University of New Brunswick 11:05 Default Reasoning, Minimality and Coherence Hector Geffner -- University of California at Los Angeles 11:40 Impediments to Universal Preference-Based Default Theories Jon Doyle -- Massachusetts Institute of Technology Michael P. Wellman -- AFWAL/TXI, Wright-Patterson AFB --------------- Ballroom: Taxonomic Representations; Natural Language-Oriented Representations ---------- 9:00 Terminological Knowledge Representation Systems Supporting N-Ary Terms James G. Schmolze -- Tufts University 9:35 Subsumption in KL-ONE is Undecidable Manfred Schmidt-Schauss -- Universitat Kaiserslautern 10:10 == break == 10:30 Taxonomic Syntax for First Order Inference David McAllester -- MIT Artificial Intelligence Laboratory Bob Givan -- MIT Artificial Intelligence Laboratory Tanveer Fatima -- MIT Artificial Intelligence Laboratory 11:05 Ontological Assumptions in Knowledge Representation Graeme Hirst -- University of Toronto 11:40 An Episodic Knowledge Representation for Narrative Texts Lenhart K. Schubert -- University of Rochester Chung Hee Hwang -- University of Rochester ======================================================================== 12:15 - 2:00 LUNCH ======================================================================== MONDAY, MAY 15 -- AFTERNOON --------------- Ontario Room: Metareasoning; Belief Revision -------- 2:00 Principles of Metareasoning Stuart Russell -- University of California at Berkeley Eric Wefald -- University of California at Berkeley 2:35 Tractable Decision-Analytic Control Oren Etzioni -- Carnegie-Mellon University 3:10 == break == 3:30 Belief, Metaphorically Speaking John A. Barnden -- New Mexico State University 4:05 A Knowledge Level Analysis of Belief Revision Bernhard Nebel -- IBM Deutschland GmbH 4:40 Formal Theories of Belief Revision Anand S. Rao -- The Australian AI Institute Norman Y. Foo -- University of Sydney --------------- Ballroom: Symposium on Temporal Reasoning -------------- Temporal Reasoning in AI, Philosophy, and Theoretical Computer Science Organized and Moderated by Yoav Shoham, Stanford University 2:00 Johan van Benthem, Universiteit van Amsterdam 2:45 Panel Discussion 3:10 == break == 3:30 Amir Pnueli, Weizmann Institute 4:15 Panel Discussion 4:40 Audience Participation ======================================================================== ======================================================================== TUESDAY, MAY 16 -- MORNING --------------- Ontario Room: Deductive Reasoning -------------------- 9:00 A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning Alan M. Frisch -- University of Illinois 9:35 On the Appearance of Sortal Literals: A Non Substitutional Framework for Hybrid Reasoning A. G. Cohn -- University of Warwick 10:10 == break == 10:30 Syntactic Equality in Knowledge Representation and Reasoning Edward P. Stabler, Jr. -- University of Western Ontario 11:05 Plausible World Assumption Eliezer L. Lozinskii -- The Hebrew University 11:40 Skeptical Reasoning and Disjunctive Programs Arcot Rajasekar -- University of Maryland Jorge Lobo -- University of Maryland Jack Minker -- University of Maryland --------------- Ballroom: Case-Based, Analogical, and Inductive Reasoning ------------------------- 9:00 A Framework for Dynamic Representation of Knowledge: A Minimum Principle in Organizing Knowledge Representation Yoshiteru Ishida -- Kyoto University 9:35 Knowledge Representation in a Case-Based Reasoning System: Defaults and Exceptions Phyllis Koton -- The MITRE Corporation Melissa P. Chase -- The MITRE Corporation 10:10 == break == 10:30 Induction as Nonmonotonic Reasoning Nicolas Helft -- ICOT 11:05 Analogical Reasoning, Defeasible Reasoning, and the Reference Class R. P. Loui -- Washington University 11:40 Analogy as a Constrained Partial Correspondence Over Conceptual Graphs Debbie Leishman -- University of Calgary ======================================================================== 12:15 - 2:00 LUNCH ======================================================================== TUESDAY, MAY 16 -- AFTERNOON --------------- Ontario Room: Commonsense Theories ------------------- 2:00 Combining Logic and Differential Equations for Describing Real-World Systems Erik Sandewall -- Linkoping University 2:35 Solutions to a Paradox of Perception with Limited Acuity Ernest Davis -- Courant Institute 3:10 == break == 3:30 Cardinalities and Well Orderings in a Common-Sense Set Theory Wlodek Zadrozny -- IBM T. J. Watson Research Center 4:05 Modelling Topological and Metrical Properties in Physical Processes D. A. Randell -- University of Warwick A. G. Cohn -- University of Warwick --------------- Ballroom: Symposium on Nonmonotonic Reasoning --------- Nonmonotonic Reasoning Organized and Moderated by David Etherington, AT&T Bell Laboratories 2:00 Probabilistic Semantics for Nonmonotonic Reasoning: A Survey Judea Pearl -- University of California at Los Angeles 3:00 == break == 3:30 Report on the Munich Nonmonotonic Reasoning Workshop David Poole -- University of British Columbia 4:00 Invited Panel: Critical Issues in Nonomonotonic Reasoning Moderator: David Etherington, AT&T Bell Laboratories Panellists: Ken Forbus, University of Illinois Matthew Ginsberg, Stanford University David Israel, SRI International/CSLI Vladimir Lifschitz, Stanford University ======================================================================== TUESDAY, MAY 16 -- EVENING 7:00 Conference Banquet Ontario Place ======================================================================== ======================================================================== WEDNESDAY, MAY 17 -- MORNING --------------- Ontario Room: Constraints; Time --------------------- 9:00 Parallel Solutions to Constraint Satisfaction Problems Simon Kasif -- The Johns Hopkins University 9:35 Exact Solution in Linear Time of Networks of Constraints Using Perfect Relaxation Francesca Rossi -- MCC Ugo Montanari -- Universita di Pisa 10:10 == break == 10:30 Temporal Constraint Networks Rina Dechter -- University of California at Los Angeles Itay Meiri -- University of California at Los Angeles Judea Pearl -- University of California at Los Angeles 11:05 Localizing Temporal Constraint Propagation Johannes A. G. M. Koomen -- University of Rochester 11:40 A Non-Reified Temporal Logic Fahiem Bacchus -- University of Waterloo Josh Tenenberg -- University of Rochester Johannes A. Koomen -- University of Rochester --------------- Ballroom: Default Reasoning; Tractable Reasoning ----- 9:00 What the Lottery Paradox Tells Us About Default Reasoning David Poole -- University of British Columbia 9:35 Hard Problems for Simple Default Logics Henry A. Kautz -- AT&T Bell Laboratories Bart Selman -- University of Toronto 10:10 == break == 10:30 Some Results Concerning the Computational Complexity of Abduction Tom Bylander -- The Ohio State University Dean Allemang -- The Ohio State University Michael C. Tanner -- The Ohio State University John R. Josephson -- The Ohio State University 11:05 Hierarchical Knowledge Bases and Efficient Disjunctive Reasoning Alex Borgida -- Rutgers University David W. Etherington -- AT&T Bell Laboratories 11:40 Towards a Theory of Access-Limited Logic for Knowledge Representation J. M. Crawford -- The University of Texas at Austin Benjamin Kuipers -- The University of Texas at Austin ======================================================================== WEDNESDAY, MAY 17 -- AFTERNOON *** FREE AFTERNOON * ======================================================================== ======================================================================== THURSDAY, MAY 18 -- MORNING --------------- Ontario Room: Nonmonotonic Reasoning II -------------- 9:00 What Does a Conditional Knowledge Base Entail? Daniel Lehmann -- Hebrew University 9:35 Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming Teodor C. Przymusinski -- University of Texas at El Paso 10:10 == break == 10:30 Argument Systems: A Uniform Basis for Nonmonotonic Reasoning Fangzhen Lin -- Stanford University Yoav Shoham -- Stanford University 11:05 Between Circumscription and Autoepistemic Logic Vladimir Lifschitz -- Stanford University 11:40 Relating Autoepistemic and Default Logics Wiktor Marek -- University of Kentucky Miroslaw Truszczynski -- University of Kentucky --------------- Ballroom: Planning and Reasoning about Action -------- 9:00 Synthesizing Information-Tracking Automata from Environment Descriptions Stanley J. Rosenschein -- Teleos Research 9:35 Situated Control Rules Mark Drummond -- NASA Ames Research Center 10:10 == break == 10:30 ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus Edwin P. D. Pednault -- AT&T Bell Laboratories 11:05 Inheritance in Automated Planning Josh Tenenberg -- University of Rochester 11:40 Making Situation Calculus Indexical Devika Subramanian -- Stanford University John Woodfill -- Stanford University ======================================================================== 12:15 - 2:00 LUNCH ======================================================================== THURSDAY, MAY 18 -- AFTERNOON --------------- Ballroom: Plenary Symposium ---------------------------- Against Representation: The Opposition Speaks Organized and Moderated by David Kirsh, MIT Speaker: Geoffrey Hinton, University of Toronto "Connectionist Symbol Processing" Respondent: Danny Bobrow, Xerox PARC Speaker: Stan Rosenschein, Teleos Research "No Representation Without Information" Respondent: Drew McDermott, Yale University Speaker: John Perry, Stanford University/CSLI "Intelligence is Attunement to Incremental Information" Respondent: Robert Moore, SRI International ======================================================================== ------------------------------ Date: 2 Apr 89 22:59:33 GMT From: [email protected] (Donald E Walker) Subject: ACL Annual Meeting - Vancouver ASSOCIATION FOR COMPUTATIONAL LINGUISTICS 27th Annual Meeting 26-29 June 1989 Instructional Resources Centre (IRC) University of British Columbia Vancouver, British Columbia, Canada SUNDAY EVENING, 25 JUNE 7:00-9:00 Tutorial Registration and Reception Fort Camp Lounge, Walter Gage Residence Halls Complex MONDAY MORNING, 26 JUNE 9:00-12:30 TUTORIAL SESSIONS Theatre 4 Constrained Grammatical Formalisms Aravind Joshi, K. Vijay-Shanker, & David Weir Theatre 5 Psycholinguistic Approaches to Language Comprehension Michael Tanenhaus MONDAY AFTERNOON, 26 JUNE 2:00-5:30 TUTORIAL SESSIONS Theatre 4 Morphology and Computational Morphology Richard Sproat Theatre 5 Speech Technology Jared Bernstein & Patti Price MONDAY EVENING, 26 JUNE 7:00-9:00 Conference Registration and Reception Lobby 8:00-9:30 PANEL: Computational Linguistics & Research in the Humanities Don Walker (Chair), Patrick Hanks, Nancy Ide, Mark Liberman, Martha Palmer, Antonio Zampolli REGISTRATION: TUESDAY THURSDAY 8:00-5:00 Lobby; until noon Thursday EXHIBITS: TUESDAY THURSDAY 9:00-6:00 Various rooms on lobby floor; until 1:30pm Thursday * ALL TECHNICAL SESSIONS IN THEATRE 2 *** TUESDAY MORNING, 27 JUNE 9:00-9:15 Opening remarks and announcements 9:15 9:40 A Transfer Model Using a Typed Feature Structure Rewriting System with Inheritance Remi Zajac 9:40-10:05 A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms Stuart M. Shieber, Gertjan van Noord, Robert Moore, & Fernando C. N. Pereira 10:05 10:35 Break 10:35 11:00 A Three-Valued Interpretation of Negation in Feature Structure Descriptions Anuj Dawar & K. Vijay-Shanker 11:00-12:00 INVITED TALK: Natural Language and Knowledge Representation: So Close Together Yet So Far Apart James Allen TUESDAY AFTERNOON, 27 JUNE 1:30-1:55 Logical Forms in the Core Language Engine Hiyan Alshawi & Jan van Eijck 1:55 2:20 Unification-Based Semantic Interpretation Robert C. Moore 2:20-2:45 Reference to Locations Lewis G. Creary, J. Mark Gawron, & John Nerbonne 2:45 3:05 Break 3:05 3:30 Getting at Discourse Referents Rebecca J. Passonneau 3:30-3:55 Conversationally Relevant Descriptions Amichai Kronfeld 3:55 4:20 Cooking Up Referring Expressions Robert Dale 4:20-4:40 Break 4:40-5:05 Word Association Norms, Mutual Information and Lexicography Kenneth Church & Patrick Hanks 5:05 5:30 Lexical Access in Connected Speech Recognition Ted Briscoe 5:30-5:55 Dictionaries, Dictionary Grammars and Dictionary Entry Parsing Mary S. Neff & Branimir K. Boguraev WEDNESDAY MORNING, 28 JUNE 9:00-9:25 Some Chart-Based Techniques for Parsing Ill-Formed Input Chris Mellish 9:25 9:50 On Representing Governed Prepositions and Handling `Incorrect' and Novel Prepositions Hatte Blejer & Sharon Flank 9:50-10:15 Acquiring Disambiguation Rules from Text Donald Hindle, AT&T Bell Laboratories 10:15 10:45 Break 10:45-11:10 The Effects of Interaction on Spoken Discourse Sharon L. Oviatt & Philip R. Cohen 11:10-12:10 INVITED TALK: Repair and the Organization of Natural Language Emmanuel Schegloff WEDNESDAY AFTERNOON, 28 JUNE 1:30-1:55 How to Cover a Grammar Rene Leermakers 1:55-2:20 The Structure of Shared Forests in Ambiguous Parsing Sylvie Billot & Bernard Lang 2:20-2:50 Break 2:50-3:15 A Calculus for Semantic Composition and Scoping Fernando Pereira 3:15-3:40 A General Computational Treatment of the Comparative Carol Friedman 3:40-4:05 The Lexical Semantics of Comparative Expressions Duane E. Olawsky 4:05-4:25 Break 4:25-4:50 Automatic Acquisition of the Lexical Semantics of Verbs from Sentence Frames Mort Webster & Mitch Marcus 4:50-5:15 Computer Aided Interpretation of Lexical Cooccurrences Paola Velardi, Maria Teresa Pazienza, & Stefano Magrini 5:15-5:40 A Hybrid Approach to Representation in the Janus Natural Language Processor Ralph M. Weischedel 6:30-7:30 RECEPTION Graduate Center 7:30-10:00 BANQUET Museum of Anthopology Presidential Address: Candy Sidner THURSDAY MORNING, 29 JUNE 9:00-9:25 Planning Text for Advisory Dialogues Johanna D. Moore & Cecile L. Paris 9:25-9:50 Two Constraints on Speech Act Ambiguity Elizabeth A. Hinkelman & James F. Allen 9:50-10:10 Break 10:10-11:10 INVITED TALK: How Many Words Do People Know? Mark Liberman 11:10-12:00 BUSINESS MEETING & ELECTIONS Nominations for ACL Offices for 1990 President: Jerry Hobbs, SRI International Vice President: Ralph Grishman, NYU Secretary-Treasurer: Don Walker, Bellcore Executive Committee (1990-1992): Kathleen McKeown, Columbia Executive Committee (1990-1991): Wolfgang Wahlster Universitaet des Saarlandes Nominating Committee (1990-1992): Candy Sidner, BBN THURSDAY AFTERNOON, 29 JUNE 1:30-1:55 Treatment of Long Distance Dependencies in LFG and TAG: Functional Uncertainty in LFG is a Corollary in TAG Aravind K. Joshi & K. Vijay-Shanker 1:55-2:20 Tree Unification Grammar Fred Popowich 2:20-2:45 A Generalization of the Offline Parsable Grammars Andrew Haas 2:45-3:15 Break 3:15-3:40 Discourse Entities in Janus Damaris M. Ayuso 3:40-4:05 Evaluating Discourse Processing Algorithms Marilyn A. Walker 4:05-4:30 A Computational Mechanism for Pronominal Reference Robert J.P. Ingria & David Stallard 4:30-4:50 Break 4:50-5:15 Parsing as Natural Deduction Esther Koenig 5:15-5:40 Efficient Parsing for French Claire Gardent, Gabriel G. Bes, Pierre-Francois Jurie, & Karine Baschung PROGRAM COMMITTEE Joyce Friedman, Boston University Barbara Grosz, Harvard University Julia Hirschberg, AT&T Bell Laboratories (Chair) Robert Kasper, USC Information Sciences Institute Richard Kittredge, Universite de Montreal and Odyssey Research Associates Beth Levin, Northwestern University Steve Lytinen, University of Michigan Martha Palmer, Unisys Fernando Pereira, SRI International Carl Pollard, Carnegie-Mellon University Len Schubert, University of Rochester Mark Steedman, University of Pennsylvania TUTORIALS 26 June 1989 CONSTRAINED GRAMMATICAL FORMALISMS Aravind Joshi, University of Pennsylvania K. Vijay-Shanker, University of Delaware David Weir, Northwestern University Our goal is to review a range of constrained grammatical formalisms by considering the following aspects: key features of language structure the formalisms try to capture, linguistic adequacy, mathematical and computational properties, parsing strategies, kinds of structural descriptions supported, strategies for embedding them in the unfication framework, etc. We will focus on those formalisms characterized as mildly context-sensitive. The presentation will be based on examples rather than on formal proofs. Therefore, it will be appropriate for a wide range of computational linguists, even those whose investments in the construction of a lexicon and a grammar do not allow them the luxury of playing with alternative formalisms now. PSYCHOLINGUISTIC APPROACHES TO LANGUAGE COMPREHENSION Michael Tanenhaus, University of Rochester I will present a selective review of recent psycholinguistic work in three areas: (1) word recognition and lexical access; (2) parsing, with a focus on attachment ambiguity and gap-filling; and (3) anaphora resolution. In each of these areas, I will summarize some of the influential ideas and the empirical results that have emerged during the last few years. Basic information will be provided about some of the methodological advances that are enabling psycholinguists to provide detailed information about immediate or ``on-line'' comprehension processes. I will also identify some of the controversial issues that I expect will be the focus of psycholinguistic research for the next few years, and I will outline some areas where more interaction between computational linguistics and experimental psycholinguists would be especially fruitful. MORPHOLOGY AND COMPUTATIONAL MORPHOLOGY Richard Sproat, AT&T Bell Laboratories Why study the structure of words computationally why not just look up words in a dictionary without considering their internal structure? Knowledge of morphology is useful in applications as diverse as speech synthesis, parsing, machine translation, spelling correction, and Japanese text-editing. The tutorial will outline some major results in theoretical morphology which affect computational issues, including recent linguistic work on the phonological, syntactic and semantic properties of words. Particular pieces of work in computational morphology will be discussed, all of which deal with theoretically interesting issues to a greater or lesser extent, and many of which were done with a particular application in mind. Among the systems discussed will be the Decomp module of the MITalk text-to-speech system, and the KIMMO Two-Level morphological analysis system. There will also be some discussion of computational work in areas closely related to morphology, including the interpretation of compound nouns in English, and the recognition of word boundaries in inputs where such boundaries are not marked, such as speech or Chinese text. Some of the recent debate on the computational complexity of morphological analysis will be addressed. SPEECH TECHNOLOGY Jared Bernstein and Patti Price, SRI International This tutorial will review the basics of speech production and perception, followed by a an overview of the major speech processing applications including coding-decoding for transmission, speaker recognition, speech recognition, speech synthesis, and related medical and educational applications. The core of the tutorial is an in-depth review of speech synthesis and recognition, along with a discussion of metrics for their evaluation and current directions of research. The presentation on text-to-speech synthesis will cover current practice and research issues in letter-to-sound conversion, prosodic construction, and spectral composition. The presentation of recognition will emphasize methods for acoustic feature extraction, lexical modeling, and word matching. The integration of syntactic and semantic knowledge in recognition and synthesis will also be covered. PANEL 26 June 1989 COMPUTATIONAL LINGUISTICS AND RESEARCH IN THE HUMANITIES Don Walker, Bellcore (Chair); Patrick Hanks, Collins Publishers; Nancy Ide, Vassar; Mark Liberman, AT&T Bell Laboratories; Martha Palmer, Unisys; Antonio Zampolli, University of Pisa Humanists have carried out careful analyses of selected bodies of literary texts, although usually not with sophisticated linguistic tools. Computational linguists have developed new techniques for examining linguistic structure, but only recently have begun to study naturally occurring texts and to explore the characteristics of particular collections. A Text Encoding Initiative has just been established to formulate and disseminate international guidelines for the encoding and interchange of machine-readable texts intended for literary, linguistic, historical, or other textual research. A Data Collection Initiative has also been started to collect, annotate, and tag a large body of English texts. Other initiatives in the United States, Europe, and Japan are pursuing similar directions. The session will consider these developments and explore the mutual relevance of corpus-based language analysis and language-based corpus analysis in this larger context. Organized with the cooperation of the Association for Computers and the Humanities and the Association for Literary and Linguistic Computing . REGISTRATION INFORMATION AND DIRECTIONS PREREGISTRATION MUST BE RECEIVED BY 12 JUNE; after that date, please wait to register at the Conference itself. Complete the attached ``Application for Preregistration'' and send it with a check payable to Association for Computational Linguistics or ACL to Donald E. Walker (ACL); Bellcore, MRE 2A379; 445 South Street, Box 1910; Morristown, NJ 07960-1910, USA; (201) 829-4312; [email protected]. If a registration is cancelled before 12 June, the registration fee, less $25US for administrative costs, will be returned. Registration includes one copy of the Proceedings, available at the Conference. Additional copies of the Proceedings at $25US for members ($50US for nonmembers) may be ordered on the registration form or by mail prepaid from Walker. For people who are unable to attend the conference but want the proceedings, there is a special entry line at the bottom of the registration form. TUTORIALS: Attendance is limited. Preregistration is encouraged to insure a place and guarantee that syllabus materials will be available. * * * * * The printed version of this program and registration information will be mailed to ACL members by the end of the week. Others are encouraged to use the [editied out] form or write for a program flyer to the following address: Dr. D.E. Walker (ACL) Bellcore - MRE 2A379 445 South Street - Box 1910 Morristown, NJ 07960-1910, USA or send net mail to [email protected] or uunet.uu.net!bellcore!walker, specifying "ACL Annual Meeting Information" on the subject line. ------------------------------ Date: Tue, 4 Apr 89 13:29:58 PDT From: [email protected] (Mark Gluck) Subject: Neural Networks for Defense Conference A One-day Conference: --------------------------- NEURAL NETWORKS for DEFENSE --------------------------- Saturday, June 17, 1989 (the day before IJCNN) Washington, DC Conference Chair: Prof. Bernard Widrow (Stanford Univ.) ------------------------------------------------------- A one-day conference on defense needs, applications, and opportunities for computing with neural networks, featuring key representatives from government and industry. It will take place in Washington, DC, right before the IEEE and INNS's International Joint Conference on Neural Networks (IJCNN). The morning session will include program managers from lead- ing Department of Defense (DoD) agencies funding Neural Network research and development, including Barpara Yoon (Defense Advanced Research Projects Agency, DARPA), Joel Davis & Thomas McKenna (Office of Naval Research, ONR), William Berry & C. Lee Giles (Air Force Office of Scientific Research, AFOSR), plus oth- ers to be announced later. They will provide information on: 1) proposals they have already funded, 2) the types of proposals they intend to fund in the future, 3) how their programs differ from other DoD programs, 4) details on how to best approach them for neural network R&D funding. The afternoon session will feature presentations of the current status of defense-oriented research, development, and applications of neural network technology from both industry and academia. The speakers include representatives from neural- network R&D programs at General Dynamics, Ford Aerospace, Mar- tingale Research, Booz-Allen, Northrup, SAIC, Hughes Aircraft, Hecht-Nielson Neurocomputer Corp., Rockwell International, Nestor Inc., Martin Marietta, plus others to be announced later. They will discuss their current, past, and future involvement in neural networks and defense technology, as well as the kinds of cooperative ventures in which they might be interested. An evening dinner banquet will feature Prof. Bernard Widrow as the after-dinner speaker. Prof. Widrow directed the recent DARPA study evaluating the military and commercial potential of neural networks. He is a professor of EE at Stanford University, the current president of the INNS, co-inventor of the LMS algorithm (Widrow & Hoff, 1960), and the president of Memistor Corp, the oldest neural network applications and development company, which Prof. Widrow founded in 1962. Ample time will be alloted during breaks, lunch, and a dinner banquet, for informal discussions with the speakers and other attendees. Program Committee: Mark Gluck (Stanford) & Edward Rosenfeld ------------------------------------------------------------ For more information, call Anastasia Mills at (415) 995-2471 ------------------------------------------------------------ or FAX: (415) 543-0256, or write to: Neural Network Seminars, Miller-Freeman, 500 Howard St., San Francisco, CA 94105 _______: Attendance to "Neural Networks for Defense" :_____ : is limited to U.S. citizens only : ------------------------------ Date: Thu, 13 Apr 89 16:26:51 EDT From: [email protected] (Michael Cohen) Subject: Neural Network Models of Conditioning and Action NEURAL NETWORK MODELS OF CONDITIONING AND ACTION 12th Symposium on Models of Behavior Friday and Saturday, June 2 and 3, 1989 105 William James Hall, Harvard University 33 Kirkland Street, Cambridge, Massachusetts PROGRAM COMMITTEE: Michael Commons, Harvard Medical School Stephen Grossberg, Boston University John E.R. Staddon, Duke University JUNE 2, 8:30AM--11:45AM ----------------------- Daniel L. Alkon, ``Pattern Recognition and Storage by an Artificial Network Derived from Biological Systems'' John H. Byrne, ``Analysis and Simulation of Cellular and Network Properties Contributing to Learning and Memory in Aplysia'' William B. Levy, ``Synaptic Modification Rules in Hippocampal Learning'' JUNE 2, 1:00PM--5:15PM ---------------------- Gail A. Carpenter, ``Recognition Learning by a Hierarchical ART Network Modulated by Reinforcement Feedback'' Stephen Grossberg, ``Neural Dynamics of Reinforcement Learning, Selective Attention, and Adaptive Timing'' Daniel S. Levine, ``Simulations of Conditioned Perseveration and Novelty Preference from Frontal Lobe Damage'' Nestor A. Schmajuk, ``Neural Dynamics of Hippocampal Modulation of Classical Conditioning'' JUNE 3, 8:30AM--11:45AM ----------------------- John W. Moore, ``Implementing Connectionist Algorithms for Classical Conditioning in the Brain'' Russell M. Church, ``A Connectionist Model of Scalar Timing Theory'' William S. Maki, ``Connectionist Approach to Conditional Discrimination: Learning, Short-Term Memory, and Attention'' JUNE 3, 1:00PM--5:15PM ---------------------- Michael L. Commons, ``Models of Acquisition and Preference'' John E.R. Staddon, ``Simple Parallel Model for Operant Learning with Application to a Class of Inference Problems'' Alliston K. Reid, ``Computational Models of Instrumental and Scheduled Performance'' Stephen Jose Hanson, ``Behavioral Diversity, Hypothesis Testing, and the Stochastic Delta Rule'' Richard S. Sutton, ``Time Derivative Models of Pavlovian Reinforcement'' FOR REGISTRATION INFORMATION SEE ATTACHED [edited out - nick] OR WRITE: Dr. Michael L. Commons Society for Quantitative Analysis of Behavior 234 Huron Avenue Cambridge, MA 02138 ------------------------------ Date: 14 Apr 89 19:26:13 GMT From: pluto%[email protected] (Mark E. P. Plutowski) Reply-to: neilson%[email protected] Subject: IJCNN'89 Volunteers Wanted: volunteers for the International Joint Conference on Neural Networks held in Washington D.C. June 18-22, 1989. Free registration and proceedings in lieu of your time. Need to work about 4 hours each day of the conference. For more information contact Karen Haines at: email: [email protected] phone: (619) 942.2843 (leave message) -=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--= (this is a forwarded message. DO NOT REPLY TO NETWORK) -=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--=--= =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Mark Plutowski, UCSD, C-014 INTERNET: pluto%[email protected] La Jolla, California 92093 =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- ------------------------------ Date: 9 Apr 89 22:28:12 GMT From: [email protected] (Worthy N. Martin) Subject: IEEE Conf. on Computer Vision and Pattern Recognition (CVPR89) IEEE Computer Society Conference on COMPUTER VISION AND PATTERN RECOGNITION Sheraton Grand Hotel San Diego, California June 4-8, 1989 General Chair Professor Rama Chellappa Department of EE-Systems University of Southern California Los Angeles, California 90089-0272 Program Co-Chairs Professor Worthy Martin Professor John Kender Dept. of Computer Science Dept. of Computer Science Thornton Hall Columbia University University of Virginia New York, New York 10027 Charlottesville, Virginia 22901 Program Committee Chris Brown Avi Kak Theo Pavlidis Allen Hansen Rangaswamy Kashyap Alex Pentland Robert Haralick Joseph Kearney Azriel Rosenfeld Ellen Hildreth Daryl Lawton Roger Tsai Anil Jain Martin Levine John Tsotsos Ramesh Jain David Lowe John Webb John Jarvis Gerard Medioni General Conference Sessions will be held June 6-8, 1989 Conference session topics include: -- Edge Detection -- Shape from _____ (Shading, Contour, ...) -- Feature Extraction -- Motion -- Morphology -- Neural Networks -- Range Data: Generation and Processing -- Image and Texture Segmentation -- Monocular, Polarization Cues -- Stereo -- Object Recognition -- Visual Navigation -- Preprocessing -- Applications of Computer Vision -- Vision Systems and Architectures Invited Speakers: June 6 June 7 June 8 Prof. J. Feldman Prof. V.S. Ramachandran Prof. M.A. Arbib ICSI, Berkeley Univ. Calif., San Diego Univ. of Southern Calif. Time, Space and Form Visual Perception in Schemas, Computer Vision in Computer Vision Humans and Machines and Neural Networks Tutorials June 4, am June 5, am June 5, pm 1. Morphology and 3. Robust Methods for 5. Analog Networks for Computer Vision Computer Vision Computer Vision: R.M. Haralick W. Forstner Theory and Applications 2. Intermediate and 4. Parallel Algorithms C. Koch Low Level Vision and Architectures for 6. Model Based Vision M.S. Trivedi Computer Vision W.E.L. Grimson V.K.P. Kumar The IEEE Computer Society will also hold a workshop entitled: Artificial Intelligence in Computer Vision June 5, 1989 General Chair: Professor Rama Chellappa Program Co-Chairs: Professor J.K. Aggarwal and Professor A. Rosenfeld Conference Registration (for CVPR and Tutorials) Conference Department CVPR IEEE Computer Society 1730 Massachusetts Ave Washington, D.C. 20036-1903 (202)371-1013 Fees, before May 8 CVPR - $200 (IEEE Members, includes proceedings and banquet) - $100 (Students, includes proceedings and banquet) Tutorials - $100 per session (IEEE Members and Students) The Advance Program with registration forms, etc. will be mailed out of the IEEE offices shortly. ------------------------------ Date: 13 Apr 89 09:17:56 GMT From: [email protected] Subject: 5th Alvey Vision Conference - Reading (AVC89) ============================================================================== THE FIFTH ALVEY VISION CONFERENCE University of Reading, 25th-28th, September 1989 ================================ ANNOUNCEMENT AND CALL FOR PAPERS ================================ As on previous occasions, the primary purpose of the conference is to serve as a forum for the presentation of the most recent results of investigations funded by the Alvey Directorate (now administered by the Information Engineering Directorate of the DTI), but original papers reporting other work are also welcome. The programme will also include key-note presentations by invited speakers. Contributions are sought on any novel aspect of computational vision; presentations will normally be of 15 or 20 minutes duration. A printed copy of the Proceedings will be available to delegates at the conference, and a selection of the best papers will be published separately in a special issue of Image and Vision Computing Journal. Topics of particular interest include: Image Processing and Feature Analysis Practical Applications of Machine Vision Object Recognition and Identification Scene Analysis and Image Interpretation Reconstruction of 3-d Shape Computational issues in Visual Perception Sensors and Robotic Vision Architectures for Vision Systems Separate cash prizes will be given for the two papers which are judged by the programme committee: (i) to make the best scientific contribution (sponsored by the AVC committee), or (ii) to have the greatest industrial potential (sponsored by Computer Recognition Systems Ltd.) -------------------------------------------------- TIMETABLE OF DEADLINES 8 May 1989: Nine copies of draft, short-form paper, consisting of 1500-2000 words to be submitted to the Programme Chairman. 1 June 1989: Early registration to the Conference Chairman for preferential rate. 9 June 1989: Notification of acceptance of papers, draft programme and instructions for camera-ready copy to authors. 17 July 1989: Camera-ready final paper (plus four additional photocopies) to be received by the Programme Chairman. Final copy not to exceed 6 pages of A4, double column in 10 point type. 25 Sept 1989: Conference registration. -------------------------------------------------------------- Conference Chairman: Prof K D Baker. Programme Chairman: Mr G D Sullivan. Department of Computer Science, University of Reading, PO Box 220, Whiteknights, Reading, RG2 6AX Tel: (0734) 318603 E-mail: [email protected] ============================================================================ ------------------------------ Date: 30 Mar 1989 10:31-EST From: [email protected] Subject: Workshop on AI for the Hearing Impaired CALL FOR PARTICIPATION Workshop on Artificial Intelligence Aids for the Hearing Impaired August 23, 1989 at the Eleventh International Conference on Artificial Intelligence Detroit, Michigan, USA This workshop will concentrate on the use of perception techniques such as the many forms of speech recognition as they are applicable to the handicapped person who suffers from partial or total auditory impairment. Since the hearing impaired has other perceptual means the problem is quite different from the computer speech recognition problem because disambiguation and visual perception are possible. The focus will concentrate on techniques that are peculiar to the hearing impaired who already understands the semantics of "speech acts" in discourse models. For example, pattern recognition techniques are being applied to cued speech and lip-reading techniques to improve understanding by transformation of the phonetically equivalent visual information to textual form for those who are not capable of reading cues or lips. Also, a number of teaching programs for instruction of the hearing impaired have used AI assisted methodology. A full day, on the Wednesday of the week during the IJCAI '89, has been allocated for the workshop. Attendance will be limited to less than 35 persons, all active participants in this field, and ample time will be allotted for general discussion. There will be at least one summary panel discussion at the end of the 9 am to 5 pm workshop. Presentations will be usually limited to 30 minutes including a discussion period; participants are encouraged to bring copies of any publications for distribution but no formal proceedings will be published at this time. Proposals for Presentation Submit an outline of the topic that you would like to present in one or two typewritten pages, or via electronic mail to the address given below by April 30, 1989. You may include appropriate and relevant bibliographic references if you wish. Keep in mind presentations will be limited to 30 minutes or less. Send this material to: Prof. Oscar N. Garcia The George Washington University Department of Electrical Engineering and Computer Science Washington, DC 20052 Arpanet: garcia at a.isi.edu Proposers will be notified early in May by the Organizing Committee: Oscar Garcia, Chairman, GWU; R. Orin Cornett, Gallaudet College; Paul Hazan, John Hopkins APL; Murray Loew, George Washington Univ.; Alex Pentland, MIT's Media Lab; Eric Petajan, Bell Labs. ------------------------------ Date: 31 March 1989, 09:36:41 EDT From: PP211011 at TECMTYVM Subject: 2nd Intl. Symposium on AI - Monterey SECOND INTERNATIONAL SYMPOSIUM ON ARTIFICIAL INTELLIGENCE October 23-27, 1989 ITESM The Second International Symposium on Artificial Intelligence will be held in Monterrey, N.L. Mexico on October 23-27, 1989. The Symposium is sponsored by the ITESM (Instituto Tecnologico y de Estudios Superiores de Monterrey) in cooperation with the AAAI,IEEE, IBM, Apple and the SMIA (Mexican Society of Artificial Intelligence). Papers presenting original research on fundamental advances in knowledge Based Systems and Applications are sougth. Suggested topics for papers include: 1) Knowledge Adquisition 2) Evaluating Knowledge Engineering Tools 3) Machine Learning 4) Knowledge Representation 5) Verification and Validation of Expert Systems 6) Constraint Directed Reasoning 7) Uncertainty Management 8) Neural Networks 9) Natural Language 10) Truth Maintenance Systems 11) Managing Expert Systems Projects 12) Future trends and impact of KBS technology 13) Impact of KBS in organizations 14) Applications in Manufacturing, Finance, Bussiness and Medicine. Persons wishing to submit a paper should send five copies of the paper and extended abstract written in English to: David Garza Program Chairman Centro de Investigacion en Informatica, ITESM Suc.de Correos "J",C.P.64849 Monterrey, N.L. MEXICO Tel.(52-83) 58-2000 ext.5133, Telefax (52-83) 58-8931, Net address [email protected] IMPORTANT DATES: Papers must be received by May 30,1989. Authors will be notified of acceptance or rejection by July 3,1989. A final copy of each accepted paper, camera ready for inclusion in the Symposium proceedings, will be due by August 7, 1989. REQUIREMENTS: The entire extended abstract should be at least 5 double-spaced pages and not exceed 4000 words or 10 double-spaced pages. Authors or accepted papers will be expected to present their work at the Symposium. The selection or papers will be determined by the Program Committee. GENERAL CHAIRMAN: Francisco J. Cantu ITESM COUNCILORS: Woodrow Bledsoe UT AUSTIN Gordon Novak UT AUSTIN PROGRAM CHAIRS: Rocio Guillen ITESM (Chairwoman) David Garza ITESM (Chairman) PROGRAM COMMITTEE: Robert Cartwright RICE UNIVERSITY Francisco Cervantes UNAM Eduardo Diaz ITESM Gerhard Fischer UNIVERSITY OF COLORADO Patricia Friel TEXAS A&M UNIVERSITY Randy Goebel UNIVERSITY OF ALBERTA Adolfo Guzman INTERNATIONAL SW SYSTEMS Jose Ignacio Icaza ITESM Christian Lemaitre UNAM Richard Mayer TEXAS A&M UNIVERSITY Daniel Meade ITESM Mariaurora Mota ITESM Robert Port INDIANA UNIVERSITY Elaine Rich MCC Antonio Sanchez UNIV.DE LAS AMERICAS Carlos Scheel ITESM Masaru Tomita CARNEGIE MELLON UNIV. PUBLICITY CHAIRWOMAN: Moraima Campbell ITESM TUTORIAL CHAIRWOMAN: Marcela Garza ITESM LOCAL ARRANGEMENT CHAIRWOMAN: Leticia Rodriguez ITESM EXHIBITS CHAIRMAN: Gustavo Trevino ITESM ------------------------------ Date: 31 Mar 89 7:10:38-PST (Fri) From: [email protected] Reply-to: [email protected] Subject: 4th Intl. Supercomputing Symposium - Santa Clara ---------------------------------------------------------------- Date: 30 Mar 89 16:41:00 EST From: "NRL::PICKETT" <pickett%[email protected]> FOURTH INTERNATIONAL CONFERENCE ON SUPERCOMPUTING AND THIRD WORLD SUPERCOMPUTER EXHIBITION SANTA CLARA, CA, APRIL 30-MAY 5, 1989 The 1989 Supercomputer Conference in Santa Clara will have 13 tutorials (April 30 and May 1) and 90 technical sessions (May 2-5). DURING THE FOUR DAYS OF TECHNICAL SESSIONS, SUPERCOMPUTER USERS AND HARDWARE & SOFTWARE DESIGNERS WILL DISCUSS INTEGRATED PROBLEMS ASSOCIATED WITH SUPERCOM- PUTER APPLICATIONS, ALGORITHMS, SOFTWARE & HARDWARE ARCHITECTURES, DESIGN, AND HARDWARE TECHNOLOGIES. The conference will include 12 symposiums: Symposium I: INDUSTRIAL SUPERCOMPUTERS Symposium II: TECHNOLOGY ASSESSMENT & COMPUTATIONS Symposium III: NUMERICAL SIMULATIONS Symposium IV: SCIENTIFIC & ENGINEERING APPLICATIONS Symposium V: AERODYNAMIC APPLICATIONS Symposium VI: EARTH AND SPACE SCIENCES Symposium VII: ENERGY RESEARCH APPLICATIONS Symposium VIII: MEDICAL & BIOLOGICAL ENGINEERING & SCIENCES Symposium IX: COMPUTATIONAL MECHANICS Symposium X: Mathematical applications Symposium XI: SUPERCOMPUTING STRUCTURES Symposium XII: SUPERCOMPUTING IN ARTIFICIAL INTELLIGENCE Below are headlines for Symposiums I, III, IV, VII: (anticipated to be of interest to the current readership) Symposium I: INDUSTRIAL SUPERCOMPUTERS HEADLINES: cray supercomputer family from CRAY Research, Inc. RP-3 PROJECT OF IBM Corporation TITAN SUPERCOMPUTER FOR GRAPHIC APPLICATIONS from Ardent Corporation LONG INSTRUCTION WORD SUPERCOMPUTERS from Multiflow, Inc. X-RAY LITHOGRAPHICS AND SILICON TECHNOLOGIES from IBM Advanced Silicon Technology Lab; GigaBit Logic, Inc.; ETA Systems Inc.; Brooktree Corporation; and Advanced Micro Devices SUPERCOMPUTER ENVIRONMENT FOR SCIENTIFIC & ENGINEERING APPLICATIONS from NCSA; Yale University; NASA Lewis Research Center; John von Neumann National Supercomputer Center; Florida State University; Control Data Corporation; and Compass, Inc. UNIX SOFTWARE, OPEN SYSTEMS AND STANDARDIZATION from AT&T Bell Labs and X/Open Company Ltd. SUPERCOMPUTER PERFORMANCE & BENCHMARKING from the Unisys Corporation; Central Computer & Telecommunications Agency of United Kingdom; Fachhochschule Regensburg, FRG; Phoenix Numeric, Inc.; and ETA Systems, Inc. INDUSTRIAL HIGH PERFORMANCE DATABASES from Scientific & Engineering Software, Inc.; and Control Data Corporation, etc. INDUSTRIAL SUPERCOMPUTER NETWORKS from Ultra Network Technologies; Network Systems Corporation; Proteon Corporation; CRAY Research, Inc.; and the National Center for Supercomputer Applications. STANDARDIZATION OF NUMERICAL ALGORITHMS from Drexel University; Numer- ical Algorithms Group Ltd.; IMSL, Inc.; and NASA Goddard Space Flight Center. Symposium III: Numerical Simulations This Symposium features research accomplishments of NASA Research Centers (Ames, Lewis, and Langley), NASA Headquarters, and contributions by scientists from the University of Chicago, Stanford University, Sterling Federal Systems, and University of California at Berkeley. HEADLINES: GALACTIC FORMATION & EVOLUTION TURBULENCE PHYSICS DETERMINATION OF CHEMICAL AND PHYSICAL PROPERTIES OF MOLECULES SIMULATION OF SPACE SHUTTLE VEHICLE IN ASCENT HYPERSONIC FLOWFIELD SIMULATIONS TURBOMACHINERY FLOWS SIMULATION OF FLOW THROUGH ARTIFICIAL HEART, and HYDRODYNAMICAL AND ELECTRICAL THEORIES OF ION MOTIONS SUPERCOMPUTER VISION Symposium IV: SCIENTIFIC & ENGINEERING APPLICATIONS HEADLINES: ALGORITHMS FOR PARALLEL SUPERCOMPUTERS from Argonne National Lab; California Institute of Technology; IBM Scientific/Engineering Computations Department; Louisiana State University; Center for Supercomputing Research and Development, University of Illinois at Urbana; and IBM T.J. Watson Research Center PARALLELIZING FORTRAN COMPILERS from IBM Kingston Lab; Kuck and Ass- ociates; IBM T.J. Watson Research Center; and IBM Data System Division SUPERCOMPUTING IN SOLID STATE PHYSICS from the Naval Research Lab; Ohio State University; Sandia National Lab; University of Warwick, UK; University of Cincinnati; Oak Ridge National Lab; and the University of Bristol, UK SUPERCOMPUTING IN BIOCHEMISTRY from IBM Kingston Lab; Stanford Magnetic Resonance Lab, Stanford University; IBM Data Systems Division; University of Pennsylvania; Cornell University; Mount Sinai School of Medicine of the City University of New York; Carnegie-Mellon University; Princeton University; NASA Ames Research Center; Okkaido University, JAPAN; E.I. DuPont de Nemours & Company; IBM Almaden Research Lab; Louisiana State University; ETH-Zrich, SWITZERLAND; and the Minnesota Supercomputer Institute VISUALIZATION IN SCIENTIFIC COMPUTING from IBM Kingston Lab; IBM UK Scientific Center in Hampshire, UK; Silicon Graphics, Inc.; Facultes Univer- sitaires Notre Dame de la Paix, FRANCE; and CINECA, ITALY SUPERCOMPUTING IN MICRODYNAMICS from IBM Kingston Lab; City College of the City University of New York; Pennsylvania State University; Schlumberger-- Doll Research, FRG; University of Pittsburgh; Free University of Brussels, BELGIUM; UCLA; Service Chemie Physique II, Free University of Brussels, BELGIUM; and Texas Tech University SUPERCOMPUTING & COMPRESSIBLE FLOW from IBM Kingston Lab; Rockwell International; University of Waterloo, Canada; Nuclear Research Center at Neger, ISRAEL; and United Technology Research Center MAPPING PROBLEMS OF ENGINEERING ONTO SUPERCOMPUTERS from IBM Kingston Lab; ONERA, FRANCE; Ecole Polytechnique Federale de Lausanne, SWITZERLAND; Politechnico di Torin, ITALY; Centro Ricerche, FIAT, ITALY; and Polytechnic of Central London, UK INTERDISCIPLINARY AERODYNAMICS: fluid dynamics, aeroacoustics, and electromagnetics, from Boeing Computer Services, Boeing Company; and Rockwell International Science Center NON-AIRPLANE APPLICATIONS OF TURBULENT FLOWFIELDS from AeroVironment, Inc; University of Tokyo, JAPAN; Technical Institute of Shimizu Construction, JAPAN; San Diego University; and AeroHydro, Inc. AIRFRAME AERODYNAMICS from Aerodynamic Research; Boeing Commercial Airplanes; and McDonnell Douglas Corporation HYPERSONIC AERODYNAMICS USING FLOW VISUALIZATION for a complex three-- dimensional vehicle and three-dimensional, chemically reacting flows from NASA Langley Research Center; and Analytical Services and Materials PROPULSION SYSTEM AERODYNAMICS from NASA Lewis Research Center and General Electric Aircraft Engines Symposium VII: ENERGY RESEARCH APPLICATIONS HEADLINES: LATTICE SPIN MODEL CALCULATIONS from the California Institute of Technology; Brown University; and Nordita University, DENMARK GENERAL COMPUTATIONAL PLASMA PHYSICS from the Jet Propulsion Lab; Los Alamos National Lab; and the University of California at Los Angeles HIGH-TEMPERATURE CONDUCTIVITY from the University of Toronto, CANADA; University of California at Santa Barbara; and Queen's University, CANADA SUPERCOMPUTERS IN THE DNA SEQUENCE ANALYSIS from the Jet Propulsion Lab and the University of Southern California For information also see the 50 page Advance Program detailing conference fees, reservations, hotels, etc. Please contact Prof. Lana P. Kartashev, International Supercomputing Institute, Inc., 3000 - 34th Street South, Suite B-309, St. Petersburg, Florida 33711, tel. (813) 866-2694 ------------------------------ Date: 2 Apr 89 20:39:55 GMT From: [email protected] (Cliff Joslyn) Subject: American Society for Cybernetics Meeting CALL FOR PAPERS the 1989 Meeting of the American Society for Cybernetics, in Virginia Beach, Virginia on 9-12 November. Pre-Conference Tutorial: 8 November. Extensively, cybernetics can be defined by the connections it evokes. Modern cybernetics was born forty years ago in a series of intense, interdisciplinary conferences on "circular causal and feedback mechanisms" which drew on anthropology, electrical engineering, psychology, biology, and philosophy, among many other fields. From the conversations and controversies that ensued arose the ideas of organizational closure, self-reference, attractrs, and other recognitions of essential circularities in complex systems. Their influence has been felt in areas as diverse as immunology and political science, family therapy and information systems, education and ethics. Intensively, cybernetics could be defined as the search for "those notions which perade all purpive bhavior and all understanding of our world" , as Warren McCulloch wrote of those early discussions, and the concern with the tenability and consequences of ou conceptions of kowing, causality, and the laws of nature. The challenge and excitement of cybernetics lies in the difference between these two definitions, and the bond. It is to go beyond philosophizing and tool-building alike, to embrace distinction, not be engulfed by it, and to let creativity and rigor inform not exclude one another. These are the concerns of the conference: 1. What questions does a cybernetician ask, and how are these understood by workers in other fields? 2. What are the lessons of more recent connections for understanding understanding? 3. What social and scientific processes underlie change (or progress?) in cybernetics as a field? They will be articulated in a series of plenary sessions on: Self-organization, computer technology, & management, The phenomena of language in the machine, animal, & organization, Modeling as definition, reflection, & intervention, The social construction of knowledge, and Learning & helping. PROCESS. To explore connecting in conversation, the conference will include special issue seminars that will consider a particular topic in greater depth and will include a packet of readings to be mailed to participants before the conference; an ongoing participatory laboratory, stocked with mechanical and electronic tools for modeling, experimentation, and expression; "Questions of Cybernetics", a special full day pre-conference tutorial, linked from the conference to sites around the country by interactive television; and a cybernetics fair and other unscheduled time in which to pursue the conversations and respond to the cncrns hat arise during the conference. PROGRAM. To encourage and faciliate preparation on the part of presenters and other participants, we will publish a Conference Program, including abstracts for each presentation and workshop, and theme statements for each plenary session. The Program will be mailed to conference registrants in early fall. STUDENTS AND NEW PARTICIPANTS: To broaden participation, we plan to provide a limited number of travel scholarships and awards. Please contact the organizers at the address below for more information. DEADLINE. We invite your participation. Proposals must be received by May 1, 1989. They should include: 1. a title and abstract (150-300 words); 2. for seminar proposals only, a short reading list (30-50 pages of reading); 3. format (e.g. paper presentation, seminar, performance, workshop, exhibit, or demonstration) and corresponding technical and audio-visual requirements. Since items 1 and 2 will be published in the Conference Program, they must be submitted in one of the following formats: camera ready copy OR 5 1/4" or 3 1/2 " MS-DOS 3.3 compatible floppy disk: ASCII, Microsoft Word(, Wordperfect(, or Wordstar( OR 3 1/2" Macintosh( compatible floppy disk: Text, Microsoft Word(, or MacWrite( . Please mail proposals to: Christoph Berendes Center for Cybernetic Studies in Complex Systems Old Dominion University Norfolk, VA 23529-0248 (804) 683-4558 Internet: [email protected] Usenet: {hplabs,sun}!well!chrisber -- O----------------------------------------------------------------------> \| Cliff Joslyn, Cybernetician at Large \| Systems Science, SUNY Binghamton, [email protected] V All the world is biscuit shaped. . . ------------------------------ Date: Mon, 3 Apr 89 17:11 PDT From: [email protected] Subject: Model Based Diagnosis Workshop - Paris ******************************************* MODEL BASED DIAGNOSIS INTERNATIONAL WORKSHOP Paris July 25-26-27, 1989 First announcement and call for papers Model based reasoning is a recent and growing research field in Artificial Intelligence. It has led to a powerful framework for diagnosis which exploits deep knowledge about the behavior of an artifact and also provides a conceptual background for analyzing human diagnostic problem solving. The workshop will focus on basic issues and challenges for model based diagnosis. Topics include: . Theoretical aspects . Applications . New diagnostic strategies . Modeling . Scaling . Integrating heuristic knowledge. The primary aim of the workshop is to encourage interaction and co-operation among researchers in the field. Therefore, it will be limited to 30 participants, and substantial time for discussions will be allocated. We are planning there to be at most five papers presented per day. The workshop will be located at the I.B.M. Paris scientific center. Everyone who is interested in attending should submit 4 copies of extended abstracts or papers before the 14th of April to the program chairman: Olivier Raiman IBM Paris Scientific Center 3, 5 Place Vendome, Paris 75001 France e-mail: [email protected]. Please indicate with the submission . whether you are interested in presenting a paper or only wish to attend the workshop, . in the case of multiple authors, which authors are interested in attending, . your electronic mail address. Based on these submissions the program committee will invite approximately 30 participants to the workshop (and 15 of them for presentation). The submissions will be compiled and distributed to the participants at the workshop. To facilitate the selection process, the program committee will only consider the first 5000 words of any submission. The program committee's decisions will be sent by May 15th. Program Committee: Jean Marc David, Renault Randall Davis, M.I.T. Johan de Kleer, Xerox Parc Roy Leitch, H-W. Univ. Edinburgh Olivier Raiman, I.B.M. Peter Struss, Siemens Brian C. Williams, Xerox Parc ------------------------------ Date: Mon, 10 Apr 89 11:01:57 AST From: carole hafner <[email protected]> Subject: AI and Law Conference - Vancouver (ICAIL-89) PROGRAM ANNOUNCEMENT ICAIL-89 - The Second International Conference on Artificial Intelligence and Law June 13-16, 1989 University of British Columbia Vancouver, BC CANADA Sponsored by: Faculty of Law, University of British Columbia In Coooperation with ACM SIGART Additional Support from: IBM Canada Ltd. The Center for Law and Computer Science, Northeastern University To receive registration material contact: Ms. Rita Laffey School of Law, Northeastern University (617)437-3346 For information about exhibits or local arrangements contact: Ms. Rosemarie Page Faculty of Law, University of British Columbia (604)228-2944 SCHEDULE OF EVENTS Tuesday, June 13 5:00 p.m. - 9:00 p.m. - Registration and Reception, Gage Center (Registration will continue through the conference) Wednesday, June 14 8:30 a.m. - 12:30 p.m. - Tutorials and Workshop 2:00 p.m. - 6:00 p.m. - Welcome, Paper Presentations, and Invited Talk 7:00 p.m. - Gala Banquet Banquet Speaker: The Honorable Chief Justice Beverly M. McLachlin Supreme Court of British Columbia Thursday-Friday, June 15-16 8:30 a.m. - 6:00 p.m. - Paper Presentations, Invited Talk, and Panel Thursday evening, June 15 - Salmon Barbecue, Museum of Anthropology INVITED TALKS "The Marriage of AI and Law - A New Analytical Jurisprudence" Donald H. Berman, Richardson Professor of Law, Northeastern University "`That reminds me of a story' - How Memory Organization Supports Retrieval of Relevant Cases" Roger C. Schank, Professor of Computer Science, Yale University PANEL DISCUSSION "Research Funding for AI and Law: Opportunities and Pitfalls." Moderated by J.C. Smith, Professor of Law and Directory of the Legal Expert Systems Project, Faculty of Law, University of British Columbia TUTORIALS Tutorial A. "Artificial Intelligence and Law: Opportunities and Challenges" Donald H. Berman, Richardson Professor of Law, Northeastern University Carole D. Hafner, Associate Professor of Computer Science, Northeastern Univ. Tutorial B. "Case-Based Reasoning" Kevin D. Ashley, Ph.D., J.D. WORKSHOP "Deontic Logic." Presented by Andrew J. I. Jones, Professor of Philosophy, University of Oslo, Norway RESEARCH PRESENTATIONS Toward a Computational Theory of Arguing with Precedents Dr. Kevin D. Ashley IBM Watson Research Laboratories Cutting Legal Loops Professor Donald H. Berman Northeastern University School of Law Representing and Reusing Explanations of Legal Precedents Mr. L. Karl Branting Department of Computer Sciences University of Texas Boyd V. Deaver - Litigation Strategies Mr. Dan Burnstein Harvard Law School Deep Models, Normative Reasoning and Legal Expert Systems Dr. T.J.M. Bench-Capon Department of Computer Science University of Liverpool, England Xcite (an expert system for naturalization cases) Dr. Andreas Galtung Norwegian Research Center For Computers and Law Representing Developing Legal Doctrine A Problem for AI Programs Dr. Anne v.d.L. Gardner Atherton, CA A System for Planning Arguments and Searching Interpretation Spaces Dr. Thomas F. Gordon German National Research Center for Computer Science Sankt Augustin, Federal Republic of Germany A Specialized Expert System for Judicial Decision Support Dr. L.V. Kale Department of Computer Science University of Illinois The Treatment of Negation in Logic Programs for Representing Legislation Dr. Robert Kowalski Department of Computing Imperial College, London, ENGLAND LESTER: Using Paradigm Cases in a Quasi-Precedential Legal Domain Dr. Kenneth A. Lambert Department of Computer Science Washington and Lee University, Lexington, VA The Design of an Attorney's Statistical Consultant Dr. Leonard S. Lutomski The American Institutes for Research Expert Systems in Case-Based Law: The Hearsay Rule Advisor Dr. Marilyn T. MacCrimmon The University of British Columbia Vancouver, CANADA Representing the Structure of a Legal Argument Ms. Catherine C. Marshall Xerox Palo Alto Research Center Palo Alto, CA LRS Legal Reasoning System Professor Antonio A. Martino Istituto per la Documentazione Giuridica Del Consiglio Nazionale Delle Richerche, ITALY A Language for Legal Discourse Dr. L. Thorne McCarty Rutgers University New Brunswick, NJ An Attempted Dimensional Analysis of the Law Governing Government Appeals in Criminal Cases Mr. Simon Mendelson Cambridge, MA 02140 Market Realities of Rule-Based Software for Lawyers Where the Rubber Meets the Road Mr. Rees Morrison, Esq. Price Waterhouse New York, NY Building GRANDJUR Using Evidence and Other Knowledge to Prepare Casefiles Dr. Roger D. Purdy School of Law The University of Akron, OHIO Dimension-Based Analysis of Hypotheticals from Supreme Court Oral Argument Dr. Edwina L. Rissland Dept. of Computer Science University of Massachusetts, Amherst Interpreting Statutory Predicates Dr. Edwina L. Rissland Mr. David B. Skalak Dept. of Computer Science University of Massachusetts, Amherst Legal Information Retrieval A Hybrid Approach Dr. Daniel E. Rose Institute for Cognitive Science University of California, San Diego A Framework for Legal Knowledge Base Construction Dr. Tom Routen Department of Computer Science Leicester Polytechnic, ENGLAND EPS II Estate Planning With Prototypes (with L. T. McCarty) Mr. Dean A. Schlobohm Stanford Law School, Stanford CA Expert Systems and ICAI in Tax Law: Killing Two Birds with one AI Stone Dr. David Sherman The Law Society of Upper Canada Toronto, CANADA ASSYST - Computer Support for Guideline Sentencing Dr. Eric Simon U.S. Sentencing Commission, Washington, D.C. Taking Advantage of Models for Legal Classification Mr. David Skalak Dept. of Computer Science University of Massachusetts, Amherst The Latent Damage System A Jurisprudential Analysis Dr. Richard Susskind Ernst and Whinney London ENGLAND PROLEXS, A Model to Implement Legal Knowledge Mr. P.H. van den Berg Computer/Law Institute Juridische Faculteit Vrije Universiteit Amsterdam, THE NETHERLANDS Legal Reasoning - A Jurisprudential Description Dr. Peter Wahlgren The Swedish Law and Informatics Research Inst. University of Stockholm, SWEDEN CACE: Computer-Assisted Case Evaluation in the Brooklyn District Attorney's Office Mr. Steven S. Weiner Yayes, Mechling, Kleiman, Inc. Cambridge, MA 02138 Amalgamating Regulation- and Case-based Advice Systems Through Suggested Answers Dr. David E. Wolstenholme Department of Computing Imperial College, London, ENGLAND CONFERENCE COMMITTEE Robert T. Fraonson, Faculty of Law, University of British Columbia, Co-Chair J. C. Smith, Faculty of Law, University of British Columbia, Co-Chair Carole D. Hafner, Northeastern University, Secretary-Treasurer PROGRAM COMMITTEE: Edwina L. Rissland, University of Massachusetts, Amherst, Program Chair Kevin D. Ashley, IBM Thomas J. Watson Research Center Trevor J. M. Bench-Capon, University of Liverpool, ENGLAND Donald H. Berman, Northeastern University Jon Bing, University of Oslo, NORWAY Michael G. Dyer, University of California, Los Angeles Anne v.d. L. Garner, Atherton, CA L. Thorne McCarty, Rutgers University Marek J. Sergot, Imperial College, London, ENGLAND ------------------------------ End of AIList Digest ****************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA09588; Wed, 19 Apr 89 20:58:04 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA09588; Wed, 19 Apr 89 20:58:04 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa14433; 19 Apr 89 21:38 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.127	AIList Digest V9 #10	HERON::ROACH	TANSTAAFL !	`Fri Apr 21 1989 19:36`	766
	Printed by: Pat Roach Document Number: 007014 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 20-Apr-1989 11:42am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@STATOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #10 AIList Digest Thursday, 20 Apr 1989 Volume 9 : Issue 10 Seminars: Plan Analysis of Programs - Stanley Letovksy A Model of Speech Acquisition: Supervised Learning - Michael Jordan The Four References - Don Perlis Meaners - Don Perlis The Cognitive Basis of the So-Called Topic in Japanese - Kuroda Adding Forward Chaining and TMS to Prolog - Tim Finin Constructing Simple Maps of an Indoor Environment - Karen Srachik Cognitive Artifacts or Things That Make Us Smart - Donald A. Norman Guaranteeing Serializable Results in Parallel ... - Jim Schmolze Text Analysis for Text Retrieval - David D. Lewis First- and Higher-Order Meinongian Logic - Jacek Pasniczek Has Representation Been Naturalized? - L. R. Baker Abstracts from the Journal of Experimental and Theoretical AI (4) Generating plausible diagnostic hypotheses ... - Jonathan Wald et al. Edge segments for texture discrimination - Iwama and Maida A paradigm shift in belief representation ... - John Barnden The graph of a boolean function - Frank Harary Fodor's Perverse Frame Problem and its Implications - Eric Dietrich ---------------------------------------------------------------------- Date: Tue, 28 Feb 89 10:51:10 EST From: [email protected] Subject: Plan Analysis of Programs - Stanley Letovksy PLAN ANALYSIS OF PROGRAMS Stanley Letovsky Yale/CMU Tuesday, March 7, 1:30 PM MH 3C344 Computer programs are more than just concatenations of instructions to a machine; they are also compositions of programming plans. Conventional languages make the instructions to the machine explicit, but they often obscure the plans, causing difficulties for program maintainers, who operate mostly at the level of changing the plans in the code. Plan analysis is the task of determining what plans are implemented in a given program. Automatic plan analysis may provide the basis for intelligent documentation tools which can provide maintainers with high level summaries of programs, and answer questions about the goals and plans in the code. This talk presents an approach to automated plan analysis of programs based on program transformations. Plan recognition is modelled as program transformation within a wide-spectrum language, in which the expressions in the code that make up a plan are rewritten into a new expression describing the corresponding goal. Exhaustive application of this recognition process yields a new version of the target program from which optimizations and implementation details have been removed. This version can be used to provide summary documentation of programs. The history of transformation applications provides information about what plans were found in the program. This information can be used to answer questions about the motivation for particular pieces of code. Analysis methods are presented within the transformational framework for analyzing several problematic types of programming plans. These include imperative plans with side effects, looping plans, plans involving abstract datatypes, and plans involving conditionals. A working prototype transformational analyzer, called CPU, has been constructed and will be described. Sponsor: Prem Devanbu, Telephone (201) 582-2062, Email: [email protected] ------------------------------ Date: Wed 1 Mar 89 17:26:13-EST From: Marc Vilain <[email protected]> Subject: A Model of Speech Acquisition: Supervised Learning - Michael Jordan BBN Science Development Program AI Seminar Series Lecture TOWARD A MODEL OF SPEECH ACQUISITION: SUPERVISED LEARNING AND SYSTEMS WITH EXCESS DEGREES OF FREEDOM Michael Jordan MIT Center for Cognitive Science ([email protected]) BBN Labs 10 Moulton Street 2nd floor large conference room 10:30 am, Monday March 6 The acquisition of speech production is an interesting domain for the development of connectionist learning methods. In this talk, I focus on a particular component of the speech learning problem, namely, that of finding an inverse of the function that relates articulatory events to perceptual events. A problem for the learning of such an inverse is that the forward function is many-to-one and nonlinear. That is, there are many possible target vectors corresponding to each perceptual input, but the average target is not in general a solution. I argue that this problem is best resolved if targets are specified implicitly with sets of constraints, rather than as particular vectors (as in direct inverse system identification). Two classes of constraints are distinguished---paradigmatic constraints, which implicitly specify inverse images in articulatory space, and syntagmatic constraints, which define relationships between outputs produced at different points in time. (The latter include smoothness constraints on articulatory representations, and distinctiveness constraints on perceptual representations). I discuss how the interactions between these classes of constraints may account for two kinds of variability in speech: coarticulation and historical change. ------------------------------ Date: 9 Mar 89 14:38:26 GMT From: [email protected] Reply-to: [email protected] (William J. Rapaport) Subject: The Four References - Don Perlis UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK GRADUATE GROUP IN COGNITIVE SCIENCE PRESENTS DONALD R. PERLIS Department of Computer Science and Institute for Advanced Computer Studies University of Maryland and Department of Computer Science University of Rochester "THE FOUR REFERENCES" Mind is a device for reasoning, thinking. So, what is thought? Who needs it? Not bacteria. But more complex behavior requires processing information `about' the world. What is `aboutness', and what good is it? The world is too complex to always correctly model it or algorith- mize responses to it. For bacteria, it seems not to matter; they sur- vive in sufficient numbers without having to deal with this issue. But we are not so lucky, or rather we are lucky that we are not so lucky, since it has forced us to evolve ways to deal with incorrect algorithms, namely, to postulate error in ourselves and, on detecting it, take corrective action. We will consider the extent to which aboutness may be explained in terms of this capacity, and the idea that thought amounts to the exercise of this capacity. Language supports this activity, so we will look a bit at linguistics. Finally, there are fas- cinating philosophic positions and arguments that bear on this whole enterprise. Monday, March 20, 1988 Noon - 2 P.M. (bring a brown-bag lunch) 317 Park Hall, Amherst Campus There will be an evening discussion at 8:00 P.M., at Stuart C. Shapiro's, 112 Parkledge, Snyder. For further information, contact Bill Rapaport, Department of Computer Science, 636-3193. ------------------------------ Date: Thu, 9 Mar 89 17:39:15 EST From: allegra!dlm (D.L.McGuinness) Subject: Meaners - Don Perlis MEANERS Donald Perlis U of Maryland and U of Rochester Friday, March 10, 10:30 AT&T Bell Laboratories Murray Hill 3D-436 This paper is about meaning, in the following sense: If an agent employs symbols, in what sense are they symbols, of what are they symbolic, and in what sense is it the agent that makes them symbolic? I discuss an approach that puts far more emphasis on events _internal_ to the agent than on external correspondences, and argue that this resolves a number of puzzles in the literature. sponsor: David Etherington [email protected] ------------------------------ Date: Mon, 13 Mar 89 17:04:58 EST From: [email protected] (William J. Rapaport) Subject: The Cognitive Basis of the So-Called Topic in Japanese - Kuroda UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK GRADUATE GROUP IN COGNITIVE SCIENCE PRESENTS S.-Y. KURODA Department of Linguistics University of California, San Diego The Cognitive Basis of the So-Called Topic in Japanese: A Contribution to Discourse and Narrative Theory The Japanese language distinguishes ``topicalized'' and ``nontopical- ized'' sentences by grammatical means. This distinction is commonly accounted for in terms of discourse theory. I once proposed an approach, broadly put, in cognitive semantics, in terms of the distinc- tion between ``categorical'' and ``thetic'' judgments, the distinction originally introduced by Franz Brentano and Anton Marty. I would like to give a fresh look at this distinction; I propose to separate ``affirming'' from ``asserting''. I will apply this distinction to account for different effects that topicalized and nontopicalized sen- tences bring to discourse and narration. Thursday, March 23, 1989 4:00 P.M. 280 Park Hall, Amherst Campus There will be an evening discussion at 8:00 P.M., at Mary Galbraith's, 130 Jewett Parkway, Buffalo. For further information, contact Bill Rapaport, Department of Computer Science, 716-636-3193. ------------------------------ Date: Wed, 15 Mar 89 20:12:32 -0500 From: [email protected] Subject: Adding Forward Chaining and TMS to Prolog - Tim Finin AI SEMINAR UNISYS PAOLI RESEARCH CENTER Adding Forward Chaining and Truth Maintenance to Prolog Tim Finin Unisys Paoli Research Center [email protected] Prolog, like most logic programming languages, has a fixed reasoning strategy based on depth-first, left-to-right backward chaining. Many applications can benefit from more flexible reasoning strategies. This talk describes an approach to extending Prolog's reasoning capabilities by adding forward chaining, Horn clauses, and an integrated truth maintenance system. The Pfc system is a package, implemented in standard Prolog, that provides a forward reasoning capability with an integrated justification-based truth maintenance system. It is intended to be used together with conventional Prolog programs, allowing the programmer to decide whether to encode a particular piece of knowledge as a forward-chaining Pfc rule or a backward chaining Prolog one. Like other logic programming languages, Pfc programs have a declarative interpretation as well as clear and predictable procedural one. The integrated truth maintenance system maintains consistency, supports non-monotonic reasoning, and makes derivations available for applications. Finally, Pfc is designed to be practical, being relatively efficient and fairly unobtrusive. Monday, March 20, 2:00 BIC Conference Room Unisys Paoli Research Center Route 252 and Central Ave. Paoli PA 19311 -- non-Unisys visitors who are interested in attending should -- -- send email to [email protected] or call 215-648-7446 -- ------------------------------ Date: Wed 15 Mar 89 23:11:07-EST From: Marc Vilain <[email protected]> Subject: Constructing Simple Maps of an Indoor Environment - Karen Srachik BBN Science Development Program AI Seminar Series Lecture VISUAL NAVIGATION: CONSTRUCTING AND UTILIZING SIMPLE MAPS OF AN INDOOR ENVIRONMENT Karen Sarachik MIT Artificial Intelligence Laboratory ([email protected]) BBN Labs 10 Moulton Street 2nd floor large conference room 10:30 am, Tuesday March 21 Much work with mobile robots has been done in the past using both vision and sonar to build maps, or, given a map, to successfully plan and execute trajectories to a goal. The most successful examples of robot navigation occurred in carefully engineered environments where the robot was able to accurately predict what its sensory input should be at any point, and correct for drift by comparing actual input to the projected input. In unstructured environments, however, the problem became much harder, and the obvious approaches failed to produce good results. The problem is further complicated by the fact that most interesting environments are not static, but rather are changing continually. In this talk I will discuss the problem from a different angle altogether, using the way people navigate through buildings as insight and inspiration. The goal is to navigate through an office environment using only visual information gathered from four cameras, whose initial detailed configuration is not known, placed onboard a mobile robot. The method is insensitive to physical changes within the room it is inspecting, such as moving objects. The map is built without the use of odometry or trajectory integration, which are often unreliable. At the heart of this technique is the development of a ``room recognizer'' which is able to deduce the size and shape of a room in conjunction with a ``door recognizer'' which recognizes a potential door by finding two vertical edges close enough together. The long term goal of the project described here is for the robot to build simple maps of its environment, presumed to be a single floor of an office building, and to localize itself within this framework. ------------------------------ Date: Thu, 16 Mar 89 15:49 EST From: "R. Uthurusamy" <SAMY%[email protected]> Subject: Cognitive Artifacts or Things That Make Us Smart - Donald A. Norman Seminar at the General Motors Research Laboratories in Warren, Michigan. Friday, March 31, 1989 at 10 am. COGNITIVE ARTIFACTS or THINGS THAT MAKE US SMART ------------------------------------------------------- Donald A. NORMAN Chair, Department of Cognitive Science The University of California, San Diego ABSTRACT The power of the unaided human mind is highly overrated. Artifacts play a critical role in human performance, whether it be as an aid to memory, spatial reasoning, attentional focus, or communication. I give examples of the role that even simple artifacts can play -- for spatial communication, reminders, pre-computation, task restructuring -- and present the beginnings of a theoretical analysis of the interaction between internal and external knowledge and structure. ----------------------------------------------------------------------- Prof. Donald Norman is chair of the newly formed Department of Cognitive Science at the University of California, San Diego. His current research interests are in an area he calls Distributed Cognition, in which cognitive processes and knowledge are distributed across people, social groups, the environment, and artificial devices -- cognitive artifacts. Norman has been active researcher in the study of human cognition for many years. He is one of the founders of the Cognitive Science Society and has served as its secretary-treasurer and chair. His most recent book is "The Psychology of Everyday Things" (Basic Books, 1988). ---------------------------------------------------------------------------- Non-GMR personnel interested in attending please contact R. Uthurusamy [ [email protected] ] 313 - 986 - 1989 ------------------------------ Date: Fri, 24 Mar 89 11:08:46 -0500 From: [email protected] Subject: Guaranteeing Serializable Results in Parallel ... - Jim Schmolze AI SEMINAR UNISYS PAOLI RESEARCH CENTER Guaranteeing Serializable Results in Parallel Production Systems Jim Schmolze Computer Science Tufts University [email protected] To speed up production systems, researchers have studied how to execute many rules simultaneously. Unfortunately, such systems can yield results that are impossible for a serial system to produce, leading to erroneous behaviors. We present algorithms that prevent all non-serializable effects for parallel production systems that execute many rules simultaneously. Our framework is taken from [1] and improves upon their solution. The practical advantages of these strategies is demonstrated using estimates from a large production system, the Manhattan Mapper [2]. [1] T. Ishida and S.J. Stolfo. "Towards the parallel execution of rules in production system programs." In Proceedings of the International Conference on Parallel Processing, 1985. [2] L. Lerner and J. Cheng. "The Manhattan Mapper expert production system." Tech. Report, Computer Science, Columbia , May 1983. 11:00 am, Monday April 3, 1989 BIC Conference Room Unisys Paoli Research Center Route 252 and Central Ave. Paoli PA 19311 -- non-Unisys visitors who are interested in attending should -- -- send email to [email protected] or call 215-648-7446 -- ------------------------------ Date: Wed, 29 Mar 89 15:23:45 -0500 From: [email protected] Subject: Text Analysis for Text Retrieval - David D. Lewis AI SEMINAR UNISYS PAOLI RESEARCH CENTER Text Analysis for Text Retrieval David D. Lewis Information Retrieval Laboratory University of Massachusetts at Amherst The performance of traditional text retrieval methods has plateaued in recent years, sparking a renewed interest in applications of natural language processing (NLP) to information retrieval (IR). The ADRENAL (Augmented Document REtrieval using NAtural Language processing) system, under construction at U Mass, makes use of syntactic and semantic processing, as well as plausible inference techniques, to construct a rich, though rather general and errorful, semantic representation of queries and documents for use in retrieval. I will focus in this talk on the problems of applying NLP to large collections of real-world text, paying particular attention to the lexical analysis and inference phases. Preliminary results from hand simulations of the system, and data on the operational syntactic parser and inference components, will be presented. Two algorithms which have been implemented for making use of NLP-produced representations in text retrieval will be described. One is based on the probabilistic retrieval model from IR, while the other is an incremental graph matching and inference algorithm derived from AI work on knowledge representation. 11:00am Monday, April 17 BIC Conference Room Unisys Paoli Research Center Route 252 and Central Ave. Paoli PA 19311 -- non-Unisys visitors who are interested in attending should -- -- send email to [email protected] or call 215-648-7446 -- ------------------------------ Date: Mon, 3 Apr 89 14:14:52 EDT From: [email protected] (William J. Rapaport) Subject: First- and Higher-Order Meinongian Logic - Jacek Pasniczek UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK BUFFALO LOGIC COLLOQUIUM GRADUATE GROUP IN COGNITIVE SCIENCE and GRADUATE RESEARCH INITIATIVE IN COGNITIVE AND LINGUISTIC SCIENCES PRESENT JACEK PASNICZEK Institute of Philosophy and Sociology Department of Logic Marie Curie-Sklodowska University Lublin, Poland FIRST- AND HIGHER-ORDER MEINONGIAN LOGIC Meinongian logic is a logic based on Alexius Meinong's ontological views. Meinong was an Austrian philosopher who lived and worked around the turn of the century. He is known as a creator of a very rich objec- tual ontology including non-existent objects, and even incomplete and impossible ones, e.g., "the round square". Such objects are formally treated by Meinongian logic. The Meinongian logic presented here (M- logic) is not the only Meinongian one: there are some other theories that are formalizations of Meinong's ontology and that may be considered as Meinongian logics (e.g., Parsons's, Zalta's, Rapaport's, and Jacquette's theories). But the distinctive feature of M-logic is that it is a very natural and straightforward extension of classical first- order logic--the only primitive symbols of the language of M-logic are those occurring in the first-order classical language. Individual con- stants and quantifiers are treated as expressions of the same category. This makes the syntax of M-logic close to natural-language syntax. M- logic is presented as an axiomatic system and as a semantical theory. Not only is first-order logic developed, but the higher-order M-logic as well. Wednesday, April 26, 1989 4:00 P.M. 684 Baldy Hall, Amherst Campus For further information, contact John Corcoran, Dept. of Philosophy, 716-636-2444, or Bill Rapaport, Dept. of Computer Science, 716-636-3193. ------------------------------ Date: 7 Apr 89 15:53:12 GMT From: [email protected] (William J. Rapaport) Subject: Has Representation Been Naturalized? - L. R. Baker UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK DEPARTMENT OF PHILOSOPHY and GRADUATE RESEARCH INITIATIVE IN COGNITIVE AND LINGUISTIC SCIENCES PRESENT LYNNE RUDDER BAKER Department of Philosophy Middlebury College HAS REPRESENTATION BEEN NATURALIZED? Physicalism either denies or denigrates beliefs, by maintaining either that there are no beliefs or that beliefs are identical with physical states. Baker's book gives close examination of each of these proposals in turn, concluding that they come up short. One of the most subtle and influential proponents of physicalism is Jerry Fodor. At the American Philosophical Association meetings in December 1988, Baker read a cri- tique of Fodor's book _Psychosemantics_, with Fodor giving a reply. The paper she will read here is a revision of her APA paper that takes Fodor's reply into account. Wednesday, April 19, 1989 3:00 P.M. 684 Baldy Hall, Amherst Campus Contact Newton Garver, Dept. of Philosophy, 716-636-2444, or Bill Rapaport, Dept. of Computer Science, 716-636-3193, for further information. ------------------------------ Date: Sun, 9 Apr 89 15:56:30 MDT From: <[email protected]> Subject: Journal of Experimental and Theoretical AI Abstracts (4) _________________________________________________________________________ The following are abstracts of papers appearing in the second issue of the Journal of Experimental and Theoretical Artificial Intelligence, to appear in April, 1989. For submission information, please contact either of the editors: Eric Dietrich Chris Fields PACSS - Department of Philosophy Box 30001/3CRL SUNY Binghamton New Mexico State University Binghamton, NY 13901 Las Cruces, NM 88003-0001 [email protected] [email protected] JETAI is published by Taylor & Francis, Ltd., London, New York, Philadelphia _________________________________________________________________________ Generating plausible diagnostic hypotheses with self-processing causal networks Jonathan Wald, Martin Farach, Malle Tagamets, and James Reggia Department of Computer Science, University of Maryland A recently proposed connectionist methodology for diagnostic problem solving is critically examined for its ability to construct problem solutions. A sizeable causal network (56 manifestation nodes, 26 disorder nodes, 384 causal links) served as the basis of experimental simulations. Initial results were discouraging, with less than two-thirds of simulations leading to stable solution states (equilibria). Examination of these simulation results identified a critical period during simulations, and analysis of the connectionist model's activation rule during this period led to an understanding of the model's nonstable oscillatory behavior. Slower decrease in the model's control parameters during the critical period resulted in all simulations reaching a stable equilibrium with plausible solutions. As a consequence of this work, it is possible to more rationally determine a schedule for control parameter variation during problem solving, and the way is now open for real-world experimental assessment of this problem solving method. _________________________________________________________________________ Organizing and integrating edge segments for texture discrimination Kenzo Iwama and Anthony Maida Department of Computer Science, Pennsylvania State University We propose a psychologically and psychophysically motivated texture segmentation algorithm. The algorithm is implemented as a computer program which parses visual images into regions on the basis of texture. The program's output matches human judgements on a very large class of stimuli. The program and algorithm offer very detailed hypotheses of how humans might segment stimuli, and also suggest plausible alternative explanations to those presented in the literature. In particular, contrary to Julesz and Bergen (1983), the program does not use crossings as textons and does use corners as textons. Nonetheless, the program is able to account for the same data. The program accounts for much of the linking phenomena of Beck, Pradzny, and Rosenfeld (1983). It does so by matching structures between feature maps on the basis of spatial overlap. These same mechanisms are also used to account for the feature integration phenomena of Triesman (1985). ---------------------------------------------------------------------------- Towards a paradigm shift in belief representation methodology John Barnden Computing Research Laboratory, New Mexico State University Research programs must often divide issues into managable sub-issues. The assumption is that an approach developed to cope with a sub-issue can later be integrated into an approach to the whole issue - possibly after some tinkering with the sub-approach, but without affecting its fundamental features. However, the present paper examines a case where an AI issue has been divided in a way that is, apparently, harmless and natural, but is actually fundamentally out of tune with the realities of the issue. As a result, some approaches developed for a certain sub-issue cannot be extended to a total approach without fundamental modification. The issue in question is that of modeling people's beliefs, hopes, intentions, and other ``propositional attitudes'', and/or interpreting natural language sentences that report propositional attitudes. Researchers have, quite understandably, de-emphasized the problem of dealing in detail with nested attitudes (e.g. hopes about beliefs, beliefs about intentions about beliefs), in favor of concentrating on the sub-issue of nonnested attitudes. Unfortunately, a wide variety of approaches to attitudes are prone to a deep but somewhat subtle problem when they are applied to nested attitudes. This problem can be very roughly described as an AI system's unwitting imputation of its own arcane ``theory'' of propositional attitudes to other agents. The details of this phenomenon have been published elsewhere by the author: the present paper merely sketches it, and concentrates instead on the methodological lessons to be drawn, both for propositional attitude research and, more tentatively, for AI in general. The paper also summarizes an argument (presented more completely elsewhere) for an approach to attitude representation based in part on metaphors of mind that are commonly used by people. This proposed new research direction should ultimately coax propositional attitude research out of the logical armchair and into the pyschological laboratory. --------------------------------------------------------------------------- The graph of a boolean function Frank Harary Department of Computer Science, New Mexico State University (Abstract not available) ___________________________________________________________________________ ------------------------------ Date: Mon, 10 Apr 89 15:23:36 EDT From: [email protected] (William J. Rapaport) Subject: Fodor's Perverse Frame Problem and its Implications - Eric Dietrich UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK GRADUATE RESEARCH INITIATIVE IN COGNITIVE AND LINGUISTIC SCIENCES PRESENTS ERIC DIETRICH Program in Philosophy and Computer & Systems Science Department of Philosophy SUNY Binghamton FODOR'S PERVERSE FRAME PROBLEM AND ITS IMPLICATIONS FOR SCIENTIFIC A.I. Over the last several years, Jerry Fodor has developed a theory of mind which has the unintuitive consequence that one part of the human brain routinely solves an intractable (or undecidable) problem. This problem is Fodor's version of the frame problem, which was first discovered in 1969 by McCarthy and Hayes, and is currently the subject of controversy and debate. I will briefly discuss Fodor's theory of mind--the modular- ity thesis--and his version of the frame problem. Then I will show that Fodor's frame problem is not solvable by any physical computer with realistic resources. Though Fodor apparently embraces this conclusion, I do not. Instead, the modularity thesis should be rejected. The gap left by the modularity thesis, however, poses at least one serious prob- lem for AI. I will suggest one way of handling this problem and its implications for a scientific AI. Monday, April 17, 1989 4:00 P.M. 684 Baldy Hall, Amherst Campus There will be an evening discussion at 8:00 P.M. at David Mark's house, 380 S. Ellicott Creek Road, Amherst. Contact Bill Rapaport, Dept. of Computer Science, 716-636-3193, for further information. ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA10694; Wed, 19 Apr 89 21:30:18 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA10694; Wed, 19 Apr 89 21:30:18 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa10718; 19 Apr 89 22:54 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.128	AIList Digest V9 #8	HERON::ROACH	TANSTAAFL !	`Fri Apr 21 1989 19:51`	1214
	Printed by: Pat Roach Document Number: 007022 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 21-Apr-1989 10:07am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@DELOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #8 AIList Digest Thursday, 20 Apr 1989 Volume 9 : Issue 8 IJCAI-89 Workshops: Symbolic Problem Solving Lexical Acquisition AI in Manufacturing (5) Knowledge, Perception, and Planning Object Oriented Programming in AI Conceptual Graphs A preview of Next Year: 1990 Connectionist Summer School, 1990 Computational Linguistics - Helsinki (COLING-90) Symposium on Spatial Data Handling - Zurich 1990 AI and Organization Theory, HICSS-23, 1990 Expert Systems - HICSS-23, 1990 Warning: AIList is being moved to a diferent distribution machine, new digestification software is being tested, and the arpanet is being disconnected. Weirdness can be expected for the next few weeks. Your mileage may vary. ---------------------------------------------------------------------- Date: Tue, 28 Mar 89 17:55:52 MST From: <[email protected]> Subject: IJCAI-89 Workshop on Symbolic Problem Solving Call for Participants / Call for Abstracts Symbolic Problem Solving in Noisy, Novel, and Uncertain Task Environments 20-21 August, 1989 (tentative), Detroit, MI, USA An IJCAI-89 Workshop, Sponsored by AAAI Goals. Brittleness in the face of noise, novelty, and uncertainty is a well-known failing of symbolic problem solvers. The goals of this Workshop are to characterize the features of task environments that cause brittleness, to investigate mechanisms for decreasing the brittleness of symbolic problem solvers, and to review case histories of implemented systems that function in task environments high in noise, novelty, and data of uncertain relevance. Topics of interest for the Workshop include the following. Analysis of task environments: Definitions of noisy, novelty, and uncertain relevance; exploration of related concepts in general systems theory or logic; parameters for characterizing task environments; knowledge engineering strategies. Mechanisms for addressing noise and novelty: Plasticity and learning; constructive problem solving; fragmentation of knowledge structures; dynamic modification of rules, schemata, or cases; coherence maintenance; adaptive control mechanisms. Representations: Data structures allowing dynamic abstraction and modification; representation of ``unstructured'' knowledge; knowledge implicit in control or learning procedures; ordering of knowledge structures; tradeoffs between explicit and implicit knowledge representation. Implementation issues: Implementing symbolic problem solvers on parallel machines; concurrency control strategies; integrating symbolic systems with artificial neural networks; general systems integration. Researchers interested in participating in the Workshop are invited to submit abstracts describing work in any of these topic areas. Format. All participants will present their current work, either as a brief oral report or as a poster. Most presentations will be posters, as these provide the greatest opportunity for presentation and discussion of technical details. Presentations will be on the first day of the Workshop, followed by discussions in working groups organized by application domain and a panel discussion on the second day. Attendance at IJCAI Workshops is limited to fifty participants. Participants not registered for IJCAI must pay a $50/day fee. Abstract Submission. Please submit a 1 page abstract of the work to be presented, together with a cover letter summarizing previous work in relevant areas and expected contribution to the Workshop, to Mike Coombs, Box 30001/3CRL, New Mexico State University, Las Cruces, NM 88003-0001 USA, by 15 May 1989. Authors will be notified as to acceptance by 1 June 1989. Accepted abstracts will be distributed at the Workshop. A volume collecting selected papers from the Workshop is planned; papers for this volume will be solicited at the Workshop. Organizers. Mike Coombs and Chris Fields (NMSU), Russ Frew (GE), David Goldberg (Alabama), Jim Reggia (Maryland). Points of contact: Mike Coombs, 505-646-5757, [email protected]; Chris Fields, 505-646-2848, [email protected]. ------------------------------ Date: Thu, 30 Mar 89 14:45:58 EST From: [email protected] (Donald E Walker) Subject: IJCAI-89 Workshop on Lexical Acquisition CALL FOR PARTICIPATION First International Workshop on Lexical Acquisition IJCAI-89 21 August 1989 Detroit, Michigan Organized by Roy Byrd - IBM T.J. Watson Research Center Nicoletta Calzolari - University of Pisa Paul Jacobs - General Electric Research and Development Center James Pustejovsky - Brandeis University Uri Zernik - General Electric Research and Development Center This is a call for papers for a one-day workshop on Lexical Acquisition to be held at IJCAI-89. We will accommodate 30 participants, 15 of whom will be invited to give talks. Position papers will be collected and published in an edited volume. For Natural Language systems to become more robust they require huge lexicons, providing both syntax and semantics. Existing on-line lexicons are small in size and cannot satisfy all the requirements of diverse Natural Language systems. Lexical acquisition and computational lexicology have emerged as major research areas addressing these problems. We will investigate in the workshop the following issues: * What are the uses of lexicons? (e.g., parsing, text processing, generation, translation) * What should be the contents of a lexicon (e.g., syntax, semantics, morphology), and how should these components be integrated? phonology, etc. * How is a lexicon organized? (e.g., hierarchy, subcategorization, indexing) * What are possible acquisition resources? (e.g., text, corpus, context, machine-readable dictionaries) * How can a lexicon be used? (e.g., customizing a lexicon to a domain by learning) * What are the necessary utilities? (e.g., tool kits for computational lexicography) To participate, please submit a 3-page position paper (4 copies) by May 15 highlighting: (a) the specific problem addressed; (b) the approach; (c) the application; (d) references to more detailed publications. ADDRESS FOR SUBMISSION: Dr. Uri Zernik General Electric - Research and Development Center PO Box 8 Schenectady, NY 12301 For further details, please call or email: (518) 387-5370 [email protected] ------------------------------ Date: 31 Mar 89 01:02:08 GMT From: [email protected] (Dundee Navinchandra) Subject: IJCAI-89 Workshops on AI in Manufacturing (5) AI IN MANUFACTURING WORKSHOPS AT IJCAI 1989 ------------------------------------------- The AAAI Special Interest Group on Manufacturing (SIGMAN) will be hosting five workshops at the upcoming International Joint Conference on Artificial Intelligence. The Conference is being held from Aug 20-25th in Detroit, Michigan. The SIGMAN workshops are: Aug 21 - Workshop 1: Concurrent Engineering Design Aug 22 - Workshop 2: Manufacturing Planning Aug 23 - Workshop 3: Manufacturing Scheduling Aug 24 - Workshop 4: Integrated Architectures for Manufacturing Aug 25 - Workshop 5: Diagnostic Systems for Manufacturing The workshop proceedings will most probably be published in one volume under the title "Proceedings of the AAAI Workshops on Manufacturing". -------------------------------------------------------------------------- WORKSHOP 1 - AUG 21 CONCURRENT ENGINEERING DESIGN Call for Participation. AIM: The workshop addresses the issues related to concurrent design in industrial environments. The workshop focus is to discuss in detail the software issues related to design by a team of engineers, the support environment provided to the individual designers and the advances in design methodology in the mechanical and electrical engineering domain. WARNING: This workshop is not to be confused with, the more theoretically inclined, AAAI-Artificial Intelligence in Design Workshops which have been held every other year since 1984. The next Design workshop will be held at AAAI 1990. TOPICS: Authors are encouraged to submit abstracts for papers across a broad spectrum of issues related, but not limited to: - Concurrent Design Methodology, Problems, Techniques. - System architectures for Concurrent Design. Coordination, Control and Communication issues. Design Databases. - Implementation of Design for the abilities, (Manufacturability, Testability, Reliability, etc.) AI techniques. - Knowledge/Data Representation, Feature based design, Non-Geometric features, Design Databases, Standards. - Case studies in Concurrent Engineering. FORMAT The workshop will be on day long and will take place on Monday, August 21. There will be four Panel Discussions, two in the morning and two in the afternoon. Each panel will begin with general remarks by the panel moderator followed by short presentations by the panelists. General discussion will follow. Attendance will be limited to 70. SUBMISSIONS Please submit one page abstracts/position-papers no later than May 2, 1989. The focus of the submissions should be on the identification and discussion of key issues concerning Concurrent Engineering Design, and the role/solutions that AI techniques can provide, as well as the current status of existing applications. These submissions will be used to select workshop attendees. Notifications will be mailed out by the end of June. Please send submissions with 4 copies to: Dr. V. Jagannathan American Cimflex 121 Industry Drive Pittsburgh, PA 15275 U.S.A. E-Mail: [email protected] Phone: (412) 787 3001 PROGRAM COMMITTEE: V. Jagannathan, Co-Chair, American Cimflex D. Navinchandra, Co-Chair, CMU Nien-Hua Chao, AT&T Bell Labs S. N. Dwivedi, West Virginia Univ. David Gossard, MIT Ted Kitzmiller, Boeing Adv. Tech. Center Allen Matsumoto, American Cimflex Sanjay Mittal, Xerox Palo Alto Research Y.V. Ramana Reddy, W. Virginia Univ. Marty Tenenbaum, Stanford. Ralph Wood, GE-Corporate Research Mike Wozny, Rensselaer Polytechnic ------------------------------------------------------------------------------- WORKSHOP 2 - AUGUST 22 MANUFACTURING PLANNING Call for Papers/Participation This one-day workshop is to be held during the International Joint Conference on Artificial Intelligence (IJCAI) in Detroit this August. DESCRIPTION: The purpose of this workshop is to identify critical issues in manufacturing planning, applicable AI technologies, and directions for future research. TOPICS: The subject area, manufacturing planning, is interpreted here to include all areas of manufacturing in which AI planning techniques might be applicable. For example, process planning would be such an area. One exception to the above is that this workshop will not deal with production scheduling (which is to be handled in a separate workshop). FORMAT: The workshop will be divided into panels on various topics. For each topic, short presentations will be given by the panel members, followed by extended discussions. ORGANIZING COMMITTEE: Dana Nau (Committee Chair) University of Maryland [email protected] Steve Ray, NIST (formerly NBS) Keith Hummel, Allied Signal Corp. Stephen C. Y. Lu, University of Illinois SUBMISSIONS: Those interested in participating should submit a one- or two-page extended abstract, along with a list of related publications. The submission deadline will be May 12, and attendees will be notified in mid June. Submissions should be sent to: Dana S. Nau Computer Science Department University of Maryland College Park, MD 20742 ATTN: SIGMAN PLANNING WORKSHOP Attendees will be selected by the organizing committee, based on the committee's evaluation of the submissions. [Several potential participants have asked me whether they will be required to submit a full paper for the workshop proceedings if their extended abstract is accepted for the workshop. They are welcome to do so if they wish, but our intention is that the proceedings will consist simply of the submitted extended abstracts.] ------------------------------------------------------------------------------- WORKSHOP 3 - AUGUST 23 MANUFACTURING SCHEDULING DESCRIPTION: The purpose of this workshop is to identify the key issues in the scheduling of production in manufacturing facilities, the applicable AI techniques, the current status of existing applications, and the directions for future research. FORMAT: There will be four 1.5 hour sessions (two morning sessions with a break, followed by a lunch break (possibly working lunch), followed by two afternoon sessions with a break) in the one day workshop. Each session will begin with a few overview remarks from one of the program committee who has refereed the papers for that session and will act as its chairman. This will be followed by a brief position statement (5 minutes) by each of those (4 or 5) who have had papers accepted for that session topic. This will be followed by an open discussion. Open discussion of the issues is intended to occupy the bulk of each session, and will be mediated by the session chairman. TOPICS: The sessions will be organized in response to the interest of the participants as reflected in papers submitted. Suggested topics include ... predictive scheduling, reactive scheduling, interactive scheduling, MRP- level/quarterly/monthly scheduling, weekly/daily scheduling, hourly/real-time scheduling, schedule construction, schedule repair, constraint-based scheduling, expert system schedulers, fuzzy scheduling, genetic scheduling, simulated annealing scheduling, .... SUBMISSIONS Three page single-spaced submissions must be received by 15 May 89. Notification will not be later than 16 June 89, with final copy submission by 17 July 89. Proceedings will be available at IJCAI prior to the start of the workshop. Focus should be on the identification and resolution of scheduling issues using AI techniques, rather than broad surveys or implementation details (unless implementation is the issue). Preference will be given to those who describe work which tests identifiable theory under realistic conditions. ATTENDANCE Participation will be limited to 50 with roughly 20 having the opportunity to formally present and everyone having a chance to contribute (the discussion period allows for 240 minutes to be shared among 50 participants). Invitations will be primarily issued to those who provide substantive submissions. Remaining places will be filled by those who respond by 15 May 89 with a one page resume (including recent publications) which demonstrates the ability to contribute to the discussion periods. Domain experts are welcome to respond in this fashion. The committee will have the final choice concerning the invitation of participants. COMMITTEE Karl Kempf (AAAI-SIGMAN Industrial Co-Chair) - Intel Corporation, Stephen Smith - CMU, Barry Fox - NASA, one other t.b.a. CONTACT: Karl Kempf Intel Corporation / SC9-22 2250 Mission College Blvd. Santa Clara, CA, 95052 Phone 408-765-9322 FAX 408-765-9936 [email protected] [email protected] ------------------------------------------------------------------------------- WORKSHOP 4 - AUGUST 24 INTEGRATED ARCHITECTURES FOR MANUFACTURING WORKSHOP DESCRIPTION: The workshop on Integrated Architectures for Manufacturing aims at bringing together participants from industry and academia interested in finding ways in which Artificial Intelligence can be used to effectively coordinate and integrate organizational decision making in manufacturing. To achieve such a level of integration it is necessary to develop a manufacturing systems architecture that supports appropriate representation and distribution of the manufacturing knowledge, as well as protocols that enable cooperative decision making. This task represents an enormous challenge given the complexity of manufacturing tasks, the need to integrate a huge array of numerical, symbolic and pictorial data, the need to be able to represent entities such as 3D geometries and abstract design features, the need to define the proper interactions not only among the various organizational functions, but also interactions (and reactions to) with a dynamically changing competitive environment. TOPICS: The topics to be discussed will focus on the interests of the participants as evidenced by their submissions. Some general topics include: - What does it mean to integrate activities both within production and across the manufacturing product life cycle? - What is an appropriate architecture that supports the above? - How can the achievement of global organizational goals be supported while maintaining autonomous decision making in different parts of the organization? - What are the strategies to support negotiation to resolve conflicts? FORMAT: The workshop is 1-day long and will take place on Thursday, August 24. There will be four sessions, two in the morning and two in the afternoon. Each session will begin with general remarks by the session chairperson followed by a presentation, 5 to 10 minutes, by the selected participants. General discussion will follow. Attendance will be limited to 60. Suggested panel topics are presented below. The final selection of panel topics, however, will be determined by the issues addressed in the submissions. Submissions targeted for a particular panel in the present list should indicate so in the title page. Integrated Manufacturing Architectures: What does it mean? Since this is a rather recent topic that may mean different things to different people, it is important to discuss possible definitions of the concept, its essential characteristics, its function, its scope, the key issues that need to be addressed, the role of AI techniques and other related questions. Are current manufacturing organizational structures obsolete? In current manufacturing organizations, materials and information are passed serially from one department to the next and the hierarchical mode of organization predominates. Future enterprises will employ a flexible informational infrastructure, where each function becomes a knowledge center capable of teaming with other nodes and operating in parallel in support of the enterprise business strategy. Integration requires more than just technology. Success demands the true integration of "people and machines", where the quality of human interaction becomes as important as product quality. This will necessitate not only the realignment of departmental charts, but also reward systems, career paths and management style. How should manufacturing knowledge be represented and distributed throughout the organization? The applications of most large manufacturing enterprises have their own dedicated databases. Although there is redundant data in most of these data bases, it cannot be automatically shared because the definition of the data elements are slightly different, and moreover the semantics, even for key concepts such as part, subassembly, tolerance, varies from function to function. These problems are circumvented today by the human translation process and manual adaptation of the information passed from one function to the next. Hence, one of the important issues is the development of reference models for the enterprise and the incorporation of adequate translation strategies for communication between functions. What kinds of coordination patterns give rise to different production strategies? New production strategies, such as Just in Time (JIT), have recently been advocated and adopted by companies. There is, however, no general understanding of the coordination patterns necessary for the successful employment of a strategy. For example, some of the requirements for effective use of JIT are close working arrangements with suppliers, and full quality assurance since poor quality parts or materials result in severe manufacturing problems and, in theory, JIT allows no time for checking incoming parts. These JIT requirements imply specific coordination patterns with material suppliers. Related questions are under what circumstances are different production strategies appropriate, and whether there exist Manufacturing Architectures that support the flexible adaptation of different coordination patterns by the organization to produce different production behaviors. ORGANIZING COMMITTEE: Katia Sycara (Chair), Carnegie Mellon Dan Corkill, Univ. of Massachussetts Les Gasser, Univ. of Southern California Victor Lesser, Univ. of Massachussetts Charles Marshall, Digital Equipment Corporation. Richard Mayer, Texas A and M Univ. Van Parunak, ITI Univ. of Michigan Steve Smith, Carnegie Mellon Marty Tenenbaum, Schlumberger and Stanford SUBMISSIONS: There will be two kinds of submissions: - Submission of 6 copies of a 2-3 page single-spaced position paper no later tha May 2. The focus of the submissions should be on identification and discussion of key issues concerning Integrated Manufacturing Architectures, and the role/solutions that AI techniques can provide, as well as the current status of existing applications. These submissions will be given first priority in selecting presenters. - Submission of 6 copies of a one-paragraph expression of interest in participation that demonstrates the ability of the potential participant to contribute to the discussions. Domain experts are encouraged to respond in this fashion. All submissions will be reviewed by the program committee. Presenters and participants will be selected on the strength of their submissions. Participants will be notified my mid June . Final copy submissions will be made by the end of June. Proceedings will be available at the workshop. Please mail papers to: Katia P. Sycara The Robotics Institute Carnegie Mellon University Pittsburgh, PA. 15213 Phone: (412) 268-8825 [email protected] ------------------------------------------------------------------------------- WORKSHOP 5 - AUGUST 25 DIAGNOSTIC SYSTEMS FOR MANUFACTURING WORKSHOP DESCRIPTION: The purpose of this workshop is to assess status, technologies, and future directions for the successful application of AI to diagnostic problems in manufacturing. The manufacturing focus is understood broadly and covers the creation or use of diagnostic systems throughout the product lifecyle - from design through production to field service. The workshop is structured around three panels: Innovative Applications, Tools and Techniques, and Pragmatics (i.e. Knowledge Acquisition, Validation and Verification, User Interfaces, and System Integration). The panels will be followed by a discussion/debate on the status of diagnostic technology (To what extent is it ready for deployment?) and future directions (What are the unresolved issues?). PARTICIPATION: Those interested are asked to send 1 page abstracts and a biographical note to the to the workshop chair by April 21. Abstracts should focus on a core issue relevant to one of the panels. Attendance will be limited to 75. Panelists will be selected from those submitting abstracts. Notifications will be mailed by the end of June. WORKSHOP CHAIR: Gary Kahn Carnegie Group Inc. 5 PPG Place Pittsburgh, PA 15222 SCHEDULE 08:30-9:00 Introductions 09:00-10:30 Panel: Innovative Applic. 10:30-10:45 Break 10:45-12:15 Panel: Tools and Techniques 12:15-01:45 Lunch Break 01:45-03:15 Panel: Pragmatics 03:30-05:00 Discussion: Ready for Prime Time, or Not? ------------------------------ Date: Wed, 5 Apr 89 18:05:51 edt From: [email protected] Subject: IJCAI-89 Workshop on Knowledge, Perception, and Planning Enclosed is a call for papers for a workshop on knowledge, perception and planning, to be held in conjunction with IJCAI-89. CALL FOR PAPERS Workshop on knowledge, perception, and planning (to be held in conjunction with IJCAI-89) Detroit, Michigan Tuesday, August 22, 1989 In this workshop, we intend to discuss the relationships between perception, knowledge, and planning in humans and robots with human-like sensors. In the past ten years, there has been a significant body of work on integrated theories of planning and knowledge. Specifically, researchers have investigated the knowledge that agents need in order to perform actions and the ways in which the performance of actions affects an agent's knowledge. A primary focus of the workshop will be current research in these areas. In particular, we would like to examine the ways in which knowledge is acquired through perception and communication. For example, previous theories would be able to support an inference such as ``To get to the assembly line, the robot must know where the assembly line is located,'' but they do not provide a mechanism for inferring, or even expressing, facts like ``The robot can learn where the assembly line is by seeing it,'' or ``The robot can see the assembly line from the north side of the factory.'' A theory that included this kind of information could form the interface between an abstract characterization of the knowledge needed for a plan, and the physical sensor and effector actions needed to gain that knowledge. Among the issues that will be addressed are: the connection between knowledge and action; the acquisition of knowledge through communication and the planning of communicative acts; high-level theories of perception; high level theories of hand-eye coordination; the acquisition of knowledge through perception; and the use and construction of cognitive maps. This is intended to be a forum for the presentation and discussion of current ideas and approaches. The format will consist of individual presentations followed by adequate time for interaction with peers. To maximize such interaction, participation will be limited to a small number of active researchers. PARTICIPATION: Those interested in attending should submit a one-page description of their research interests and current work to one of the organizing committee (preferably electronically) by June 1. [NOTE the new later deadline; this has been extended from the deadline given in the IJCAI paper mailing.] At the same time, those interested in making a presentation should submit an extended abstract (3-5 pages) of their intended topic. Notification of acceptance or rejection will be given after July 1. Accepted papers must be submitted by August 1; these will be reproduced and distributed at the workshop. ORGANIZING COMMITTEE Ernest Davis Leora Morgenstern Kate Sanders New York University Brown University Brown University (212) 998-3123 (401) 863-7644 (401) 863-7672 ([email protected]) ([email protected]) ([email protected]) Hard copy submissions may be sent to: Kate Sanders Computer Science Department Box 1910 Brown University Providence, RI 02912 USA ------------------------------ Date: 6 Apr 89 12:58:04 GMT From: [email protected] (Scott Woyak) Subject: IJCAI-89 Workshop on Object Oriented Programming in AI CALL FOR PARTICIPATION IJCAI-89 Workshop on Object-Oriented Programming in AI Sponsored by AAAI Tuesday, August 22, 1989 Detroit, Michigan, U.S.A. Description ----------- The use of object-oriented programming (OOP) has resulted in many practical, implemented AI systems, both AI programming langauges/environments and domain specific knowledge based applications. This workshop will provide an informal forum where researchers can exchange ideas, experiences, and issues regarding the merits of OOP for various AI problems. The goal of the workshop is that the participants will categorize problems for which OOP is most appropriate and identify how specific features of OOP are beneficial. Topics ------ Some of the areas of AI that OOP is being used for are: o knowledge representation o integrating multiple paradigms o cooperating, intelligent agents o model-based reasoning o constraint propagation o simulation o natural language processing o knowledge-based applications. In addition to the discussion of the utility of OOP in these various areas, the following topics are relevant: o comparison of objects and frames o use of objects to integrate rules, logic, and procedural knowledge o OO approaches to knowledge base design o comparison of OOP inheritance and AI inheritance o objects and pattern matching o object classes and AI classification o OO protocols for tasks such as inference. Format ------ The workshop will take place on Tuesday, August 22, and will consist of 2-3 segments consisting of a few short presentations followed by ample discussion. Each segment will be moderated by a member of the Workshop Committee. Submission Information ---------------------- Workshop invitations will be issued on the basis of short papers 5 pages or less in length. Send 4 copies of the paper to the contact below. Each short paper will be reviewed by members of the Workshop Committee. Accepted papers will emphasize the merits of OOP in an implemented AI system. In keeping with an informal workshop, the total number of invitations will be limited to 30-35 people. Workshop Committee ------------------ Sherman Alpert, IBM T.J. Watson Research Center Lloyd Arrowood, Oak Ridge National Laboratory Howard Shrobe, Symbolics Scott Woyak, EDS Research & Development Important Dates --------------- May 15, 1989 Short papers must be received July 3, 1989 Notification of invitation or rejection August 22, 1989 Workshop date Contact ------- Scott W. Woyak EDS Research and Development 3551 Hamlin Rd, Fourth Floor Auburn Hills, MI 48057 USA Phone: (313) 370-1669 Net: [email protected] ----------------------------------------------------------------------------- -- Scott W. Woyak - Electronic Data Systems [email protected] USENET: ... {rutgers!rel,uunet}!edsews!edsdrd!sww ------------------------------ Date: 14 Apr 89 21:19:42 EDT From: john Sowa <[email protected]> Subject: IJCAI-89 Workshop on Conceptual Graphs Call for Participation IJCAI-89 Workshop on Conceptual Graphs August 20 & 21, 1989 The Fourth Annual Workshop on Conceptual Graphs will be held at IJCAI-89 in Detroit, Michigan, on Sunday August 20 and Monday August 21. It will provide a forum for researchers and practitioners to exchange ideas about the theory and applications of conceptual graphs. Attendance will be limited to people who are actively using, developing, extending, or implementing conceptual graphs. Those who are interested in participating should submit a two-page extended abstract about their work with an indication of whether they would like to (a) present a full paper, (b) present a short summary of their work, or (c) simply attend. Seven copies of the abstract are due by May 10 at the following address: Conceptual Graph Workshop Committee c/o Janice A. Nagle 1641 E. Old Shakopee Road Bloomington, MN 55425 Copies of the proceedings of the 1988 Conceptual Graph Workshop are available from the AAAI for $20. No proceedings are available for the first two workshops. ------------------------------ Date: 29 Mar 89 05:32:48 GMT From: [email protected] (Jeff Elman) Subject: 1990 Connectionist Summer School, 1990 March 28, 1989 PRELMINARY ANNOUNCEMENT CONNECTIONIST SUMMER SCHOOL / SUMMER 1990 UCSD La Jolla, California The next Connectionist Summer School will be held at the University of California, San Diego in June 1990. This will be the third session in the series which was held at Carnegie-Mellon in the summers of 1986 and 1988. The summer school will offer courses in a variety of areas of connectionist modelling, with emphasis on computa- tional neuroscience, cognitive models, and hardware imple- mentation. In addition to full courses, there will be a series of shorter tutorials, colloquia, and public lectures. Proceedings of the summer school will be published the fol- lowing fall. As in the past, participation will be limited to gradu- ate students enrolled in PhD. programs (full- or part-time). Admission will be on a competitive basis. We hope to have sufficient funding to subsidize tuition and housing. THIS IS A PRELMINARY ANNOUNCEMENT. Further details will be announced over the next several months. Terry Sejnowski Jeff Elman UCSD/Salk UCSD Geoff Hinton Dave Touretzky Toronto CMU [email protected] [email protected] ------------------------------ Date: 3 Apr 89 15:58:38 GMT From: [email protected] (Donald E Walker) Subject: Computational Linguistics - Helsinki (COLING-90) The Thirteenth International Conference on Computational Linguistics COLING 90 COLING 90 will be arranged on August 20-25, 1990, at the University of Helsinki. Pre-Coling tutorials take place on August 16-18, 1990. YOU ARE INVITED TO SUBMIT - a topical paper on some critical issue in computational linguistics, - a project note with software demonstration The written part of your presentation should not exceed 6 pages in A4 format or 12,000 characters for a topical paper, and half that length for a project note. The final version of the paper should follow the COLING 88 style sheet. Send your text NOT LATER THAN DECEMBER 1, 1989, as electronic mail or as five paper copies to the Coling 90 Program Committee. The Program Committee will respond by February 1, 1990. All prospective participants are kindly requested to indicate their interest to the Conference Bureau by January 15, 1990. Detailed information (on e.g. accommodation) will be sent to all participants by February 1, 1990. Deadline for preregistration will be May 1, 1990. The registration fee will be 750 FIM (certified students 400 FIM). The late registration fee is 1100 FIM. Inquiries concerning papers should be directed to the Program Committee and concerning accommodation to the Conference Bureau. Other inquiries are handled by the local organizers. COLING 90 PROGRAM COMMITTEE Hans Karlgren KVAL Skeppsbron 26 S-111 30 STOCKHOLM Sweden Phone: +46 8 7896683 Fax: +46 8 7969639 Telex: 15440 kval s E-mail: [email protected] or: [email protected] COLING 90 CONFERENCE BUREAU Riitta Ojanen Kaleva Travel Agency Ltd Congress Service Box 312 SF-00121 HELSINKI Finland Phone: +358 0 602711 Fax: +358 0 629019 Telex: 122475 kleva sf LOCAL ARRANGEMENTS Fred Karlsson Dept of General Linguistics University of Helsinki Hallituskatu 11 SF-00100 HELSINKI Finland Phone: +358 0 1911 Fax: +358 0 656591 Telex: 124690 unih sf E-mail: COLING@FINUH (in BITNET) ------------------------------ Date: 9 Apr 89 03:58:13 GMT From: [email protected] (David Mark) Subject: Symposium on Spatial Data Handling - Zurich 1990 Call for Papers 4th International Symposium on Spatial Data Handling ---------------------------------------------------- July 23-27, 1990 Zurich, Switzerland The 4th International Symposium on Spatial Data Handling will be held at the University of Zurich, Switzerland. As its predecessors this interdisciplinary meeting is sponsored by the Commission on Geographic Information Systems of the International Geographical Union and will emphasize research issues rather than applications. The conference will focus on the following topics: - Algorithms and data models for applications in computational geometry spatial knowledge representation spatial decision analysis automatic recognition of spatial structures digital surface modelling handling and representation of space-time data cartographic visualization and generalization - Spatial languages and user interfaces - System design and architectures for data integration - Amplified intelligence concepts for spatial data handling - Spatial data handling approaches for alternative system architectures (neural nets, parallel processing). The official language of the meeting will be English. The conference will consist of sessions with presentations of approx. 20 minutes; a few selected papers of special merit will be given 30 minutes of time and will be the subject of prepared discussion. Researchers are invited to submit abstracts of 500-700 words length to the organizing committee no later than October 1, 1989. Abstracts must carry the full name and mailing address of the author(s), and possibly an electronic mail address. The abstracts will be evaluated by an international program committee. Persons submitting abstracts will be notified of the decision of the committee no later than December 15, 1989 and final papers will be required in camera-ready form no later than April 1, 1990. The number of participants to the conference will be restricted; active participants will be given priority. Abstracts and inquiries should be directed to: Professor Kurt Brassel Geographisches Institut Telephone: 0041-1-257 5151 Universitaet Zuerich Telefax: 0041-1-257 4004 Winterthurerstrasse 190 e-mail: [email protected] CH-8057 Zuerich, Switzerland ------------------------------ Date: Sun, 2 Apr 89 10:12:32 -0500 (EST) From: Michael Prietula <[email protected]> Subject: AI and Organization Theory, HICSS-23, 1990 Call For Papers and Referees ARTIFICIAL INTELLIGENCE AND ORGANIZATION THEORY 23rd Hawaii International Conference on System Sciences, HICSS-23 Kailua-Kona, Hawaii January 2 -- 5, 1990 The Emerging Technologies and Applications Track of HICSS-23 will contain a special set of papers addressing topics in ARTIFICIAL INTELLIGENCE AND ORGANIZATION THEORY. For an organization to function, countless decisions must be made at all levels of the firm. Over time, organizations adapt to the internal and external environmental demands and constraints in a manner which yields structures that reduce the complexity of such decision making tasks. These structures are comprised of both formal and in formal components which are sometimes quite difficult to articulate; therefore, modifications or ignorance of such structures can lead to unanticipated, often undesirable results. As our capability and effort turn toward assisting decision makers with information technology, it is essential that we understand and appreciate the interaction between the systems we build and the organizational structures in which we embed them. Relevant interesting and innovative results are emerging from artificial intelli gence (AI) and cognitive science research. AI systems have capabilities fundamentally different from more traditional support systems. The notion of configuring an intelligent agent which can assume more of the decision-making responsibility has importan t ramifications when considering how the organizational structure may be affected. Collections of such agents working either independently or with humans complicate the issues involved. Whereas earlier researchers have proposed a link between organizati onal structures and information systems, it has been further proposed that because AI systems embed problem solving components, the design of these problem solving components affect, and are affected by, the technology and the organizational structure. The goal of this session is to bring together papers which begin to address the link between AI research, organizational theory, cognitive science, and the automated support of complex decision making in organizations. Topics relevant to this session would include: --> How can intelligent agents function in an organization? --> What is the nature of the interaction between intelligent agents, human agents, and organizational structures? --> How can multiple intelligent agents cooperate and coordinate in the support of complex decision making in an organizational setting? --> What are the issues involved in implementing single or multiple agent systems? --> How can AI be used to model organizational structures or theories? --> What are the major design issues to consider when operating an AI system within an organization? --> How can AI systems help realize truly adaptive organizational structures? --> What can organization theory tell us about configuring distributed AI systems? --> And what can distributed AI tell us about organization theories? Papers selected for presentation will appear in the conference proeedings, which are published by the Computer Society of the IEEE, and, possibly, later also in a special issue of a professional society periodical. HICSS-23 is sponsored by the University of Hawaii in cooperation with the ACM, the IEEE Computer Society, and the Pacific Research Institute for Information Systems and Management (PRIISM). INSTRUCTIONS FOR AUTHORS Manuscripts should be 22--26 typewritten, double-spaced pages in length (including figures and references). Do not send submissions that are significantly shorter or longer than this. Papers must not have been previously presented or published, nor currently submitted for journal publication. Papers must not have been previously presented or published. Each manuscript will be subjected to a rigorous refereeing process. Manuscripts should have a title page that includes the title of the paper, full name of its author(s), affiliation(s), complete physical mail and electronic address(es), telephone number(s), and a 300-word abstract. DEADLINES: 1. Six hardcopies of the manuscript are due postmarked by June 5, 1989. 2. Notification of acceptance by September 1, 1989. 3. Camera-ready accepted manuscripts due by October 1, 1989. SEND SUBMISSIONS AND QUESTIONS TO EITHER OF THE CO-CHAIRS: Dr. Michael J. Prietula Graduate School of Industrial Administration Carnegie-Mellon University Pittsburgh, PA 15213 (412) 268-8833 BITNET: [email protected] -- OR -- Dr. Renee A. Beauclair School of Business University of Louisville Louisville, KY 40292 (502) 588-7830 BITNET: RABEAU01@ULKYVM ------------------------------ Date: 5 Apr 89 18:50:02 GMT From: [email protected] (Dave King) Reply-to: [email protected] () Subject: Expert Systems - HICSS-23, 1990 Call for Papers Expert Systems Minitrack in the DSS-KBS Track of the Hawaii International Conference on System Sciences - 23 Kailua-Kona, HI Jan 1990 Expert systems and knowledge-base systems are being applied in a variety of domains. This minitrack of the DSS-KBS Track at HICSS-23 focuses primarily on the use of ES/KBS in the decision support, business/financial and information management delivery arenas. While the focus is somewhat specific, papers can be theoretical, applied or empirical in nature. In particular, papers dealing with one or more of the following topics are encouraged: o Knowledge representation o Reasoning with uncertainty, probablistic or fuzzy data o Common sense reasoning o Knowledge acquisition o Tools and technologies for creating ES/KBS o Distributed ES/KBS o Integrating ES/KBS with DSS or DBMS o Embedding ES/KBS in DSS or DBMS o Intelligent tutoring and frontends o Conversational advisory systems and natural language frontends o Empirical studies dealing with the use of ES/KBS technology o Prototypical or commercial ES/KBS in specific domains which illustrate innovative applications or aspects of these technologies INSTRUCTIONS FOR SUBMITTING PAPERS Manuscripts should be 22-26 typewritten, double-spaced pages in length. Do not send submissions that are significantly shorter or longer than this. Papers must not have been previously presented or published, nor submitted for journal publication. Each manuscript will be subjected to a rigorous refereeing process. Manuscripts should have a title page that includes the title of the paper, full name(s) of its author(s), affiliation(s), complete mailing and electronic address(es), telephone number(s), and a 300-word abstract. DEADLINES o Six copies of the manuscript are due by June 6, 1989 o Notification of accepted papers by Sept. 1, 1989 o Camera ready copy by Oct. 1, 1989 SEND PAPERS TO Dave King Director, AI Applications Execucom Systems Corp. 9442 Capital of Texas Hwy. N. Arboretum Plaza One Austin TX 78759 512-346-4980 or Professor James Marsden Department of Decision Science and Information Systems College of Business and Economics University of Kentucky Lexington, KY 40506-0034 606-257-2536 Distribution: Organization: Execucom Systems Corp., Austin, Texas Keywords: ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA24149; Thu, 20 Apr 89 02:46:22 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA24149; Thu, 20 Apr 89 02:46:22 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa13723; 19 Apr 89 20:15 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.129	AIList Digest V9 #11	HERON::ROACH	TANSTAAFL !	`Thu May 25 1989 12:26`	403
	Printed by: Pat Roach Document Number: 007323 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 25-May-1989 09:38am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@STATOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #11 AIList Digest Thursday, 25 May 1989 Volume 9 : Issue 11 IJCAI Announcements: Call For IJCAI-89 Student Volunteers Workshop on Automating Software Design Travel Grant applications Revised Dates: Knowledge Discovery Workshop - June 1 Blackboard Workshop - May 31 Workshop on Human Machine Intelligence - May 29 Workshop on Intelligent Interfaces - June 1 Workshop: OOP in AI - May 31 ---------------------------------------------------------------------- Date: Thu, 20 Apr 89 12:39:44 EDT From: [email protected] Subject: Call For IJCAI-89 Student Volunteers For those who missed it earlier: CALL FOR IJCAI-89 STUDENT VOLUNTEERS The 1989 International Joint Conference on Artificial Intelligence will be held in Detroit, Michigan USA from Saturday, August 19 to Friday August 25. Student volunteers are being sought to assist with a variety of tasks at the conference site, such as registration, ticket taking, messages, and answering questions. Each volunteer will be expected to work 12 hours, and will be provided with free conference registration and Proceedings. If you are interested in volunteering you will need to supply the following information: (1) Name and address (2) An e-mail address if available (3) Name of your university and department, and your level of study (4) The days you prefer to work, jobs desired, or sessions you prefer to assist with (5) Identify any language other than English in which you can converse. Send this information to [email protected] (Note the underline character between names) E-mail will be acknowledged and further details supplied. If you do not receive a reply within one week, or if you do not have access to e-mail, send the information by regular mail to Prof. Robert Lindsay MHRI University of Michigan 205 Washtenaw Place Ann Arbor, Michigan 48109 ------------------------------ Date: 4 May 1989 0113-PDT (Thursday) From: Mike Lowry <[email protected]> Subject: IJCAI-89 Workshop on Automating Software Design CALL FOR PARTICIPATION: Automating Software Design IJCAI-89 Workshop; Detroit, Michigan USA Monday, 21 August 1989 This international one day workshop will focus upon current approaches to automating software design. We intend to discuss the capabilities needed to push current work on knowledge-based software engineering to the 'break-even' point: the point at which software development becomes easier with a knowledge-based tool than without. Attendance will be limited to 50 active researchers. The workshop will be evenly divided between presentations and discussions which focus on the following two topics: 1. Interactive acquisition of formal specifications. 2. Interactive and automatic synthesis of computer programs from formal specifications. Important Dates May 31 Those interested in attending should submit a one page description of their research interests and current work by May 31. Include name, mailing address, and electronic mail address. At the same time, those interested in making a presentation should submit an abstract of 3-5 pages on their intended topic. Electronic submissions are preferred and should be sent to: [email protected] Hard copy submissions should be sent to Robert McCartney. June 15 Notification of acceptance. July 24 All participants may submit an extended abstract or position paper; only camera ready hard copy will be accepted. Our intent is to mail participants a copy of the proceedings prior to IJCAI. August 21 Workshop Organizing Committee: Michael R. Lowry Kestrel Institute 3260 Hillview Ave. Palo Alto, CA 94304 USA (415) 493-6871 ([email protected]) Robert McCartney Department of Computer Science University of Connecticut, U-155 Storrs, CT 06269-3155 USA (203) 486-5232 ([email protected]) Jeremy M. Wertheimer MIT AI Laboratory 545 Technology Square Cambridge, MA 02139 USA (617) 253-5867 ([email protected] .mit.edu) ------------------------------ Date: 18 May 89 17:03:11 GMT From: [email protected] (Donald E Walker) Subject: IJCAI-89 Travel Grant applications - 15 June TRAVEL GRANTS FOR IJCAI-89 IJCAII has established a program to provide travel support for participants attending IJCAI-89 in Detroit, Michigan. The amounts awarded will vary depending on location and on the number of persons applying. 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 limited travel funds. Applications should be received no later than 15 June 1989. They should briefly identify the expected form of conference participation; describe benefits that would result from attendance; specify 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 to: Priscilla Rasmussen, IJCAI-89 Travel Grants Laboratory for Computer Science Research Hill Center, Busch Campus Rutgers, the State University New Brunswick, NJ 08903, USA (+1-201)932-2768 internet: [email protected] ------------------------------ Date: 29 Apr 89 17:00:09 GMT From: [email protected] (Michael Siegel) Subject: IJCAI-89 Knowledge Discovery Workshop - June 1 IJCAI-89 Workshop on Knowledge Discovery in Databases August 20, Detroit MI, USA Due to the delayed mailing of IJCAI-89 flyers, the deadline for submitting papers or abstracts has been postponed to June 1. Acceptance notification has been postponed to July 1. Send 3 copies of an extended abstract or a short paper to workshop chairman: Gregory Piatetsky-Shapiro email: gps0%[email protected] GTE Laboratories CSnet: [email protected] 40 Sylvan Road Fax: 617-890-9320 Waltham MA 02254 USA Phone: 617-466-4236 ------------Program Committee--------------- Jaime Carbonell (CMU) J. Ross Quinlan (U. of Sydney) William Frawley (GTE Laboratories) Michael Siegel (Boston University) Kamran Parsaye (IntelligenceWare) Ramasamy Uthurusamy (GM Research) ------------------------------ Date: 1 May 89 18:00:00 GMT From: [email protected] ("Dan Corkill, COINS, UMass 413/545-0156") Subject: IJCAI-89 Blackboard Workshop - May 31 ------------------------------------------------------------------------------ CALL FOR PARTICIPATION IJCAI-89 Workshop on Blackboard Systems Sponsored by AAAI Wednesday, August 23, 1989 Detroit, Michigan, U.S.A. ** PLEASE NOTE NEW SUBMISSION DEADLINE ** Description ----------- The blackboard paradigm is a powerful technique for implementing today's ambitious AI applications and for integrating diverse problem solving expertise into a common framework. The Third Annual Workshop on Blackboard Systems, like its predecessors, provides an informal forum where researchers in blackboard technology and developers of blackboard-based applications exchange ideas, experiences, problems, and inspirations. The aims of the workshop include: allowing participants to share the latest results of their research in an informal setting, informing participants of other researchers working on similar problems or using similar approaches, and identifying common unsolved research issues. Topics ------ Topics of interest for the workshop include: * blackboard systems/shells; * blackboard control mechanisms/techniques; * real-time, parallel, and distributed blackboard approaches; * performance measures for blackboard systems/applications; * user interfaces/explanation facilities for blackboard systems; * application development/debugging facilities for blackboard systems; * problems associated with fielding a blackboard-based application; * novel blackboard-based applications. Submissions presenting comparison data between blackboard technology and other AI methodologies or among alternate blackboard-based approaches are particularly encouraged. Format ------ The workshop is one-day long and will take place on Wednesday, August 23. Accepted papers will be grouped into three panels based on content. Each panel will consist of a series of informal paper presentations followed by a general discussion period. A chair for each panel will be selected from members of the Workshop Committee. As with previous years, a proceedings containing complete versions of the accepted papers will be distributed at the workshop. Submission Information ---------------------- Workshop invitations will be issued on the basis of extended abstracts 10 pages or less in length. Each extended abstract will be reviewed by members of the Workshop Committee. At most, 2 invitations will be issued for each accepted abstract. In keeping with an informal workshop, the total number of invitations will be limited to 30--35 people. Workshop Committee ------------------ Larry Baum, Boeing ATC Kevin Gallagher, UMass (co-chair) Roberto Bisiani, CMU Barbara Hayes-Roth, Stanford Daniel Corkill, UMass (chair) V. Jagannathan, American Cimflex Raj Dodhiawala, FMC Victor Lesser, UMass Robert Engelmore, Stanford Penny Nii, Stanford Lee Erman,Teknowledge Important Dates --------------- May 31, 1989 Extended abstracts must be received July 17, 1989 Notification of invitation or rejection August 8, 1989 Completed papers must be received August 23, 1989 Workshop date Send four copies of extended abstracts to: ------------------------------------------ Daniel D. Corkill Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 U.S.A. Internet: [email protected] Phone: 413/545-0156 FAX: 413/545-1249 ------------------------------ Date: 9 May 89 20:40:21 GMT From: [email protected] (Valerie Shalin) Subject: IJCAI-89 Workshop on Human Machine Intelligence - May 29 The announced due date for submissions to our workshop "Integrated Human-Machine Intelligence in Aerospace Systems" is May 15. However, many of you just received announcements about the IJCAI workshops. We thought it might be helpful to have an extension. The new due date for submitting papers and requests for participation is May 29. In addition, please note that the workshop will be held on August 21. --Valerie ------------------------------ Date: Wed, 10 May 1989 2:28:12 EDT From: Steve Feiner <[email protected]> Subject: IJCAI-89 Workshop on Intelligent Interfaces - June 1 Message-Id: <[email protected]> Because the AAAI mailing was late, we have decided to postpone the due date for submissions to the IJCAI-89 Workshop on Intelligent Interfaces to be held Tue Aug 22. Please send submissions by June 1 (previously May 15) to IJCAI-89 Interface Workshop c/o Yigal Arens USC/ISI 4676 Admiralty Way Marina del Rey, CA 90292 (If you have already sent a submission and would like to send a revised version by the new date, that's fine also.) Invitations to participate will be extended in June. Steve Feiner ------------------------------ Date: 12 May 89 15:30:25 GMT From: [email protected] (Scott Woyak) Subject: IJCAI-89 Workshop: OOP in AI - May 31 Due to the delayed mailing of the IJCAI-89 Workshop CFP's, the revised dates for the Object-Oriented Programming in AI workshop are: May 31, 1989 Short papers must be received July 17, 1989 Notification of invitation or rejection -- Scott W. Woyak - Electronic Data Systems [email protected] USENET: ... {rutgers!rel,uunet}!edsews!edsdrd!sww ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA09958; Wed, 24 May 89 19:00:41 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA09958; Wed, 24 May 89 19:00:41 PDT Received: by mintaka.lcs.mit.edu id af16212; 24 May 89 17:27 EDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa08088; 24 May 89 17:18 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.130	AIList Digest V9 #13	HERON::ROACH	TANSTAAFL !	`Mon May 29 1989 10:41`	427
	Printed by: Pat Roach Document Number: 007362 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 27-May-1989 09:48am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@DELOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #13 AIList Digest Saturday, 27 May 1989 Volume 9 : Issue 13 Seminars: Plausible Inference, Extended ... - Paul Cohen Issues in Genetic Optimization - Gunar Liepins Toward a New Model of Reasoning - Jon Barwise Paradoxes of Indirect Discourse - Nicholas Asher Connectionist Models of Memory ... - Roger Ratcliff Reasoning with Defaults - Hector Geffner Time-Derivative Models of Pavlovian ... - Sutton and Barto (paper) Gene Identification - Periannan Senapathy ---------------------------------------------------------------------- Date: Wed, 19 Apr 89 14:30:37 EDT From: Marc Vilain <[email protected]> Subject: Plausible Inference, Extended Composition, and Ontology ... - Paul Cohen BBN STC Science Development Program AI Seminar Series Lecture PLAUSIBLE INFERENCE, EXTENDED COMPOSITION, AND ONTOLOGY MAINTENANCE PAUL R. COHEN Experimental Knowledge Systems Laboratory Department of Computer and Information Science University of Massachusetts, Amherst BBN STC, 2nd floor large conference room 10 Moulton St, Cambridge MA, 02138 Friday April 21st, 10:30 AM I will present work I have done with Cynthia Loiselle on a simple method for generating rules of plausible inference from the relations in a knowledge base, and, more recently, on the question of how to predict the plausibility of the conclusions of inferences. Unlike deductive inferences, conclusions generated by rules of plausible inference are not guaranteed to be "true" or plausible in any sense, so for every rule, we need to know whether it generates plausible conclusions (or, in the case of Collins' certainty conditions, what would make the conclusions more or less plausible). Experiments with human subjects show that relatively little information is needed to make moderately accurate plausibility predictions for the rules we generated. Still, roughly 30% of the implausible inferences in our test set were predicted to be plausible, so we have been examining what additional knowledge is necessary to improve this performance. I will describe Huhns and Stephens' adaptation of relation element theory (called extended composition) to the task of predicting the plausibility of inferences, and show that their system is essentially equivalent to our own, but could be extended to provide the information needed to improve plausibility predictions. I will also touch on the role of plausible inference in ontology maintenance, the process of determining the meaning of new relations or revising the meaning of existing relations in a very large knowledge base such as CYC. ------------------------------ Date: Wed, 19 Apr 89 15:35:55 EDT From: Marc Vilain <[email protected]> Subject: Issues in Genetic Optimization - Gunar Liepins BBN STC Science Development Program AI Seminar Series Lecture ISSUES IN GENETIC OPTIMIZATION GUNAR LIEPINS Oak Ridge National Laboratories BBN STC, 2nd floor large conference room 10 Moulton St, Cambridge MA, 02138 Tuesday April 25th, 10:30 AM This presentation reviews several genetic algorithm applications, provides a brief introduction to the genetic paradigm, and addresses multi-objective and constrained optimization. The roles of sampling (embedding) and representation are made explicit and illustrated from the perspective of function dimensionality and smoothness. The four modes of GA failure: estimation, crossover disruption, stability of regions of attraction, and schemata deceptiveness, are reviewed. A simple construction for fully deceptive problems of arbitrary size is given. The presentation concludes that the primary challenges are to improve GA efficiency and better characterize their domain of applicability. ------------------------------ Date: 21 Apr 89 14:20:13 GMT From: [email protected] (William J. Rapaport) Subject: Toward a New Model of Reasoning - Jon Barwise UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK DEPARTMENT OF MATHEMATICS and GRADUATE RESEARCH INITIATIVE IN COGNITIVE AND LINGUISTIC SCIENCES PRESENT JON BARWISE Director, Symbolic Systems Program, Department of Philosophy, and Center for the Study of Language and Information (CSLI) Stanford University TOWARD A NEW MODEL OF REASONING This lecture, reporting joint work of John Etchemendy and the speaker, will discuss a new mathematical model of inference and reasoning. Our basic idea is that reasoning generally consists of the manipulation of _information_, not linguistic symbols. Language is just one of the many forms in which information can be couched. Visual images, for example in the form of diagrams or visual scenes of real-world objects, are other forms. Valid inference is the general process of extracting new information from information given or already obtained from a variety of sources, including both linguistic and visual. We think this is the way to think about reasoning in most situations, even in cases which seem, on the face of it, very symbolic, like mathematics. There are two novel features of our approach. One is the handling of information that is presented to us in more than one form. The other is that our approach is neutral between the two competing paradigms: rea- soning as deduction, and reasoning as model building (Johnson-Laird). We are developing a mathematical theory of inference based on this idea, as well as a computer program for teaching reasoning that is based on these ideas. The talk will present a discussion of the theory and a demo of a mock-up of the program. Monday, April 24, 1989 4:00 P.M. 684 Baldy Hall, Amherst Campus There will be an evening discussion at 8:00 P.M. at Lynne Hewitt's house, 239 Huntington Ave. (ground floor), Buffalo. Contact Nick Goodman, Dept. of Mathematics, 716-831-3179, or Bill Rapa- port, Dept. of Computer Science, 716-636-3193, for further information. ------------------------------ Date: Mon, 24 Apr 89 15:01:21 EDT From: [email protected] (William J. Rapaport) Subject: Paradoxes of Indirect Discourse - Nicholas Asher UNIVERSITY AT BUFFALO STATE UNIVERSITY OF NEW YORK BUFFALO LOGIC COLLOQUIUM and GRADUATE RESEARCH INITIATIVE IN COGNITIVE AND LINGUISTIC SCIENCES PRESENT NICHOLAS ASHER Department of Philosophy and Center for Cognitive Science University of Texas at Austin PARADOXES OF INDIRECT DISCOURSE In natural language and programs where we must reason about the states of other systems, it is extremely useful to quantify over beliefs of agents. I look at two proposals for quantifying over beliefs--one first-order and one second-order. I then consider certain paradoxes of indirect discourse that arise when one allows quantification over beliefs. These were part of the mediaeval insolubilia and have recently been discussed by Prior and Thomason. I show how inductive and semi- inductive theories of belief (like the one recently developed by Kamp and myself) can address the paradoxes Thomason discusses within the first-order theory of quantification over beliefs, and I propose an analogous way of handling these paradoxes within the higher order frame- work. Monday, May 8, 1989 4:00 P.M. 684 Baldy Hall, Amherst Campus There will probably be an evening discussion at a time and place to be announced. Contact John Corcoran, Dept. of Philosophy, 716-636-2444, or Bill Rapa- port, Dept. of Computer Science, 716-636-3193, for further information. ------------------------------ Date: Thu, 27 Apr 89 18:20:52 EDT From: [email protected] Reply-to: [email protected] Subject: Connectionist Models of Memory ... - Roger Ratcliff AI SEMINAR WEDS, MAY 3, 1:30 PM (NOTE ODD TIME) SECOND FLOOR LARGE CONFERENCE ROOM, BBN, 10 MOULTON ST. ROGER RATCLIFF, NORTHWESTERN UNIVERSITY CONNECTIONIST MODELS OF MEMORY AND FACTS ABOUT HUMAN MEMORY In this talk, connectionist models of memory are proposed and evaluated. The main class of models uses variants of the multilayer encoder model with the backpropagation delta rule for learning. The autoassociative model with the delta rule for learning is also evaluated in a much less exhaustive fashion. The models are applied to standard list learning procedures in which items are studied in a learning phase and then tested for retention. In contrast to most implementations of connectionist models, items or vectors are presented for learning one at a time (or in small groups of items within a rehearsal buffer) and an item is not trained further during the remainder of the list. This scheme mimics learning in many traditional memory experiments in which long lists of words are presented without repetition. This sequential learning scheme leads to two serious and central problems for the multilayer model. First, well learned information is forgotten rapidly as new information is learned. Second, discrimination between studied items and new items either decreases or is nonmonotonic as a function of the amount of rehearsal or number of learning trials each studied item receives. Both these results provide problems for the model because both predictions are inconsistent with large bodies of data from memory research. To address the first problem, manipulations of the network within the multilayer model were examined (for example holding some of the network weights constant and adding extra hidden units) but none of these significantly affected the forgetting functions. To address the second problem, several variants on the multilayer model were examined including learning as increments on a prelearned memory system, modifications only to a context portion of an item vector, and training an additional node to represent old items when turned on at test. None of these modifications produced adequate discrimination between studied and new items as a function of the amount of learning. The constraints demonstrated by these studies are important because they provide limitations on the scope and role of connectionist models in learning and forgetting in human memory and more generally in situations in which the whole set of information to be learned is not all available throughout learning. ------------------------------ Date: Thu, 11 May 89 14:54:29 EDT From: [email protected] Subject: Reasoning with Defaults - Hector Geffner Date: Monday, 5/22/89 Time: 10:00 am Place: AT&T Bell Laboratories - Murray Hill 3D436 Title: Reasoning with Defaults Speaker: Hector Geffner Cognitive Systems Laboratory - Department of Computer Science, UCLA Defaults play a central role in commonsense reasoning, permitting the generation of useful predictions in the absence of complete information. These predictions are nonmonotonic, in the sense that they often need to be revised in light of new information. A number of extensions to classical logics have been proposed which successfully accommodate this non-monotonic behavior. Recent work in defeasible inheritance, however, has shown that there are additional issues, beyond non-monotonicity, which also need to be addressed in order to capture the defaults intended meaning. I will present two alternative formalizations which address these issues. In the first part I will discuss a qualitative inference system that results from interpreting defaults as high conditional probability statements. The system is characterized by a core of five rules of inference which permit derivations to be constructed in the style of natural deduction systems and which capture the context-sensitivity of defaults. A sixth rule is then introduced which extends the core with assumptions about conditional independence. In the second part of the talk, I will present a model theoretic account which provides an alternative validation of both the core rules and the conditional independence assumptions. This account appeals to a preference relation among models hinted by the probabilistic interpretation. We will then present some examples and discuss ideas about implementation. Sponsor: David Etherington - [email protected] ------------------------------ Date: 19 May 89 18:54:12 GMT From: [email protected] (Rich Sutton) Subject: Time-Derivative Models of Pavlovian ... - Sutton and Barto (paper) Andy Barto and I have just completed a major new paper relating temporal-difference learning, as used, for example, in our pole-balancing learning controller, to classical conditioning in animals. The paper will appear in the forthcoming book ``Learning and Computational Neuroscience,'' edited by J.W. Moore and M. Gabriel, MIT Press. A preprint can be obtained by emailing to rich%[email protected] with your physical-mail address. The paper has no abstract, but begins as follows: TIME-DERIVATIVE MODELS OF PAVLOVIAN REINFORCEMENT Richard S. Sutton GTE Laboratories Incorporated Andrew G. Barto University of Massachusetts This chapter presents a model of classical conditioning called the temporal-difference (TD) model. The TD model was originally developed as a neuron-like unit for use in adaptive networks (Sutton & Barto, 1987; Sutton, 1984; Barto, Sutton & Anderson, 1983). In this paper, however, we analyze it from the point of view of animal learning theory. Our intended audience is both animal learning researchers interested in computational theories of behavior and machine learning researchers interested in how their learning algorithms relate to, and may be constrained by, animal learning studies. We focus on what we see as the primary theoretical contribution to animal learning theory of the TD and related models: the hypothesis that reinforcement in classical conditioning is the time derivative of a composite association combining innate (US) and acquired (CS) associations. We call models based on some variant of this hypothesis ``time-derivative models'', examples of which are the models by Klopf (1988), Sutton & Barto (1981a), Moore et al (1986), Hawkins & Kandel (1984), Gelperin, Hopfield & Tank (1985), Tesauro (1987), and Kosko (1986); we examine several of these models in relation to the TD model. We also briefly explore relationships with animal learning theories of reinforcement, including Mowrer's drive-induction theory (Mowrer, 1960) and the Rescorla-Wagner model (Rescorla & Wagner, 1972). We motivate and explain time-derivative models from the point of view of animal learning theory, and show that the TD model solves significant problems with earlier time-derivative models. We also demonstrate the TD model's accord with empirical data in a range of conditioning paradigms including conditioned inhibition, primacy effects (Egger & Miller, 1962), facilitation of remote associations, and second-order conditioning. ------------------------------ Date: Mon, 22 May 89 12:23:45 -0400 From: [email protected] Subject: Gene Identification - Periannan Senapathy AI SEMINAR UNISYS PAOLI RESEARCH CENTER Computer Identification of Eukaryotic Genes in Uncharacterized Sequences: Applications to the Genome Project. Dr. Periannan Senapathy Biotechnology Center University of Wisconsin An international effort is now underway to determine the complete nucleotide sequence of the human genome (about 3.5X10^9 nucleotides) as well as those of other biomedically important organisms. In accomplishing this goal, large regions of raw sequence data will be generated, and major tasks will include analysis to identify and characterize genes within the sequence data. Statistical analysis and computer algorithms will be the primary tools to address these problems. In this talk, I will first present the motivation for the human genome project and then discuss my current work on the statistical basis for identifying eukaryotic genes. 3:30pm Monday, May 22 Cafeteria Conference Room Unisys Paoli Research Center Route 252 and Central Ave. Paoli PA 19311 -- non-Unisys visitors who are interested in attending should -- -- send email to [email protected] or call 215-648-7446 -- ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA11937; Fri, 26 May 89 19:58:08 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA11937; Fri, 26 May 89 19:58:08 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa09495; 26 May 89 20:17 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.131	AIList Digest V9 #12	HERON::ROACH	TANSTAAFL !	`Mon May 29 1989 10:45`	1071
	Printed by: Pat Roach Document Number: 007344 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 26-May-1989 10:19am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@DELOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #12 AIList Digest Thursday, 25 May 1989 Volume 9 : Issue 12 Announcements: 6th Israeli Conference on AI and Vision Workshop on Neural Representation of Visual Information ICGA-89 3rd Intl. Conference on Genetic Algorithms - Fairfax, VA CADE-10 10th Intl. Conference on Automated Deduction - West Germany Bar-Ilan Symposium on Foundations of AI - Israel IKBCS-89, Bombay - Revised Deadlines Call for Volunteers for Cog. Sci. Society Conference Connection Science Special Issue on Hybrid Symbolic/Connectionist Systems 3rd Conference on Reasoning About Knowledge - 1990 PODS-90 Symposium on Principles of Database Systems - 1990 ---------------------------------------------------------------------- Date: Sun, 23 Apr 89 13:47:14 JST From: Jeff rosenschein <jeff%[email protected]> Subject: 6th Israeli Conference on AI and Vision Call For Papers Sixth Israeli Conference on Artificial Intelligence and Computer Vision Tel-Aviv, December 26-27 1989 The conference is the joint annual meeting of the Israeli Association for Artificial Intelligence, and the Israeli Association for Computer Vision and Pattern Recognition, which are affiliates of the Israeli Information Processing Association. Papers addressing all aspects of AI and Computer Vision, including, but not limited to, the following topics, are solicited: - AI and education - AI languages, logic programming - Automated reasoning - Cognitive modeling - Expert systems - Inductive inference, learning and knowledge acquisition - Knowledge theory, logics of knowledge - Natural language processing - Planning and search - Image Processing and Pattern Recognition - Image Analysis and Computer Vision - Visual Perception - Applications - Robotics Submitted papers will be refereed by the program committee, listed below. Authors should submit 4 copies of a full paper or an extended abstract. The accepted papers will appear in the conference proceedings. Submitted papers should be received at the following address by June 1st, 1989. Authors will be notified of accepted papers by August 1st, 1989. Vision: Dr. Y. Yeshurun AI: Dr. J. Rosenschein 6th IAICV 6th IAICV Dept of Computer Science Dept of Computer Science Tel Aviv University The Hebrew University 69978 Tel Aviv 91904 Jerusalem Israel Israel Program Committee co-chairmen: Jeff Rosenschein, Hebrew University ([email protected]) Yehezkel Yeshurun, Tel-Aviv University ([email protected]) Moshe Ben-Bassat, Tel-Aviv University ([email protected]) Rina Dechter, Technion Ehud Gudes, Ben-Gurion University ([email protected]) Tamar Flash, Weizmann Institute of Science ([email protected]) Daniel Lehmann, Hebrew University ([email protected]) Marc Luria, Technion Yoram Moses, Weizmann Institute of Science Uzzi Ornan, Technion Ehud Shapiro, Weizmann Institute of Science ([email protected]) Freddy Bruckstein, Technion ([email protected]) Zvi Meiri, IBM Scientific Center (meiri@israearn) Amnon Meizles, Ben Gurion University (am@bengus) Shmuel Peleg, The Hebrew University ([email protected]) Shimon Ullman, Weizmann Institute of Science ([email protected]) Michael Werman, The Hebrew University ([email protected]) Haim Wolfson, Tel-Aviv University ([email protected]) ------------------------------ Date: Tue, 16 May 89 11:25:36 EDT From: [email protected] (William J. Rapaport) Subject: Workshop on Neural Representation of Visual Information STATE UNIVERSITY OF NEW YORK AT BUFFALO UB VISION GROUP and GRADUATE RESEARCH INITIATIVE IN COGNITIVE AND LINGUISTIC SCIENCES invite you to attend a workshop: NEURAL REPRESENTATION OF VISUAL INFORMATION June 9, 8:30 am to 10 pm June 10, 8:30 am to 4 pm Lipschitz Room, CFS 126, Main Street Campus Speakers: Dana Ballard, Computer Science, Rochester Robet Boynton, Psychology, UC San Diego Ennio Mingola, Center for Adaptive Systems, Boston U. Ken Naka, National Inst. for Basic Biology, Japan, and NYU Hiroka Sakai, National Inst. for Basic Biology, Japan, and NYU Members of the UB Vision Group If you are interested in attending, send your name and address with a check for $40 to cover the cost of the five meals to: Dr. Deborah Walters Department of Computer Science SUNY Buffalo Buffalo, NY 14260 Graduate students may apply for a waiver of the meal fee. For further information, contact Dr. Walters, 636-3187, email: [email protected] or [email protected]. ------------------------------ Date: Wed, 26 Apr 89 15:49:39 EDT From: John Grefenstette <[email protected]> Subject: ICGA-89 3rd Intl. Conference on Genetic Algorithms - Fairfax, VA Call for Participation ICGA-89 The Third International Conference on Genetic Algorithms June 4-7, 1989 George Mason University Fairfax, Virginia with support from Navy Center for Applied Research in AI and Philips Laboratories Conference Chair: Kenneth A. De Jong, George Mason University Local Arrangements: Lashon B. Booker, Naval Research Lab Program Chair: J. David Schaffer, Philips Labs Program Committee: Lashon B. Booker L. David Davis, Bolt, Beranek and Newman, Inc. Kenneth A. De Jong David E. Goldberg, University of Alabama John J. Grefenstette, Naval Research Lab John H. Holland, University of Michigan George G. Robertson, Xerox PARC J. David Schaffer Stephen F. Smith, Carnegie-Mellon University Stewart Wilson, Rowland Institute for Science CONFERENCE OBJECTIVE The objective of the International Conference on Genetic Algo- rithms is to provide a global forum for the exchange of informa- tion on genetic algorithm theory, technique, and application. This year, this objective will be met with the presentation of over 60 papers at a combination of general and poster sessions. In the past, the Conference has provided a collegial environment conducive to informal information exchange between new faces and old hands alike. The conference program has been designed care- fully to maintain this tradition, even though the number of sub- missions has grown substantially. WHO SHOULD ATTEND Both budding and established GA researchers and practitioners will find useful information at ICGA89. For the newcomer, a tu- torial is available to review the current state of the art. More- over, conference presenters in the past have been aware of the diverse backgrounds of their audience and have made special ef- forts to provide essential background material. In 1989 this tradition of concern for newcomers is expected to continue. For established researchers and practitioners, ICGA is still the only regularly scheduled conference entirely devoted to genetic algo- rithms and genetics-based machine learning, and all the major centers of GA activity will be represented. This year, the addi- tion of poster sessions should bolster the healthy exchange of ideas that has marked past conferences. SPECIAL ACTIVITIES This year, the Conference plans a number of special activities: --- a Tutorial on Sunday afternoon. Dr. David Goldberg of the University of Alabama will present a 2 hour introduction to the theory and application of genetic algorithms. Dr. Goldberg is the author of over 44 publications in GAs, including his recent book, Genetic Algorithms in Search, Optimization, and Machine Learning. --- a Wine and Cheese Mixer on Sunday evening. See your old friends and make new ones at the official opening of the confer- ence. --- an informal Cookout on Monday evening followed by a poster session with more than 30 presenters. --- a Panel Discussion on Tuesday afternoon. Leading researchers and practitioners in the field will discuss current issues and future directions. --- a Conference Banquet on Tuesday evening. --- an Exhibit Area in which software can be demon-strated and exchanged. --- a Press Liaison. For the first time, members of the scien- tific and engineering press have been invited to attend, and the Conference Committee will provide a member to act as liaison to the community. TECHNICAL PAPERS Genetic Algorithm Theory Uniform Crossover in Genetic Algorithms, Gilbert Syswerda Biases in the Crossover Landscape, Larry Eshelman, Richard A. Caruana and J. David Schaffer How Genetic Algorithms Work: A Critical Look at Implicit Parallelism, John J. Grefenstette and James E. Baker Some Results on Boolean Concept Learning by Genetic Algorithms, Hans Ros When Both Individuals and Populations Search: Adding Simple Learning to the Genetic Algorithm, Richard K. Belew An Investigation of Niche and Species-formation in Genetic Function Optimization, K. Deb and D. E. Goldberg A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization, J. D. Schaffer, R. A. Caruana, L. Eshelman and R. Das Adapting Operator Probabilities in Genetic Algorithms, Lawrence Davis Sizing Populations for Serial and Parallel Genetic Algorithms, David E. Goldberg Zen and the Art of Genetic Algorithms, David E. Goldberg Schema Alphabets: A New Interpretation that Overturns the Binary Coding Constraint, H. James Antonisse Genetic Search with Proportion Estimations, Ping-Chung Chi GAs for Unfixed Length, Order Dependent Representations, Yuval Davidor Varying the Probability of Mutation in the Genetic Algorithm, Terence C. Fogerty The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem, P. Jog, J. Y. Suh and D. Van Gucht The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best, D. Whitley Applications Using Genetic Algorithms to Solve NP-Complete Problems, Kenneth A. De Jong and William M. Spears Scheduling Problems and Optimal Traveling Salesman: The Genetic Edge Recombination Operator, Darrell Whitley, Timothy Starkweather and D'Ann Fuquay Constrained Genetic Optimization via Dynamic Reward-Penalty Balancing and Its Use in Pattern Recognition, W. Siedlecki and J. Sklansky EnGENous Domain Independent, Machine Learning for Design Optimization, D. J. Powell, S. Tong and M. Skolnick Using Genetic Algorithms to Schedule Flow Shop Releases, Gary A. Cleveland and Stephen F. Smith Application of Genetic Algorithms in Chemometrics, C.B. Lucasins and G. Kateman Genetic Algorithm for Inducing Control Rules for a Dynamic System, Michael Omoniyi Odetayo and D.R. McGregor A System for Learning Process Control Rules with Genetic Algorithms, John J. Grefenstette Some Guidelines for Genetic Algorithms with Penalty Functions, R. Richardson, M. Palmer, Gunar E. Liepins and Mike R. Hilliard Breeding Hybrid Strategies: Optimal Behavior for Oligopolists, Robert E. Marks A SEAGUL Visits the Race Track, Michael de la Maza A Comparative Evaluation of Search Methods Applied to Parametric Design of Aircraft, M. Bramlette and R. Cusic A Genetic Algorithm Approach to the Configuration of Stack Filters, Chee-Hung Henry Chu Genetic Algorithms and Information Accumulation during the Evolution of Gene Regulation, M. Huynen and P. Hogeweg Optimization of Steiner Trees by Genetic Algorithms, J. Hesser, R. Manner and O. Stucky Procedure Learning using a Variable Dimension Solution Space, Kenneth J. Hintz Hierarchical Genetic Algorithms Operating on Populations of Computer Programs, John R. Koza Classifier Systems A Critical Review of Classifier Systems, Stewart W. Wilson & David E. Goldberg The Emergence of Coupled Sequences of Classifiers, Richard L. Riolo Triggered Rule Discovery in Classifier Systems, L. Booker Back Propagation for the Classifier System, Richard K. Belew & Michael Gherrity A Defense of the Bucket Brigade, Tom Westerdale Learning by Analogy in Genetic Classifier Systems, Hayong Harry Zhou and John J. Grefenstette Asymptotic Dynamics of Classifier Systems, M. Compiani, D. Montanari, R. Serra, G. Valastro and P. Simonini The Dynamical Behavior of Classifier Systems, Stephanie Forrest and John H. Miller The Context-Array Bucket-Brigade Algorithm: An Enhanced Approach to Credit- Apportionment in Classifier Systems, Dijia Huang A Rational Reconstruction of Wilson's Animat and Holland's CS-1, Gary Roberts The Emergence of Default Hierarchies in Learning Classifier Systems, Richard L. Riolo Representational Difficulties with Classifier Systems, Dale Schuurmans and Johnathan Schaeffer VCS: Variable Classifier Systems, Lingyan Shu and Johnathan Schaeffer A Study of Rule Set Development in a Learning Classifier System, Robert E. Smith and Manuel Valenzuela-Rendon Rosetta: A Model of Learning Problems, Steven J. Smith and Stewart W. Wilson Boolean Analysis of Classifier Sets, M. Valenzuela-Rendon Neural Networks Towards the Genetic Synthesis of Neural Networks, Steven Alex Harp, Tariq Samad and Aloke Guha Parametric Connectivity: Training of Neural Networks using Genetic Algorithms, T. Caudell and C. Dolan Mapping Neural Networks into Classifier Systems, L. Davis Designing Neural Networks using Genetic Algorithms, Geoffrey F. Miller, Peter M. Todd and Shailesh U. Hegde Machine Learning: A Mathematical Framework for Neural Network, Symbolic and Genetic-Based Learning, G. Deon Oosthuizen Optimizing Neural Networks Using Faster, More Accurate Genetic Search, Darrell Whitley and Thomas Hanson Parallel Genetic Algorithms A Theoretical Investigation of a Parallel Genetic Algorithm, Chrisila C. Pettey and Michael R. Leuze A Parallel Genetic Heuristic for the Quadratic Assignment Problem, Donald E. Brown, Christopher L. Huntley and Andrew R. Spillane Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization, H. Muhlenbein ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy, M. Gorges-Schleuter Fine-Grained Parallel Genetic Algorithms, Bernard Manderick and Piet Spiessens Distributed Genetic Algorithms, Reiko Tanese ------------------------------ Date: Tue 2 May 89 18:23:55-PDT From: [email protected] (Mark Stickel) Reply-to: [email protected] Subject: CADE-10 10th Intl. Conference on Automated Deduction - West Germany CADE-10 10th International Conference on Automated Deduction West Germany July 23-27, 1990 Call for Papers CADE is the major forum at which research on all aspects of automated deduction can be presented. Papers on automated deduction (for classical and nonclassical logics) in the following and related fields are invited: Theorem Proving Decision Procedures Logic Programming Unification Program Verification/Synthesis Inference Systems Term Rewriting Deductive Databases Applications Program Committee Peter Andrews Claude Kirchner William Pase Wolfgang Bibel Jean-Louis Lassez Lawrence Paulson W.W. Bledsoe Donald Loveland Fernando Pereira Alan Bundy Ewing Lusk David Plaisted Robert Constable Michael McRobbie Joerg Siekmann Jean-Pierre Jouannaud Dale Miller Mark Stickel, Chairman Deepak Kapur Hans Juergen Ohlbach Richard Waldinger Matt Kaufmann Ross Overbeek Christoph Walther Original research papers (up to 5,000 words; 15 proceedings pages, 6 X 9 inches, 12 point type, will be allotted) are solicited. Also solicited are system summaries that describe working reasoning systems (2 proceedings pages) and problem sets that provide realistic, interesting challenges for automated reasoning systems (5 proceedings pages). The title page of the submission should include author's name, address, phone number, and E-mail address. Papers must be unpublished and not submitted for publication elsewhere. Late papers and papers that require major revision, including submissions that are too long, will be rejected. Submission receipt deadline: November 27, 1989 Author notification date: February 15, 1990 Camera-ready copy receipt deadline: April 2, 1990 Six paper copies should be sent to arrive by November 27, 1989 to Mark E. Stickel Artificial Intelligence Center SRI International 333 Ravenswood Avenue Menlo Park, CA 94025 U.S.A. Inquiries about CADE can also be sent by electronic mail to [email protected] ************************* PLEASE POST *********************** ------------------------------ Date: 17 May 89 09:02:41 GMT From: ariel%[email protected] (Ariel J. Frank) Subject: Bar-Ilan Symposium on Foundations of AI - Israel BISFAI-89 Bar-Ilan Symposium on the Foundations of Artificial Intelligence 19-21 June 1989 Sponsored by the Research Institute for the Mathematical Sciences Bar-Ilan University, Ramat Gan, Israel with additional support from IBM Israel Martin Golumbic, Symposium Chair Ariel Frank, Organizing Chair Monday, June 19, 1989 09:00 AM - 09:30 AM: Registration and Opening ceremonies 09:30 AM - 10:30 AM: Invited Hour Address Knowledge, Probability and Adversaries Joseph Halpern, IBM Almaden Research Center 10:30 AM - 11:00 AM: Coffee Break 11:00 AM - 12:35 PM: 20 minute presentations -- Logic and Reasoning Pattern-directed invocation with changing equalities Yishai A. Feldman, Weizmann Institute of Science Charles Rich, M.I.T. Abstract Belief Logics for AI: An Approach via Knowledge Automata Larry M. Manevitz, Courant Institute (New York) and Haifa Univ. Computing with prototypes L. Thorne McCarty, Rutgers University A Distributed Algorithm for ATMS Rina Dechter, Technion - Israel Institute of Technology 12:45 PM - 01:45 PM: Lunch 02:00 PM - 03:00 PM: Invited Hour Address Formalized Common Sense Knowledge and Reasoning John McCarthy, Stanford University 03:00 PM - 03:30 PM: Coffee Break 03:30 PM - 04:40 PM: 20 minute presentations -- Logic and Reasoning All we believe fails in impossible worlds: A possible-world semantics for a "knowing at most" operator Shai Ben David, Yael Gafni, Technion - Israel Inst. of Tech. Using hypersequents in proof systems for non-classical logic Arnon Avron, Tel Aviv University The logic of time structures: temporal and nonmonotonic features Neil V. Murray, SUNY at Albany Mira Balaban, Ben Gurion University Tuesday, June 20, 1989 09:30 AM - 10:30 AM: Invited Hour Address Recent Developments in Machine Learning Theory Ronald Rivest, M.I.T. 10:30 AM - 11:00 AM: Coffee Break 11:00 AM - 12:35 PM: 20 minute presentations -- Learning and Reasoning A logical framework for integrating explanation-based learning and similarity-based learning Moshe Koppel, Bar-Ilan University Qualitative analysis of continuous dynamic systems by intelligent numeric experimentation Elisha Sacks, Princeton University On the learnability of infinitary regular sets Oded Maler, Amir Pnueli, Weizmann Institute of Science Barriers, Tools, and the Qualitative Complexity of Processes Yoram Moses and Moshe Tennenholtz, Weizmann Inst. of Science 12:45 PM - 01:45 PM: Lunch 02:00 PM - 03:00 PM: Invited Hour Address The architecture of concepts Johann A. Makowsky, Technion - Israel Institute of Technology 03:00 PM - 03:30 PM: Coffee Break 03:30 PM - 05:00 PM: 20 minute presentations -- Learning and Reasoning Concept Learning via Conceptual Clustering Yoelle S. Maarek, IBM Watson Research Center Reconstruction of polygonal sets by constrained and unconstrained double probing M. Lindenbaum, A. Bruckstein, Technion - Israel Inst. of Tech. Recovering the shape of visible surfaces from stereo shading and texture modules Ignatios E. Vakalis, Western Michigan University The representation and manipulation of the algorithmic probability measure for problem-solving Alex Gammerman, Heriot-Watt University Wednesday, June 21, 1989 09:30 AM - 10:30 AM: Invited Hour Address Graphoids and the representation of dependencies Judea Pearl, U.C.L.A. 10:30 AM - 11:00 AM: Coffee Break 11:00 AM - 12:35 PM: 20 minute presentations - probabilistic and algorithmic aspects Search of the best decision rules with the help of a probabilistic estimate Victor Brailovsky, Tel Aviv University The whole is faster than its parts: efficient algorithm for the small matching problem Amihood Amir, Martin Farach, University of Maryland Partial orders as a basis for KBS semantics Simon P. H. Morgan, University of Exeter John G. Gammack, Steven A. Battle, University of Bristol A set expression based inheritance system Ido Dagan, Alon Itai, Technion - Israel Institute of Tech. 12:45 PM - 01:45 PM: Lunch 02:00 PM - 03:10 PM: 20 minute presentations -- applications An Incremental approach to automating software project scheduling Ali Safavi, Carnegie Mellon University A theoretical framework for incremental scheduling Nicola Muscettola, Carnegie Mellon University Towards an intelligent finite element training system Alex Bykat, University of Tennessee at Chattanooga 03:10 PM - 03:40 PM: Coffee Break 03:40 PM - 05:00 PM: 20 minute presentations -- language Ontology, sublanguage, and semantic networks: three keys to formal foundations of meaning representation in natural-language artificial intelligence (natural language processing) Victor Raskin, Purdue University Theory formation for interpreting an unknown language: a domain metamodel of etruscologists' trials Ephraim Nissan, Ben Gurion University to be announced Ingrid Zukerman, Australia Dr. Ariel Frank, BISFAI-89 Organizing Chair Department of Mathematics and Computer Science Bar-Ilan University, Ramat Gan, ISRAEL (email: [email protected]) E-mail facilities will be available to all Symposium participants. ------------------------------ Date: 19 May 89 17:06:55 GMT From: [email protected] (Milind Tambe) Subject: IKBCS-89, Bombay - Revised Deadlines Subject: IKBCS-89 - Second Call for Papers * Please note the revised deadlines *** IKBCS-89 SECOND CALL FOR PAPERS International Conference on Knowledge Based Computer Systems Dec 11 - 13, 1989 BOMBAY, INDIA The Conference IKBCS-89 is the second in the series of annual conferences of the Knowledge Based Computer Systems (KBCS) Project. The nation-wide KBCS project is sponsored by the Department of Electronics, Government of India with assistance from the United Nations Development Programme. The objective of the conference is to bring together researchers in KBCS and to promote interaction among them. The Advisory Committee The Programme Committee K Apt, CWI, Amsterdam KK Bajaj, DoE, Delhi Arvind, MIT, USA VP Bhatkar, CDAC, Pune M Boden, Univ of Sussex, UK D Dutta Majumder, ISI, Calcutta A Joshi, Univ of Pennsylvania, USA HN Mahabala, IIT, Madras R Kowalski, Imperial College, UK V Rajaraman, IISc, Bangalore CJP Lucena, Rio de Janiero, Brazil PVS Rao, TIFR, Bombay P Saint-Dizier, LSI Univ Paul Sabatier S Ramani, NCST, Bombay France A Togashi, Kohotu University, Japan Topics Original papers are invited on the following topics. Papers in related areas are also welcome. Arrangements have been made for international publication of the proceedings. * Advances in Expert Systems * Logic Programming * AI Applications * Natural Language Understanding * AI and Engineering * Parallel Processing * AI Systems and Software * Pattern Recognition * Computer Architecture * Reasoning * Intelligent Tutoring Systems * Speech * Knowledge Representation * Vision * Learning Address for Correspondence S Ramani Chairman, Programme Committee, IKBCS-89 Phone: +91(22)6201606 National Centre for Software Technology Telex: +81(11)78260 NCST IN Gulmohar Cross Road No 9 E-mail: uunet!shakti!ikbcs Bombay 400 049, INDIA Important Dates Deadlines for submission are listed below. Please note that these dates have been revised since the first Call for Papers. Aug 15, 1989 Draft of paper due Oct 1, 1989 Intimation of acceptance or rejection Nov 1, 1989 Camera-ready version of paper due About Bombay The conference will be held in Bombay, a city on the move, which houses a number of premier RD and educational organizations. The weather in December will be mild; warm clothing will not be re- quired. The normal minimum and maximum temperatures in Bombay in December are 21 C (70 F) and 31 C (88 F). There are several tourist spots in and around Bombay: ancient cave paintings, sculptures, quaint hill-stations and more! ------------------------------ Date: 2 May 89 19:58:41 GMT From: [email protected] (Sue Schuon) Reply-to: [email protected] (Sue Schuon) Subject: Call for Volunteers for Cog. Sci. Society Conference Call for Student Volunteers The Eleventh Annual Conference of the Cognitive Science Society will be held August 16-19, 1989 at the University of Michigan in Ann Arbor, Michigan. This precedes the IJCAI meeting in Detroit the following week. Student volunteers are needed to help with audio-visual, answer questions, and assist with a variety of tasks during the conference. Each volunteer will be expected to work at least four hours. In exchange for your help you will be given free registration and a copy of the proceedings. There will be a mandatory meeting in early August to give information and assignments. If you are interested in volunteering, please send your name, address, phone number and e-mail address to: Sue Schuon CSMIL University of Michigan 701 Tappan Street Ann Arbor, MI 48109-1234 E-mail: [email protected] ------------------------------ Date: 3 May 89 18:49:16 GMT From: hendler%[email protected] (James Hendler) Reply-to: hendler%[email protected] (James Hendler) Subject: Connection Science Special Issue on Hybrid Symbolic/Connectionist Systems CALL FOR PAPERS CONNECTION SCIENCE (Journal of Neural Computing, Artificial Intelligence and Cognitive Research) Special Issue -- HYBRID SYMBOLIC/CONNECTIONIST SYSTEMS Connectionism has recently seen a major resurgence of interest among both artificial intelligence and cognitive science researchers. The spectrum of connectionist approaches is quite large, ranging from structured models, in which individual network units carry meaning, through distributed models of weighted networks with learning algorithms. Very encouraging results, particularly in ``low-level'' perceptual and signal processing tasks, are being reported across the entire spectrum of these models. Unfortunately, connectionist systems have had more limited success in those ``higher cognitive'' areas where symbolic models have traditionally shown promise: expert reasoning, planning, and natural language processing. While it may not be inherently impossible for purely connectionist approaches to handle complex reasoning tasks someday, it will require significant breakthroughs for this to happen. Similarly, getting purely symbolic systems to handle the types of perceptual reasoning that connectionist networks perform well would require major advances in AI. One approach to the integration of connectionist and symbolic techniques is the development of hybrid reasoning systems in which differing components can communicate in the solving of problems. This special issue of the journal Connection Science will focus on the state of the art in the development of such hybrid reasoners. Papers are solicited which focus on: Current artificial intelligence systems which use connectionist components in the reasoning tasks they perform. Theoretical or experimental results showing how symbolic computations can be implemented in, or augmented by, connectionist components. Cognitive studies which discuss the relationship between functional models of higher level cognition and the ``lower level'' implementations in the brain. The special issue will give special consideration to papers sharing the primary emphases of the Connection Science Journal which include: 1) Replicability of Results: results of simulation models should be reported in such a way that they are repeatable by any competent scientist in another laboratory. The journal will be sympathetic to the problems that replicability poses for large complex artificial intelligence programs. 2) Interdisciplinary research: the journal is by nature multidisciplinary and will accept articles from a variety of disciplines such as psychology, cognitive science, computer science, language and linguistics, artificial intelligence, biology, neuroscience, physics, engineering and philosophy. It will particularly welcome papers which deal with issues from two or more subject areas (e.g. vision and language). Papers submitted to the special issue will also be considered for publication in later editions of the journal. All papers will be refereed. The expected publication date for the special issue is Volume 2(1), March, 1990. DEADLINES: Submission of papers June 15, 1989 Reviews/decisions September 30, 1989 Final rewrites due December 15, 1989. Authors should send four copies of the article to: Prof. James A. Hendler Associate Editor, Connection Science Dept. of Computer Science University of Maryland College Park, MD 20742 USA Those interested in submitting articles are welcome to contact the editor via e-mail ([email protected] - US Arpa or CSnet) or in writing at the above address. ------------------------------ Date: Tue, 2 May 89 22:35:02 edt From: Daniel Leary <[email protected]> Subject: 3rd Conference on Reasoning About Knowledge - 1990 Please Post Please Distribute THIRD CONFERENCE ON THEORETICAL ASPECTS OF REASONING ABOUT KNOWLEDGE CALL FOR PAPERS The 3nd Conference on Theoretical Aspects of Reasoning about Knowledge, sponsored by IBM Research, Almaden Research Cen- ter, will be held March 4-7, 1990, at the Asilomar Confer- ence Center in Pacific Grove, California. While research in this area has traditionally been done by philosophers and linguists, reasoning about knowledge has recently been shown to be of great relevance to Artificial Intelligence, Computer Science and Economics. The aim of the conference is to bring together researchers from these various disci- plines in order to further our theoretical understanding of reasoning about knowledge. Topics of interest include, but are not limited to: o Semantic Models for Knowledge and Belief o Decision Procedures and Proof Systems o Resource-bounded Reasoning o Probabilistic Knowledge o Minimal Knowledge Proof Systems o Analyzing Distributed Systems via Knowledge o Knowledge Acquisition and Learning o Knowledge and Commonsense Reasoning o Knowledge, Planning, and Action o Knowledge in Economic Models You are invited to submit 15 copies of a detailed abstract (not a complete paper) to the program chairperson: Rohit Parikh Ph.D Program in Computer Science City University Graduate Center 33 West 42nd Street New York, NY 10036-8099, USA Phone: 212-642-2201, 914-834-5681 E-address: [email protected], [email protected] 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 (4,000 words). It is understood that the research reported in the abstract is or- iginal, is submitted exclusively to this conference, and its publication in a journal is not imminent Papers arriving late or departing significantly from these guidelines risk immediate rejection. The program committee consists of Nicholas Asher (University of Texas at Austin), Cristina Bicchieri (University of Chicago), Fred Dretske (University of Wisconsin), Jon Doyle (MIT), Ronald Fagin (IBM Almaden Research Center), Mike Fischer (Yale University), Haim Gaifman (Hebrew University), John Geanakopolos (Yale University), Shafi Goldwasser (MIT), Kurt Konolige (SRI International), Isaac Levi (Columbia Uni- versity), Rohit Parikh (City University of New York), and Robert Stalnaker (MIT) The deadline for submission of abstracts is August 21, 1989. Authors will be notified of acceptance by October 30, 1989 (authors who supply an electronic address might be notified earlier). The accepted papers will be due by December 8, 1989. Accepted papers will be published in the conference proceedings, which will be distributed at the conference and will be subsequently available for purchase through the pub- lisher. We plan 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 ac- cepted papers. We hope to be able to partially subsidize participants' expenses. For further information contact the conference chairperson: Moshe Y. Vardi, IBM Research, Almaden Research Center K53-802, 650 Harry Rd., San Jose, CA 95120-6099, USA, Phone: 408-927-1784, E-mail: [email protected], [email protected]. ------------------------------ Date: Mon, 22 May 89 21:27:04 CDT From: [email protected] (Raghu Ramakrishnan) Subject: PODS-90 Symposium on Principles of Database Systems - 1990 CALL FOR PAPERS Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) Nashville, Tennessee, April 2-4, 1990 The conference will cover new developments in both the theoretical and practical aspects of database and knowledge-base systems. Papers are solicited which describe original and novel research about the theory, design, specification, or implementation of database and knowledge-base systems. Some suggested, although not exclusive, topics of interest are: complex objects, concurrency control, database machines, data models, database programming languages and persistent programming, data structures, deductive databases, distributed systems, incomplete information, knowledge representation and nonmonotonic reasoning, object-oriented databases, performance evaluation, physical and logical design, query languages, query optimization, spatial and temporal data, and transac- tion management. You are invited to submit eleven (11) copies of a detailed abstract (not a complete paper) to the program chair: Yehoshua Sagiv - PODS Department of Computer Science Stanford University Stanford, CA 94305 [email protected] (415) 723-1512 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 contributions of the work; 2) explain the importance of the work - its novelty and its practical or theoretical relevance to database and knowledge-base sys- tems; and 3) include comparisons with and references to relevant litera- ture. Abstracts should be no longer than ten double-spaced pages. Devi- ations from these guidelines may affect the program committee's evalua- tion of the paper. Program Committee Vassos Hadzilacos C. Mohan Richard Hull Shamim Naqvi Yannis E. Ioannidis Doron Rotem Paris C. Kanellakis Yehoshua Sagiv Michael Kifer Allen Van Gelder The deadline for submission of abstracts is October 9, 1989. Authors will be notified of acceptance or rejection by December 6, 1989. The accepted papers, typed on special forms, will be due at the above address by January 10, 1990. All authors of accepted papers will be expected to sign copyright release forms, and one author of each accepted paper will be expected to present the paper at the conference. Proceedings will be distributed at the conference, and will be subse- quently available for purchase through the ACM. General Chair Local Arrangements Chair Daniel J. Rosenkrantz Patrick C. Fischer Dept. of Computer Science Dept. of Computer Science State University of NY at Albany Box 1679B, Vanderbilt University Albany, NY 12222 Nashville, TN 37235 [email protected] [email protected] ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA27916; Wed, 24 May 89 16:47:17 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA27916; Wed, 24 May 89 16:47:17 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa23792; 24 May 89 18:23 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.132	AIList Digest V9 #14	HERON::ROACH	TANSTAAFL !	`Tue Jul 04 1989 17:00`	323
	Printed by: Pat Roach Document Number: 007825 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 02-Jul-1989 09:45am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@DELOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #14 AIList Digest Saturday, 1 July 1989 Volume 9 : Issue 14 Seminars: KB Machine Translation at CMU - Sergei Nirenburg Simulation Using Logic Programming - Mandy Haggith The Proper Place of Connectionism - Stevan Harnad An Intelligent Tutoring System for Programming - Brian J. Reiser Computational Value Analysis - David Klein ---------------------------------------------------------------------- Subject: KB Machine Translation at CMU - Sergei Nirenburg From: "Damaris M. Ayuso" <[email protected]> Date: Mon, 5 Jun 89 18:58:53 EDT BBN STC Science Development Program AI Seminar Series Lecture RESEARCH IN MACHINE TRANSLATION AT CARNEGIE MELLON UNIVERISTY SERGEI NIRENBURG School of Computer Science Carnegie Mellon University BBN STC, 2nd floor large conference room 10 Moulton St, Cambridge MA, 02138 Friday June 9th, 10:30 AM I will give an overview of KBMT-89, a knowledge-based machine translation project at the CMU Center for Machine Translation, which resulted in producing a working prototype MT system. Since it is unrealistic to hope to cover the entire material in less than an hour, I will then concentrate on one or more components of the system, as time permits. I would also like to discuss the lessons we learned from the work on this project about the difficulties and tasks in developing knowledge-based MT systems. The specifications of our MT system are as follows: Source languages: English and Japanese Target languages: English and Japanese; Translation paradigm: Interlingua Computational architecture: A distributed, coarsely parallel system Domain of translation: IBM PC installation manuals. The knowledge acquired for the system includes: * An ontology (domain model) of about 1,500 concepts * Analysis lexicons: about 800 open-class lexical units of Japanese and about 900 such units of English * Generation lexicons: about 800 open-class lexical units of Japanese and about 900 such units of English * Analysis grammars for English and Japanese * Generation grammars for English and Japanese * Specialized syntax <---> semantics structural mapping rules. The underlying formalisms that were developed for the use in this system are: * The knowledge representation system FrameKit * A language for representing domain models (a semantic extension of FrameKit) * Specialized grammar formalisms, based on Lexical-Functional Grammar * A language for representing text meanings (the interlingua) The procedural components of the system include: * A syntactic parser with a semantic constraint interpreter; * A semantic mapper for treating additional types of semantic constraints; * An interactive augmentor for treating residual ambiguities; * A semantic generator producing syntactic structures of the target language, complete with lexical insertion; * A syntactic generator, producing output strings based on the output of the semantic generator. The support and environment facilities in KBMT-89 include: * A knowledge acquisition tool for acquiring ontologies and lexicons, ONTOS; * A knowledge acquisition tool for acquiring grammars; and * Testing environments for analysis, augmentation and generation. ================================================================= ------------------------------ Date: 9 Jun 89 13:22:22 GMT From: [email protected] (Paul Fishwick) Organization: UF CIS Department Subject: Simulation Using Logic Programming - Mandy Haggith ----------------------CIS COLLOQUIUM SERIES----------------------------- -----------Department of Computer and Information Sciences-------------- ----------------------University of Florida----------------------------- -------------------------Gainesville, FL-------------------------------- The EcoLogic System: A Simulation System using Logic Programming Ms. Mandy Haggith Department of Computer Science Edinburgh University Scotland Time: 10:00PM - 11:30PM Date: Tuesday, June 13th Place: Large Conference Room, Room 305 Building CSE ABSTRACT Many ecologists wish to test out hypotheses about a particular ecological system by constructing and manipulating a mathematical model of that system. A convenient and powerful way of doing this is to write and run a simulation program implementing the appropriate mathematical model. Unfortunately many ecologists do not have, and do not want to learn, the various programming techniques necessary to construct simulation programs themselves. A valuable tool for such ecologists, therefore, would be a computer system which would help them to describe their ecological systems in ecological terminology, and would use this information to construct appropriate simulation programs. The aim of the ECO project is to build such a tool. A prototype system meeting these requirements, called EcoLogic (EL), has been constructed and is the subject of several ECO papers. My talk will be an overview of current work on the ECO project, motivated and illustrated by an example ecological model of the seal populations in the North Sea, which are suffering a viral epidemic. I shall outline how EL works, and indicate some of its major weaknesses. These include its inability to cope with incomplete ecological descriptions, problems with its user-interface, and the limit to the range of ecological models which it can construct. My research task is to correct these weaknesses, so the majority of the talk will be a discussion of the solutions with which I am experimenting. ------------------------------ Date: 16 Jun 89 06:09:24 GMT From: [email protected] (S. R. Harnad) Organization: Princeton University, NJ Subject: The Proper Place of Connectionism - Stevan Harnad ON THE PROPER PLACE OF CONNECTIONISM IN MODELLING OUR BEHAVIORAL CAPACITIES (Abstract of paper presented at First Annual Meeting of the American Psychological Society, Alexandria VA, June 11 1989) Stevan Harnad, Psychology Department, Princeton University, Princeton NJ 08544 Connectionism is a family of statistical techniques for extracting complex higher-order correlations from data. It can also be interpreted and implemented as a neural network of interconnected units with weighted positive and negative interconnections. Many claims and counterclaims have been made about connectionism: Some have said it will supplant artificial intelligence (symbol manipulation) and explain how we learn and how our brain works. Others have said it is just a limited family of statistical pattern recognition techniques and will not be able to account for most of our behavior and cognition. I will try to sketch how connectionist processes could play a crucial but partial role in modeling our behavioral capacities in learning and representing invariances in the input, thereby mediating the "grounding" of symbolic representations in analog sensory representations. The behavioral capacity I will focus on is categorization: Our ability to sort and label inputs correctly on the basis of feedback from the consequences of miscategorization. -- Stevan Harnad INTERNET: [email protected] [email protected] [email protected] [email protected] [email protected] CSNET: harnad%[email protected] BITNET: [email protected] [email protected] (609)-921-7771 ------------------------------ Subject: An Intelligent Tutoring System for Programming - Brian J. Reiser From: "Damaris M. Ayuso" <[email protected]> Date: Mon, 19 Jun 89 14:36:41 EDT BBN STC Science Development Program AI Seminar Series Lecture KNOWLEDGE REPRESENTATION AND EXPLANATION IN AN INTELLIGENT TUTORING SYSTEM FOR PROGRAMMING Brian J. Reiser Princeton University [email protected] BBN STC, 2nd floor large conference room 10 Moulton St, Cambridge MA, 02138 Friday June 23rd, 10:30 AM I will describe an intelligent tutoring system for programming called GIL (Graphical Instruction in LISP) that constructs explanations directly from the content of its problem solving knowledge. GIL provides feedback by comparing a student's solution to its problem solving model. GIL's problem solving rules not only encode what step to take in each problem situation, but also can reason about why each step is effective. Explanations are constructed dynamically rather than being prepared in advance for each situation in which feedback is required. The tutor is embedded in a graphical programming environment so that students work in a medium that more closely corresponds to their planning operations. GIL produces reasonable explanations for a wide variety of errors concerning approximately 200 rules and high-level plans used in an introductory programming lesson. I will describe studies of students learning to program using GIL and working with human tutors, and consider: (1) how GIL's graphical representation facilitates students' reasoning, (2) how GIL's explanations enables students to learn more effectively from their errors, and (3) the ways in which the pedagogical strategies and effectiveness of human tutors are modeled in GIL. ------------------------------ Date: Mon, 26 Jun 89 15:30:19 -0400 From: [email protected] Subject: Computational Value Analysis - David Klein Dissertation Defense University of Pennsylvania COMPUTATIONAL VALUE ANALYSIS David Klein This dissertation presents Computational Value Analysis (CVA), a framework for explaining and refining choices among competing alternatives in the context of intelligent systems. CVA increases the transparency of value theory, a formal model of choice, to provide a framework for modeling choices that is both formal and transparent. The components of CVA include (1) an interpretation of value theory that provides an intuitive yet formally sound vocabulary for talking about choices, (2) a set of strategies for explaining choices, and (3) a set of strategies for refining choices. CVA at once addresses problems in artificial intelligence (AI) and in decision analysis (DA). From an AI perspective, CVA provides a general foundation for building formally justifiable, intelligible, modifiable systems for choosing among alternatives. A secondary contribution of the work to AI is a set of observations concerning formality and transparency; although previous approaches to modeling choices in a systems context generally have reflected a view of formality and transparency as competitive properties of representations, our experience developing CVA suggests that these properties are synergistic. Finally, the dissertation outlines a potential approach to employing other formal models in the context of intelligent systems. From a DA perspective, CVA addresses problems of transparency. First, CVA can potentially increase the acceptance of decision-theoretic advice by providing methods for justifying that advice in intuitive terms. Second, CVA provides a means for managing bias in parameter assessment; the framework provides users with an opportunity to observe the step-by-step effect of a parameter value on the final result, so that users' responses are less likely to be influenced by the fashion in which parameter-assessment questions are posed. Third, CVA can potentially reduce the demands on parameter-assessment methods by providing for the incremental repair of model parameters. Finally, the framework provides an approach to the problem of managing changing preferences over time. 4:30 pm, June 28, 1989 Moore 554 University of Pennsylvania COMMITTEE ------------------------- T.W. Finin (advisor) E.H. Shortliffe (advisor) N.I. Badler E.K. Clemons A.K. Joshi M.O. Weber ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA04778; Sat, 1 Jul 89 23:20:08 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA04778; Sat, 1 Jul 89 23:20:08 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa12034; 2 Jul 89 1:50 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.133	AIList Digest V9 #15	HERON::ROACH	TANSTAAFL !	`Tue Jul 04 1989 17:03`	1001
	Printed by: Pat Roach Document Number: 007828 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 03-Jul-1989 09:57am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@STATOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #15 AIList Digest Saturday, 1 July 1989 Volume 9 : Issue 15 Conference Announcements: Computational Neuroscience Symposium Conference on Dictionaries in the Electronic Age Special Interest Groups at NACLP89 Bio-Matrix'89 Meeting Announcement Conference on The Concept of Predication NIPS Schedule Update 2nd ITESM Conference on AI - Monterey, Mexico IEEE Application Conference ---------------------------------------------------------------------- Date: 31 May 89 20:17:28 GMT From: [email protected] (Jim Brule) Organization: Northeast Parallel Architectures Center, Syracuse NY Subject: Computational Neuroscience Symposium Preliminary Announcement: Computational Neuroscience and Parallel Computing October 23-24, 1989 Sheraton University Inn and Conference Center Syracuse, NY sponsored by: Northeast Parallel Architectures Center (NPAC) Syracuse University Syracuse, NY Symposium Chair: Erich Harth, Syracuse University Program Committee: Michael Arbib, USC James Brule', NPAC Erich Harth, SU J. Alan Robinson, SU Charles Stormon, Coherent Research Inc. Thomas Schwartz, TJ Schwartz Associates Great strides are being made in the fields of neuroscience and parallel computing. This is in part due to the technological advances made in support of each field, allowing scientists to further their work more effectively. The rapid progress in each field has led to an overlap between them. Work that takes place in this overlap is beginning to gain stature as a field in its own right. This fledgling discipline has come to be known as "Computational Neuroscience." It has found itself at the center of much attention and controversy. As such, Computational Neuroscience has generated both enthusiasm and caution among researchers. The goal of this Symposium is to explore this overlap with the intent of discovering the richest opportunities for research there. Invited neuroscientists and computer scientists will speak, and lead panel discussions and roundtable exchanges. A total of seven invited lectures and two panels will be presented. The following topics are a partial representation of the final program: Connectionism and Massively Parallel Systems Neural Networks Computational Neuroscience Dynamic Link Architectures Application Areas (panel) Implementation Issues (panel) In an effort to promote meaningful exchange, attendance will be limited to 125. Fees: $385 until August 31, 1989; $450 thereafter. 5% discount for members in good standing of IEEE or INNS For more information contact: James F. Brule', Ass't Dir. for Research Programs Northeast Parallel Architectures Center (NPAC) Center for Science and Technology 111 College Place Syracuse University Syracuse, NY 13244 (315) 443-3924 -- Thirty thousand mighty suns shone down in a soul- [email protected] searing splendor that was more frighteningly cold ************************* in its awful indifference than the bitter wind * Isaac Asmiov that shivered across the cold, horribly bleak world.* "Nightfall" ------------------------------ Date: 2 Jun 89 03:36:13 GMT From: [email protected] (Donald E Walker) Subject: Conference on Dictionaries in the Electronic Age DICTIONARIES IN THE ELECTRONIC AGE Fifth Annual Conference of the University of Waterloo Centre for the New OED Jointly presented by Oxford University Press Oxford University Computing Service University of Waterloo St. Catherine's College, Oxford, England -- 18-19 September 1989 (For associated workshops on Dictionary Assessment and Criticism and on Developing Lexical Resources, see below.) "The complete Oxford English Dictionary ... likely to be very manageable indeed when compressed into the electronic microstructure of a chip." - Christopher Evans, "The Mighty Micro", 1979 Once it had become clear that computers could be used in the composition, analysis, and transmission of written texts, it was a natural step to try to yoke them together with dictionaries, the most complex of texts both to compile and to analyse. Pioneering early efforts were made during the 1950s and 1960s, when storage was limited and data entry was by punched card. The first dictionaries actually compiled in the form of a computer database appeared in the late 1970s. By this time professional analysts of language such as linguists and computer scientists had begun to realize that the dictionary was a ready-made mine of language. If it could be electronically analysed they would be freed from much of the labour of collecting or introspecting linguistic patterns. During the 1980s a fruitful symbiosis has grown up between lexicography, computing, and linguistics. Increasingly, dictionaries are designed as computer databases and compiled with the assistance of textual corpora. The lexicographer's desk has been reinterpreted as a multi- functional workstation. Linguists are exploiting the full resources of machine-readable dictionaries in order to build comprehensive models of linguistic data. Computer scientists are able to take over the information network built into the dictionary as a kind of ready-made expert system. In 1984 the "Oxford English Dictionary" became the first large dictionary to be converted from printed format into a machine-readable database. In March this year the second edition of the OED was published, the offspring of a successful marriage of lexicography and computer technology. To mark this achievement this Fifth Annual Conference is being held at Oxford rather than at Waterloo. The publication of the new edition of the OED, together with the development, at the University of Waterloo Centre for the New OED, of programs for the rapid searching of large textual databases like the OED, and the appearance of a CD-ROM version of the first edition of the OED, are pointers towards the fulfilment of Evans's prediction. CONFERENCE PROGRAMME Sunday, 17 September 2.00-6.00 p.m. Registration, Porter's Lodge 6.00 p.m. Registration and Reception, Junior Common Room 7.00 p.m. Dinner, Dining Hall Monday, 18 September 8.30 a.m. Registration SESSION I Developing Lexical Resources Donald E. Walker, Bellcore Editing the OED in the Electronic Age Edmund S.C. Weiner, Oxford University Press Demonstration: Lexicographical Workstations Nicoletta Calzolari and Eugenio Picchi, Istituto di Linguistica Computazionale SESSION II La Constitution de la documentation du Tresor de la langue francaise: problemes et methodes Gerard Gorcy, Institut National de la Langue Francaise The Corpus of the Dictionary of Old English: Its Delimitation, Compilation and Application Ashley Crandell Amos, University of Toronto 7.00 p.m. Banquet, Dining Hall Guest speaker: Sir Randolph Quirk, University College London Tuesday, 19 September SESSION III The Concrete Lexicon and the Abstract Dictionary Martin Kay, Xerox PARC Lexicons for Computer Programs and Lexicons for People Sergei Nirenburg, Carnegie-Mellon University SESSION IV Discovering Relationships Among Word Senses Roy J. Byrd, IBM Research Center What is Text? Frank W. Tompa, University of Waterloo SESSION V Panel Discussion: Present and Future Challenges Panelists: Gaston H. Gonnet (Introducer), University of Waterloo Beryl T.S. Atkins, Oxford University Press Reinhard R.K. Hartmann, University of Exeter Michael E. Lesk, Bellcore Conference Chairman: Timothy J. Benbow, Oxford University Press Nominating Committee Chairman: Gaston H. Gonnet, University of Waterloo CONFERENCE ARRANGEMENTS: All Conference activities will take place at St Catherine's College, Oxford, with the main sessions taking place in the Bernard Sunley Building. ACCOMMODATION: Conference and workshop accommodation will be arranged in single study-bedrooms in St Catherine's College, Oxford. Most of these bedrooms have wash-basins, and there are washing and shower facilities on each floor. Soap, linen, and hand- towels are provided. TRANSPORT: There is a frequent coach service to Oxford from both Gatwick and Heathrow airports, and many trains (Paddington station) and coaches (Victoria coach station) from London. Timetables will be forwarded with the Conference information package to those who register. CONFERENCE FEES (in pound sterling): Basic fees cover all conference sessions, one copy of the conference proceedings, the reception, two lunches (Mon. and Tues.), two dinners (Sun. and Tues.), mid-session refreshments, and the banquet on Monday evening. Resident fees include the basic fees plus Sunday, Monday and Tuesday night bed and breakfast at St Catherine's College. All optional fees (see below) are additional to the conference fees. Registration must be received by 31 August 1989. If space permits, late registration will be available at an additional cost of L20.00. All fees must be paid in pounds sterling. Please make cheques payable to Oxford University Press. Access, Visa, and Barclaycard (MasterCard) credit cards will be accepted. The conference information package will be forwarded upon receipt of registration. Basic fees: Academic L149.50 Non-academic L287.50 Resident fees: Academic L207.00 Non-academic L345.00 There will be a late registration fee (after 31 August) of L20.00. Note: All charges include 15 per cent UK Value Added Tax where applicable. Additional conference proceedings will be available at L10.00 per copy. ASSOCIATED WORKSHOPS Both workshops will be held at St Catherine's College, Oxford. DICTIONARY ASSESSMENT AND CRITICISM Sunday, 17 September 1989: 10 a.m.-5 p.m. Organized by EURALEX Participants at the 1988 biennial EURALEX General Meeting in Budapest will recall requests for a more practical and explicitly lexicographical orientation to the Association's activities. Thus, this workshop has been organized to: 1. provide an introduction to the topic and to allow participants to work in small groups at an assessment of one dictionary and/or a comparison of two or more works, and 2. make suggestions for the structure and contents of the section on Dictionary Assessment and Criticism at the next EURALEX International Congress, in Malaga, August 28- September 2, 1990. The workshop should prove of interest to lexicographers, publishers, language teachers, linguists, researchers, reviewers and anyone else who uses dictionaries: in fact, to all types of dictionary producers and consumers. Euralex Workshop Fee: Member L22.00 Non-member L25.00 Includes lunch and refreshment breaks. DEVELOPING LEXICAL RESOURCES Wednesday, 20 September 1989, 9.30 a.m.-4 p.m. Organized by the Association for Computational Linguistics and Bellcore We need to resolve the conflicts of interest that appear to exist among publishers, software developers, and the research community. The research community needs resources to do its work. The publishers have source materials but are concerned with protecting their intellectual property rights. The software developers are trying simultaneously to create tools and a market in which to use them. This open meeting will present the perspectives of these protagonists and attempt to work out strategies for resolving the perceived conflicts in ways that will be beneficial to all parties. There is no fee for this Workshop. However, please respond on the Conference registration form if you plan to attend, or contact Don Walker at the address below. INFORMATION For further information about the Conference and the EURALEX Workshop, contact either Katherine Manville (ext. 4533) or Sandra Johnston (ext. 4530) at: Dictionary Department Oxford University Press Walton Street Oxford OX2 6DP England Telephone: (0865) 56767 International: + 44 865 56767 Internet: [email protected] For information about the Workshop on Developing Lexical Resources, contact: Dr. Donald E. Walker (Oxford) Bellcore, MRE 2A379 445 South Street, Box 1910 Morristown, NJ 07960-1910, USA telephone: (+1 201) 829-4312 fax: (+1 201) 292-0067 internet: [email protected] usenet: uunet.uu.net!bellcore!walker ------------------------------ Date: 8 Jun 89 14:59:40 EDT From: Catherine Lassez <[email protected]> Subject: Special Interest Groups at NACLP89 NACLP89 Special Interest Group Sessions CALL FOR SUBMISSIONS Submissions are sought for special interest group meetings to take place in conjunction with the North American Logic Programming Conference in Cleveland, Ohio October 16-20, 1989. These sessions are intended as a forum for people sharing a common interest in an area of Logic Programming (from theory, to implementation issues to application domains). The sessions will be informal and can have a duration of half a day or more. Please send BEFORE JULY 7 your submission, including name, address (email, Fax number, ...), affiliation, title of proposed session and brief description of subject as well as intended duration to: Catherine Lassez email address: LASSEZ at IBM.COM Fax #: (914) 789 7455 (attention: C. Lassez) ------------------------------ Path: burdvax!overt@antony From: [email protected] (Christian Overton) Newsgroups: comp.ai.digest Subject: Bio-Matrix'89 Meeting Announcement Date: 9 Jun 89 15:02:40 GMT Reply-To: [email protected] (Christian Overton) Organization: Unisys - Paoli Research Center Paoli, PA Lines: 104 CALL FOR PARTICIPATION: CONFERENCE ON THE MATRIX OF BIOLOGICAL KNOWLEDGE Aug. 18-19, 1989 White Mountain Conference Center, Waterville Valley, NH Biological systems are characterized by complex relationships among their components. It is becoming increasingly clear that further rapid advances in our understanding of these systems depends on our ability to structure, access and analyze the rapidly expanding volume of experimental data and accumulated knowledge needed to elucidate these relationships. To that end, a ``Matrix of Biological Knowledge'' (Bio-Matrix) has been proposed in which biological databases would be integrated into a cohesive whole and interfaced to a knowledge base containing a structured representation of biological knowledge. The resulting system would be used as the foundation for the analysis of a range of biological problems. The Bio-Matrix project requires an interdisciplinary approach combining expertise from both the biological and computer science communities. This meeting is designed to explore the issues and approaches towards implementing the Bio-Matrix and to foster the necessary interchange among the various computer science and biological disciplines. Topics to be addressed include: o Examples and status of current biological databases. DBs include information resources for biosequences, genetics, macromolecular structure, systematics, toxicology, etc. and the associated literature. o Approaches to database integration. These include the range from straightforward database merges to integration of multiple heterogeneous, distributed databases. o Next generation database systems. Much information of biological interest, e.g., graphics, pictures, text, and biosequences, is not well suited to current commercial database technology. Alternatives such as object-oriented databases, hypertext and multi-media databases are needed. o Automation of Knowledge Acquisition. A major stumbling block in building the Bio-Matrix is the task of entering the enormous volume of knowledge and data into the system. Methodologies to overcome this block must be developed. o Integrating Knowledge-Based/Expert Systems, Database Systems and Analysis Tools. Analysis of biological problems is knowledge and data intensive. How should systems be designed to automate this process? o Theory of Biological Knowledge Representation and Techniques for Reasoning in the Biological Domain. How do we best represent biological knowledge both for task specific applications and as part of a general theory of biological knowledge? Many key biological insights have been driven by reasoning about analogies and homologies in systems both within and between species. Methods for representing these relationships and to assist in reasoning about them are central to the Bio-Matrix concept. Similarly, models of biological systems can be viewed both as a description of the system and as a tool for reasoning about the system. As problems of increasing complexity are addressed by biologists, the need for representing and reasoning with models becomes more critical. The conference will be organized as a two day meeting following and coordinated with the 1989 MacroMolecules, Genes and Computing II Meeting to be held Aug. 13-17, 1989 at the same site. The Bio-Matrix Conference will include invited speakers, poster sessions and workshops. Invited speakers will be chosen on the basis of a short (less than 500 word) abstract describing their work. All others attending the meeting are encouraged to submit a poster. One of the primary aims of the meeting is to foster the dialog between computer scientists and biologists that is necessary for the success of the Bio-Matrix project. To that end, workshops will include both tutorials to educate biologists in the potential benefits of recent computer science research, and to educate computer scientists in the front-line problems of interest to the biologists. In the latter category, one workshop, ``Concepts in Biology for Computer Scientists'', is designed to introduce computer scientists to areas of biological research, such as the Human Genome Sequencing Projects, where use of computers will play a major role in the success of the project. Proposals for workshops and tutorials are invited at this time. Again, proposals should be less than 500 words. Proposals and abstracts should be submitted by June 15th with notification of acceptance by July 5th. Acceptance of a proposal or abstract is not a requirement for attendance, but funding for travel, room and board will be limited to those selected to present material. Cost of the meeting is moderate: There is no conference fee and room and board is approximately $130 per day. We especially encourage the participation of computer scientists who are interested in working in the domain of biology to use this opportunity to establish contacts with biologists. Submit electronically or by mail to: Dr. G. Christian Overton Unisys Paoli Research Center PO Box 517 Paoli, PA 19301 (215) 648-7533 [email protected] -- ------------------------------ Date: Fri, 9 Jun 89 11:17:40 EDT From: [email protected] (William J. Rapaport) Subject: Conference on The Concept of Predication School of Humanities, University of California at Irvine and University of California Humanities Research Institute present a conference on PROBLEMS AND CHANGES IN THE CONCEPT OF PREDICATION August 21 - August 26, 1989 338 Administration Building University of California at Irvine The purpose of this conference is to bring together scholars with a broad range of expertise on the subject of predication, extending from ancient and medieval philosophy to the philosophy of science and com- puter science, in order both to investigate the nature of the tradi- tional conception of predication and to assess various challenges to this conception. Historically, the topic originates with the ancient Greek philosophers, most importantly (though by no means exclusively) with Aristotle. Pred- ication, whether conceived as a property of statements or as a relation between certain parts of a statement, is unarguably one of the most fun- damental philosophical concepts. Since Aristotle's time, various aspects of his account of science, and the theory of predication that goes with it, have been subjected to vigorous debate, and many of his theses have, in the course of time, met with widespread rejection. Nonetheless, the Aristotelian conception and its various descendents are still the subject of intense debate. The sources of this contemporary interest are many and diverse, ranging from developments in metaphysics and literary theory to developments in recent physics. The discussion should illuminate ways in which the important philosophical concept of predication influences, and is influenced by, the manifold disciplines on which it impinges. PARTICIPANTS Frank Arntzenius, Harvard University and University of Southern California James Bogen, Pitzer College Jeffrey Bub, University of Maryland Alan Code, University of California at Berkeley Maxwell Cresswell, Victoria University, J. Michael Dunn, Indiana University Kit Fine, UCLA Malcolm Forster, University of Wisconsin Karel Lambert, University of California at Irvine Frank Lewis, University of Southern California Carl Posy, Duke University William J. Rapaport, SUNY Buffalo Erhard Scheibe, University of Heidelberg Bas van Fraassen, Princeton University The conference is free and open to the public, but advance registration is encouraged. To recieve information, please contact: Ann Holland UCI Conference Services 105 Administration Irvine, CA 92717 714-856-6963 ------------------------------ Date: Mon, 19 Jun 89 08:51:16 -0400 From: [email protected] (Stephen J Hanson) Subject: NIPS Schedule *******NIPS UPDATE****** Deadline for abstracts and summaries was May 30, 1989. We have now received over 460 contributions (almost 50% more than last year!). They are now logged in, and cards acknowledging receipt will be mailed next week to authors. Authors who have not received an acknowledgement by June 30 should write to Kathie Hibbard at the NIPS office; it's possible we got your address wrong in our database, and this will help us catch these things. Refereeing will take July. Collecting the results and defining a final program will be done in August. We plan to mail letters informing authors of the outcome during the first week of September. At that time, we will send all registration material, information about prices, and a complete program. If you haven't heard from us in late September, again please write, to help us straighten things out. ******NIPS UPDATE******* ------------------------------ Date: 26 June 1989, 09:38:57 EDT From: ISAI at TECMTYVM Subject: 2nd ITESM Conference on AI - Monterey, Mexico ITESM - CENTRO DE INVESTIGACION EN INFORMATICA SECOND INTERNATIONAL SYMPOSIUM ON ARTIFICIAL INTELLIGENCE OCTOBER 23 TO 27, 1989 MONTERREY, N.L. MEXICO The Centro de Investigacion en Informatica (Informatic Research Center) of the Instituto Tecnologico y de Estudios Superiores de Monterrey(ITESM) is organizing the Second International Symposium on Artificial Intelligence to be held in Monterrey, Mexico on October 23-27, 1989. The Symposium is sponsored by the ITESM in cooperation with the AAAI, IBM, Apple and SMIA. GOALS .- Our goals are to present recent advances in the Artificial Intelligence technology and to promote the use of Knowledge Based Systems (KBS) in solving problems in industry and business, as well as to show current Artificial Intelligence applications from all the world. PROGRAM .- The Symposium consists of a Tutorial and a Conference. TUTORIAL .- October 23 and 24. The tutorial program includes general topics as well as advanced ones. Topics covered in the Tutorials include .- Introduction to Artificial Intelligence. Introduction to Expert Systems. Evaluating and Selecting Knowledge Engineering Tools. Knowledge Representation. Logic Programming INSTRUCTORS ===>>> Randy Goebel (University of Alberta), Masaru Tomita (Carnegie Mellon University), Richard Mayer (Texas A&M University). CONFERENCE .- October 25,26 and 27. The program will consist of high quality invited papers (guest speakers) and selected papers from the --Call for Papers-- invitation. We asked for papers covering a wide range of topics including => Knowledge Acquisition. Evaluating Knowledge Engineering Tools. Machine Learning. Knowledge Representation. Verification and Validation of Expert Systems. Constraint Directed Reasoning. Uncertainty Management. Neural Networks. Natural Language. Truth Maintenance Systems. Managing Expert Systems Projects. Future trends and impact of KBS technology. Impact of KBS in organizations. Applications in Manufacturing, Finance, Business and Medicine. The selection of papers and the format of the meeting will be determined by the Program Committee: Wolfgang Bidel => Technische Hochschule Darmstadt Robert Cartwright => Rice University Francisco Cervantes => UNAM Eduardo Diaz => ITESM Gerhard Fischer => University of Colorado Patricia Friel => Texas A&M University Randy Goebel => University of Alberta Adolfo Guzman => International Software Systems Jose Ignacio Icaza => ITESM Christian Lemaitre => UNAM Richard Mayer => Texas A&M University Daniel Meade => ITESM Mariaurora Mota => ITESM Robert Port => Indiana University Elaine Rich => MCC Antonio Sanchez => Universidad de las Americas Carlos Scheel => ITESM Masaru Tomita => Carnegie Mellon University During the three-day Conference, an exposition of computer hardware and software will take place. We invite software and hardware businesses to participate in this exposition. In order to encourage an atmosphere of friendship and exchange among participants, some social events are being organized. FEES .- Tutorial..... Students $100.00 USD. Professionals $200.00 USD. Conference... Students $ 75.00 USD. Professionals $150.00 USD. Simultaneous Translation $ 7.00 USD. Hotel Accomodations..... Holiday Inn Crowne Plaza $ 85.00 USD. Ambasador $ 73.50 USD. Ancira $ 65.00 USD. Monterrey $ 34.50 USD. Del Rio $ 30.00 USD. Student housing $ 11.00 USD. Advance registration in encouraged since the attendance is limited. Fees are valid before July 30. Please include a 15 % tax to the Tutorial, Conference and Hotel Accomodations fees. ** Prices are per person, per night in a single or double room. Hotel reservations are made by sending one night deposit no later than forty days prior to arrival date. Tutorial fee also includes => * Notes case. * Tutorial material. * Welcoming cocktail party. Conference fee alse includes => * Notes case. * Proceedings. * Exhibition. * Welcoming cocktail party (Oct. 25) * Lunch (Oct. 26) * Formal dinner (Oct. 27) REGISTRATION PROCEDURE .- Send personal check payable to I.T.E.S.M. to: " Centro de Investigacion en Informatica Attention=> Mrs. Leticia Rodriguez, Sucursal de Correos "J", C.P. 64849, Monterrey, N.L. Mexico INFORMATION .- Centro de Investigacion en Informatica, I.T.E.S.M. Sucursal de Correos "J", C.P. 64849 Monterrey, N.L. Tel. (52-83) 58-20-00 ext 5132 Telefax (52-83) 58-89-31 Net address:ISAI at TECMTYVM.BITNET GENERAL .- The Symposium Tutorial and Conferences will be given in English. TRANSPORTATION SERVICE .- There will be transportation ready to take all the participants from their hotel to the I.T.E.S.M. (where the Symposium will be held) and bring them back to the hotel. ACCOMODATION SERVICE .- We can make you any reservation you want, just notify us. ------------------------------ From: [email protected] Subject: IEEE Application Conference Date: Sat, 01 Jul 89 13:15:24 EDT PRELIMINARY CALL FOR PARTICIPATION THE SIXTH IEEE CONFERENCE ON ARTIFICIAL INTELLIGENCE APPLICATIONS FESS PARKER'S RED LION RESORT SANTA BARBARA, CALIFORNIA MARCH 5-9, 1990 SPONSORED BY: THE COMPUTER SOCIETY OF IEEE The conference is devoted to the application of artificial intelligence techniques to real-world problems. Two kinds of papers are appropriate: Case studies of knowledge-based applications that solve significant problems and stimulate the development of useful techniques. Papers on AI techniques and principles that underlie knowledge-based systems, and in turn, enable ever more ambitious real-world applications. This conference provides a forum for such synergy between applications and AI techniques. Papers describing significant unpublished results are solicited along three tracks: - - "Engineering/Manufacturing" Track. Contributions stemming from the general area of industrial and scientific applications. - - "Business/Decision Support" Track. Contributions stemming from the general area of business, law and various decision support applications. Papers in these two application tracks must: (1) Justfy the use of the AI technique, based on the problem definition and an analysis of the application's requirements; (2) Explain how AI technology was used to solve a significant problem; (3) Describe the status of the implementation; (4) Evaluate both the effectiveness of the implementation and the technique used. - - "Enabling Technology" Track. Contributions focusing on techniques and principles that facilitate the development of practical knowledge based systems, and can be scaled to handle increasing problem complexity. Topics include, but not limited to: knowledge acquisition, representation, reasoning, searching, learning, software life cycle issues, consistency maintenance, verification/validation, project management, the user interface, integration, problem- solving architectures, and general tools. Papers should be limited to 5000 words. The first page of the paper should contain the following information (where applicable) in the order shown: - - Title. - - Authors' names and affiliation. (specify student) - - Abstract: A 200 word abstract that includes a clear statement on what the original contribution is and what new lesson is imparted by the paper. - - AI topic: Knowledge acquisition, explanation, diagnosis, etc. - - Domain area: Mechanical design, factory scheduling, education, medicine, etc. Do NOT specify the track. - - Language/Tool: Underlying language and knowledge engineering tools. - - Status: development and deployment status as appropriate. - - Effort: Person-years of effort put into developing the particular aspect of the project being described. - - Impact: A 20 word description of estimated or measured (specify) benefit of the application developed. Each paper accepted for publication will be allotted seven pages in the conference proceedings. Best papers accepted in the Enabling Technology track will be considered for a special issue of IEEE Transactions on Knowledge and Data Engineering (TDKE) to appear in late 1990. Best papers accepted in the application tracks will be considered for a special issue of IEEE EXPERT, also to appear in late 1990. In addition, there will be a best student paper award of $1,500, sponsored by IBM for this conference. In addition to papers, we will be accepting the following types of submissions: - Proposals for Panel discussions. Topic and desired participants. Indicate the membership of the panel and whether you are interested in organizing/moderating the discussion. A panel proposal should include a 1000-word summary of the proposed subject. - Proposals for Demonstrations. Videotape and/or description of a live presentation (not to exceed 1000 words). The demonstration should be of a particular system or technique that shows the reduction to practice of one of the conference topics. The demonstration or video tape should be not longer than 15 minutes. - Proposals for Tutorial Presentations. Proposals of both an introductory and advanced nature are requested. Topics should relate to the management and technical development of usable and useful artificial intelligence applications. Particularly of interest are tutorials analyzing classes of applications in depth and techniques appropriate for a particular class of applications. However, all topics will be considered. Tutorials are three hours in duration; copies of slides are to be provided in advance to IEEE for reproduction. Each tutorial proposal should include the following: * Detailed topic list and extended abstract (about 3 pages) * Tutorial level: introductory, intermediate, or advanced * Prerequisite reading for intermediate and advanced tutorials * Short professional vita including presenter's experience in lectures and tutorials. - Proposals for Vendor Presentations: A separate session will be held where vendors will have the opportunity to give an overview to their AI-based software products and services. IMPORTANT DATES - - September 29, 1989: Six copies of Papers, and four copies of all the proposals are due. Submissions not received by that date will be returned unopened. Electronically transmitted materials will not be accepted. - - October 30, 1989: Author notifications mailed. - - December 12, 1989: Accepted papers due to IEEE. Accepted tutorial notes due to Tutorial Chair, Donald Kosy - - March 5-6, 1990: Tutorials - - March 7-9, 1990: Conference Submit Papers and Other Materials to: Se June Hong (Room 31-206) IBM T.J. Watson Research Center P.O. Box 218 Yorktown Heights, NY 10598 USA Phone: (914)-945-2265 CSNET: [email protected] FAX: (914)-945-2141 TELEX: 910-240-0632 Submit Tutorial Proposals to: Donald Kosy Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Phone: 412-268-8814 ARPANET: [email protected] CONFERENCE COMMITTEES General Chair Mark S. Fox, Carnegie-Mellon University Publicity Chair Jeff Pepper, Carnegie Group Inc Tutorial Chair Donald Kosy, Carnegie Mellon University Program Committee Chair Se June Hong, IBM Research At-large Jan Aikins, AION Corp. John Gero, University of Sidney Robert E. Filman, IntelliCorp Gary Kahn, Carnegie Group John Mc Dermott, DEC Engineering/Manufacturing Track Chair Chris Tong, Rutgers University (Visiting IBM) Sanjaya Addanki, IBM Research Alice Agogino, UC Berkeley Miro Benda, Boeing Computer Services Sanjay Mittal, Xerox PARC Duvurru Sriram, MIT Business/Decision Support Track Chair Peter Hart, Syntelligence Chidanand Apte, IBM Research Vasant Dhar, New York University Richard Fikes, Price-Waterhouse Timothy Finin, Unisys Research Daniel O'Leary, University of Southern California Enabling Technology Track Chair Howard Shrobe, Symbolics Lee Erman, CIMFLEX-Teknowledge Brian Gaines, University of Calgary Eric Mays, IBM Research Kathy McKeown, Columbia University Katia Sycara, Carnegie-Mellon University Additional Information For registration and additional conference information, contact: CAIA-90 The Computer Society of the IEEE 1730 Massachusetts Avenue, NW Washington, DC 20036-1903 Phone: 202-371-0101 ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA07609; Sun, 2 Jul 89 00:31:20 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA07609; Sun, 2 Jul 89 00:31:20 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa12387; 2 Jul 89 2:31 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.134	AIList Digest V9 #16 - INTERESTING INFO PAT	HERON::ROACH	TANSTAAFL !	`Tue Jul 04 1989 17:10`	1100
	Printed by: Pat Roach Document Number: 007830 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 03-Jul-1989 11:03am ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@DELOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest V9 #16 AIList Digest Saturday, 1 July 1989 Volume 9 : Issue 16 More Announcements: CFP: 1990 PODS (Principles of Database Systems) CFP: IJCAI Plan Recognition Workshop IEEE ES Task Force Newsletter, Vol. 1 #1 Computer Games Olympiad CFP: 1st Maghrebin Conference on AI and SE - Algeria NSF Support of PRC Researchers ---------------------------------------------------------------------- Date: Thu, 1 Jun 1989 15:02:38 EDT From: Michael Kifer <[email protected]> Reply-To: Michael Kifer <[email protected]> Subject: CFP: 1990 PODS (Principles of Database Systems) CALL FOR PAPERS Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) Nashville, Tennessee, April 2-4, 1990 The conference will cover new developments in both the theoretical and practical aspects of database and knowledge-base systems. Papers are solicited which describe original and novel research about the theory, design, specification, or implementation of database and knowledge-base systems. Some suggested, although not exclusive, topics of interest are: complex objects, concurrency control, database machines, data models, database programming languages and persistent programming, data structures, deductive databases, distributed systems, incomplete information, knowledge representation and nonmonotonic reasoning, object-oriented databases, performance evaluation, physical and logical design, query languages, query optimization, spatial and temporal data, and transac- tion management. You are invited to submit eleven (11) copies of a detailed abstract (not a complete paper) to the program chair: Yehoshua Sagiv - PODS Department of Computer Science Stanford University Stanford, CA 94305 [email protected] (415) 723-1512 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 contributions of the work; 2) explain the importance of the work - its novelty and its practical or theoretical relevance to database and knowledge-base sys- tems; and 3) include comparisons with and references to relevant litera- ture. Abstracts should be no longer than ten double-spaced pages. Devi- ations from these guidelines may affect the program committee's evalua- tion of the paper. Program Committee Vassos Hadzilacos C. Mohan Richard Hull Shamim Naqvi Yannis E. Ioannidis Doron Rotem Paris C. Kanellakis Yehoshua Sagiv Michael Kifer Allen Van Gelder The deadline for submission of abstracts is October 9, 1989. Authors will be notified of acceptance or rejection by December 6, 1989. The accepted papers, typed on special forms, will be due at the above address by January 10, 1990. All authors of accepted papers will be expected to sign copyright release forms, and one author of each accepted paper will be expected to present the paper at the conference. Proceedings will be distributed at the conference, and will be subse- quently available for purchase through the ACM. General Chair Local Arrangements Chair Daniel J. Rosenkrantz Patrick C. Fischer Dept. of Computer Science Dept. of Computer Science State University of NY at Albany Box 1679B, Vanderbilt University Albany, NY 12222 Nashville, TN 37235 [email protected] [email protected] ------------------------------ Date: 2 Jun 89 12:34:47 GMT From: [email protected] (randy calistri) Organization: GE Corporate Research and Development Subject: CFP: IJCAI Plan Recognition Workshop ///////////////////////////////// \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ ////////// Workshop Announcement - Call for Participation \\\\\\\\\\ \\\\\\\\\\ Second Workshop on Plan Recognition ////////// \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ ////////////////////////////////// 11th International Joint Conference on Artificial Intelligence Detroit, Michigan, Monday August 21, 1989 Plan recognition problems remain at the center of a great deal of AI related research. This workshop will bring together researchers and practitioners who are interested in sharing their work on problems associated with inferring a goal-based explanation of the behavior of one or more agents. Closely related problems include inferring an author's plans from text, and inferring a programmer's intentions from code. Problems of this sort often seem to lie at the heart of intelligence; people can apparently select just the right explanatory principles from a large store of knowledge. These problems have encouraged interest in nontraditional control structures such a marker passing, parallelism, and connectionism. To date no decisive solutions have been obtained. FORMAT: This is intended to be a forum for the presentation and discussion of current ideas and approaches. The format will consist of individual presentations followed by adequate time for interaction with peers. To maximize interaction, participation will be limited to about 30-35 attendees, with no more than 10-12 presentations. PARTICIPATION: Those interested in attending should submit a one-page description of their research interests and current work to one of the organizing committee by June 23. Those interested in making a presentation should submit an extended abstract (3-5 pages) of their intended topic. Electronic submissions are encourage. Notification of acceptance or rejection will be given by July 14. Any materials to be reproduced and distributed at the workshop must be submitted by August 11. ORGANIZING COMMITTEE: John Josephson The Ohio State University LAIR, CIS Dept. 228 CAE Bldg., 2036 Neil Ave. Columbus, Ohio 43210-2177 (614) 292-0208 Netmail:[email protected] Jeff Maier Adaptive Software Inc. 4900 Frederick Pike Dayton, Ohio 45414 (513) 275-9000 Randy Calistri GE Corporate R&D K1-5C8, PO Box 8 Schenectady, NY 12301 (518) 387-7839 Netmail: [email protected] ______________________________________________________________________ ------------------------------ Date: Wed, 14 Jun 89 11:24 EDT From: DYU%[email protected] Subject: IEEE ES Task Force Newsletter, Vol. 1 #1 The Heuristic, newsletter of the IEEE Task Force on Expert Systems vol. 1, issue 1, Summer 1989 BITNET DYU@NCCIBM1 [This is the full text for the first newsletter of the IEEE Computer Society Task Force on Expert Systems] ----- MASTHEAD ----- About our Name... We have chosen THE HEURISTIC as the title of the Task Force on Expert Systems Newsletter. Not only does this reflect that expert systems are tools for applying heuristics, but also that the Task Force is an organization for discussing heuristics about expert systems in practice. Editor: Rodger Knaus, (202) 966-2582 Research and reporting: Sandra Hoffman, (202) 226-6849 Layout and Design Joe Hooper, Lori Rottenberg Distribution Judy Lamont Deadline for the Fall '89 issue: Aug. 1, 1989 Send newsletter contributions to: Rodger Knaus, Instant Recall, 5900 Walton Rd., Bethesda, Md. 20817. Preferred format: a machine-readable file, either an ASCII file on a 5.25 IBM-PC/AT diskette, or an upload on the Instant Recall BBS. (301)-983-8439 BBS info: Up during business hours and some other times; runs under RBBS at 300 to 2400 baud, with 8 data bits, 1 parity bit and null parity. This BBS is for file transfer, NOT for general messages. ----- NEXT MEETING ----- The next meeting of the IEEE Task Force on Expert Systems will be July 25, 9-11 a.m., at the American Management Society (AMS). After a 20-min. business meeting, several speakers will present expert systems applications in their organization. AMS is located in Roslyn, VA (in the Washington, D.C. metropolitan area) at 1777 N. Kent St., 2 blocks from the Roslyn Metro stop. ----- EDITORIAL ----- Welcome to the IEEE Task Force on Expert Systems. Maybe your reaction was like mine: What is a Task Force on Expert Systems anyway, and who needs one? There are already too many conferences and publications on compters, and expert systems in particular. Why have more? I saw one possible answer at "On the Art of Fixing a Shadow: 150 Years of Photography." Since photography is 5 times older than expert systems, its path as a technology suggests how expert systems may evolve. The first photographers built their own cameras, made their own film, and printed their own pictures. Camera and film science dominated the early years of photography. However, as the basic technology matured, craft displaced science as the prime concern of photographers. Today, photographers use cameras, film and expertise to create images for people. In a similar transition, knowledge engineers are emerging as craftspersons who use hardware, software and skill to create decision tools for people. Photography could not exist without lens design and film chemistry; architecture could not exist without structural engineering; and knowledge engineering could not exist without successful and continuing expert systems research. However, like architecture and photography before it, knowledge engineering today is a design rather than a research activity. The concerns of the knowledge engineer are those of a designer rather than a scientist. The knowledge engineer is an architect of software, with the architect's concern for building something on time and within budget, meeting the current and future needs of the client, and creating an esthetically pleasing environment where form reflects function. This is where the Task Force comes in. The Task Force is a forum for knowledge engineers to * see and present current work * discuss new tools and techniques * learn how things worked in practice. Our focus is on how things work in the field rather than in the lab; on the lifecycle rather than the idea and prototyping stage; on the complete system rather than the isolated design attribute; and on design and architecture rather than basic science and engineering. The Task Force plans meetings and conferences about expert systems in practice. We plan standards that may eventually help expert systems communicate. The nature and direction of the Task Force depends on you, the working knowledge engineer. Our newsletter also will become what you make it. Do you have a more graceful name for the organization than IEEE Task Force on Expert Systems? I'll publish a list of the best suggestions in the next newsletter. Did an expert system application turn out unexpectedly good or bad, easy or hard? Write it up for our "How Did it Work" column. Was there an event of interest in your area? Share it with the Task Force nationally in a newsletter article. This is your organization. We invite and welcome your participation. ----- MESSAGE FROM THE CHAIR ----- by: Dan Yurman 202-475-6754 BITNET DYU@NCCIBM1 Welcome to the Task Force on Expert Systems The IEEE Computer Society announces the formation of a Task Force on Expert Systems Applications. The purpose of the Task Force is to support interest in the development and use of expert systems applications. The IEEE Computer Society, which has over 100,000 members worldwide, authorized the creation of the Task Force at a meeting of its Technical Activities Board (TAB) held March 2nd in San Francisco, CA. The objectives of the Task Force are to improve the abilities of organizations and individuals to work with expert systems technologies. The Task Force will sponsor activities at the national and international levels, but also support local events. The Task Force will publish a newsletter, exchange electronic mail, provide speakers for conferences, organize tutorials, symposiums, and convene meetings on standards either on its own initiative or jointly with other IEEE Computer Society functions. The Importance of Expert Systems MIS and end users are experiencing an explosion of interest and activity in expert systems applications in almost all sectors of business, government, and education. This is taking place due to the wide distribution of expert system shells on personal computers and workstations. It is a remarkable change in the field of artificial intelligence in which developers usually rely on specialized computer platforms and programming languages. Expert systems are the most mature and resilient products to emerge from the AI community, and they are being adopted by corporations and government departments to improve productivity. They are doing this because the applications of expert systems to specific knowledge intensive systems return high yields. Success stories for expert systems are more common now than two years ago. A current estimate is there are 2,000 operational expert systems and 80% of them on running on personal computers. The Value of the Task Force The greatest value which will be derived from participating in the Task Force will come from regular discussions among Task Force participants. In some ways, this will resemble the informal interactions of a user group. In other ways it will compliment many of the professional activities of the IEEE Computer Society. Within these broad themes, there are many diverse interests, including business activities such as banking and finance, manufacturing and service functions, medical practice, government functions, including the military, and education. These interests will be addressed through locally sponsored and nationally significant activities including conferences, workshops, lectures, a newsletter, and other appropriate mechanisms. Membership All meetings of the Task Force are be open to the public and will be announced ahead of time in the news media. Anyone who has an interest in the objectives of the Task Force is invited to attend its functions and participate in its activities. Membership in the IEEE Computer Society is not required to attend our meetings. Since the Task Force is oriented toward development and use of expert systems applications, we expect and encourage the interest of vendors of computer hardware, software, and services. Future activities of the Task Force will be developed consistent with the goals and objectives of the IEEE Computer Society. First Meeting On April 21, 1989, the Task Force held it's kickoff meeting in Washington, DC. A total of 61 people attended the session. The meeting was held at the Departmental Auditorium of the Internal Revenue Service through the good offices of Ted Rogers, Director of the IRS Artificial Intelligence Center. The Task Force created and staffed five Vice-Chair positions: Standards, Conferences, Communications, Industry Relations, and Local Meetings. We have two vacant vice chair positions - treasurer and membership. Here is what they do. Treasurer: Responsible for keeping track of Task Force finances, for fund raising including setting up a means to cover costs, and solicitations of "in kind" contributions. Membership: Responsible for developing and implementing a membership recruitment campaign for the Task Force working at the national level. Works with other Vice-Chairs to carry out these functions. More than 400 people have expressed an interest in the Task Force. These names have been submitted to the TAB Coordinator for creating of a mailing list. Publicity about the Task Force has appeared in several computer trade publications and approximately 60 people called for more information as a result. Texas Instruments Corp. provided a mailing list of people who attended their AI Satellite Symposium last November, and the company is planning to provide publicity about the Task Force in an upcoming newsletter. Press releases were sent to IEEE Expert and IEEE Computer Magazine. Persons desiring to be placed on the mailing list should send their name and address to: Task Force on Expert Systems c/o TAB Coordinator IEEE Computer Society 1730 Massachusetts Ave. NW Washington, DC 20036 ----- CONTACTS ----- IEEE Task Force Contacts Who to contact: To be put on the Expert Systems Task Force mailing list: TAB Coordinator IEEE Computer Society 1730 Mass Ave. NW Washington, DC 20036 For Task Force sponsorship of local activities: Chair, IEEE Expert Systems Task Force Other: The appropriate chair, from the list below. Chair: Dan Yurman Task Force on Expert Systems c/o TAB Coordinator IEEE Computer Society 1730 Mass Ave. NW Washington, DC 20036 (202) 475-6754 (9-5 EST) MCI Mail: 364:1277 IEEE C.S. Comp-Mail: CMP5845 BITNET DYU@NCCIBM1 Vice Chair for Communications Sandra Hoffman Congressional Budget Office 2nd & D, SW, Rm. 450 Washington, D.C. 20515 (202) 226-2775 Vice Chair for Conferences Jerry Feinstein Phase-Linear Systems/ICF 9300 Lee Highway Fairfax, VA 22031 (703) 934-3280 Vice Chair for Industry Relations Joseph Schmuller CDM Federal Programs Corp. 13135 Lee Jackson Highway Fairfax, VA 22033 (703) 968-0900 Vice Chair for Meetings Randy Manner American Management Systems 1777 N. Kent St. Arlington, VA 22209 (703) 841-6849 Vice Chair for Standards Capt. Dave Howell Artificial Intelligence Program Management Office U.S. Air Force Logistics Command HQ AFLC/MM-AI Wright Patterson AFB Ohio 45433 (513) 257-2571 [email protected] Vice Chair for Membership: vacant - contact the TAB coordinator Treasurer: vacant - contact the Chair Newsletter Editor Rodger Knaus Instant Recall 5900 Walton Rd. Bethesda, Md. 20817 (301) 530-0898 BBS: (301) 983-8439 ----- LOCAL ----- Local events and meetings are one of the most important ways in which expert systems professionals can exchange information and grow professionally. The IEEE Task Force on Expert Systems will sponsor local events about expert systems applications, provided that these events are appropriate to a professioal organization under IEEE's guidelines; what this means in practice is that sponsored events are of interest to expert systems professionals and are not vehicles for sales and marketing activities. To obtain Task Force sponsorship of an event, contact the Chair, Dan Yurman, at (202) 475-6754. ----- INDUSTRY ----- Joseph Schmuller Expert Systems Team CDM Federal Programs Corporation Fairfax, VA Our objective, broadly stated, is to liaison with industry -- to get industry involved with the activities of the Task Force. We started by analyzing the world that we will liaison with, and distinguished first between "Industrial Expert Systems" and the "Expert Systems Industry" -- in other words, between consumers of Expert Systems technology and vendors of the technology. Both consumers and producers can be represented by a 2 X 2 matrix. Consumers may be either public or private sector, and either "system developers" or "system users" (we recognize that these two roles are not necessarily mutually exclusive). Our "Consumers" matrix, then, encompasses "Sector" (Public and Private) and "Role" (Developer and User). As we contact members of the Consumer community, two questions will be answered: How is the technology being used? How can the Task Force help users of the technology? Now, let's look at the "Vendors" matrix. Manufacturers of Expert System Tools necessarily distinguish between applications that reside on Personal Computers and those that reside on larger platforms, and they design their tools accordingly. Our Group will establish connections with vendors from both arenas. Another distinction is between hardware tools and software tools. Thus, our "Vendors" matrix is defined by "Platform" (PC and non-PC) and "Type of Tool" (Hardware and Software). Our contacts with the Vendor Community will result in reviews of new products. We are also interested in influencing the development of future products. Committees In order to carry out Group objectives, we'll have four committees, and these committees reflect the aforementioned analysis. I've selected three committee chairpersons (the fourth is yet to be named), and I'll work with them to find members for each committee. The committee members will initiate contacts with the Consumer and Vendor Communities, and the appropriate chairperson will co-ordinate these contacts. For the Consumer Community, Don Ramsey (of the law firm of Sutherland, Asbill, and Brennan) will chair the Private Sector Committee, and Bruce Ramsay (of the IRS) will chair the Public Sector Committee. I'll work with Don and Bruce to find at least four members for each committee. Each committee member will contact either users of Expert Systems or developers of Expert Systems. The purpose of the contacts is to find out the types of systems being developed, who is doing the development, and how Expert Systems are being used within a particular organization. For the Vendor Community, Rod Pitts (of the AI Special Interest Group of the Capital Area PC Users Group) will chair the PC-based Tools Committee. At present, the chairperson of the Non-PC Tools Committee is unnamed. I'll work with Rod and the fourth chairperson to find at least four members for each committee. Each committee member will contact vendors of hardware or vendors of software. The contacts will be for the purpose of finding out about new releases and for receiving review copies of products. Each committee member will review the products that he or she receives. My thanks to Don, Bruce, and Rod! Meetings I plan to hold chairpersons' meetings in odd-numbered months and Industry Relations Group Meetings in even-numbered months. At each chairpersons' meeting, we will identify a speaker or set of speakers for the subsequent Industry Relations Group meeting. The speakers will be drawn from the Consumer and Vendor Communities. At our chairpersons' meetings, we will also begin to organize poster sessions, presentations, and other events for meetings of the entire Task Force. To facilitate the production of these events, the Vice Chairman and the committee chairpersons will ask for the help of Group members who are not members of any of the four committees. ----- CONFERENCE ----- FAST START ON CONFERENCES PLANNING by Jerry Feinstein, Chair, Conference Working Group ICF/Phase Linear tel. 703-934-3280 fax. 703-934-9740 The Conference Working Group met on 4/21/89 to develop a plan for identifying and implementing its activities. Our long-range goal is to establish a yearly conference that would focus on expert systems with an emphasis on the user and manager. A more immediate goal is to establish informal workshops where managers and system builders could discuss lessons learned, successful approaches used elsewhere, etc. The Conference Group identified a number of 'interest areas' around which might spring ideas for workshops, tutorials, and tracks for future conferences: knowledge acquisition; validation, verificaiton, and testing; project management and implementation of E.S.; business applications of E.S; PC-based E.S.; statistical applications; and standards. These topical groupings are open to change and expansion, guided by the interests of the Task Force at large. People are free work on as many groups as their time and interests permit. For the future, the Conference Working Group selected MANAGING AN EXPERT SYSTEM PROJECT/PROGRAM as a general theme that could develop into workshops or conferences.ed From this theme, tracks, tutorials, and topics would flow logically and almost sequentially. From the theme, we developed a preliminary structure based on input from our group. We call this structure preliminary because its purpose is to provide a point of departure or skeleton on which others in our Task Force may build. Staffing an E.S. Group Selecting the Right Application Selecting Appropriate Shells Cost-Justifying E.S.s Managing the Development Institutionalization Finding a Project Champion Developing User Groups Validation Measuring Productivity Maintenance ----- COMMUNICATIONS ----- NEWSLETTER STARTED, BBS PLANNED The Communications Committee has been busy with the first issue of a planned quarterly newsletter. Publication of each issue will be around the start of a season (e.g. June 15 for the first issue). Under the guidance of our chair, Sandra Hoffman, the newsletter has been a pipelined effort, with reporting by Sandra Hoffman, editing by Rodger Knaus, design and layout by Joe Hooper and distribution by Judy Lamont, with the help of the IEEE Technical Activities Board Coordinator, Lori Rattenberg. Research and reporting: Sandra Hoffman, (202) 226-6849 Editing: Rodger Knaus, (202) 966-2582 Layout and Design Joe Hooper Publicity Judy Lamont Many members of the Task Force have expressed interest in an electronic bulletin board. Now that the first newsletter is out, the Communications Committee wants to start planning the BBS. We need ideas and help in every aspect of the bulletin board, including donations of hardware and software, bulletin board expertise, and ideas about structure and content of the board; in return for your contributions, you will be able to post some information about your professional services on the board. If you want to contribute to the BBS, leave a message to Rodger Knaus (SYSOP) on the Instant Recall BBS, (301) 983-8439. the board is up during business hours, plus some evenings and weekends, operates under RBBS at 300 to 2400 baud, with 8 data bits, 1 parity bit and null parity. ----- STANDARDS ----- KBS LIFECYCLE MAY BE STANDARDS FOCUS by Capt. Dave Howell, Standards Vice-Chair [email protected] 513-257-2925 The turnout for the Standards Committee portion of the first IEEE Task Force on Expert Systems meeting was excellent. Individuals from 15 organizations attended; they came from both the public and private sector, and included both end users and knowledge-based system (KBS) manufacturers. In spite of this diversity, when the attendees said why they were interested in standards, widespread interest on the KBS life cycle emerged. The group saw standards as a way to reduce life cycle costs, because with standards you can * develop good KBS costing models * provide effective development methodologies * determine proper verification and validation (V&V) techniques The group also wanted "lessons learned" to be part of the standards process. A consensus developed that the scope of the Standards Committee should be at a high enough level to allow for language independence. The group did not see itself getting initially involved in low level implementation issues, i.e. Prolog versus Lisp versus shells, etc. Further, the high-level focus was deemed appropriate considering the immature state of the technology. At this point, the greatest perceived service the Standards Committee can provide is to make the KBS life cycle explicit. In short, a by-the-numbers approach to KBS development, V&V, fielding, and maintenance. The first official task the Standards Committee will be to determine its objective(s). The discussion at the first meeting suggests an initial focus on the KBS lifecycle. In the next few weeks the Standards Vice-Chair will call all the initial meeting attendees and solicit their inputs abaout objectives. Anyone not attending the meeting who would like to help with this can call the Standards Vice-Chair, Capt. Dave Howell, during working hours, at (513) 257-2571. ----- EXPERT SYSTEMS IN GOVERNMENT ----- AISIG 1990 by: Dan Yurman DYU@NCCIBM1 202-475-6754 I am pleased to announce our participation in the 5th annual "AI Systems in Government Conference" to be held in Washington, DC, in May 1990. The Task Force on Expert Systems has agreed to chair the panels for the 1990 Conference. If you are interested in convening a panel or being a speaker on one, please contact one of the panel committee members listed in this article. The panel committee met on May 10th. Following is the committee report. 1989 Experience In 1989 there were seven panels. The bulk of the conference was taken up by technical sessions spread over two tracks and the plenary sessions. The conference, including tutorials and exhibits, lasted five days. Approximately 200 people came to one or more sessions. I believe there will be better attendance in 1990. This will be due to the fact that there is a determined effort not to conflict with the AI in Logistics Conference. We identified more than 7 potential panels. Additionally, Jerry Feinstein, who chaired panels at the 1989 conference, has joined us as a working member for 1990 and has agreed to find conveners for two panels. Following is a list of proposed panels. I see no reason why we should feel constrained to focus only on these panel topics if better ones emerge from our respective discussions with potential conveners. For this reason, I regard the potential topics listed below as "straw men" until our meeting in July. As is the case with any conference involving volunteer speakers, some conveners and panelists may drop out by May 1990. Panel Assignments Dan Yurman, Chair US EPA (OS-110) 401 M St., SW Washington, DC 20460 (202) 475-6754 - AI Shells - AI at EPA - Software Engineering for Expert Systems - Medical Applications Harry Siegel JAYCOR 1608 Spring Hill Rd. Vienna, VA 22182 (703) 847-4120 - NASA Expert Systems - AI for Acquisition/Logistics Management - SDI Expert Systems - AI Hardware Platform Developments Ralph Wachter Office of Naval Research Computer Science Dept.; Code 1133 800 N. Quincy St. Arlington, VA 22217 (703) 696-4304 - Executive Panel on AI - AI Laboratory Chiefs - Innovative Technology Programs Jerry Feinstein ICF/Phase Linear 9300 Lee Highway Fairfax, VA 22031 (703) 934-3280 - How the Press Views AI - International Applications (via video tape) Unassigned - State Government Applications - Local Government Applications 1990 Plans Panels in the 1989 conference lasted 1 hour 30 minutes each except one on SDI which lasted 2 hours. Assuming there are four or five speakers for a panel, and assuming time is desired for a Q & A session with the audience, the convener must plan speaking time for each panelist accordingly. This include a few minutes to introduce everyone, time between speakers to get organized with A/V equipment, etc. The point is that time slips by fast and speakers should be advised to be crisp and to the point in their talks. Next Meeting The next meeting of the panels committee is July 19, 1989, at the JAYCOR office at 10 AM. At that meeting, the committee will share the following information about our panels. - Name of panel convener & biography - Objectives for the panel - "Who should attend" information - Brief bibliography, if possible Some of this information will come later from the panel conveners themselves. The full conference committee has requested that panels be "locked up" with sufficient time to list the names of panel conveners and speakers in the final program. I will get the deadlines for this information at a meeting with the committee on May 30th. Open Issues We did not achieve closure on several points. This was due in most cases to a lack of information. I would like to provide a summary of our discussions at the May 10th meeting. I hope I adequately convey your thoughts here, and if not, I regret any oversight. 1. Focus on Applications Panels should emphasize concrete applications whenever possible. People attending the 1989 conference expressed the desire to hear about applications which added value or which improved productivity in the organization which used the system. Alternatively, speakers have the option of providing evaluations, either quantitative or qualitative, of systems which were built as prototypes but not shipped to users. This satisfies the requirement for a focus on "lessons learned." 2. Speakers from Industry We discussed whether it would be useful to try to draw in speakers from vendors of computer hardware and software. It was pointed out that while many computer companies, such as IBM, DEC, and TI, make heavy use of expert systems inhouse, fewer offerings have found their way to market. Some firms prefer not to advertise their use of expert systems since it alerts the competition to the technology which is used to gain and keep customers. In the post-conference evaluation of the 1989 meeting, it was remarked that exhibitors complained that those attending the meeting did not have enough time to go to the exhibit floor. Perhaps a source of speakers would be firms supplying expert system hardware or software who have government clients with nonclassified applications. Certainly, the successful use of a product in a public government setting could be "packaged" to fit a panel presentation at the conference. Please give this your consideration. 3. High Quality Handouts Although the conference publishes a set of proceedings, panel presentations are not included in it. For this reason, handouts from speakers are very important. It was suggested that speakers include a brief bibliography for further reading on their topic. For instance, the bibliography could include a standard reference as well as well known journal articles by experts on the topic. Citations should be accessible in English in the U.S. A citation format is available from the IEEE. It was suggested that speakers provide brief biographies, which is certainly a benefit. Harry Siegal agreed to prepare a draft format for speaker bios. He noted that these should be brief with the objective of placing all speakers on an equal footing. 4. Recognition for Panels It was suggested that each panelist receive a certificate suitable for framing or a letter of appreciation for appearing at the conference. A suggestion was made to award a prize for the best panel, but there was uncertainty about how to make the award "on the spot" by the end of the conference. A suggestion was made to provide "tokens" of appreciation such as a coffee cup, desk ornament, or other novelty item. ------------------------------ Date: 15 Jun 89 09:52:36 GMT From: [email protected] (Don Beal) Organization: Computer Science Dept, Queen Mary College, University of London, UK. Subject: Computer Games Olympiad Here are some up-to-date details of the Computer Games Olympiad to be held in London this August. The world's first Olympiad for computer programs will take place at the Park Lane Hotel, London, from August 9th to 15th 1989. This unique event will feature tournaments for chess, bridge, backgammon, draughts, poker, Go, and many other classic "thinking" games. In every tournament all of the competitors will be computer programs. The role of the human operators will merely be to tell their own programs what moves have been made by their opponents. Over 115 enquries from prospective entrants were received, and between 80 and 100 programs are expected to take part. The 1st London Conference on Computer Games will take place as part of the Computer Olympiad. There will be about 15 papers on various aspects of programming computers to play "thinking" games such as chess, bridge, Go, backgammon, etc. The conference Chair will be Professor Tony Marsland, from the Computing Science Department at the University of Alberta, Edmonton, Canada. The editor of the conference proceedings will be Don Beal, from the Computer Science Department at Queen Mary College, London University. The Computer Olympiad is organised by International Chess Master David Levy, who is President of the International Computer Chess Association. Competitors and conference participants will be coming from over 15 countries. Hotel bookings are available ranging from 5-star hotel to youth hostel. Anyone wanting more information on attending the event should contact: Computer Olympiad, 11 Loudoun Road, London NW8 OLP, England. Tel: +44 1 624 5551 Fax: +44 1 372 3266 ------------------------------ Path: boulder!tigger!bouguett From: [email protected] (Athman Bouguettaya) Newsgroups: comp.ai,comp.ai.digest,comp.ai.neural-nets,comp.lang.smalltalk,comp.lang.eiffel,comp.software-eng Subject: CFP: 1st Maghrebin Conference on AI and SE - Algeria Date: 16 Jun 89 20:02:45 GMT Reply-To: [email protected] (Athman Bouguettaya) Organization: University of Colorado, Boulder Lines: 65 -------------------------------------------------------------------------------- FIRST MAGHREBIN CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFTWARE ENGINEERING Constantine, Algeria, September 24-27, 1989 CALL FOR PAPERS TOPICS The Conference Program will include bith invited and contributed papers. Authors from Maghreb are particulary encouraged to submit. The adressed topics, but not limited to, are : - Algebraic Specification - Program Construction and Proving - Expert Systems - Knowledge and Data Bases - Communication Protocols - Distributed Systems - Object Oriented Programming TERMS OF PRESENTATION OF PAPERS : Papers should be in English, French or Arabic and meet the following requirements : 1- Pages should not number more than 20, including an abstract, tables, figures and references. 2- The papers should be double typed on (A 4) single faced page. 3- The full-name of author (s) and institude and country where the research was conducted should be written on the title page with an abstract of no more than 300 words. 4- Four copies of the papers should be sent to the chaiman of the organizing committee. DEADLINE FOR SUBMISSION OF PAPERS : The closing date for acceptance of papers is 10 August 1989. Those whose papers are accepted will be informed by 4th September 1989. ORGANIZED BY : Laboratory of Knowledge Bases and Distributed Systems Computer Science Institute, Constantine University with the partipation of LRI ORSAY- FRANCE. GUEST SPEAKER : Eric G. Wagner, Research staff member IBM Watson Research Center (USA) CORRESPONDANCE : All correspondance should be adressed to : Dr. BETTAZ Mohamed Institut d'Informatique Universite de Constantine Constantine 25000 ALGERIA Telephone : (213) (4) 69.21.39 Telex : 92436 UNCZL ----------------------------------------------------------------------------- ----------------------------------------------------------------- Athman Bouguettaya Dept of Computer Science, Univ of Colorado at Boulder. E-mail: [email protected] " Le bonheur est un vain mot pour ceux qui aiment." ------------------------------ Subject: NSF Support of PRC Researchers Date: Tue, 20 Jun 89 09:37:21 -0400 From: "Kenneth I. Laws" <[email protected]> From a memo by Erich Bloch, Director of NSF: Recently, in response to events in the People's Republic of China (PRC), President Bush offered a one-year delayed departure to all PRC students, scholars and other visitors now in the United States. Many visitors from the PRC currently receive support through NSF awards, particularly as graduate students and postdoctoral researchers. Effective immediately, NSF will entertain requests for supplements if the duration of the stay of a PRC student or other researcher supported on an existing award is altered as the result of the President's initiative. For the remainder of FY 1989, reserve funds will be made available to cover these supplements. Program reference code 9284, "PRC Scientist Supplements," should be cited. Information regarding the opportunity for these supplements will be provided to the university community by the Division of Grants and Contracts [(202) 357-9496]. -- Ken Laws (202) 357-9586 ------------------------------ End of AIList Digest ******************** ======================================================================== Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) id AA09995; Sun, 2 Jul 89 01:20:17 PDT Received: from MINTAKA.LCS.MIT.EDU by decwrl.dec.com (5.54.5/4.7.34) for aivtx::ai_info; id AA09995; Sun, 2 Jul 89 01:20:17 PDT Received: from mc.lcs.mit.edu by mintaka.lcs.mit.edu id aa12733; 2 Jul 89 3:10 EDT Reply-To: [email protected] Us-Mail: MIT LCS, 545 Tech Square, Rm# NE43-504, Cambridge MA 02139 Phone: (617) 253-6524 Message-Id: <[email protected]>
21.135	NL-KR Digest V6.30	HERON::ROACH	TANSTAAFL !	`Mon Jul 17 1989 11:29`	512
	Printed by: Pat Roach Document Number: 008003 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 14-Jul-1989 06:40pm ETE From: AI_INFO AI_INFO@AIVTX@MRGATE@STATOS@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: NL-KR Digest V6.30 Article 14 of comp.ai.nlang-know-rep Path: shodha.dec.com!shlump.dec.com!decwrl!ucbvax!cs.rpi.edu!nl-kr-request From: [email protected] (NL-KR Moderator Chris Welty) Newsgroups: comp.ai.nlang-know-rep Subject: NL-KR Digest, Volume 6 No. 30 Message-ID: <[email protected]> Date: 7 Jul 89 21:14:09 GMT Sender: [email protected] Reply-To: [email protected] (NL-KR Digest) Organization: The Internet Lines: 482 Approved: [email protected] NL-KR Digest (Fri Jul 7 12:45:01 1989) Volume 6 No. 30 Today's Topics: A Knowledge Based Software Information System (Unisys seminar) New Book: INTERLINGUISTICS Proper Place of Connectionism ACE Version 1.3 Distribution INFORMATION NEEDED....... Re: Natural Language Knowledge Engineering References Re: Knowledge Engineering References Re: Knowledge Engineering References Submissions: [email protected] Requests, policy: [email protected] Back issues are available from host archive.cs.rpi.edu [128.213.1.10] in the files nl-kr/Vxx/Nyy (ie nl-kr/V01/N01 for V1#1), mail requests will not be promptly satisfied. If you can't reach `cs.rpi.edu' you may want to use `turing.cs.rpi.edu' instead. ----------------------------------------------------------------- To: [email protected] Date: Wed, 5 Jul 89 15:30:58 -0400 >From: [email protected] Subject: A Knowledge Based Software Information System (Unisys seminar) AI SEMINAR UNISYS PAOLI RESEARCH CENTER A Knowledge Based Software Information System Prem Devanbu AT&T Bell Laboratories The difficulty of maintaining very large software systems is becoming widely acknowledged. One of the primary problems is the difficulty of accessing information about a complex and evolving system. Brooks calls this the problem of "invisibility". This problem leads to various difficulties, including reduced quality and productivity. We are exploring the contribution to be made by applying knowledge representation and reasoning to the management of information about large systems. LaSSIE is a prototype tool (based on the ARGON system) that uses a frame-based description language and classification inferences to facilitate a programmer's discovery of the structure of a complex system. It also supports the retrieval of software for possible re-use in a new development task. We describe our experiences in building this tool, what we have learned about this approach. 11:00am July 17 BIC Conference Room Unisys Paoli Research Center Route 252 and Central Ave. Paoli PA 19311 -- non-Unisys visitors who are interested in attending should -- -- send email to [email protected] or call 215-648-7446 -- ------------------------------ To: [email protected] Date: Fri, 7 Jul 89 08:48:55 +0200 >From: Klaus Schubert <[email protected]> Phone: +31 30 911911 Fax: +31 30 944048 Telex: 40342 bso nl Subject: New Book: INTERLINGUISTICS ************************************************************************** I send this book announcement to the readers of the NL-KR Bulletin with a special dedication. Which is the topic the NL-KR subscribers are interested in most of all? The answer is short and clear: ESPERANTO. Why? Study the history of the Bulletin since 1986. The moderator (Brad Miller in those days) only once in these years found it necessary to cut a discussion that did not stop by itself: the discussion about Esperanto. My personal conclusion from that discussion was that quite a few people took part in the controversy without actually KNOWING very much about planned languages. Most of the contributions were assumptions and unproved claims. It is because of this observation that I am especially glad to announce the below book on INTERLINGUISTICS to the subscribers of this Bulletin. Klaus Schubert ********** BOOK ANNOUNCEMENT ********** BOOK ANNOUNCEMENT ******* INTERLINGUISTICS - ASPECTS OF THE SCIENCE OF PLANNED LANGUAGES. Red. Klaus Schubert (kunlabore kun Dan Maxwell). Berlin / New York: Mouton de Gruyter 1989, 348 p. Contents: Part I: Introductions Andr'e MARTINET (Paris): The proof of the pudding. Introductory note Klaus SCHUBERT (Utrecht): Interlinguistics - its aims, its achievements, and its place in language science Part II: Planned Languages in Linguistics Aleksandr D. DULI^CENKO (Tartu): Ethnic language and planned language Detlev BLANKE (Berlin): Planned languages - a survey of some of the main problems Sergej N. KUZNECOV (Moscow): Interlinguistics: a branch of applied linguistics? Part III: Language Design and Language Change Dan MAXWELL (Utrecht): Principles for constructing Planned Languages Francois LO JACOMO (Paris): Optimization in language planning Claude PIRON (Geneva): A few notes on the evolution of Esperanto Part IV: Sociolinguistics and Psycholinguistics Jonathan POOL (Seattle) - Bernard GROFMAN (Irvine): Linguistic artificiality and cognitive competence Claude PIRON (Geneva): Who are the speakers of Esperanto? Tazio CARLEVARO (Bellinzona): Planned auxiliary language and communicative competence Part V: The Language of Literature Manuel HALVELIK (Antwerp): Planning nonstandard language Pierre JANTON (Clermont-Ferrand): If Shakespeare had written in Esperanto ... Part VI: Grammar Probal DASGUPTA (Hyderabad): Degree words in Esperanto and categories in Universal Grammar Klaus SCHUBERT (Utrecht): An unplanned development in planned languages. A study of word grammar Part VII: Terminology and Computational Lexicography Wera BLANKE (Berlin): Terminological standardization - its roots and fruits in planned languages R"udiger EICHHOLZ (Bailieboro): Terminics in the interethnic language Victor SADLER (Utrecht): Knowledge-driven terminography for machine translation Index ************************************************************************* ------------------------------ To: [email protected] >From: [email protected] (S. R. Harnad) Newsgroups: comp.ai Subject: Proper Place of Connectionism Keywords: Categorization, Behavioral Capacity, Feature Detection Date: 16 Jun 89 06:09:24 GMT [[ The next few articles are from the comp.ai and comp.ai.shells newsgroups. I will, on occasion, post articles from there that seem relevant to this group. In the future I won't be making note of it, but you can tell from the `Newsgroups: ' line in the header of a msg. Be careful when replying to such message, as the original poster probably does not read this digest. This next one may not seem appropriate for nl-kr, but some readers have commented that they missed Steve Harnad's `colorful' comments. -CW]] ON THE PROPER PLACE OF CONNECTIONISM IN MODELLING OUR BEHAVIORAL CAPACITIES (Abstract of paper presented at First Annual Meeting of the American Psychological Society, Alexandria VA, June 11 1989) Stevan Harnad, Psychology Department, Princeton University, Princeton NJ 08544 Connectionism is a family of statistical techniques for extracting complex higher-order correlations from data. It can also be interpreted and implemented as a neural network of interconnected units with weighted positive and negative interconnections. Many claims and counterclaims have been made about connectionism: Some have said it will supplant artificial intelligence (symbol manipulation) and explain how we learn and how our brain works. Others have said it is just a limited family of statistical pattern recognition techniques and will not be able to account for most of our behavior and cognition. I will try to sketch how connectionist processes could play a crucial but partial role in modeling our behavioral capacities in learning and representing invariances in the input, thereby mediating the "grounding" of symbolic representations in analog sensory representations. The behavioral capacity I will focus on is categorization: Our ability to sort and label inputs correctly on the basis of feedback from the consequences of miscategorization. - - Stevan Harnad INTERNET: [email protected] [email protected] [email protected] [email protected] [email protected] CSNET: harnad%[email protected] BITNET: [email protected] [email protected] (609)-921-7771 ------------------------------ To: [email protected] >From: [email protected] (David Wolfram) Newsgroups: comp.ai Subject: ACE Version 1.3 Distribution Date: 20 Jun 89 08:47:45 GMT Reply-To: [email protected] (David Wolfram) Posted: Tue Jun 20 09:47:45 1989 ACE Version 1.3 --------------- ACE (Abstract Clause Engine) is an experimental program for solving problems specified by clauses. It has a variety of generic search methods, and a preprocessor. It should be useful for developing prototype languages, and for use in courses on logic programming or proof theory. Example problems include: - logic programming with equational unification - equational unification - rewriting - logic programming - context-free grammar parsing and generation - n queens problem - distinct representatives problem. The search methods include: - backtrack - optimised forward checking with search rearrangement - adaptive backtrack - depth first and breadth first search - iterative deepening (for one or more solutions). Some of these methods can be combined. For example, adaptive backtrack and iterative deepening. Search methods can also be combined to solve a problem. In logic programming with equational unification, the search method for finding equational unifiers can be different from that for finding refutations. ACE is written and distributed as Standard ML Version 2 source files in tar format on tape. It is approximately 125Kb in total size. It can be compiled with Poly/ML v1.75, and Standard ML of New Jersey, Version 0.33. Poly/ML is available only for VAX and Sun-3 computers running Berkeley UNIX. A Sun should have at last 4Mb of store. Cambridge can distribute Poly/ML for academic research purposes only. A Poly/ML licence permitting teaching or commercial research can be obtained from Imperial Software Technology 3 Glisson Road Cambridge CB1 2HA England. Phone: +44 223 462400. Please write to receive a copy of the licence agreement for ACE Version 1.3 and state whether you require a licence agreement for Poly/ML for academic research. Licence forms can be sent to you in LaTeX format by email. There is a distribution fee of 100 pounds sterling for ACE and 100 pounds sterling for Poly/ML, if it is required. The first distribution is expected to occur in September 1989. - -------------------------------------------------------------------------- David Wolfram E-mail: [email protected] University of Cambridge Telex: via 81240 CAMSPL G Computer Laboratory Fax: +44 223 334748 Pembroke Street Phone: +44 223 334634 Cambridge CB2 3QG England. ------------------------------ To: [email protected] >From: [email protected] (Alex M. Chan.) Newsgroups: comp.ai,comp.lang.smalltalk,comp.lang.lisp,or.general,pdx.general Subject: INFORMATION NEEDED....... Date: 25 Jun 89 05:49:10 GMT Reply-To: tektronix!nosun!whizz!tanya!kirk A friend of mine is working on a Chinese-English translator. Needs: 1) Electronic bitmaps and copy of "The People's Republic of China National Standard code of Chinese Graphic Character Set for Information Interchange GB 2312-80" At least the primary 'ChASCII' set of 6763 characters. Any bitmap size from 24x24 thru 60x60 would help. 2) Electronic Chinese dictionary. Latest respected version in ChASCII or whatever is available. 3) Electronic English-Chinese dictionary. Prefer "A New English-Chinese Dictionary" with definitions in ChASCII code. Any such dictionary would help. 4) Electronic Chinese-English dictionary. In addition to regular dictionary text, need full definition of each ChASCII character including meanings of individual strokes and sub-characters, character combination rules including word formation and disallowed combinations, and context shift rules. 5) Electronic English dictionary. Prefer Webster's New World, Third edition, having 200,000 English words with definitions. (Publisher won t sell electronic version. Any electronic dictionary would help. 6) Electronic English Thesaurus and/or Chinese Thesaurus. Most have some different entries, so prefer combination, but any would help. 7) Chinese Natural Language Parser/Generator. Handle 150 common sentence types, distinguish word boundaries, parts of speech; whatever is available. 8) English Natural Language Parser/Generator. Would like state of the art aductive reasoning system but will take anything. Prefer Smalltalk, Lisp OK. 9) If available in the Northwest, a Chinese-English linguist to help on this project on a volunteer basis. Anyone who can either provide any of these pieces to the translator or who can refer me to a good source of any of these is encouraged to reply via E-mail ( sun!nosun!{qiclab\|whizz}!tanya!kirk ) or via US MAIL to: Kirk W. Fraser, PO Box 1426, Beaverton, OR 97075 Thank you in advance. Sincerely, K. W. Fraser. ------------------------------ To: [email protected] >From: [email protected] (Eugene Miya) Newsgroups: comp.ai Subject: Re: Natural Language Date: 28 Jun 89 16:28:31 GMT Reply-To: [email protected] (Eugene Miya) The current dicussion about various aspects of natural language elicits me to ask the yearly query for examples of natural language to test speech synthesis and recognition. While a few people are working in these areas, there is lots of interest by a naive public which does not understand all of the issues in these areas. In an effort to aid testing, I ask for sample text for either synthesis and/or recognition. The existing informally collected file resides on aurora.arc.nasa.gov in the directory pub and file can be grabbed using one of either two names: speech.examples, or from a discussion in comp.arch on benchmarking names: Rhosettastone (the file is identical). Please email any example you might have to me as I do not reguarly read comp.ai. I will include it into the file IF it does not alredy exist in the file and does not contain potentially objectionable material (taste, it is a Govt. machine and we have lots of bureaucrats around 8). Credit will also be cited in the file. Another gross generalization from - -eugene miya, NASA Ames Research Center, [email protected] resident cynic at the Rock of Ages Home for Retired Hackers: "You trust the `reply' command with all those different mailers out there?" "If my mail does not reach you, please accept my apology." {ncar,decwrl,hplabs,uunet}!ames!eugene Live free or die. ------------------------------ To: [email protected] >From: [email protected] (Steve Peterson) Newsgroups: comp.ai.shells Subject: Knowledge Engineering References Date: 15 Jun 89 22:36:00 GMT Approved: [email protected] Posted: Thu Jun 15 23:36:00 1989 Hello, Recently I've been searching for some references on the knowledge engineering process. I'd appreciate receiving any information on methodologies for structuring the knowledge acquisition process (manual or automated) and then transforming that knowledge into an appropriate knowledge representation. Information on using a top-down/structured approach with hueristics like "Define your object classes before writing the rules", "Start with defining declarative knowledge, then define procedural knowledge", "Group rules into knowledge-islands", or "Only have one condition in the IF part of your rules" would be especially interesting. Comparisons of methodologies(top-down vs. bottom-up) would also be very interesting. Thanks in advance and I'll post a summary to net if there is sufficient interest. Stephen Peterson ARPA: [email protected] UUCP: {decwrl!decvax, mit-eddie, attunix}!apollo!peterson_s USPS: Apollo Computer, 220 Mill Rd.,MS: CHM 01 SS, Chelmsford MA. 01824 ------------------------------ To: [email protected] >From: [email protected] (Marco Valtorta) Newsgroups: comp.ai.shells Subject: Re: Knowledge Engineering References Date: 18 Jun 89 17:55:22 GMT Approved: [email protected] Posted: Sun Jun 18 18:55:22 1989 In article <[email protected]> you write: >Recently I've been searching for some references on the knowledge >engineering process. I'd appreciate receiving any information on >methodologies for structuring the knowledge acquisition process >(manual or automated) and then transforming that knowledge into an >appropriate knowledge representation. Information on using a >top-down/structured approach with hueristics like "Define your object >classes before writing the rules", "Start with defining declarative >knowledge, then define procedural knowledge", "Group rules into >knowledge-islands", or "Only have one condition in the IF part of >your rules" would be especially interesting. Comparisons of >methodologies(top-down vs. bottom-up) would also be very interesting. I recommend that you look at the KADS methodology for knowledge acquisition and structuring. Write joost breuker at the University of Amsterdam: ...!mcvax!swivax!breuker. I would be interested in a summary of replies to your query. Marco Valtorta usenet: ...!ncrcae!usceast!mgv Department of Computer Science csnet: [email protected] University of South Carolina tel.: (1)(803)777-4641 Columbia, SC 29208 tlx: 805038 USC U.S.A. fax: (1)(803)777-3065 usenet from Europe: ...!mcvax!uunet!ncrlnk!ncrcae!usceast!mgv ------------------------------ To: [email protected] >From: [email protected] (Caroline Knight) Newsgroups: comp.ai.shells Subject: Re: Knowledge Engineering References Date: 3 Jul 89 08:39:40 GMT Approved: [email protected] Posted: Mon Jul 3 09:39:40 1989 Also check out the research by Nigel Shadbolt, Nottinham University, UK He has been doing comparative large-scale studies of some knowledge acquisition techniques over the last few years. See his (and his co-authors) papers in:- Research and Development in Expert Systems IV ed by Stuart Moralee (= proceedings of Expert Systems '87, held in Brighton, UK) Proceedings of ECAI-88 Artificial Intelligence Review (1987) 1, pp245-253 And also for a now somewhat dated review of knowledge engineering and in particular knowledge acquisition: Margaret Welbank's "A Review of Knowledge Acquisition Techniques for Expert Systems" BT Research Labs, Ipswich, UK. 1983 Caroline Knight HPLabs, Bristol, UK ------------------------------ End of NL-KR Digest *****************
21.136	AIList Digest has died	HERON::ROACH	TANSTAAFL !	`Sun Jan 28 1990 13:40`	661
	Printed by: Pat Roach Document Number: 010103 -------------------------------------------------------------------------------- I N T E R O F F I C E M E M O R A N D U M Date: 26-Jan-1990 07:09pm CET From: AI_INFO AI_INFO@AIVTX@HERON@MRGATE@HUGHI@VBO Dept: Tel No: TO: ROACH@A1NSTC Subject: AIList Digest has died This is AIList's final message. After much soul-searching and discussion with folks here at MIT and elsewhere, I have come to the conclusion that the charter of the AIList was just too broad to be of any use to people doing real research. I know of twenty-one other lists that deal with AI topics, in more-or-less specific detail. The following was taken largely from Rich Zellich's list-of-lists as of Jan 1990. (available for anonymous ftp from NIC.DDN.MIL as INTEREST-GROUPS.TXT, in the directory NETINFO:), together with contributions from many others: AG-EXP-L%[email protected] Expert Systems in Agriculture AI-CHI <[email protected]> AI applications to Human-Computer interface design aicom [email protected] International Usenet AI newsgroup [email protected] AI in Education alvey jws%[email protected] British AI [email protected], comp.theory.cell-automata Cellular Automata list and newsgroup [email protected] Concurrent Logic Programming comp.ai Usenet AI [email protected] Connectionism CVNET%[email protected] Color and Vision research [email protected] Cybernetics and Systems FINEART%[email protected] Use of computers in the Fine Arts fj-ai%[email protected] Japanese AI foNETiks <r34334%[email protected]> Speech production and perception [email protected] <[email protected]> Genetic Algorithms IRList <[email protected]> Information Retrieval LANTRA-L%[email protected] Translation and interpretation of natural language mod-ki%[email protected] German AI NEURON%[email protected] Neural nets [email protected] Natural Language and knowledge representation [email protected] NSF calendar list PROLOG[-HACKERS]@SUSHI.STANFORD.EDU Prolog and logic programming [email protected], comp.simulation Simulation list and newsgroup [email protected], [email protected] Users of the Rochester Connectionist Simulator Symbolic Math <[email protected]> Algorithms, applications, and problems in symbolic math [email protected] AI Vision research * * * * In addition, the ADA Repository on SIMTEL20.ARPA (Mailing list [email protected]) contains a directory of AI programs in PD2:<ADA.AI>. Many of the above lists obey the internet convention of handling administrative matters (like subscription requests) via a second list whose name can be derived from the list name: to subscribe to a list called FOO@BAR, send mail to FOO-REQUEST@BAR. Further information on many of the above lists is appended below. - nick <[email protected]> * * * * AG-EXP-L%[email protected] Discusses the use of Expert Systems in Agricultural production and management. Primary emphasis is for practitioners, Extension personnel and Experiment Station researchers in the land grant system. BITNET, EARN, or NetNorth subscribers can join by sending the Listserv SUB command with your name. For example, SEND LISTSERV@NDSUVM1 SUB AG-EXP-L Jon Doe or TELL LISTSERV AT NDSUVM1 SUB AG-EXP-L Jon Doe To be removed from the list, SEND LISTSERV@NDSUVM1 SIGNOFF AG-EXP-L or TELL LISTSERV AT NDSUVM1 SIGNOFF AG-EXP-L Those without interactive access may send the Listserv Command portion of the above lines as the first TEXT line of a message. For example: SUB AG-EXP-L Jon Doe would be the only line in the body (text) of mail to LISTSERV@NDSUVM1. Monthly public logs of mail to AG-EXP-L are kept on LISTSERV for a few months. For a list of files send the 'Index AG-EXP-L' command to LISTSERV%[email protected]. Coordinator: Sandy Sprafka <NU020746%[email protected]> AI-CHI <[email protected]> Unmoderated mailing list intended for discussion on the subjects related to AI applications to Human-Computer interface design. This could include user modeling, self-adaptive interfaces, intelligent user agents, multi-modal I/O (Natural Language, graphics, speech), intelligent user-interface management systems, intelligent on-line advising, task modelling, and any other related issues. Announcements of books, papers, conferences, new products, public domain software tools, etc. are also encouraged. A limited archive of the most recent messages is available by request from [email protected]. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Coordinator: Dr. Sherman Tyler <[email protected]> [email protected] Discussions related to the application of artificial intelligence to education. This includes material on intelligent computer assisted instruction (ICAI) or intelligent tutoring systems (ITS), interactive encyclopedias, intelligent information retrieval for educational purposes, and pychological and cognitive science models of learning, problem solving, and teaching that can be applied to education. Issues related to teaching AI are welcome. Topics may also include evaluation of tutoring systems, commercialization of AI based instructional systems, description of actual use of an ITS in a classroom setting, user-modeling, intelligent user-interfaces, and the use of graphics or videodisk in ICAI. Announcements of books, papers, conferences, new products, public domain software tools, etc. are encouraged. If there are several people at one site that are interested, users should try to form a local distribution system to lessen the load on SUN.COM. Archives of messages are kept on host SUN.COM. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Moderators: J.R. Prohaska <[email protected]> Stuart Macmillan <[email protected]> [email protected] [email protected] Mailing-list for the exchange of information on all aspects of cellular automata and their applications. The list is gatewayed to/from the Usenet group comp.theory.cell-automata. Archived messages will be kept at Think.COM in the files: mail/ca.archive* There is a LISTSERV-maintained BitNet part of this list, CA-L@MITVMA. BitNet subscriptions can be managed in the usual way, e.g.: TELL LISTSERV AT MITVMA SUBSCRIBE CA-L your_full_name BitNet Notebooks with monthly archives are available from MITVMA from 11/89. All other requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Coordinator: Bruce Walker <[email protected]> [email protected] Unmoderated, direct-redistribution mailing list devoted to discussion of the following topics (among others): * Concurrent logic programming languages - Problematic constructs - Comparisons between languages * Concurrent constraint programming languages - Constraint solvers, including those for discrete constraint satisfaction - Language issues * Semantics, proof techniques and program transformations - Partial evaluation - Meta interpretation - Embedded languages * Parallel Prolog systems - Restricted And-parallel - Or-parallel Prolog * Implementations - Announcement of software packages - Reports on performance - Issues in implementation * Programming techniques and idioms, applications - Open systems and distributed computation - Small demonstration programs * Seminars, conferences, trip reports etc. related to the above All messages will be archived and can be obtained on request from the list coordinator. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected] or to [email protected]. Coordinator: Jacob Levy <[email protected]> CVNET%[email protected] The Color and Vision Network; the purpose is to make people in vision research and in color research who utilize e-mail communication known to each other. Mass mailing can also be easily done, so announcements supplied to CVNET@YORKVM1 get distributed to the subscriber list. Another activity is the compilation of a key word list that describes the activities of those listed. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to CVNET%[email protected]. Coordinator: Peter K. Kaiser <pkaiser%[email protected]> [email protected] CYBSYS-L%[email protected] [email protected] The Cybernetics and Systems mailing list is an open list serving those working in or just interested in the interdisciplinary fields of Systems Science, Cybernetics, and related fields (e.g. General Systems Theory, Complex Systems Theory, Dynamic Systems Theory, Computer Modeling and Simulation, Network Theory, Self-Organizing Systems Theory, Information Theory, Fuzzy Set Theory). The list is coordinated by members of the Systems Science department of the Watson School at SUNY-Binghamton, and is affiliated with the International Society for the Systems Sciences (ISSS) and the American Society for Cybernetics (ASC). To subscribe, send the following command to LISTSERV@BINGVMB via mail or interactive message: SUB CYBSYS-L your_full_name where "your_full_name" is your name. For example: SUB CYBSYS-L Joan Doe Non-BitNet users can subscribe by sending the text: SUB CYBSYS-L your_full_name in the body of a message to [email protected] or LISTSERV%[email protected]. To unsubscribe send the following command: UNSUB CYBSYS-L Coordinator: Cliff Joslyn <[email protected]> FINEART%[email protected] The FINEART Forum is dedicated to International collaboration between artists and scientists. It is subsidized by the International Society for the Arts, Science, and Technology (ISAST), 2020 Milvia, Berkeley, CA 94704. The purpose of this bulletin board is to disseminate information regarding the use of computers in the Fine Arts. Topics to be included are: Computers used in the design of works of art Computers used to fabricate works of art Computers used within works of art Computers used to analyse works of art Computers used to criticize art Computers used to distribute art General areas of interest include: Computer Animation Computer Aided Fabrication Shape Grammars Image Synthesis Design Rule Systems Style Simulation Image Rendering Interactive Video Art & AI Sensory Environments Picture Networks Paint Systems Send submissions & requests for list membership to: ARPANET: FINEART%[email protected] BITNET submissions: FINEART@umaecs BITNET subscriptions: LISTSERV@RUTVM1 (U.S.) LISTSERV@EB0UB011 (Europe) CSNET: [email protected] MCI-mail: FAST PHONE: (413) 545-1902 Moderator: Ray Lauzzana <lauzzana%[email protected]> foNETiks <r34334%[email protected]> Special interest group for the phonetic sciences called "foNETiks". It will publish information of current interest to researchers and students interested in speech production and speech perception, speech disorders, automatic speech recognition and speech synthesis. We would like to see contributions on signal analysis software used in speech research, current research in the phonetic sciences, meetings, questions, etc. The newsletter can be obtained by sending a simple request to R34334@UQAM on the BITNET network. foNETiks is also available from Psychnet <EPSYNET%[email protected]>. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to the Coordinator. Coordinator: Eric Keller <r34334%[email protected]> [email protected] Those interested in more information about genetic algorithms, including the next international conference on GA's, may wish to subscribe to GA-LIST. Send subscription requests to [email protected] submissions to [email protected] -- [email protected] (daniel m offutt) IRList <[email protected]> IRList is open to discussion of any topic (vaguely) related to Information Retrieval. Certainly, any material relating to ACM SIGIR (the Special Interest Group on Information Retrieval of the Association for Computing Machinery) is of interest. The field has close ties to artificial intelligence, database management, information and library science, linguistics, etc. A partial list of suitable topics is: Information Management/Processing/Science/Technology AI Applications to IR Hardware aids for IR Abstracting Hypertext and Hypermedia CD-ROM/CD-I/... Indexing/Classification Citations Information Display/Presentation Cognitive Psychology Information Retrieval Applications Communications Networks Information Theory Computational Linguistics Knowledge Representation Computer Science Language Understanding Cybernetics Library Science Data Abstraction Message Handling Dictionary analysis Natural Languages, NL Processing Document Representations Optical disc technology and applications Electronic Books Pattern Recognition, Matching Evidential Reasoning Probabilistic Techniques Expert Systems in IR Speech Analysis Expert Systems use of IR Statistical Techniques Full-Text Retrieval Thesaurus construction Fuzzy Set Theory Contributions may be anything from tutorials to rampant speculation. In particular, the following are sought: Abstracts of Papers, Reports, Dissertations Address Changes Bibliographies Conference Reports Descriptions of Projects/Laboratories Half-Baked Ideas Humorous, Enlightening Anecdotes Histories Questions Requests Seminar Announcements/Summaries Research Overviews Work Planned or in Progress The only real boundaries to the discussion are defined by the topics of other mailing lists. Please do not send communications to both this list and AIList or the Prolog list, except in special cases. The Moderator tries not to overlap much with NL-KR, except when both lists receive materials from contributors or from some bulletin board or researchers. There is no objection to distributing material that is destined for conference proceedings or any other publication. The Coordinator is involved in SIGIR Forum and, unless submittors request otherwise, may include submissions in whole or in part in future paper versions of the FORUM. Indeed, this is one form of solicitation for FORUM contributions! Both IRList and the FORUM are unrefereed, and opinions are always those of the author and not of any organization unless there are other indications. Copies of list items should credit the original author, not necessarily the IRList. The IRLIST Archives will be set up for anonymous FTP, and the address will be announced in future issues. To subscribe send the following command to [email protected]: SUB IR-L your_full_name where "your_full_name" is your real name, not your login Id. Non-BitNet users can join by sending the above command as the only line in the text/body of a message to LISTSERV%[email protected]. Moderator: IRLUR%[email protected] Editorial Staff: Clifford Lynch <[email protected]> <[email protected]> Mary Engle <[email protected]> <[email protected]> Nancy Gusack <[email protected]> LANTRA-L%[email protected] A forum for all aspects of translation and interpreting of natural languages including, but not restricted to, computer aids for translation and interpreting. All translators, interpreters, educators, and other people who are interested in this fascinating subject are welcome. Topics which can be discussed are: - computer aided translation - terminology - lexicography - intercultural communication - sociolinguistics - psycholingusistics - professional ethics for interpreters and translators - education and training of interpreters and translators etc. To add or remove yourself from the list, send a message to LISTSERV%[email protected]. The Sender of the message you send must be the name (E-mail address) you want to add or remove from the list. The text body of the message should be: SUBSCRIBE LANTRA-L your_full_name or: SIGNOFF LANTRA-L where your_full_name is your normal name, not your E-mail address. Coordinator: Helge Niska <HNISKA%[email protected]> NEURON%[email protected] ...!hplabs!neuron NEURON is a list (in digest form) dealing with all aspects of neural networks (and any type of network or neuromorphic system), especially: NATURAL SYSTEMS Software Simulations Neurobiology Hardware Neuroscience Digital ARTIFICIAL SYSTEMS Analog Neural Networks Optical Algorithms Cellular Automatons Some key words which may stir up some further interest include: Hebbian Systems Widrow-Hoff Algorithm Perceptron Threshold Logic Holography Content Addressable Memories Lyapunov Stability Criterion Navier-Stokes Equation Annealing Spin Glasses Locally Couples Systems Globally Coupled Systems Dynamical Systems (Adaptive) Control Theory Back-Propagation Generalized Delta Rule Pattern Recognition Vision Systems Parallel Distributed Processing Connectionism Any contribution in these areas is accepted. Any of the followin are reasonable: Abstracts Reviews Lab Descriptions Research Overviews Work Planned or in Progress Half-Baked Ideas Conference Announcements Conference Reports Bibliographies History Connectionism Puzzles and Unsolved Problems Anecdotes, Jokes, and Poems Queries and Requests Address Changes (Bindings) Archived files/messages will be sent to individuals on request. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Moderator: Peter Marvit <[email protected]> <marvit%[email protected]> [email protected] NL-KR is open to discussion of any topic related to the natural language (both understanding and generation) and knowledge representation, both as subfields of AI. The Moderator's interests are primarily in: Knowledge Representation Natural Language Understanding Discourse Understanding Philosophy of Language Plan Recognition Computational Linguistics Contributions are also welcome on topics such as: Cognitive Psychology (as related to NL/KR) Human Perception (same) Linguistics Machine Translation Computer and Information Science (as may be used to implement various Logic Programming (same) NL systems) Contributions may be anything from tutorials to speculation. In particular, the following are sought: Abstracts Reviews Lab Descriptions Research Overviews Work Planned or in Progress Half-Baked Ideas Conference Announcements Conference Reports Bibliographies History of NL/KR Puzzles and Unsolved Problems Anecdotes, Jokes, and Poems Queries and Requests Address Changes (Bindings) This list is in some sense a spin-off of the AIList, and as such, a certain amount of overlap is expected. The primary concentration of this list should be NL and KR, that is, natural language (be it understanding, generation, recognition, parsing, semantics, pragmatics, etc.) and how we should represent knowledge (aquisition, access, completeness, etc. are all valid issues). Topics deemed to be outside the general scope of this list will be forwarded to AIList (or other more appropriate list) or rejected. Readers are warned not to submit any information that is export-controlled or classified. Archival copies of all digests will be kept and are available via Anonymous FTP from ROCHESTER.ARPA/CS.ROCHESTER.EDU (cd to nl-kr); feel free to ask nl-kr-request for recent back issues if you have no FTP capability. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Moderator: Brad Miller <[email protected]> PROLOG[-HACKERS]@SUSHI.STANFORD.EDU Prolog and logic programming mailing lists. Some of the people answering the initial BBoard message stated that they would be interested in general Prolog and logic programming information, but not in the nitty-gritty details of Prolog systems and their bugs. Therefore, two mailing lists have been set up, PROLOG and PROLOG-HACKERS: PROLOG will provide a digest of articles of general interest; PROLOG-HACKERS will provide a direct mailing for the nasty stuff. Finally, PROLOG-REQUEST should be used for distribution requests. In a nutshell: Mail to for ------- --- [email protected] sending articles of general interest [email protected] sending articles of limited interest [email protected] getting in and out of the mailing lists and other bureaucracy Please do not send the same message to PROLOG and PROLOG-HACKERS. Messages will be moved between lists if appropriate. An archive of the USEnet prolog interest group interchange can be FTP'd from host SU-SCORE using standard anonymous login convention. The pathname is: PS:<PROLOG>UPIG.ARCHIVE Moderator: Chuck Restivo <[email protected]> [email protected] comp.simulation (UseNet newsgroup) All topics connected with simulation are welcome; some sample topics are: Real time simulation methods Flight simulation Parallel architectures for simulation analysis and modeling Simulation and training Distributed simulation Artificial intelligence and simulation Automatic generation and analysis of models Analog vs. digital methods, hybrids Continuous, discrete, and combined methods Qualitative modeling Application specific questions Theory of simulation and systems Queries and comments about available simulation software Announcements of simulation-related talks and seminars Graphics and image processing in simulation All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Moderator: Paul Fishwick <[email protected]> <[email protected]> ...ihnp4!codas!uflorida!fish!fishwick (UUCP) [email protected] [email protected] Mailing list to allow users of the Rochester Connectionist Simulator to talk to one another. Please send BUG REPORTS to [email protected]. We are interested in fixing bugs, but can't make any promises! Please make your bug reports as specific as possible. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Coordinator: Liudvikas Bukys <[email protected]> Symbolic Math <[email protected]> Mailing list covering symbolic math algorithms, applications and problems relating to the various symbolic math languages. It is primarily the USENET newsgroup sci.math.symbolic; items are forwarded to ARPANET, BITNET and CSNET from randvax. Mail to be forwarded to the list should be sent to leff%[email protected] (ARPANET/MilNet) or sci.math.symbolic (USENET). Requests to be included on the list should be sent to leff%[email protected]. Coordinator: Laurence Leff <leff%[email protected]> [email protected] Discussion group for artificial intelligence vision researchers. The list is intended to embrace discussion on a wide range of vision topics, including physiological theory, computer vision, artificial intelligence technology applied to vision research, machine vision algorithms, industrial applications, robotic eyes, implemented systems, ideas, profound thoughts -- anything related to vision and its automation is fair game. Previous messages are available on request to [email protected]. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to [email protected]. Moderator: Tod Levitt <[email protected]> * END OF LIST OF AI-RELATED LISTS AND NEWSGROUPS *