Xref: rde comp.ai:1810 news.answers:3184 comp.answers:685 Newsgroups: comp.ai,news.answers,comp.answers Path: rde!gator!tarpit!uunet!europa.eng.gtefsd.com!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!mkant From: mkant+@cs.cmu.edu (Mark Kantrowitz) Subject: FAQ: Artificial Intelligence Questions & Answers 1/5 [Monthly posting] Message-ID: Followup-To: poster Summary: Frequently asked questions about AI Sender: news@cs.cmu.edu (Usenet News System) Supersedes: Nntp-Posting-Host: a.gp.cs.cmu.edu Reply-To: mkant+ai-faq@cs.cmu.edu Organization: School of Computer Science, Carnegie Mellon University Date: Thu, 13 May 1993 07:21:31 GMT Approved: news-answers-request@MIT.Edu Expires: Thu, 24 Jun 1993 07:20:36 GMT Lines: 1361 Archive-name: ai-faq/part1 Last-Modified: Tue May 11 18:10:03 1993 by Mark Kantrowitz Version: 1.6 ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai-faq-1.text -- 56308 bytes If you think of questions that are appropriate for this FAQ, or would like to improve an answer, please send email to mkant+ai-faq@cs.cmu.edu. *** Topics Covered: Part 1: [1-0] What is the purpose of this newsgroup? [1-1] AI-related Associations and Journals [1-2] How do I get a copy of the proceedings to conference ? [1-4] What are the rules for the game of "Life"? [1-5] What AI competitions exist? [1-8] Commercial AI products. [1-9] Glossary of AI terms. [1-10] What are the top schools in AI? [1-11] How can I get the email address for Joe or Jill Researcher? Part 2 (AI-related Newsgroups and Mailing Lists): List of all known AI-related newsgroups, mailing lists, and electronic bulletin board systems. Part 3 (Bibliography): Bibliography of introductory texts, overviews and references Addresses and phone numbers for major AI publishers Part 4 (FTP Resources): [4-0] General Information about FTP Resources for AI [4-1] FTP Repositories [4-2] FTP and Other Resources Part 5 (FTP Resources): [5-1] AI Bibliographies available by FTP [5-2] AI Technical Reports available by FTP [5-3] Where can I get a machine readable dictionary, thesaurus, and other text corpora? [5-4] List of Smalltalk implementations. Search for [#] to get to question number # quickly. *** Recent changes: ;;; 1.6 ;;; 14-APR-93 mk Added entry on MICE to planning testbeds in part 4. ;;; 14-APR-93 mk Added entry on INTERNATIONAL JOURNAL OF APPROXIMATE ;;; REASONING. ;;; 14-APR-93 mk Changed Probabilisitic Reasoning category in schools list ;;; to "Reasoning under uncertainty" and added a school to it. ;;; 14-APR-93 mk Removed entry on GASSY from part 4, per author's request. ;;; 14-APR-93 mk Added entry on Prime Time Freeware CD ROMs to part 4 of the ;;; FAQ. ;;; 14-APR-93 mk Added Genetic Programming Repository to part 4. ;;; 14-APR-93 mk Added Speech Analysis and Synthesis to Bibliography. ;;; 15-APR-93 mk UCI ML Database archive now has archie mail server. ;;; 15-APR-93 mk Added Linguistics intros to bibliography. ;;; 15-APR-93 mk Added Xerox part of speech tagger to part 4. ;;; 16-APR-93 mk Updated subscription information for KAW mailing list. ;;; 19-APR-93 mk Corrected Computers and AI journal entry. ;;; 19-APR-93 mk Added entry on SME to part 4. ;;; 23-APR-93 mk Corrected IAKE phone number. ;;; 23-APR-93 mk Corrected various entries associated with ILS, including ;;; ftp sources for ICU and ICBR, and the technical report ftp ;;; location. ;;; 23-APR-93 mk Updated Open Book Initiative entry. ;;; 26-APR-93 mk Added entry on DTP to part 4. ;;; 26-APR-93 mk Added Uncertainty in AI mailing list. ;;; 26-APR-93 mk Updated ISAI entry. ;;; 26-APR-93 mk Updated MUME entry. ;;; 27-APR-93 mk Updated ACL directory of grad programs in computational ;;; linguistics entry in 1-10 and in 1-1. ;;; 29-APR-93 mk Updated SNNS ftp address. ;;; 29-APR-93 mk Added entry on availability of source to the programs from ;;; Pereira and Shieber's book on NLU in Prolog. ;;; 30-APR-93 mk Split part 4 of the FAQ (FTP Resources) into parts 4 and 5. ;;; 30-APR-93 mk Added entry on SETHEO under theorem provers. ;;; 30-APR-93 mk Added Chuck Wooters' TIMIT-based pronunciation dictionary ;;; to part 5. ;;; 6-MAY-93 mk Added entry on Jeffrey Mark Siskind's Screamer package to ;;; part 4. ;;; 11-MAY-93 mk Added entry on Evoluntionary Programming digest to part 2. ;;; 11-MAY-93 mk Updated entry on ATREE in part 4. ;;; 12-MAY-93 mk Reviewed various genetic algorithms contents of this FAQ ;;; after reading through Joerg Heitkoetter's new FAQ for ;;; comp.ai.genetic. Mostly minor changes (e.g., inserting ;;; pointers to his FAQ). Expanded the reference to Nici ;;; Schraudolph's GA software survey, including a BRIEF ;;; listing of the free software from Nici's list. *** Introduction: Certain questions and topics come up frequently in the various network discussion groups devoted to and related to Artificial Intelligence (AI). This file/article is an attempt to gather these questions and their answers into a convenient reference for AI researchers. It is posted on a monthly basis. The hope is that this will cut down on the user time and network bandwidth used to post, read and respond to the same questions over and over, as well as providing education by answering questions some readers may not even have thought to ask. The latest version of this file is available via anonymous FTP from CMU: To obtain the file from CMU, connect by anonymous ftp to any CMU CS machine (e.g., ftp.cs.cmu.edu [128.2.206.173]), using username "anonymous" and password "name@host". The files ai-faq-1.text, ai-faq-2.text, ai-faq-3.text, and ai-faq-4.text are located in the directory /afs/cs.cmu.edu/user/mkant/Public/AI/ [Note: You must cd to this directory in one atomic operation, as some of the superior directories on the path are protected from access by anonymous ftp.] If your site runs the Andrew File System, you can just cp the file directly without bothering with FTP. The FAQ postings are also archived in the periodic posting archive on rtfm.mit.edu [18.70.0.226]. Look in the anonymous ftp directory /pub/usenet/news.answers/ in the subdirectory ai-faq/. If you do not have anonymous ftp access, you can access the archive by mail server as well. Send an E-mail message to mail-server@rtfm.mit.edu with "help" and "index" in the body on separate lines for more information. ---------------------------------------------------------------- ~Subject: [1-0] What is the purpose of this newsgroup? The newsgroup comp.ai exists for general discussion of topics related to Artificial Intelligence. For example, possible topics can include (but are not necessarily limited to): announcements of AI books and products discussion of AI programs and tools questions about AI techniques problems implementing an AI technique Postings should be of general interest to the AI community. See also part 2 of the FAQ for a list of other more specialized discussion lists. Every so often, somebody posts an inflammatory message, such as Will computers every really think? AI hasn't done anything worthwhile. These "religious" issues serve no real purpose other than to waste bandwidth. If you feel the urge to respond to such a post, please do so through a private e-mail message, or post redirecting follow-ups to comp.ai.philosophy. We've tried to minimize the overlap with the FAQ postings to the comp.lang.lisp, comp.lang.prolog and comp.ai.neural-nets newsgroups, so if you don't find what you're looking for here, we suggest you try the FAQs for those newsgroups. These FAQs should be available by anonymous ftp from rtfm.mit.edu [18.70.0.226] in subdirectories of /pub/usenet/ or by sending a mail message to mail-server@rtfm.mit.edu with subject "help". The Lisp FAQ is also available by anonymous ftp from the same ftp location as the AI FAQ and from ftp.think.com:/public/think/lisp/. Information about Prolog may be obtained from two sources: The Prolog FAQ, which is posted twice a month to the newsgroup comp.lang.prolog by Jamie Andrews , and the Prolog Resource Guide, which is posted to the newsgroup comp.lang.prolog once a month, and is available by anonymous ftp from ftp.cs.cmu.edu [128.2.206.173] as the file /afs/cs.cmu.edu/user/mkant/Public/AI/prolog-resource-guide.txt. The Robotics FAQ is available by anonymous ftp from ftp.cs.cmu.edu [128.2.206.173] in the directory /user/nivek/robotics-faq as the files part1 and part2. To obtain a copy by email, send a message to mail-server@pit-manager.mit.edu containing the following lines: send usenet/news.answers/robotics-faq/part1 send usenet/news.answers/robotics-faq/part2 On UUCP, it is available at uunet!/archive/usenet/news.answers/robotics-faq/ as the files part1.Z and part2.Z (or by ftp from ftp.uu.net [137.39.1.9] in /archive/usenet/news.answers/robotics-faq/). Information about object-oriented programming can be obtained in the newsgroups comp.object, comp.lang.clos, and comp.lang.smalltalk. Information about object-oriented databases can be obtained in the survey compiled by Stewart Clamen, which may be found either in the comp.object FAQ posting or in byron.sp.cs.cmu.edu:clamen/evolution-summary ---------------------------------------------------------------- ~Subject: [1-1] AI-related Associations and Journals Associations: AMERICAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AAAI) AAAI, 445 Burgess Drive, Menlo Park, CA 94025. 415-328-3123, info@aaai.org, membership@aaai.org Membership includes AI Magazine: $40 regular, $20 student, $60 institution (US/Canadian) $65 regular, $45 student, $85 institution (Foreign) AAAI has several special interest groups (SIGs), including one on manufacturing and one on medicine. ASSOCIATION FOR COMPUTING MACHINERY (ACM) ACM, 1515 Broadway, New York, NY 10036. Member Services, 11 West 42nd Street, New York, NY 10036. 212-869-7440. Fax 212-944-1318. Email: acmhelp@acmvm.bitnet. $75 regular, $22 student (includes Communications of the ACM) $15 ($8 students) extra for SIGART membership (gets Sigart Bulletin; non-member subscription is $41) $12 ($7 students) extra for Lisp Pointers. $15 ($10 students) extra for Computing Surveys $34 ($29 students) extra for Computing Reviews INTERNATIONAL ASSOCIATION OF KNOWLEDGE ENGINEERS (IAKE) IAKE, 11820 Parklawn Drive, Suite 302, Rockville, MD 20852. 301-948-5390 $65 regular, $30 students. ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL) Natural language processing research and applications. Members receive the journal Computational Linguistics, ISSN 0891-2017. Regular membership $30 ($20 full-time students not earning a regular income; $20 for retired), $10 extra for first class/air postage in North America, $20 elsewhere. For more information write to Dr. Donald E. Walker (ACL), Bellcore, 445 South Street, MRE 2A379, Morristown, NJ 07960, USA, call +1-201-829-4312, fax +1-201-829-5981, or send email to acl@bellcore.com. Institutions must subscribe to the journal through MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142, USA, +1-617-253-2889. INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS (IEEE) IEEE Service Center, 445 Hoes Lane, PO Box 1331, Piscataway, NJ 08855. 1-800-678-IEEE, 201-981-0060 IEEE membership is $95 regular ($23 students) For membership in the IEEE Computer Society, add $22. $20 for IEEE Expert (Intelligent Systems and their Applications) $12 for Transactions on Neural Networks $12 for Transactions on Systems, Man and Cybernetics $15 for Transactions on Robotics and Automation $19 for Transactions on Knowledge and Data Engineering $24 for Transactions on Pattern Analysis and Machine Intelligence INTERNATIONAL SOCIETY OF APPLIED INTELLIGENCE (ISAI) Membership is $25 for associate members and $75 for full members. Full members receive a subscription to the International Journal of Applied Intelligence (normal institutional rate is $217). To apply contact Graham Forsyth, secretary, forsyth@fencer.cis.dsto.gov.au. Or write to ISAI, Department of Computer Science, Southwest Texas State University, San Marcos, TX 78666-4616, phone 512-245-3409, fax 512-245-3804, or send email to Moonis Ali, president, . Working groups include CIM -- Learning in Intelligent Manufacturing Systems, Automatic Failure Diagnostics, Production Management, Finance, Building Architecture, Scheduling and Planning. COGNITIVE SCIENCE SOCIETY Membership: $50 individuals, $25 student. Add $15 overseas postage. Members receive a copy of the journal Cognitive Science without additional charge. Write to Alan Lesgold, Secretary/Treasurer, Cognitive Science Society, LRDC, University of Pittsburgh, 3939 O'Hara Street, Pittsburgh, PA 15260, fax 1-412-624-9149, email al+@pitt.edu. INTERNATIONAL FUZZY SYSTEMS ASSOCIATION (IFSA) Membership $180, includes a subscription to the International Journal of Fuzzy Sets and Systems, ISSN 0165-0114. Write to Prof. Philippe Smets, University of Brussels, IRIDIA, 50 av. F. Roosevelt, CP 194/6, 1050 Brussels, Belgium. NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY (NAFIPS) For more information, contact Thomas H. Whalen, Secretary/Treasurer, Decision Sciences Department, Georgia State University, Atlanta, GA 30303, 404-651-4080, . NAFIPS holds a conference and a workshop in alternating years. SOCIETY FOR MACHINES AND MENTALITY James H. Moor, Treasurer, Society for Machines and Mentality, Department of Philosophy, Dartmouth College, 6035 Thornton Hall, Hanover, NH 03755-3592 U.S.A. 603-646-2155. Email: James.H.Moor@Dartmouth.edu $5 Membership only $50 Membership with subscription to _Minds and Machines_ CANADIAN AI SOCIETY (CSCSI) c/o CIPS, 430 King Street West, Suite 205, Toronto, Ontario M5V 1L5 416-593-4040 JAPANESE ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (JSAI) OS Bldg. Suite #402 4-7 Tsukudo-cho, Shinjuku-ku Tokyo 162 Japan Phone: +81-3-5261-3401 Telfax: +81-3-5261-3402 INTERNATIONAL NEURAL NETWORK SOCIETY (INNS) Membership is $55/year for non-students and $45/year for students, and includes a subscription to "Neural Networks", the official journal of the society. INNS Membership, P.O. Box 491166, Ft. Washington, MD 20749 INTERNATIONAL STUDENT SOCIETY FOR NEURAL NETWORKS (ISSNNets) Membership is $5 per year. ISSNNet, Inc., P.O. Box 15661, Boston, MA 02215 See also comp.org.issnnet. JAPANESE NEURAL NETWORK SOCIETY (JNNS) Department of Engineering, Tamagawa University, 6-1-1, Tamagawa Gakuen, Machida City, Tokyo, 194 JAPAN Phone: +81 427 28 3457 Fax: +81 427 28 3597 ARTIFICIAL INTELLIGENCE ITALIAN ASSOCIATION (AIIA) c/o Fondazione Ugo Borboni, Roma - Italy Contact: Oliviero Stock Tel: +39 6 54803428 Fax: +39 6 54804405 THE INTERNATIONAL ASSOCIATION FOR ARTIFICIAL INTELLIGENCE AND LAW (IAAIL) Contact: Prof. Carole Hafner, IAAIL, College of Computer Science, Northeastern University, 360 Huntington Avenue, Boston, MA 02115 USA Membership: $60 Regular, $35 student (incuding AI and Law Journal) $25 Reduced (without journal subscription) ASSOCIATION FOR MACHINE TRANSLATION IN THE AMERICAS (AMTA) 655 Fifteenth Street, NW, Suite 310, Washington, DC 20005 Membership: $40 Associate members, $65 active members, Institutional $200, Corporate $400. Members receive the MT News International and the MT Yellow Pages. Newsletters: The Computists' Communique is a weekly online newsletter for AI/IS/CS scientists. It covers research and funding news; career, consulting, and entrepreneurial issues; AI-related job postings and journal calls; FTPable & other resource leads; market trends; analysis and discussion. The Communique serves members of Computists International, a professional mutual-aid society. Membership in Computists International runs $135 for new professional members, $55 for students and the unemployed. There is a 25% discount for Canada, Western Europe, the UK, Japan, and Australia; other countries and territories outside the U.S. get a 50% discount. For more information, contact Dr. Kenneth I. Laws (laws@ai.sri.com), 415-493-7390, 4064 Sutherland Drive, Palo Alto, CA 94303. Note: Some Journals are listed with the publishing organization above. Journals -- General: JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (JAIR) JAIR is published by the AI Access Foundation, a nonprofit corporation devoted to the electronic dissemination of scientific results in AI. JAIR is a refereed publication, covering all areas of AI, that will be distributed free of charge over the internet by ftp, electronic mail, and in the newsgroups comp.ai.jair (announcements and abstracts of new papers), comp.ai.jair.ps (postscript versions of papers), comp.ai.jair.text (text versions of papers), comp.ai.jair.code (code and data appendices), and comp.ai.jair.d (unmoderated discussion of published articles). In addition, each complete volume of JAIR will be published by Morgan Kaufmann. JAIR aims to have a review turn-around time of about 5 weeks, with electronic publication occurring immediately after the editor receives the final version of an accepted article. JAIR will begin accepting submissions on June 15, 1993. Further information regarding submissions can be obtained by sending a request to jair@ptolemy.arc.nasa.gov. [The newsgroups have not yet been created.] JOURNAL OF COMPUTATIONAL INTELLIGENCE Published 4 times annually. ISSN 0824-7935 Basil Blackwell Publishers, Journal Subscription Department, 3 Cambridge Centre, Cambridge, MA 02142 or call 1-800-835-6770. Blackwell Publishers, 108 Cowley Road, Oxford, OX4 1JF, England. Individual subscriptions are $85 in North America and $100 in the rest of the world. Institutional subscriptions are $175 and $190, respectively. A reduced rate of $40 is available to members of the Canadian Information Processing Society. ARTIFICIAL INTELLIGENCE REVIEW (Survey and Tutorial Journal) Kluwer Academic Publishers, 101 Philip Drive, Norwell, MA 02061, 617-871-6600, fax 617-871-6528. PO Box 358, Accord Station, Hingham, MA 02018-0358. Email: kluwer@world.std.com The institutional subscription rate is $130 per volume (4 issues). ARTIFICIAL INTELLIGENCE Published 18 times annually. ISSN 0004-3702. $80 individuals (must be a member of one of the major AI societies). To order in the US, write to AAAI, AI Journal, 445 Burgess Drive, Menlo Park, CA 94025-3496, or to Elsevier Science Publishing, 655 Avenue of the Americas, New York, NY 10017, 212-633-3827. Outside the US, contact Elsevier Science Publishers, Attn: Ursula van Dijk, PO Box 103, 1000 AC Amsterdam, The Netherlands, or call +31-20-5862-608. COGNITIVE SCIENCE Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648 201-767-8450, fax 201-767-6717 $50 individual, $125 institution. JOURNAL OF EXPERIMENTAL AND THEORETICAL ARTIFICIAL INTELLIGENCE (JETAI) Annual subscription, 1992/3, $163; personal subscription, $82. To order in the US, write to Taylor and Francis, Inc., 1900 Frost Road, Suite 101, Bristol, PA 19007-1598. Or contact the home office: Taylor and Francis Ltd, Rankine Road, Basingstoke, Hampshire, UK RG24 0PR (0256) 840366. ISSN 0952-813X SPANG ROBINSON REPORT ON INTELLIGENT SYSTEMS Published monthly. ISSN 0885-9957. Subscriptions: $405 US & Canada, $455 elsewhere. John Wiley and Sons, Inc., 605 Third Avenue, New York, NY 10158-0012, 212-850-6347, fax 212-850-6088. MINDS AND MACHINES Journal for Artificial Intelligence, Philosophy, and Cognitive Science ISSN 0924-6495 Subscription information and sample copies available from: Kluwer Academic Publishers Group, P.O. Box 322, 3300 AH Dordrecht, The Netherlands. In the US, write to Kluwer Academic Publishers, 101 Philip Drive, Norwell, MA 02061. COMPUTERS AND ARTIFICIAL INTELLIGENCE I. Plander (ed.) VEDA Publishing House of the Slovak Academy of Sciences, Klemenosova 19, 814 30 Bratislava, Slovakia. Published bimonthly, order from: Lange & Springer GmbH, Foller Str.2, P.O.B. 10 16 10, 5000 Koln 1, Germany. INTERNATIONAL JOURNAL OF AI TOOLS World Scientific Publishing Co., Inc. 1060 Main Street, River Edge, NJ 07661 Tel: 1-800-227-7562 Organizations -- Robotics Related: For a list of organizations that are robotics related, see the FAQ posting for comp.robotics, maintained by Kevin Dowling . Journals -- Applied AI: APPLIED ARTIFICIAL INTELLIGENCE Published 4 times annually. ISSN 0883-9514 Subscriptions: Institutions $176; Individuals $84. Hemisphere Publishing Corp., 1900 Frost Rd., Suite 101, Bristol, PA 19007 215-785-5800, fax 215-785-5515. (in the UK, write to Taylor & Francis Ltd., Rankine Rd., Baskingstoke, Hampshire RG24 0PR, UK, call +44-256-840366, or fax +44-256-479438) APPLIED INTELLIGENCE The International Journal of Artificial Intelligence, Neural Networks, and Complex Problem-Solving Technologies Subscriptions: Institutions $217; Individuals $75. Editor in Chief: Dr. Moonis Ali, Professor of Computer Science, The University of Tennessee Space Institute, Tullahoma, TN 37388 Publisher: Kluwer Academic Publishers, P.O. Box 358, Accord Station, Hingham, MA 02018-0358, . Journals -- AI and Law: ARTICIAL INTELLIGENCE AND LAW Subscriptions: $158, including postage Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord Station, Hingham, MA 02018-0358. Journals -- Automated Reasoning: JOURNAL OF AUTOMATED REASONING Published 6 times annually. ISSN 0168-7433 Subscriptions: Individuals $131; Institutions $263; AAR members $65. Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord Station, Hingham, MA 02018-0358. Journals -- Concurrent Engineering: CONCURRENT ENGINEERING: RESEARCH & APPLICATIONS (CERA) Published quarterly. Official journal of the Concurrent Engineering Institute of the International Society for Productivity Enhancement (ISPE). Academic Press Ltd., 24-28 Oval Road, London, NW1 7DX, UK. Call 71-267-4466, fax 71-482-2293 or 71-485-4752, or email ac2@ib.rl.ac.uk. Relevant to parallel processing, blackboard systems, distributed AI, and AI in manufacturing. For information about submissions, write to Biren Prasad, Managing Editor, CERA Institute, PO Box 250254, West Bloomfield, MI 48325, call 313-492-0551, fax 313-661-8333, or send email to bprasad@cmsa.gmr.com. Journals -- Engineering: ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE Published 6 times annually. Subscriptions: Institutions (1992) 235.00 or approx US$425.00; two year institutional rate (1992/93) 446.50 or approx US$807.50. North America: Pergamon Press Inc., 660 White Plains Road, Tarrytown, NY 10591-55153, USA. Rest of the World: Pergamon Press Ltd, Headington Hill Hall, Oxford OX3 0BW, England. Tel: Oxford (0865)794141 Journals -- Expert Systems: EXPERT SYSTEMS WITH APPLICATIONS Published 4 times annually. ISSN 0957-4174. Subscriptions: Institutions L85 ($155), Individuals L45 ($72). Pergamon Press Inc., 660 White Plains Road, Tarrytown, NY 10591-5153, email PPI@pergamon.com, or Pergamon Press Ltd., Headington Hill Hall, Oxford OX3 0BW, England. EXPERT SYSTEMS: THE INTERNATIONAL JOURNAL OF KNOWLEDGE ENGINEERING Published 4 times annually. ISSN 0266-4720. Subscriptions: L85 ($110) Learned Information Ltd., Woodside, Hinksey Hill, Oxford OX1 5AU, UK. Tel: +44 (0)865-730275 Fax: +44 (0)085-736354 INTERNATIONAL JOURNAL OF EXPERT SYSTEMS Published 4 times annually. ISSN 0894-9077. Subscriptions: Institutions $135; Individuals $75. Outside the US add $10 for surface mail and $20 for airmail. JAI Press Inc., 55 Old Post Road -- No. 2, PO Box 1678, Greenwich, CT 06836-1678. Journals -- Genetic Algorithms: EVOLUTIONARY COMPUTATION Published 4 times annually, beginning April/May 1993. 100 pages per issue, 7x10. ISSN 1063-6550 Editor-in-chief: Kenneth De Jong Subscription Rates: Individuals $45 ($63.13 Canada, $59 elsewhere), Institutions $120.00 ($143.38 Canada, $134.00 elsewhere), and Students/Retired $30.00 ($47.08 Canada, $44.00 elsewhere). MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142-1399, 617-253-2889, fax 617-258-6779, E-mail hiscox@mitvma.mit.edu. Journals -- Machine Learning: MACHINE LEARNING Published 8 times annually. ISSN 0885-6125 Subscriptions: Institutions $301; Individuals $140. (AAAI Individual Members $88) Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord Station, Hingham, MA 02018-0358. Journals -- NLP/Speech/MT: COMPUTER SPEECH AND LANGUAGE Published 4 times annually. ISSN 0885-2308. Subscriptions: Institutions $136, Individuals $58. Academic Press Ltd., 24-28 Oval Road, London NW1, England. MACHINE TRANSLATION Published 4 times annually. ISSN 0922-6567. Subscriptions: Institutions $141 plus $16 postage; Individuals $55 (members of ACL $46). Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord Station, Hingham, MA 02018-0358. Journals -- Neural Nets/Connectionism: CONNECTION SCIENCE Published 4 times annually. ISSN 0954-0091. Subscriptions: Individual $82, Institution $184, Institution (UK) 74 pounds Carfax Publishing Company, PO Box 25, Abingdon, Oxfordshire OX14 3UE, UK. THE INTERNATIONAL JOURNAL OF NEURAL NETWORKS RESEARCH & APPLICATIONS Published quarterly. ISSN 0954-9889. Learned Information Ltd., Woodside, Hinksey Hill, Oxford OX1 5AU, UK. Tel: +44 (0)865-730275 Fax: +44 (0)085-736354 INTERNATIONAL JOURNAL OF NEURAL SYSTEMS Published quarterly. ISSN 0129-0657 Subscriptions: Individual $42, Institution $88 (plus $9-$17 for postage) USA: World Scientific Publishing Co., 687 Hartwell Street, Teaneck, NJ 07666, 201-837-8858; Eurpoe: World Scientific Publishing Co. Pte. Ltd., 73 Lynton Mead, Totteridge, London N20-8DH, England, (01) 4462461; Other: World Scientific Publishing Co. Pte. Ltd., Farrer Road, P.O. Box 128, Singapore 9128, 2786188. NEURAL COMPUTING AND APPLICATIONS Published quarterly. Official journal of the Neural Computing Applications Forum. Subscriptions: #120 per annum. (Free to NCAF members.) Springer Verlag, Service Center Secaucus, 44 Hartz Way, Secaucus, NJ 07094 Tel: 201-348-4033 Springer-Verlag, Springer House, 8 Alexandra Road, LONDON SW19 7JZ Tel: ..44/0 81 947 1280 Fax: 0 81 947 1274 Spqringer-Verlag, Heidelberger Platz 3, D-1000 BERLIN, Germany Tel: (0)30 8207-1 NEURAL COMPUTATION Published quarterly since 1989. ISSN 0899-7667. MIT Press Journals, 55 Hayward Street Cambridge, MA 02142-9949, 617-253-2889 Subscriptions: Individual $45, Institution $90, Students $35. Add $9 for foreign subscriptions. NEURAL NETWORKS Published 6 times annually. ISSN 0893-6080. Official journal of the International Neural Network Society. Subscriptions: $380 Pergamon Press, Ltd., Headington Hill Hall, Oxford OX3 0BW, UK. Pergamon Press, Inc., 660 White Plains Road, Tarrytown, NY 10591-5153. Journals -- Pattern Recognition: INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE Annual subscription, 1992/3, $340; individual subscription, $138. Add $34 for airmail. Published 5 times a year by World Scientific Publishing Co. Pte. Ltd., Farrer Road, PO Box 128, Singapore 9128. (In the US, write to World Scientific Publishing Co., Inc., River Edge, NJ 07661; in Europe to World Scientific Publishing Co., Inc., Totteridge, London N20 8DH, England.) PATTERN RECOGNITION Journal of the Pattern Recognition Society. Members receive the journal free of charge as part of their membership in the Society. Institutions may subscribe for $845. Pergamon Press, Ltd., Headington Hill Hall, Oxford OX3 0BW, UK. Pergamon Press, Inc., 660 White Plains Road, Tarrytown, NY 10591-5153. PATTERN RECOGNITION LETTERS Published 12 times annually. ISSN 0167-8655. Official publication of the International Association for Pattern Recognition. Subscriptions: $462 Institutions. Elsevier Science Publishing, 655 Avenue of the Americas, New York, NY 10017, 212-633-3827. Outside the US, contact Elsevier Science Publishers, Attn: Ursula van Dijk, PO Box 103, 1000 AC Amsterdam, The Netherlands, or call +31-20-5862-608. Journals -- Reasoning Under Uncertainty: INTERNATIONAL JOURNAL OF APPROXIMATE REASONING The treatment of Uncertainty in Artificial Intelligence Published 8 times a year. ISSN 0888-613X. Subscriptions: Institutions $282; included with NAFIPS membership (see NAFIPS entry above). North-Holland, Elsevier Science Publishing Co., Inc., 655 Avenue of the Americas, New York, NY 10010 Journals -- Robotics: INDUSTRIAL ROBOT ISSN 0143-991X Published quarterly. $145/year MCB University Press Limited, 62 Toller Lane, Bradford, West Yorkshire, England BD8 9BY, (44) 274-499821, fax (44) 274-547143. In the US, write to MCB University Press Limited, PO Box 10812, Birmingham, AL 35201-0812, 1-800-633-4931 (1-205-995-1567), fax 1-205-995-1588. INTERNATIONAL JOURNAL OF ROBOTICS AND AUTOMATION Published 4 times annually. ISSN 0826-8185 Subscriptions: $165 US or 313.50 SFr. ($12 US or 22.80 SFr postage and handling). A special rate is available to members of IASTED. Write to ACTA Press, PO Box 354, CH-8053, Zurich, Switzerland or ACTA Press, PO Box 2481, Anaheim, CA 92814. IASTED is the International Association of Science and Technology for Development. Individual memberships are $60 US or $120 SFr and corporate memberships $100 US or $200.00 SFr. Members receive a complimentary subscription to the journal of their choice; the annual cost of additional journals for members is $20US/$40SFr per journal. Write to IASTED, PO Box 25, Station G, Calgary, Alberta, Canada T3A 2G1, or IASTED, PO Box 354, CH-8053, Zurich, Switzerland. INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH MIT Press, 28 Carleton Street, Cambridge, MA 02142 Subscriptions: $50/year to individuals JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS Three issues per volume, $58.50 per volume (individual) Kluwer Academic Publishers Group, PO Box 322, 3300 AH Dordrecht, The Netherlands. In the US write to Kluwer Academic Publishers, PO Box 358, Accord Station, Hingham, MA 02018-0358. ROBOTICS TODAY Society of Manufacturing Engineers, One SME Drive, PO Box 930, Dearborn, MI 48121. 313-271-1500 ROBOTICS WORLD Published quarterly. Communication Channels, 6255 Barfield Road, Atlanta, GA 30328 404-256-9800 A magazine of flexible automation for the end-user. They also publish the Robotics World Directory for $49.95 ROBOT (Japanese) Industrial Robots and Application Systems Published bimonthly. Japan Industrial Robot Association (JIRA) Kikai-Shinko Building, 3-5-8, Shiba-Kohen, Mina To-ku, Tokyo, Japan Tokyo (03) 3434-2919, fax (03) 3578-1404 ROBOTICA International Journal of Information, Education and Research in Robotics and Artificial Intelligence. Published quarterly, US $179/year. Cambridge University Press, The Edinburgh Building, Shaftesbury Road, Cambridge CB2 2RU, UK. In the US write to Cambridge University Press, Journals Department, 40 West 20th Street, New York, NY 10011-4211. Journals -- User Modeling: USER MODELING AND USER-ADAPTED INTERACTION 4 issues per annum, ISSN 0924-1868, $153.50 p.a. ($50 for individuals) Kluwer Academic Publishers Group, P.O. Box 322, 3300 AH Dordrecht, The Netherlands. Journals -- Virtual Reality: PRESENCE Subscriptions: $50 individual, $120 institutions, $40 students/retired (higher rates for Canada and overseas) MIT Press Journals 55 Hayward Street, Cambridge, MA 02142-1399 617-253-2889, fax 617-258-6779 hiscox@mitvma.mit.edu Journals -- Vision: MACHINE VISION AND APPLICATIONS Published 4 times annually. ISSN 0932-8092. Subscriptions: Institutions $106 (plus $11 p&h); Individuals $54 (incl p&h). Springer-Verlag New York Inc., Journal Fulfillment Services, 44 Hartz Way, Secaucus, NJ 07094, 1-800-SPRINGER. INTERNATIONAL JOURNAL OF COMPUTER VISION Published 6 times annually. ISSN 0920-5691. Subscriptions: Institutions $229; Individuals $115. Add $8 for airmail. Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord Station, Hingham, MA 02018-0358. Other Journals and Magzines: If you have the subscription information for the following, please send a message with that information to mkant+ai-faq@cs.cmu.edu. Journals: Behavioral and Brain Sciences Brain and Cognition Brain and Language Cognition Cognition and Brain Theory Cognitive Psychology Computer Vision, Graphics, and Image Processing Human Intelligence IEEE Transactions on Fuzzy Sets and Systems ? International Journal of Man-Machine Studies Journal of the Association for the Study of Perception Journal of Intelligent Systems Journal of Intelligent & Robotic Systems Journal of Logic Programming Journal of Symbolic Computing New Generation Computing (logic programming) Speech Technology Magazines: AISB Newsletter Annual Review in Automatic Programming Artificial Intelligence Report IEEE Control Systems Magazine (often has articles about NNs and fuzzy systems) Robotics Age ---------------------------------------------------------------- ~Subject: [1-2] How do I get a copy of the proceedings to conference ? First, ask your librarian for help. If your local library doesn't have it, they may be able to get it on interlibrary loan. If you want to buy your own copy, first check with the organization that ran the conference. See the answer to question [1-1] for a list of many of the AI organizations that sponsor conferences. If they can't help you, contact the Institute for Scientific Information (ISI), and look up the proceedings in their Index to Scientific and Technical Proceedings (ISTP volumes). You can contact the ISI at Institute for Scientific Information, Inc. 3501 Market Street Philadelphia, PA 19104 Phone: 215-386-0100 Fax: 215-386-6362 Another source for proceedings author and subject indexes is: Directory of Published Proceedings. Series SEMT: Science/Engineering/Medicine/Technology. Published monthly with annual cumulations by InterDok, Harrison, NY. ISSN 0012-3293. ---------------------------------------------------------------- ~Subject: [1-4] What are the rules for the game of "Life"? Cellular Automata, of which Life is an example, were suggested by Stanislaw Ulam in the 1940s, and first formalized by von Neumann. Conway's "Game of Life" was popularized in Martin Gardner's mathematical games column in the October 1970 and February 1971 issues of Scientific American. (Shorter notes on life are alse given in the column in each month from October 1970 to April 1971, and well as November 1971, January 1972, and December 1972.) There's also quite a bit on the game in "The Recursive Universe", by William Poundstone, Oxford University Press, 1987, 252 pages. The rules for the game of life are quite simple. The game board is a rectangular cell array, with each cell either empty or filled. At each tick of the clock, we generate the next generation by the following rules: if a cell is empty, fill it if 3 of its neighbors are filled (otherwise leave it empty) if a cell is filled, it dies of loneliness if it has 1 or fewer neighbors continues to live if it has 2 or 3 neighbors dies of overcrowding if it has more than 3 neighbors Neighbors include the cells on the diagonals. Some implementations use a torus-based array (edges joined top-to-bottom and left-to-right) for computing neighbors. For example, a row of 3 filled cells will become a column of 3 filled cells in the next generation. The R pentomino is an interesting pattern: xx xx x Try it with other patterns of 5 cells initially occupied. If you record the ages of cells, and map the ages to colors, you can get a variety of beautiful images. When implementing Life, be sure to maintain separate arrays for the old and new generation. Updating the array in place will not work correctly. ---------------------------------------------------------------- ~Subject: [1-5] What AI competitions exist? The Loebner Prize, based on a fund of over $100,000 established by New York businessman Hugh G. Loebner, is awarded annually for the computer program that best emulates natural human behavior. During the contest, a panel of independent judges attempts to determine whether the responses on a computer terminal are being produced by a computer or a person, along the lines of the Turing Test. The designers of the best program each year win a cash award and a medal. If a program passes the test in all its particulars, then the entire fund will be paid to the program's designer and the fund abolished. For further information about the Loebner Prize, write Dr. Robert Epstein, Executive Director, Cambridge Center for Behavioral Studies, 11 Waterhouse Street, Cambridge, MA 02138, or call 617-491-9020. The BEAM Robot Olympics is a robot exhibition/competition started in 1991. For more information about the competition, write to BEAM Robot Olympics, c/o: Mark W. Tilden, MFCF, University of Waterloo, Ontario, Canada, N2L-3G1, 519-885-1211 x2454, mwtilden@watmath.uwaterloo.ca. The Gordon Bell Prize competition recognizes outstanding achievements in the application of parallel processing to practical scientific and engineering problems. Entries are considered in performance, price/performance, compiler parallelization and speedup categories, and a total of $3,000 will be awarded. The prizes are sponsored by Gordon Bell, a former National Science Foundation division director who is now an independent consultant. Contestants should send a three- or four-page executive summary to 1993 Gordon Bell Prize, c/o Marilyn Potes, IEEE Computer Society, 10662 Los Vaqueros Cir., PO Box 3014, Los Alamitos, CA 90720-1264, before May 31, 1993. ---------------------------------------------------------------- ~Subject: [1-8] Commercial AI products. See the Robotics FAQ for information on Robotics manufacturers. GBB, generic blackboard framework: provides: -- A high-performance blackboard database compiler and runtime library, which support pattern-based, multidimensional range-searching algorithms for efficient proximity-based retrieval of blackboard objects -- KS representation languages -- Generic control shells and agenda-management utilities -- Interactive, graphic displays for monitoring and examining blackboard and control components These components provide the infrastructure needed to build blackboard-based applications. GBB is available for DOS/Windows, Mac, Unix workstations (Sun, HP/Apollo, IBM, DEC, Silicon Graphics), Symbolics and TI Explorer Lisp machines. (GBB is a significantly enhanced, commercial version of the UMass GBB research framework, available via FTP as described in FAQ, part 3.) NetGBB, distributed extension to GBB: provides to GBB the communication and coordination facilities needed to build heterogenous distributed blackboard applications. For more information write to Blackboard Technology Group, Inc., 401 Main Street, Amherst, MA 01002, call 413-256-8990, or fax 413-256-3179. To be added to the mailing lists, send mail to gbb-user-request@bn.cs.umass.edu. There are two mailing lists, gbb-user (moderated) and gbb-users (unmoderated). RAL (Rule-extended Algorithmic Language) is a C-based RETE (OPS83) implementation that allows one to seamlessly add rules and objects to C programs. It runs on Apollo, Sony News, AT&T 3B series, Aviion, DecStation, HP9000, RS/6000, Sun3, Sparc, Pyramid, Stratus, Unix System V 386 machines, VAX, microVAX (VMS) and DOS. Production Systems Technologies was founded by Charles Forgy, the original inventor of the RETE algorithm. For further information, write to Production Systems Technologies, Inc., 5001 Baum Boulevard, Pittsburgh, PA 15213, call 412-683-4000 or fax 412-683-6347. Stiquito is a small (3cm H x 7cm W x 6cm L), simple (32 parts) and inexpensive (< $30) nitinol-propelled hexapod robot developed at the Indiana University (Bloomington) Robotics Laboratory. Its legs are propelled by nitnol actuator wires. Each leg has one degree of freedom. The robot walks up to 10 centimeters per minute and can carry a 9-volt cell, a MOSIS "tiny chip" and power transistors to drive the nitinol actuator wires. Nitinol wire (aka BioMetal, Flexinol), is a nickel-titanium alloy which exerts useful force as it is heated by passing a current through it. IUCS Technical Report 363a describes Stiquito's construction and is available by anonymous ftp from cs.indiana.edu:/pub/stiquito (129.79.254.191) as are many other related files. The tech report is also available by US mail for $5 (checks or money orders should be made payable to "Indiana University") from Computer Science Department, Attn: TR 363a 215, Lindley Hall, Indiana University, Bloomington, Indiana 47405. A kit containing all the materials needed to construct a simple version of Stiquito and its controller is available for an extra $10 from the above address (use attn line "Stiquito Kit"). To receive a video showing the assembly of Stiquito, include an additional $10 and add "Video" to the "Attn:" line. Anyone may build and use Stiquitos in any quantity for educational or research purposes, but Indiana University reserves all rights to commercial applications. Questions about Stiquito should be sent to Prof. Jonathan W. Mills . To join the Stiquito mailing list run by Jon Blow of UC/Berkeley, send mail to stiquito-request@xcf.berkeley.edu. Togai InfraLogic, Inc. (TIL) is a supplier of fuzzy logic and fuzzy expert system software and hardware. For more information, write to Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718, call +1 714 975 8522, fax +1 714 975 8524, or send email to info@til.com or til!info. TIL also supports an email-server that can be reached at fuzzy-server@til.com or til!fuzzy-server. Send an email message that contains just the word "help" in either the subject line or the message body for more information. A list of products can be obtained by sending a message that contains only the line "send products.txt" to the email-server. For an index of the contents of the server, send a message with the line "send index". YAPS is a tool for building expert systems and other programs that use a rule-based knowledge representation in Lisp. The YAPS library provides a CLOS class and appropriate methods which the programmer may mix into his/her own classes or use directly. Rules and facts about an instance are associated with the instance. Instead of one large knowledgebase with many rules which are hard to debug and maintain, the programmer creates smaller knowledge-bases which are modular and more efficient. The YAPS knowledge-bases can interact with and be controlled by the programmer's other modules, making hybrid systems straightforward. Introduced by Liz Allen at AAAI-83, YAPS is now available on Apple Macintosh, Sun3 and Sun4 (SPARC), DEC VAX under VMS and Ultrix, and 88Open platforms. YAPS runs in most commercial Common Lisps including Allegro CL, Harlequin Lispworks, Lucid CL, IBUKI CL, and Macintosh Common Lisp. YAPS is also available for the TI Explorer and Symbolic Lisp Machines, and a Flavors version is available for Sun3 in Franz Lisp. Other ports are underway -- for price and availability contact College Park Software at 461 W. Loma Alta Dr., Altadena, CA 91001-3841, USA; or by email at info@cps.altadena.ca.us, or call 818-791-9153 (voice) or 818-791-1755 (FAX). The following is from Risks Digest 13.83 -- I have no idea what the software does, but Colby did head up the PARRY project: FEELING HELPLESS ABOUT DEPRESSION? Overcoming Depression 2.0 provides computer based cognitive therapy for depression with therapeutic dialogue in everyday language. Created by Kenneth Mark Colby, M.D., Professor of Psychiatry and Biobehavioural Sciences, Emeritus, UCLA. Personal Version ($199), Professional version ($499). Malibu Artificial Intelligence Works, 25307 Malibu Rd, CA 90265. 1-800-497-6889. ---------------------------------------------------------------- ~Subject: [1-9] Glossary of AI terms. This is the start of a simple glossary of short definitions for AI terminology. Strong AI: Claim that computers can be made to actually think, just like human beings do. More precisely, the claim that there exists a class of computer programs, such that any implementation of such a program is really thinking. Weak AI: Claim that computers are important tools in the modeling and simulation of human activity. Case-based Reasoning: Technique whereby "cases" similar to the current problem are retrieved and their "solutions" modified to work on the current problem. Nonlinear Planning: A planning paradigm which does not enforce a total (linear) ordering on the components of a plan. Admissibility: An admissible search algorithm is one that is guaranteed to find an optimal path from the start node to a goal node, if one exists. In A* search, an admissible heuristic is one that never overestimates the distance remaining from the current node to the goal. Fuzzy Logic: In Fuzzy Logic, truth values are real values in the closed interval [0..1]. The definitions of the boolean operators are extended to fit this continuous domain. By avoiding discrete truth-values, Fuzzy Logic avoids some of the problems inherent in either-or judgments and yields natural interpretations of utterances like "very hot". Fuzzy Logic has applications in control theory. Verification: The process of confirming that an implemented model works as intended. Validation: The process of confirming that one's model uses measureable inputs and produces output that can be used to make decisions about the real world. ---------------------------------------------------------------- ~Subject: [1-10] What are the top schools in AI? The answer to this question is not intended to be a ranking and should not be interpreted as such. There are several major problems with ratings like the Gourman Report and the US News and World Report. Such rankings are often unsubstantiated and anecdotal, their accuracy is questionable, and they do not focus on the subfields of an area. When selecting a graduate school, students should look for schools which not only have excellent programs in their general area of research but also at least one faculty member whose research interests mesh well with the student's. Accordingly, we've broken down this list according to topic, and sorted the schools within each topic in ALPHABETICAL ORDER. For a school to be added to a topic area, there should at least two faculty actively conducting research in that area and the school should have a "good" reputation in that area. Exceptions are made for schools which only have one faculty member in the area, but that professor is a "leader" of the area, or for fields where the total number of people working in the area is small in the first place. The general idea behind these criteria is to ensure that a school has enough activity in the area that a student who considers one of these schools won't be disappointed if one of the faculty in that area is on sabbatical or isn't taking students. The best way for students to discover which schools are good in a field is to ask professors (and graduate students) in their undergraduate school for suggestions on where to apply. Reading the research journals in the field is another good method (see question [1-1]). A list of email addresses for CS departments is posted once a month to the newsgroup soc.college.gradinfo. The Association for Computational Linguistics publishes a directory of graduate programs in Computational Linguistics ($15 for members, $30 for others). Contact Donald E. Walker (ACL), Bellcore, 445 South Street MRE 2A379, Morristown, NJ 07960, +1-201-829-4312, acl@bellcore.com for more information. NOTE THAT THIS LIST IS PRELIMINARY AND BY NO MEANS COMPLETE. Please feel free to suggest schools that are particularly strong in any of these areas, or to suggest new areas to be listed. Schools with excellent programs in most fields: Carnegie Mellon University (CMU) MIT Stanford Georgia Tech Imperial College Indiana Institute for the Learning Sciences, Northwestern University (ILS) Maryland Rutgers SUNY/Buffalo Sussex University Toronto UCLA UC/Berkeley Univ. of Edinburgh Univ. of Illinois/Urbana-Champaign (UIUC) Univ. of Massachusetts/Amherst Univ. of Michigan Univ. of Pittsburgh Univ. of Rochester Univ. of Southern California & USC/Information Sciences Institute Yale AI and Medicine: MIT Stanford Univ. of Pittsburgh AI and Legal Reasoning: Imperial College Univ. of Massachusetts/Amherst Artificial Life: UCLA Automated Deduction/Theorem Proving: Imperial College Stanford Univ. of Edinburgh Univ. of Oregon Univ. of Texas/Austin Case-Based Reasoning/Analogical Reasoning: Chicago Georgia Tech Institute for the Learning Sciences, Northwestern University (ILS) Univ. of Massachusetts/Amherst Univ. of Pittsburgh Cognitive Modelling: Carnegie Mellon University (CMU) Georgia Tech Indiana Univ. of Michigan Connectionism/Neural Networks: Boston University, Cognitive and Neural Systems Department (ART networks) Brown University CalTech Carnegie Mellon University (CMU) Indiana MIT Ohio State Univ. Stanford Syracuse University Toronto UC/Irvine UC/San Diego UCLA UNC/Chapel Hill Univ. of Colorado/Boulder Univ. of Illinois/Urbana-Champaign (UIUC) Univ. of Massachusetts/Amherst Univ. of Pennsylvania Univ. of Southern California & USC/Information Sciences Institute Decision Theory and AI: Berkeley MIT Stanford Univ. of Michigan Univ. of Washington Distributed AI: Univ. of Massachusetts/Amherst Univ. of Michigan Emotion: Carnegie Mellon University Institute for the Learning Sciences, Northwestern University (ILS) Fuzzy Logic: Berkeley Genetic Algorithms: George Mason Univ. of Illinois/Urbana-Champaign (UIUC) Univ. of Michigan Integrated AI Architectures: Carnegie Mellon University (CMU) Stanford Univ. of Michigan Intelligent Tutoring, AI & Education: Carnegie Mellon University (Cognitive Science Department) Illinois Institute of Technology (IIT) Institute for the Learning Sciences, Northwestern University (ILS) Univ. of Pittsburgh Knowledge Representation: Institute for the Learning Sciences, Northwestern University (ILS) Stanford SUNY/Buffalo Univ. of Oregon Logic Programming and Logic-based AI: Carnegie Mellon University (CMU) Imperial College Stanford UCLA Univ. of Edinburgh Univ. of Melbourne Univ. of Illinois/Urbana-Champaign (UIUC) Univ. of Oregon Univ. of Pennsylvania Machine Discovery: Carnegie Mellon University (CMU) Machine Learning: Brown University Carnegie Mellon University (CMU) George Mason Georgia Tech Johns Hopkins MIT UCI Univ. of Massachusetts/Amherst Univ. of Michigan Univ. of Southern California & USC/Information Sciences Institute Natural Language Processing (NLU, NLG, Parsing, NLI, Speech): Brown Carnegie Mellon University (CMU) Columbia Georgia Tech Illinois Institute of Technology (IIT) Institute for the Learning Sciences, Northwestern University (ILS) ISI Indiana MIT Penn Stanford SUNY/Buffalo Toronto UCLA Univ. of Massachusetts/Amherst Univ. of Pittsburgh Univ. of Rochester Univ. of Southern California & USC/Information Sciences Institute Waterloo (stylistics, MT, discourse) Nonmonotonic Reasoning: Imperial College Stanford UCLA Univ. of Oregon Toronto Philosophy of AI: MIT Berkeley Planning: Brown University Carnegie Mellon University (CMU) Imperial College MIT Stanford Univ. of Massachusetts/Amherst Univ. of Oregon Univ. of Pittsburgh Univ. of Rochester Univ. of Washington/Seattle Waterloo Production Systems/Expert Systems: Carnegie Mellon University (CMU) Illinois Institute of Technology (IIT) Stanford Qualitative Physics and Model Based Reasoning: Northwestern ILS (Forbus) Univ. of Oregon Univ. of Texas Univ. of Washington Reasoning Under Uncertainty (Probabilistic Reasoning, Approximate Reasoning, etc.): Brown University George Mason Oregon State University Stanford UCLA Univ. of Rochester University of South Carolina Robotics: Bristol Polytechnic, UK Brown California Institute of Technology (Caltech) Carnegie Mellon University (CMU) Georgia Tech Harvard Hull University, UK MIT Naval Postgraduate School New York University (NYU) Courant Institute of Mathematical Sciences North Carolina State Univerisity/Raleigh (NCSU) Oxford Purdue Reading University, UK Rennsalear Polytechnic Institute (RPI) Salford University, UK Stanford Swiss Federal Institute of Technology UC/Berkeley Univ. of Alberta Univ. of Kansas Univ. of Kentucky Univ. of Maryland Univ. of Massachusetts/Amherst Univ. of Michigan Univ. of Paris INRIA Univ. of Pennsylvania Univ. of Southern California & USC/Information Sciences Institute Univ. of Utah Univ. of Wisconsin Yale Search: UCLA Univ. of Oregon Temporal Reasoning: Imperial College Virtual Reality: Carnegie Mellon University (CMU) Columbia Florida Institute of Technology MIT Media Lab Naval Postgraduate School UVA Univ. North Carolina/Chapel Hill (UNC) Vision: Carnegie Mellon University (CMU) Columbia Johns Hopkins MIT SUNY/Buffalo UCLA Univ. of Maryland Univ. of Massachusetts/Amherst Univ. of Rochester Univ. of Southern California & USC/Information Sciences Institute ---------------------------------------------------------------- ~Subject: [1-11] How can I get the email address for Joe or Jill Researcher? The AAAI membership directory is updated annually and contains addresses, phone numbers, and email addresses for many members of AAAI and other AI societies. Contact info@aaai.org for information on getting a copy of the directory (you should get a free copy if you are a member of one of the listed societies). See also the Email Address FAQ posting to the newsgroups soc.college and soc.net-people. The Artificial Intelligence and Molecular Biology Researchers database contains names, institutions, addresses, phone, fax, email, research interests and other related information about more than 200 researchers worldwide. The database is available via anonymous ftp from the host lhc.nlm.nih.gov in the directory /pub/aimb-db. There are computer- and human- readable versions available. Get the README file for more information or send email to Larry Hunter, . ---------------------------------------------------------------- ;;; *EOF* Xref: rde comp.ai.fuzzy:540 comp.answers:686 news.answers:3185 Newsgroups: comp.ai.fuzzy,comp.answers,news.answers Path: rde!gator!tarpit!uunet!europa.eng.gtefsd.com!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!mkant From: mkant+@cs.cmu.edu (Mark Kantrowitz) Subject: FAQ: Fuzzy Logic and Fuzzy Expert Systems 1/1 [Monthly posting] Message-ID: Followup-To: poster Summary: Answers to Frequently Asked Fuzzy Questions. Read before posting. Sender: news@cs.cmu.edu (Usenet News System) Nntp-Posting-Host: a.gp.cs.cmu.edu Reply-To: mkant+fuzzy-faq@cs.cmu.edu Organization: School of Computer Science, Carnegie Mellon University Date: Thu, 13 May 1993 07:21:31 GMT Approved: news-answers-request@MIT.EDU Expires: Thu, 24 Jun 1993 07:20:36 GMT Lines: 1539 Archive-name: fuzzy-logic/part1 Last-modified: Fri Apr 16 17:29:33 1993 by Mark Kantrowitz Version: 1.0 ;;; ***************************************************************** ;;; Answers to Questions about Fuzzy Logic and Fuzzy Expert Systems * ;;; ***************************************************************** ;;; Written by Erik Horstkotte, Cliff Joslyn, and Mark Kantrowitz ;;; fuzzy-faq.text -- 57099 bytes Contributions and corrections should be sent to the mailing list mkant+fuzzy-faq@cs.cmu.edu. Note that the mkant+fuzzy-faq@cs.cmu.edu mailing list is for discussion of the content of the FAQ posting only. It is not the place to ask questions about fuzzy logic and fuzzy expert systems; use the newsgroup comp.ai.fuzzy for that. If a question appears frequently in that forum, it will get added to the FAQ list. The original version of this FAQ posting was prepared by Erik Horstkotte of Togai InfraLogic , with significant contributions by Cliff Joslyn . The FAQ is maintained by Mark Kantrowitz with advice from Erik and Cliff. To reach us, send mail to mkant+fuzzy-faq@cs.cmu.edu. Thanks also go to Michael Arras for running the vote which resulted in the creation of comp.ai.fuzzy, Yokichi Tanaka for help in putting the FAQ together, and Walter Hafner , Satoru Isaka , Henrik Legind Larsen , Tom Parish , Liliane Peters , Naji Rizk , Peter Stegmaier , Prof. J.L. Verdegay , and Dr. John Yen for contributions to the initial contents of the FAQ. This FAQ is posted once a month on the 13th of the month. In between postings, the latest version of this FAQ is available by anonymous ftp from CMU: To obtain the file from CMU, connect by anonymous ftp to any CMU CS machine (e.g., ftp.cs.cmu.edu [128.2.206.173]), using username "anonymous" and password "name@host". The file fuzzy-faq.text, is located in the directory /afs/cs.cmu.edu/user/mkant/Public/AI/ [Note: You must cd to this directory in one atomic operation, as some of the superior directories on the path are protected from access by anonymous ftp.] If your site runs the Andrew File System, you can just cp the file directly without bothering with FTP. The FAQ postings are also archived in the periodic posting archive on rtfm.mit.edu [18.70.0.226]. Look in the anonymous ftp directory /pub/usenet/news.answers/ in the subdirectory fuzzy-logic/. If you do not have anonymous ftp access, you can access the archive by mail server as well. Send an E-mail message to mail-server@rtfm.mit.edu with "help" and "index" in the body on separate lines for more information. Table of Contents: [1] What is the purpose of this newsgroup? [2] What is fuzzy logic? [3] Where is fuzzy logic used? [4] What is a fuzzy expert system? [5] Where are fuzzy expert systems used? [6] What is fuzzy control? [7] What are fuzzy numbers and fuzzy arithmetic? [8] Isn't "fuzzy logic" an inherent contradiction? Why would anyone want to fuzzify logic? [9] How are membership values determined? [10] What is the relationship between fuzzy truth values and probabilities? [11] Are there fuzzy state machines? [12] What is possibility theory? [13] How can I get a copy of the proceedings for ? [14] Fuzzy BBS Systems, Mail-servers and FTP Repositories [15] Mailing Lists [16] Bibliography [17] Journals [18] Professional Organizations [19] Companies Supplying Fuzzy Tools [20] Fuzzy Researchers Search for [#] to get to topic number # quickly. In newsreaders which support digests (such as rn), [CNTL]-G will page through the answers. Recent changes: ;;; 21-APR-93 eh Corrected crisp value of Centroid defuzzification and added ;;; example. ;;; 21-APR-93 mk Two corrections from Dr. Aivars Celmins wrt IFSA entry. ================================================================ ~Subject: [1] What is the purpose of this newsgroup? ~Date: 15-APR-93 The comp.ai.fuzzy newsgroup was created in January 1993, for the purpose of providing a forum for the discussion of fuzzy logic, fuzzy expert systems, and related topics. ================================================================ ~Subject: [2] What is fuzzy logic? ~Date: 15-APR-93 Fuzzy logic is a superset of conventional (Boolean) logic that has been extended to handle the concept of partial truth -- truth values between "completely true" and "completely false". It was introduced by Dr. Lotfi Zadeh of UC/Berkeley in the 1960's as a means to model the uncertainty of natural language. Zadeh says that rather than regarding fuzzy theory as a single theory, we should regard the process of ``fuzzification'' as a methodology to generalize ANY specific theory from a crisp (discrete) to a continuous (fuzzy) form (see "extension principle" in [2]). Thus recently researchers have also introduced "fuzzy calculus", "fuzzy differential equations", and so on (see [7]). Fuzzy Subsets: Just as there is a strong relationship between Boolean logic and the concept of a subset, there is a similar strong relationship between fuzzy logic and fuzzy subset theory. In classical set theory, a subset U of a set S can be defined as a mapping from the elements of S to the elements of the set {0, 1}, U: S --> {0, 1} This mapping may be represented as a set of ordered pairs, with exactly one ordered pair present for each element of S. The first element of the ordered pair is an element of the set S, and the second element is an element of the set {0, 1}. The value zero is used to represent non-membership, and the value one is used to represent membership. The truth or falsity of the statement x is in U is determined by finding the ordered pair whose first element is x. The statement is true if the second element of the ordered pair is 1, and the statement is false if it is 0. Similarly, a fuzzy subset F of a set S can be defined as a set of ordered pairs, each with the first element from S, and the second element from the interval [0,1], with exactly one ordered pair present for each element of S. This defines a mapping between elements of the set S and values in the interval [0,1]. The value zero is used to represent complete non-membership, the value one is used to represent complete membership, and values in between are used to represent intermediate DEGREES OF MEMBERSHIP. The set S is referred to as the UNIVERSE OF DISCOURSE for the fuzzy subset F. Frequently, the mapping is described as a function, the MEMBERSHIP FUNCTION of F. The degree to which the statement x is in F is true is determined by finding the ordered pair whose first element is x. The DEGREE OF TRUTH of the statement is the second element of the ordered pair. In practice, the terms "membership function" and fuzzy subset get used interchangeably. That's a lot of mathematical baggage, so here's an example. Let's talk about people and "tallness". In this case the set S (the universe of discourse) is the set of people. Let's define a fuzzy subset TALL, which will answer the question "to what degree is person x tall?" Zadeh describes TALL as a LINGUISTIC VARIABLE, which represents our cognitive category of "tallness". To each person in the universe of discourse, we have to assign a degree of membership in the fuzzy subset TALL. The easiest way to do this is with a membership function based on the person's height. tall(x) = { 0, if height(x) < 5 ft., (height(x)-5ft.)/2ft., if 5 ft. <= height (x) <= 7 ft., 1, if height(x) > 7 ft. } A graph of this looks like: 1.0 + +------------------- | / | / 0.5 + / | / | / 0.0 +-------------+-----+------------------- | | 5.0 7.0 height, ft. -> Given this definition, here are some example values: Person Height degree of tallness -------------------------------------- Billy 3' 2" 0.00 [I think] Yoke 5' 5" 0.21 Drew 5' 9" 0.38 Erik 5' 10" 0.42 Mark 6' 1" 0.54 Kareem 7' 2" 1.00 [depends on who you ask] Expressions like "A is X" can be interpreted as degrees of truth, e.g., "Drew is TALL" = 0.38. Note: Membership functions used in most applications almost never have as simple a shape as tall(x). At minimum, they tend to be triangles pointing up, and they can be much more complex than that. Also, the discussion characterizes membership functions as if they always are based on a single criterion, but this isn't always the case, although it is quite common. One could, for example, want to have the membership function for TALL depend on both a person's height and their age (he's tall for his age). This is perfectly legitimate, and occasionally used in practice. It's referred to as a two-dimensional membership function, or a "fuzzy relation". It's also possible to have even more criteria, or to have the membership function depend on elements from two completely different universes of discourse. Logic Operations: Now that we know what a statement like "X is LOW" means in fuzzy logic, how do we interpret a statement like X is LOW and Y is HIGH or (not Z is MEDIUM) The standard definitions in fuzzy logic are: truth (not x) = 1.0 - truth (x) truth (x and y) = minimum (truth(x), truth(y)) truth (x or y) = maximum (truth(x), truth(y)) Some researchers in fuzzy logic have explored the use of other interpretations of the AND and OR operations, but the definition for the NOT operation seems to be safe. Note that if you plug just the values zero and one into these definitions, you get the same truth tables as you would expect from conventional Boolean logic. This is known as the EXTENSION PRINCIPLE, which states that the classical results of Boolean logic are recovered from fuzzy logic operations when all fuzzy membership grades are restricted to the traditional set {0, 1}. This effectively establishes fuzzy subsets and logic as a true generalization of classical set theory and logic. In fact, by this reasoning all crisp (traditional) subsets ARE fuzzy subsets of this very special type; and there is no conflict between fuzzy and crisp methods. Some examples -- assume the same definition of TALL as above, and in addition, assume that we have a fuzzy subset OLD defined by the membership function: old (x) = { 0, if age(x) < 18 yr. (age(x)-18 yr.)/42 yr., if 18 yr. <= age(x) <= 60 yr. 1, if age(x) > 60 yr. } And for compactness, let a = X is TALL and X is OLD b = X is TALL or X is OLD c = not X is TALL Then we can compute the following values. height age X is TALL X is OLD a b c ------------------------------------------------------------------------ 3' 2" 65? 0.00 1.00 0.00 1.00 1.00 5' 5" 30 0.21 0.29 0.21 0.29 0.79 5' 9" 27 0.38 0.21 0.21 0.38 0.62 5' 10" 32 0.42 0.33 0.33 0.42 0.58 6' 1" 31 0.54 0.31 0.31 0.54 0.46 7' 2" 45? 1.00 0.64 0.64 1.00 0.00 3' 4" 4 0.00 0.00 0.00 0.00 1.00 For more information on fuzzy logic operators, see: Bandler, W., and Kohout, L.J., "Fuzzy Power Sets and Fuzzy Implication Operators", Fuzzy Sets and Systems 4:13-30, 1980. Dubois, Didier, and Prade, H., "A Class of Fuzzy Measures Based on Triangle Inequalities", Int. J. Gen. Sys. 8. The original papers on fuzzy logic include: Zadeh, Lofti, "Fuzzy Sets," Information and Control 8:338-353, 1965. Zadeh, Lofti, "Outline of a New Approach to the Analysis of Complex Systems", IEEE Trans. on Sys., Man and Cyb. 3, 1973. Zadeh, Lofti, "The Calculus of Fuzzy Restrictions", in Fuzzy Sets and Applications to Cognitive and Decision Making Processes, edited by L. A. Zadeh et. al., Academic Press, New York, 1975, pages 1-39. ================================================================ ~Subject: [3] Where is fuzzy logic used? ~Date: 15-APR-93 Fuzzy logic is used directly in very few applications. The Sony PalmTop apparently uses a fuzzy logic decision tree algorithm to perform handwritten (well, computer lightpen) Kanji character recognition. Most applications of fuzzy logic use it as the underlying logic system for fuzzy expert systems (see [4]). ================================================================ ~Subject: [4] What is a fuzzy expert system? ~Date: 21-APR-93 A fuzzy expert system is an expert system that uses a collection of fuzzy membership functions and rules, instead of Boolean logic, to reason about data. The rules in a fuzzy expert system are usually of a form similar to the following: if x is low and y is high then z = medium where x and y are input variables (names for know data values), z is an output variable (a name for a data value to be computed), low is a membership function (fuzzy subset) defined on x, high is a membership function defined on y, and medium is a membership function defined on z. The antecedent (the rule's premise) describes to what degree the rule applies, while the conclusion (the rule's consequent) assigns a membership function to each of one or more output variables. Most tools for working with fuzzy expert systems allow more than one conclusion per rule. The set of rules in a fuzzy expert system is known as the rulebase or knowledge base. The general inference process proceeds in three (or four) steps. 1. Under FUZZIFICATION, the membership functions defined on the input variables are applied to their actual values, to determine the degree of truth for each rule premise. 2. Under INFERENCE, the truth value for the premise of each rule is computed, and applied to the conclusion part of each rule. This results in one fuzzy subset to be assigned to each output variable for each rule. Usually only MIN or PRODUCT are used as inference rules. In MIN inferencing, the output membership function is clipped off at a height corresponding to the rule premise's computed degree of truth (fuzzy logic AND). In PRODUCT inferencing, the output membership function is scaled by the rule premise's computed degree of truth. 3. Under COMPOSITION, all of the fuzzy subsets assigned to each output variable are combined together to form a single fuzzy subset for each output variable. Again, usually MAX or SUM are used. In MAX composition, the combined output fuzzy subset is constructed by taking the pointwise maximum over all of the fuzzy subsets assigned tovariable by the inference rule (fuzzy logic OR). In SUM composition, the combined output fuzzy subset is constructed by taking the pointwise sum over all of the fuzzy subsets assigned to the output variable by the inference rule. 4. Finally is the (optional) DEFUZZIFICATION, which is used when it is useful to convert the fuzzy output set to a crisp number. There are more defuzzification methods than you can shake a stick at (at least 30). Two of the more common techniques are the CENTROID and MAXIMUM methods. In the CENTROID method, the crisp value of the output variable is computed by finding the variable value of the center of gravity of the membership function for the fuzzy value. In the MAXIMUM method, one of the variable values at which the fuzzy subset has its maximum truth value is chosen as the crisp value for the output variable. Extended Example: Assume that the variables x, y, and z all take on values in the interval [0,10], and that the following membership functions and rules are defined: low(t) = 1 - t / 10 high(t) = t / 10 rule 1: if x is low and y is low then z is high rule 2: if x is low and y is high then z is low rule 3: if x is high and y is low then z is low rule 4: if x is high and y is high then z is high Notice that instead of assigning a single value to the output variable z, each rule assigns an entire fuzzy subset (low or high). Notes: 1. In this example, low(t)+high(t)=1.0 for all t. This is not required, but it is fairly common. 2. The value of t at which low(t) is maximum is the same as the value of t at which high(t) is minimum, and vice-versa. This is also not required, but fairly common. 3. The same membership functions are used for all variables. This isn't required, and is also *not* common. In the fuzzification subprocess, the membership functions defined on the input variables are applied to their actual values, to determine the degree of truth for each rule premise. The degree of truth for a rule's premise is sometimes referred to as its ALPHA. If a rule's premise has a nonzero degree of truth (if the rule applies at all...) then the rule is said to FIRE. For example, x y low(x) high(x) low(y) high(y) alpha1 alpha2 alpha3 alpha4 ------------------------------------------------------------------------------ 0.0 0.0 1.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 3.2 1.0 0.0 0.68 0.32 0.68 0.32 0.0 0.0 0.0 6.1 1.0 0.0 0.39 0.61 0.39 0.61 0.0 0.0 0.0 10.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 3.2 0.0 0.68 0.32 1.0 0.0 0.68 0.0 0.32 0.0 6.1 0.0 0.39 0.61 1.0 0.0 0.39 0.0 0.61 0.0 10.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 3.2 3.1 0.68 0.32 0.69 0.31 0.68 0.31 0.32 0.32 3.2 3.3 0.68 0.32 0.67 0.33 0.67 0.33 0.32 0.32 10.0 10.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 In the inference subprocess, the truth value for the premise of each rule is computed, and applied to the conclusion part of each rule. This results in one fuzzy subset to be assigned to each output variable for each rule. MIN and PRODUCT are two INFERENCE METHODS or INFERENCE RULES. In MIN inferencing, the output membership function is clipped off at a height corresponding to the rule premise's computed degree of truth. This corresponds to the traditional interpretation of the fuzzy logic AND operation. In PRODUCT inferencing, the output membership function is scaled by the rule premise's computed degree of truth. For example, let's look at rule 1 for x = 0.0 and y = 3.2. As shown in the table above, the premise degree of truth works out to 0.68. For this rule, MIN inferencing will assign z the fuzzy subset defined by the membership function: rule1(z) = { z / 10, if z <= 6.8 0.68, if z >= 6.8 } For the same conditions, PRODUCT inferencing will assign z the fuzzy subset defined by the membership function: rule1(z) = 0.68 * high(z) = 0.068 * z Note: The terminology used here is slightly nonstandard. In most texts, the term "inference method" is used to mean the combination of the things referred to separately here as "inference" and "composition." Thus you'll see such terms as "MAX-MIN inference" and "SUM-PRODUCT inference" in the literature. They are the combination of MAX composition and MIN inference, or SUM composition and PRODUCT inference, respectively. You'll also see the reverse terms "MIN-MAX" and "PRODUCT-SUM" -- these mean the same things as the reverse order. It seems clearer to describe the two processes separately. In the composition subprocess, all of the fuzzy subsets assigned to each output variable are combined together to form a single fuzzy subset for each output variable. MAX composition and SUM composition are two COMPOSITION RULES. In MAX composition, the combined output fuzzy subset is constructed by taking the pointwise maximum over all of the fuzzy subsets assigned to the output variable by the inference rule. In SUM composition, the combined output fuzzy subset is constructed by taking the pointwise sum over all of the fuzzy subsets assigned to the output variable by the inference rule. Note that this can result in truth values greater than one! For this reason, SUM composition is only used when it will be followed by a defuzzification method, such as the CENTROID method, that doesn't have a problem with this odd case. Otherwise SUM composition can be combined with normalization and is therefore a general purpose method again. For example, assume x = 0.0 and y = 3.2. MIN inferencing would assign the following four fuzzy subsets to z: rule1(z) = { z / 10, if z <= 6.8 0.68, if z >= 6.8 } rule2(z) = { 0.32, if z <= 6.8 1 - z / 10, if z >= 6.8 } rule3(z) = 0.0 rule4(z) = 0.0 MAX composition would result in the fuzzy subset: fuzzy(z) = { 0.32, if z <= 3.2 z / 10, if 3.2 <= z <= 6.8 0.68, if z >= 6.8 } PRODUCT inferencing would assign the following four fuzzy subsets to z: rule1(z) = 0.068 * z rule2(z) = 0.32 - 0.032 * z rule3(z) = 0.0 rule4(z) = 0.0 SUM composition would result in the fuzzy subset: fuzzy(z) = 0.32 + 0.036 * z Sometimes it is useful to just examine the fuzzy subsets that are the result of the composition process, but more often, this FUZZY VALUE needs to be converted to a single number -- a CRISP VALUE. This is what the defuzzification subprocess does. There are more defuzzification methods than you can shake a stick at. A couple of years ago, Mizumoto did a short paper that compared about ten defuzzification methods. Two of the more common techniques are the CENTROID and MAXIMUM methods. In the CENTROID method, the crisp value of the output variable is computed by finding the variable value of the center of gravity of the membership function for the fuzzy value. In the MAXIMUM method, one of the variable values at which the fuzzy subset has its maximum truth value is chosen as the crisp value for the output variable. There are several variations of the MAXIMUM method that differ only in what they do when there is more than one variable value at which this maximum truth value occurs. One of these, the AVERAGE-OF-MAXIMA method, returns the average of the variable values at which the maximum truth value occurs. For example, go back to our previous examples. Using MAX-MIN inferencing and AVERAGE-OF-MAXIMA defuzzification results in a crisp value of 8.4 for z. Using PRODUCT-SUM inferencing and CENTROID defuzzification results in a crisp value of 5.6 for z, as follows. Earlier on in the FAQ, we state that all variables (including z) take on values in the range [0, 10]. To compute the centroid of the function f(x), you divide the moment of the function by the area of the function. To compute the moment of f(x), you compute the integral of x*f(x) dx, and to compute the area of f(x), you compute the integral of f(x) dx. In this case, we would compute the area as integral from 0 to 10 of (0.32+0.036*z) dz, which is (0.32 * 10 + 0.018*100) = (3.2 + 1.8) = 5.0 and the moment as the integral from 0 to 10 of (0.32*z+0.036*z*z) dz, which is (0.16 * 10 * 10 + 0.012 * 10 * 10 * 10) = (16 + 12) = 28 Finally, the centroid is 28/5 or 5.6. Note: Sometimes the composition and defuzzification processes are combined, taking advantage of mathematical relationships that simplify the process of computing the final output variable values. ================================================================ ~Subject: [5] Where are fuzzy expert systems used? ~Date: 15-APR-93 To date, fuzzy expert systems are the most common use of fuzzy logic. They are used in several wide-ranging fields, including: o Linear and Nonlinear Control o Pattern Recognition o Financial Systems o Operation Research o Data Analysis ================================================================ ~Subject: [6] What is fuzzy control? ~Date: 15-APR-93 [Anybody want to write an answer?] ~References: Yager, R.R., and Zadeh, L.A., "An Introduction to Fuzzy Logic Applications in Intelligent Systems", Kluwer Academic Publishers, 1991. ================================================================ ~Subject: [7] What are fuzzy numbers and fuzzy arithmetic? ~Date: 15-APR-93 Fuzzy numbers have a peak or plateau with membership grade 1, over which the members of the universe are definitely completely in the set. The membership function is increasing towards the peak and decreasing away from it. Fuzzy numbers are used very widely in fuzzy control applications. A typical case is the triangular fuzzy number 1.0 + + | / \ | / \ 0.5 + / \ | / \ | / \ 0.0 +-------------+-----+-----+-------------- | | | 5.0 7.0 9.0 which is one form of the fuzzy number 7. Slope and trapezoidal functions are also used, as are exponential curves similar to Gaussian probability densities. For more information, see: Dubois, Didier, and Prade, Henri, "Fuzzy Numbers: An Overview", in Analysis of Fuzzy Information 1:3-39, CRC Press, Boca Raton, 1987. Dubois, Didier, and Prade, Henri, "Mean Value of a Fuzzy Number", Fuzzy Sets and Systems 24(3):279-300, 1987. Kaufmann, A., and Gupta, M.M., "Introduction to Fuzzy Arithmetic", Reinhold, New York, 1985. ================================================================ ~Subject: [8] Isn't "fuzzy logic" an inherent contradiction? Why would anyone want to fuzzify logic? ~Date: 15-APR-93 Fuzzy sets and logic must be viewed as a formal mathematical theory for the representation of uncertainty. Uncertainty is crucial for the management of real systems: if you had to park your car PRECISELY in one place, it would not be possible. Instead, you work within, say, 10 cm tolerances. The presence of uncertainty is the price you pay for handling a complex system. Nevertheless, fuzzy logic is a mathematical formalism, and a membership grade is a precise number. What's crucial to realize is that fuzzy logic is a logic OF fuzziness, not a logic which is ITSELF fuzzy. But that's OK: just as the laws of probability are not random, so the laws of fuzziness are not vague. ================================================================ ~Subject: [9] How are membership values determined? ~Date: 15-APR-93 Determination methods break down broadly into the following categories: 1. Subjective evaluation and elicitation As fuzzy sets are usually intended to model people's cognitive states, they can be determined from either simple or sophisticated elicitation procedures. At they very least, subjects simply draw or otherwise specify different membership curves appropriate to a given problem. These subjects are typcially experts in the problem area. Or they are given a more constrained set of possible curves from which they choose. Under more complex methods, users can be tested using psychological methods. 2. Ad-hoc forms While there is a vast (hugely infinite) array of possible membership function forms, most actual fuzzy control operations draw from a very small set of different curves, for example simple forms of fuzzy numbers (see [7]). This simplifies the problem, for example to choosing just the central value and the slope on either side. 3. Converted frequencies or probabilities Sometimes information taken in the form of frequency histograms or other probability curves are used as the basis to construct a membership function. There are a variety of possible conversion methods, each with its own mathematical and methodological strengths and weaknesses. However, it should always be remembered that membership functions are NOT (necessarily) probabilities. See [10] for more information. 4. Physical measurement Many applications of fuzzy logic use physical measurement, but almost none measure the membership grade directly. Instead, a membership function is provided by another method, and then the individual membership grades of data are calculated from it (see FUZZIFICATION in [4]). 5. Learning and adaptation For more information, see: Roberts, D.W., "Analysis of Forest Succession with Fuzzy Graph Theory", Ecological Modeling, 45:261-274, 1989. Turksen, I.B., "Measurement of Fuzziness: Interpretiation of the Axioms of Measure", in Proceeding of the Conference on Fuzzy Information and Knowledge Representation for Decision Analysis, pages 97-102, IFAC, Oxford, 1984. ================================================================ ~Subject: [10] What is the relationship between fuzzy truth values and probabilities? ~Date: 15-APR-93 a) A probability distribution IS a fuzzy set! (Kosko, Kampe de Feriet, Joslyn) b) Fuzzy set as trace of random set c) Generally \sum \mu_i \neq 1 d) Not determined from frequencies e) But there are fuzzy probabilities (probabilities of fuzzy events) Fuzzy values are commonly misunderstood to be probabilities, or fuzzy logic is interpreted as some new way of handling probabilities. But this is not the case. A minimum requirement of probabilities is ADDITIVITY, that is that they must add together to one, or the integral of their density curves must be one. But this is not the case in general with membership grades. And while membership grades can be determined with probability densities in mind (see [11]), there are other methods as well which have nothing to do with frequencies or probabilities. Because of this, fuzzy researchers have gone to great pains to distance themselves from probability. But in so doing, many of them have lost track of another point, which is that the converse DOES hold: all probability distributions are fuzzy sets! As fuzzy sets and logic generalize Boolean sets and logic, they also generalize probability. In fact, from a mathematical perspective, fuzzy sets and probability exist as parts of a greater Generalized Information Theory which also includes random sets, Demster-Shafer evidence theory, probability intervals, possibility theory, fuzzy measures, and so on. Furthermore, one can also talk about random fuzzy events and fuzzy random events. This whole issue is beyond the scope of this FAQ, so please refer to the following articles, or the textbook by Klir and Folger (see [16]). Delgado, M., and Moral, S., "On the Concept of Possibility-Probability Consistency", Fuzzy Sets and Systems 21:311-318, 1987. Dempster, A.P., "Upper and Lower Probabilities Induced by a Multivalued Mapping", Annals of Math. Stat. 38:325-339, 1967. Henkind, Steven J., and Harrison, Malcolm C., "Analysis of Four Uncertainty Calculi", IEEE Trans. Man Sys. Cyb. 18(5)700-714, 1988. Kamp`e de, F'eriet J., "Interpretation of Membership Functions of Fuzzy Sets in Terms of Plausibility and Belief", in Fuzzy Information and Decision Process, M.M. Gupta and E. Sanchez (editors), pages 93-98, North-Holland, Amsterdam, 1982. Klir, George, "Is There More to Uncertainty than Some Probability Theorists Would Have Us Believe?", Int. J. Gen. Sys. 15(4):347-378, 1989. Klir, George, "Generalized Information Theory", Fuzzy Sets and Systems 40:127-142, 1991. Klir, George, "Probabilistic vs. Possibilistic Conceptualization of Uncertainty", in Analysis and Management of Uncertainty, B.M. Ayyub et. al. (editors), pages 13-25, Elsevier, 1992. Klir, George, and Parviz, Behvad, "Probability-Possibility Transformations: A Comparison", Int. J. Gen. Sys. 21(1):291-310, 1992. Kosko, B., "Fuzziness vs. Probability", Int. J. Gen. Sys. 17(2-3):211-240, 1990. Puri, M.L., and Ralescu, D.A., "Fuzzy Random Variables", J. Math. Analysis and Applications, 114:409-422, 1986. Shafer, Glen, "A Mathematical Theory of Evidence", Princeton University, Princeton, 1976. ================================================================ ~Subject: [11] Are there fuzzy state machines? ~Date: 15-APR-93 Yes. FSMs are obtained by assigning membership grades as weights to the states of a machine, weights on transitions between states, and then a composition rule such as MAX/MIN or PLUS/TIMES (see [4]) to calculate new grades of future states. Refer to the following article, or to Section III of the Dubois and Prade's 1980 textbook (see [16]). Gaines, Brian R., and Kohout, Ladislav J., "Logic of Automata", Int. J. Gen. Sys. 2(4):191-208, 1976. ================================================================ ~Subject: [12] What is possibility theory? ~Date: 15-APR-93 Possibility theory is a new form of information theory which is related to but independent of both fuzzy sets and probability theory. Technically, a possibility distribution is a normal fuzzy set (at least one membership grade equals 1). For example, all fuzzy numbers are possibility distributions. However, possibility theory can also be derived without reference to fuzzy sets. The rules of possibility theory are similar to probability theory, but use either MAX/MIN or MAX/TIMES calculus, rather than the PLUS/TIMES calculus of probability theory. Also, possibilistic NONSPECIFICITY is available as a measure of information similar to the stochastic ENTROPY. Possibility theory has a methodological advantage over probability theory as a representation of nondeterminism in systems, because the PLUS/TIMES calculus does not validly generalize nondeterministic processes, while MAX/MIN and MAX/TIMES do. For further information, see: Dubois, Didier, and Prade, Henri, "Possibility Theory", Plenum Press, New York, 1988. Joslyn, Cliff, "Possibilistic Measurement and Set Statistics", in Proceedings of the 1992 NAFIPS Conference 2:458-467, NASA, 1992. Joslyn, Cliff, "Possibilistic Semantics and Measurement Methods in Complex Systems", in Proceedings of the 2nd International Symposium on Uncertainty Modeling and Analysis, Bilal Ayyub (editor), IEEE Computer Society 1993. Wang, Zhenyuan, and Klir, George J., "Fuzzy Measure Theory", Plenum Press, New York, 1991. Zadeh, Lofti, "Fuzzy Sets as the Basis for a Theory of Possibility", Fuzzy Sets and Systems 1:3-28, 1978. ================================================================ ~Subject: [13] How can I get a copy of the proceedings for ? ~Date: 15-APR-93 This is rough sometimes. The first thing to do, of course, is to contact the organization that ran the conference or workshop you are interested in. If they can't help you, the best idea mentioned so far is to contact the Institute for Scientific Information, Inc. (ISI), and check with their Index to Scientific and Technical Proceedings (ISTP volumes). Institute for Scientific Information, Inc. 3501 Market Street Philadelphia, PA 19104, USA Phone: +1.215.386.0100 Fax: +1.215.386.6362 Cable: SCINFO Telex: 84-5305 ================================================================ ~Subject: [14] Fuzzy BBS Systems, Mail-servers and FTP Repositories ~Date: 15-APR-93 Aptronix FuzzyNET BBS and Email Server: 408-428-1883, 1200-9600 N/8/1 This BBS contains a range of fuzzy-related material, including: o Application notes. o Product brochures. o Technical information. o Archived articles from the USENET newsgroup comp.ai.fuzzy. o Text versions of "The Huntington Technical Brief" by Dr. Brubaker. The Aptronix FuzzyNET Email Server allows anyone with access to Internet email access to all of the files on the FuzzyNET BBS. To receive instructions on how to access the server, send the following message to fuzzynet@aptronix.com: begin help end If you don't receive a response within a day or two, or need help, contact Scott Irwin for assistance. Electronic Design News (EDN) BBS: 617-558-4241, 1200-9600 N/8/1 Motorola FREEBBS: 512-891-3733, 1200-9600 E/7/1 Ostfold Regional College Fuzzy Logic Anonymous FTP Repository: ftp.dhhalden.no:fuzzy/ is a recently-started ftp site for fuzzy-related material, operated by Ostfold Regional College in Norway. Currently has files from the Togai InfraLogic Fuzzy Logic Email Server, Tim Butler's Fuzzy Logic Anonymous FTP Repository, and some demo programs. Material to be included in the archive (e.g., papers and code) may be placed in the upload/ directory. Send email to Asgeir Osterhus, . Tim Butler's Fuzzy Logic Anonymous FTP Repository & Email Server: ntia.its.bldrdoc.gov:pub/fuzzy contains information concerning fuzzy logic, including bibliographies (bib/), product descriptions and demo versions (com/), machine readable published papers (lit/), miscellaneous information, documents and reports (txt/), and programs code and compilers (prog/). You may download new items into the new/ subdirectory, or send them by email to fuzzy@its.bldrdoc.gov. If you deposit anything in new/, please inform fuzzy@its.bldrdoc.gov. The repository is maintained by Timothy Butler, tim@its.bldrdoc.gov. The Fuzzy Logic Repository is also accessible through a mail server, rnalib@its.bldrdoc.gov. For help on using the server, send mail to the server with the following line in the body of the message: @@ help Togai InfraLogic Fuzzy Logic Email Server: The Togai InfraLogic Fuzzy Logic Email Server allows anyone with access to Internet email access to: o PostScript copies of TIL's company newsletter, The Fuzzy Source. o ASCII files for selected newsletter articles. o Archived articles from the USENET newsgroup comp.ai.fuzzy. o Fuzzy logic demonstration programs. o Demonstration versions of TIL products. o Conference announcements. o User-contributed files. To receive instructions on how to access the server, send the following message, with no subject, to fuzzy-server@til.com. help If you don't receive a response within a day or two, contact either erik@til.com or tanaka@til.com for assistance. Most of the contents of TIL's email server are mirrored by Tim Butler's Fuzzy Logic Anonymous FTP Repository and the Ostfold Regional College Fuzzy Logic Anonymous FTP Repository in Norway. The Turning Point BBS: 512-219-7828/7848, DS/HST 1200-19,200 N/8/1 Fuzzy logic and neural network related files. Miscellaneous Fuzzy Logic Files: The "General Purpose Fuzzy Reasoning Library" is available by anonymous FTP from utsun.s.u-tokyo.ac.jp:fj/fj.sources/v25/2577.Z [133.11.11.11]. This yields the "General-Purpose Fuzzy Inference Library Ver. 3.0 (1/1)". The program is in C, with English comments, but the documentation is in Japanese. Some English documentation has been written by John Nagle, . ================================================================ ~Subject: [15] Mailing Lists ~Date: 15-APR-93 NAFIPS Fuzzy Logic Mailing List: This is a mailing list for the discussion of fuzzy logic, NAFIPS and related topics, located at the Georgia State University. The last time that this FAQ was updated, there were about 150 subscribers, located primarily in North America, as one might expect. Postings to the mailing list are automatically archived. The mailing list server itself is like most of those in use on the Internet. If you're already familiar with Internet mailing lists, the only thing you'll need to know is that the name of the server is listserv@gsuvm1.gsu.edu -or- listserv@gsuvm1.bitnet and the name of the mailing list itself is nafips-l@gsuvm1.gsu.edu -or- nafips-l@gsuvm1.bitnet Use the "gsuvm1.gsu.edu" addresses if you're on the Internet, and the "gsuvm1.bitnet" addresses if you're on BITNET. If you're on some other network, try to figure out which is "closer" to you, and use that one. If you're not familiar with this type of mailing list server, the easiest way to get started is to send the following message to listserv@gsuvm1.gsu.edu: help You will receive a brief set of instructions by email within a short time. Once you have subscribed, you will begin receiving a copy of each message that is sent by anyone to nafips-l@gsuvm1.gsu.edu, and any message that you send to that address will be sent to all of the other subscribers. Technical University of Vienna Fuzzy Logic Mailing List: This is a mailing list for the discussion of fuzzy logic and related topics, located at the Technical University of Vienna in Austria. The last time this FAQ was updated, there were about 150 subscribers, located primarily in Europe, as one might expect. In addition to the mailing list itself, the list server gives access to some files, including the "Who is Who in Fuzzy Logic" database that is currently under construction by Robert Fuller . Like many mailing lists, this one uses Anastasios Kotsikonas's LISTSERV system. If you've used this kind of server before, the only thing you'll need to know is that the name of the server is listserv@vexpert.dbai.tuwien.ac.at and the name of the mailing list is fuzzy-mail@vexpert.dbai.tuwien.ac.at If you're not familiar with this type of mailing list server, the easiest way to get started is to send the following message to listserv@vexpert.dbai.tuwien.ac.at: help You will receive a brief set of instructions by email within a short time. Once you have subscribed, you will begin receiving a copy of each message that is sent by anyone to fuzzy-mail@vexpert.dbai.tuwien.ac.at, and any message that you send to that address will be sent to all of the other subscribers. ================================================================ ~Subject: [16] Bibliography ~Date: 15-APR-93 Non-Mathematical Works: McNeill, Daniel, and Freiberger, Paul, "Fuzzy Logic", Simon and Schuster, 1992. Negoita, C.V., "Fuzzy Systems", Abacus Press, Tunbridge-Wells, 1981. Smithson, Michael, "Ignorance and Uncertainty: Emerging Paradigms", Springer-Verlag, New York, 1988. Brubaker, D.I., "Fuzzy-logic Basics: Intuitive Rules Replace Complex Math," EDN, June 18, 1992. Schwartz, D.G. and Klir, G.J., "Fuzzy Logic Flowers in Japan," IEEE Spectrum, July 1992. Textbooks: Dubois, Didier, and Prade, H., "Fuzzy Sets and Systems: Theory and Applications", Academic Press, New York, 1980. Dubois, Didier, and Prade, Henri, "Possibility Theory", Plenum Press, New York, 1988. Goodman, I.R., and Nguyen, H.T., "Uncertainty Models for Knowledge-Based Systems", North-Holland, Amsterdam, 1986. Kandel, Abraham, "Fuzzy Mathematical Techniques with Applications", Addison-Wesley, 1986. Kandel, Abraham, and Lee, A., "Fuzzy Switching and Automata", Crane Russak, New York, 1979. Klir, George, and Folger, Tina, "Fuzzy Sets, Uncertainty, and Information", Prentice Hall, Englewood Cliffs, NJ, 1987. Kosko, B., "Neural Networks and Fuzzy Systems", Prentice Hall, Englewood Cliffs, NJ, 1992. Wang, Paul P., "Theory of Fuzzy Sets and Their Applications", Shanghai Science and Technology, Shanghai, 1982. Wang, Zhenyuan, and Klir, George J., "Fuzzy Measure Theory", Plenum Press, New York, 1991. Yager, R.R., (editor), "Fuzzy Sets and Applications", John Wiley and Sons, New York, 1987. Zimmerman, Hans J., "Fuzzy Set Theory", Kluwer, Boston, 2nd edition, 1991. Anthologies: Didier Dubois, Henri Prade, and Ronald R. Yager, editors, "Readings in Fuzzy Systems", Morgan Kaufmann Publishers, 1992. "A Quarter Century of Fuzzy Systems", Special Issue of the International Journal of General Systems, 17(2-3), June 1990. ================================================================ ~Subject: [17] Journals ~Date: 15-APR-93 INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (IJAR) Official publication of the North American Fuzzy Information Processing Society (NAFIPS). Published 8 times annually. ISSN 0888-613X. Subscriptions: Institutions $282, NAFIPS members $72 (plus $5 NAFIPS dues) $36 mailing surcharge if outside North America. For subscription information, write to David Reis, Elsevier Science Publishing Company, Inc., 655 Avenue of the Americas, New York, New York 10010, call 212-633-3827, fax 212-633-3913, or send email to 74740.2600@compuserve.com. Editor: Piero Bonissone Editor, Int'l J of Approx Reasoning (IJAR) GE Corp R&D Bldg K1 Rm 5C32A PO Box 8 Schenectady, NY 12301 USA Email: bonissone@crd.ge.com Voice: 518-387-5155 Fax: 518-387-6845 Email: Bonissone@crd.ge.com INTERNATIONAL JOURNAL OF FUZZY SETS AND SYSTEMS (IJFSS) The official publication of the International Fuzzy Systems Association. Subscriptions: Subscription is free to members of IFSA. ISSN: 0165-0114 ================================================================ ~Subject: [18] Professional Organizations ~Date: 15-APR-93 INSTITUTION FOR FUZZY SYSTEMS AND INTELLIGENT CONTROL, INC. Sponsors, organizes, and publishes the proceedings of the International Fuzzy Systems and Intelligent Control Conference. The conference is devoted primarily to computer based feedback control systems that rely on rule bases, machine learning, and other artificial intelligence and soft computing techniques. The theme of the 1993 conference was "Fuzzy Logic, Neural Networks, and Soft Computing." Thomas L. Ward Institution for Fuzzy Systems and Intelligent Control, Inc. P. O. Box 1297 Louisville KY 40201-1297 USA Phone: +1.502.588.6342 Fax: +1.502.588.5633 Email: TLWard01@ulkyvm.louisville.edu, TLWard01@ulkyvm.bitnet INTERNATIONAL FUZZY SYSTEMS ASSOCIATION (IFSA) Holds biannual conferences that rotate between Asia, North America, and Europe. Membership is $232, which includes a subscription to the International Journal of Fuzzy Sets and Systems. Prof. Philippe Smets University of Brussels, IRIDIA 50 av. F. Roosevelt CP 194/6 1050 Brussels, Belgium LABORATORY FOR INTERNATIONAL FUZZY ENGINEERING (LIFE) Laboratory for International Fuzzy Engineering Research Siber Hegner Building 3FL 89-1 Yamashita-cho, Naka-ku Yokohama-shi 231 Japan Email: @fuzzy.or.jp NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY (NAFIPS) Holds a conference and a workshop in alternating years. President: Dr. Jim Keller President NAFIPS Electrical & Computer Engineering Dept University of Missouri-Col Columbia, MO 65211 USA Phone +1.314.882.7339 Email: ecejk@mizzou1.missouri.edu, ecejk@mizzou1.bitnet Secretary/Treasurer: Thomas H. Whalen Sec'y/Treasurer NAFIPS Decision Sciences Dept Georgia State University Atlanta, GA 30303 USA Phone: +1.404.651.4080 Email: qmdthw@gsuvm1.gsu.edu, qmdthw@gsuvm1.bitnet SPANISH ASSOCIATION FOR FUZZY LOGIC AND TECHNOLOGY Prof. J. L. Verdegay Dept. of Computer Science and A.I. Faculty of Sciences University of Granada 18071 Granada (Spain) Phone: +34.58.244019 Tele-fax: +34.58.243317, +34.58.274258 Email: jverdegay@ugr.es ================================================================ ~Subject: [19] Companies Supplying Fuzzy Tools ~Date: 15-APR-93 Adaptive Informations Systems: This is a new company that specializes in fuzzy information systems. Main products of AIS: - Consultancy and application development in fuzzy information retrieval and flexible querying systems - Development of a fuzzy querying application for value added network services - A fuzzy solution for utilization of a large (lexicon based) terminological knowledge base for NL query evaluation Adaptive Informations Systems Hoestvej 8 B DK-2800 Lyngby Denmark Phone: 45-4587-3217 Email: hll@dat.ruc.dk American NeuraLogix: Products: NLX110 Fuzzy Pattern Comparator. NLX230 8-bit single-chip fuzzy microcontroller. NLX20xC 8- and 16-bit VLSI Core elements for fuzzy processing. Others Other nonfuzzy and quasi-fuzzy devices. [American NeuraLogix describes these chips and cores as "fuzzy" processing devices, but as far as I can tell, they're not really fuzzy. The NLX110 is a Hamming-distance calculator, and the NLX230 and NLX20xC are based on a winner-take-all inference strategy that discards most of the advantages of fuzzy expert systems. Read the data sheets carefully before deciding.] American NeuraLogix, Inc. 411 Central Park Drive Sanford, FL 32771 USA Phone: 407-322-5608 Fax: 407-322-5609 Aptronix: Products: Fide A MS Windows-hosted graphical development environment for fuzzy expert systems. Code generators for Motorola's 6805, 68HC05, and 68HC11, and Omron's FP-3000 are available. A demonstration version of Fide is available. Aptronix, Inc. 2150 North First Street, Suite 300 San Jose, Ca. 95131 USA Phone: 408-428-1888 Fax: 408-428-1884 Fuzzy Net BBS: 408-428-1883, 8/n/1 ByteCraft, Ltd.: Products: Fuzz-C "A C preprocessor for fuzzy logic" according to the cover of its manual. Translates an extended C language to C source code. Byte Craft Limited 421 King Street North Waterloo, Ontario Canada N2J 4E4 Phone: 519-888-6911 Fax: 519-746-6751 Support BBS: 519-888-7626 Fujitsu: Products: MB94100 Single-chip 4-bit (?) fuzzy controller. FuziWare: Products: FuziCalc An MS-Windows-based fuzzy development system based on a spreadsheet view of fuzzy systems. FuziWare, Inc. 316 Nancy Kynn Lane, Suite 10 Knoxville, Tn. 37919 USA Phone: 800-472-6183, 615-588-4144 Fax: 615-588-9487 Fuzzy Systems Engineering: Products: Manifold Editor ? Manifold Graphics Editor ? [These seem to be membership function & rulebase editors.] Fuzzy Systems Engineering P. O. Box 27390 San Diego, CA 92198 USA Phone: 619-748-7384 Fax: 619-748-7384 (?) HyperLogic, Inc.: Products: CubiCalc An MS-Windows-based fuzzy development environment. CubiCalc RTC C source-code generator addon for CubiCalc. HyperLogic Corp 1855 East Valley Parkway, Suite 210 P. O. Box 3751 Escondido, Ca. 92027 USA Phone: 619-746-2765 Fax: 619-746-4089 Inform: Products: fuzzyTECH 3.0 A graphical fuzzy development environment. Versions are available that generate either C source code or Intel MCS-96 assembly source code as output. A demonstration version is available. Runs under MS-DOS. Inform Software Corp 1840 Oak Street, Suite 324 Evanston, Il. 60201 USA Phone: 708-866-1838 INFORM GmbH Geschaeftsbereich Fuzzy--Technologien Pascalstraese 23 W-5100 Aachen Tel: (02408) 6091 Fax: (02408) 6090 Metus Systems Group: Products: Metus Fuzzy Library A library of fuzzy processing routines for C or C++. Source code is available. The Metus Systems Group 1 Griggs Lane Chappaqua, Ny. 10514 USA Phone: 914-238-0647 Modico: Products: Fuzzle 1.8 A fuzzy development shell that generates either ANSI FORTRAN or C source code. Modico, Inc. P. O. Box 8485 Knoxville, Tn. 37996 USA Phone: 615-531-7008 Oki Electric: Products: MSM91U111 A single-chip 8-bit fuzzy controller. Europe: Oki Electric Europe GmbH. Hellersbergstrasse 2 D-4040 Neuss, Germany Phone: 49-2131-15960 Fax: 49-2131-103539 Hong Kong: Oki Electronics (Hong Kong) Ltd. Suite 1810-4, Tower 1 China Hong Kong City 33 Canton Road, Tsim Sha Tsui Kowloon, Hong Kong Phone: 3-7362336 Fax: 3-7362395 Japan: Oki Electric Industry Co., Ltd. Head Office Annex 7-5-25 Nishishinjuku Shinjuku-ku Tokyo 160 JAPAN Phone: 81-3-5386-8100 Fax: 81-3-5386-8110 USA: Oki Semiconductor 785 North Mary Avenue Sunnyvale, Ca. 94086 USA Phone: 408-720-1900 Fax: 408-720-1918 OMRON Corporation: Products: C500-FZ001 Fuzzy logic processor module for Omron C-series PLCs. E5AF Fuzzy process temperature controller. FB-30AT FP-3000 based PC AT fuzzy inference board. FP-1000 Digital fuzzy controller. FP-3000 Single-chip 12-bit digital fuzzy controller. FP-5000 Analog fuzzy controller. FS-10AT PC-based software development environment for the FP-3000. Japan Kazuaki Urasaki Fuzzy Technology Business Promotion Center OMRON Corporation 20 Igadera, Shimokaiinji Nagaokakyo Shi, Kyoto 617 Japan Phone: 81-075-951-5117 Fax: 81-075-952-0411 USA Sales (all product inquiries should be directed here) Pat Murphy OMRON Electronics, Inc. One East Commerce Drive Schaumburg, IL 60173 USA Phone: 708-843-7900 Fax: 708-843-7787/8568 USA Research Satoru Isaka OMRON Advanced Systems, Inc. 3945 Freedom Circle, Suite 410 Santa Clara, CA 95054 Phone: 408-727-6644 Fax: 408-727-5540 Email: isaka@oas.omron.com Togai InfraLogic, Inc.: Togai InfraLogic (TIL for short) supplies software development tools, board-, chip- and core-level fuzzy hardware, and engineering services. Contact info@til.com for more detailed information. Products: FC110 (the FC110(tm) Digital Fuzzy Processor (DFP-tm)). An 8-bit microprocessor/coprocessor with fuzzy acceleration. FC110DS (the FC110 Development System) A software development package for the FC110 DFP, including an assembler, linker and Fuzzy Programming Language (FPL-tm) compiler. FCA VLSI Cores based on Fuzzy Computational Acceleration (FCA-tm). FCA10AT FC110-based fuzzy accelerator board for PC/AT-compatibles. FCA10VME FC110-based four-processor VME fuzzy accelerator. FCD10SA FC110-based fuzzy processing module. FCD10SBFC FC110-based single board fuzzy controller module. FCD10SBus FC110-based two-processor SBus fuzzy accelerator. FCDS (the Fuzzy-C Development System) An FPL compiler that emits K&R or ANSI C source to implement the specified fuzzy system. MicroFPL An FPL compiler and runtime module that support using fuzzy techniques on small microcontrollers by several companies. TILGen A tool for automatically constructing fuzzy expert systems from sampled data. TILShell+ A graphical development and simulation environment for fuzzy systems. USA Togai InfraLogic, Inc. 5 Vanderbilt Irvine, CA 92718 USA Phone: 714-975-8522 Fax: 714-975-8524 Email: info@til.com Toshiba: Products: T/FC150 10-bit fuzzy inference processor. LFZY1 FC150-based NEC PC fuzzy logic board. T/FT Fuzzy system development tool. TransferTech GmbH: Products: Fuzzy Control Manager (FMC) Fuzzy shell, runs under MS-Windows TransferTech GmbH. Rebenring 33 W-3300 Braunschweig, Germany Phone: 49-531-3801139 Fax: 49-531-3801152 ================================================================ ~Subject: [20] Fuzzy Researchers ~Date: 15-APR-93 This is a *partial* list of some of the researchers and research organizations in the field of fuzzy logic and fuzzy expert systems. Center for Fuzzy Logic and Intelligent Systems Research (Texas A&M): This group publishes a Technical Report Series, in addition to the proceedings and video tapes of the first and second International Workshop on Industrial Fuzzy Control and Intelligent Systems (IFIS 91/92). Dr. John Yen Center for Fuzzy Logic and Intelligent Systems Research Texas A&M University MS 3112 Harvey R. Bright Building Texas A&M University College Station, TX 77843 USA Phone: 409-845-5466 Fax: 409-847-8578 Email: cfl@cs.tamu.edu German National Research Center for Computer Science (GMD): The GMD supports a fuzzy logic group which does research in - adaptive control - VLSI design - image processing Liliane E. Peters GMD-SET P. O. Box 1316 D-5205 St. Augustin 1, Germany Phone: 49-2241-14-2332 Fax: 49-2241-14-2342 Email: peters@borneo.gmd.de Swiss Federal Institute of Technology (SFIT): Email: stegmaier@ifr.ethz.ch, vestli@ifr.ethz.ch Tokyo Institute of Technology (TITech): TITech's Department of Systems Science support Dr. Michio Sugeno's laboratory, which does research in practical applications of fuzzy logic and fuzzy expert systems. Tokyo Institute of Technology Department of Systems Science 4259 Nagatsuta, Midori-ku Yokohama 227 Japan Phone: 81-45-922-1111 x2641 Fax: 81-45-921-1485 Email: @sys.titech.ac.jp [According to Dr. Michael Griffin (griffin@sys.titech.ac.jp), "Don't bother sending e-mail to Professor M. Sugeno, he doesn't use it."] ================================================================ ;;; *EOF* Xref: rde comp.ai:1814 news.answers:3189 comp.answers:690 Newsgroups: comp.ai,news.answers,comp.answers Path: rde!gator!tarpit!uunet!noc.near.net!howland.reston.ans.net!europa.eng.gtefsd.com!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!mkant From: mkant+@cs.cmu.edu (Mark Kantrowitz) Subject: FAQ: AI Newsgroups and Mailing Lists 2/5 [Monthly posting] Message-ID: Followup-To: poster Summary: Artificial Intelligence Related Newsgroups and Mailing Lists Sender: news@cs.cmu.edu (Usenet News System) Supersedes: Nntp-Posting-Host: a.gp.cs.cmu.edu Reply-To: mkant+ai-faq@cs.cmu.edu Organization: School of Computer Science, Carnegie Mellon University Date: Thu, 13 May 1993 07:22:33 GMT Approved: news-answers-request@MIT.Edu Expires: Thu, 24 Jun 1993 07:22:09 GMT Lines: 845 Archive-name: ai-faq/part2 Last-Modified: Wed Apr 14 22:20:11 1993 by Mark Kantrowitz Version: 1.6 ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai-faq-2.text -- 30415 bytes Part 2 (AI-related Newsgroups and Mailing Lists): List of all known AI-related newsgroups, mailing lists, and electronic bulletin board systems. Outline: ---------------- [0] How to Subscribe to a Mailing List [1] AI-related Newsgroups [2] AI Research in a particular country [3] Dial-up AI-related Bulletin Board Systems ---------------- [4] Artificial Life [5] AI Applications to Human-Computer Interface Design [6] AI in Education [7] Artificial Intelligence and Law [8] AI in Medicine [9] AI for Development [9b] Advanced Technology for Finance [10] Cellular Automata [11] Classification and Clustering [12] Connectionism and Neural Networks [13] Cybernetics and Systems [14] Distributed AI [15] Intelligent Systems for Economics Digest (IE-Digest) [16] Expert Systems in Agriculture [17] Use of Computers in the Fine Arts [18] Fuzzy Logic [19] Genetic Algorithms and Genetic Programming [20] Knowledge Acquisition [21] Logic Programming, Prolog [22] Machine Learning [23] Natural Language Processing [24] Psychology and Cognitive Science [25] Robot Controller Boards [26] Simulated Annealing [27] Simulation [28] Symbolic Math [29] Uncertainty [30] Vision Research [40] Miscellaneous: Artificial Morality ---------------- Search for [#] to get to question number # quickly. ---------------------------------------------------------------- ~Subject: [0] How to Subscribe to a Mailing List To be added or deleted to any of the mailing lists described in this post, send mail to the -request version of the list except where otherwise noted. This sends mail to the list maintainer, instead of annoying the membership of the entire mailing list. To subscribe to one of the BITNET listserv forums, send mail there which contains a line of the form SUB as the first and only line in the body of the message. To unsubscribe to a ListServ list, send UNSUB or SIGNOFF instead. For Lisp-related mailing lists, see part 4 of the FAQ for the newsgroup comp.lang.lisp. ---------------------------------------------------------------- ~Subject: [1] AI-related Newsgroups Subscribe to these using your newsreader. comp.ai Artificial Intelligence comp.ai.edu AI and Education comp.ai.fuzzy Fuzzy Logic. Archived on the Aptronix FuzzyNet and TIL mail-servers (see [4-1]). comp.ai.genetic Genetic Algorithms comp.ai.neural-nets Neural Nets comp.ai.nat-lang Natural Language Processing (unmoderated) comp.ai.nlang-know-rep Natural Language and Knowledge Representation (Moderated). comp.robotics Robotics. Archived at the anonymous ftp site wilma.cs.brown.edu:pub/comp.robotics/. Read the files AuthorIndex and SubjectIndex first. comp.theory.cell-automata Cellular Automata comp.theory.self-org-sys Self-Organizing Systems comp.simulation Simulation comp.speech Speech related research, including recognition and synthesis. Archived at the anonymous ftp site svr-ftp.eng.cam.ac.uk [129.169.24.20] in the directory comp.speech/archive/. Other useful information is archived in comp.speech/info/. sci.math.symbolic Symbolic Math sci.cognitive Cognitive Science comp.ai.philosophy Philosophical Foundations of AI comp.ai.shells Expert System Shells comp.ai.vision Vision Research sci.virtual-worlds Virtual Reality. Also available through the bi-directional gateway, VIRTU-L on LISTSERV@UIUCVMD.BITNET or LISTSERV@VMD.CSO.UIUC.EDU comp.lang.lisp Common Lisp comp.lang.clos Common Lisp Object System comp.object Object Oriented Programming comp.object.logic Integrating Object-Orientend and Logic Paradigms comp.lang.scheme Scheme comp.lang.lisp.mcl Macintosh Common Lisp comp.lang.lisp.franz Franz Lisp comp.lang.lisp.x XLisp comp.lang.prolog Prolog and Logic Programming comp.lang.pop POPLOG integrated programming language & environment for Lisp, Prolog, ML and Pop11 comp.lang.smalltalk Smalltalk comp.lang.ml Standard ML aicom mcvax!swivax!otten@uunet.uu.net International Usenet AI news German AI newsgroups: de.sci.ki de.sci.ki.announce de.sci.ki.mod-ki de.sci.ki.discussion Of the above newsgroups, the following have FAQ postings: comp.ai, comp.ai.fuzzy, comp.ai.genetic, comp.robotics, comp.speech, comp.neural-nets, comp.lang.lisp, comp.lang.scheme, comp.lang.clos, comp.lang.prolog ---------------------------------------------------------------- ~Subject: [2] AI Research in a particular country British AI alvey jws%ib.rl.ac.uk@nsfnet-relay.ac.uk Japanese AI fj-ai%etl.jp@relay.cs.net German AI mod-ki%unido.irb@unido.bitnet Mexican AI IAMEX-L on listserv@tecmtyvm.mty.itesm.mx The IAMEX-L list is administrated by the AI Invetigation Center in Instituto Tecnologico y de Estudios Superiores de Monterrey (ITESM) in Monterrey, N.L. To be added to that list, please contact: pl500368@tecmtyvm.bitnet (Juana Maria Gomez Puertos) pl157961@tecmtyvm.bitnet (Fernando Careaga Sanchez) The newsgroup de.sci.ki.discussion is the German equivalent of comp.ai. The newsgroup de.sci.ki.announce is for announcements about AI. The newsgroup de.sci.ki.mod-ki is moderated by Hans-Werner Hein . The newsgroup aus.ai is the (unmoderated) Australian equivalent of comp.ai. ---------------------------------------------------------------- ~Subject: [3] Dial-up AI-related Bulletin Board Systems The primary AI-related dial-up bulletin board systems are: The Interocitor 214-258-1832 (Fido 1:124/2206) V.32bis (14.4kbps) SysOp: Steve Rainwater Hours: 24 Desc: AI CD-ROM submission site, general AI archive. ShadeTree BBS 412-244-9416 (Fido 1:129/124) V.22bis (2400bps) SysOp: Bill Keller Hours: 8:30pm-8:30am only Desc: Oriented toward beginners in the field. C.N.S. BBS 509-62706267 (Fido 1:347/303) USR HST (9600bps) SysOp: Wesley Elsberry Hours: 24 Desc: Best source for neural network related information. Fuzzy Logic Related BBS's: Aptronix FuzzyNet: 408-428-1883 N/8/1 1200-19,200 baud The Turning Point: 512-219-7828 N/8/1 DS/HST 1200-19,200 baud (LIBRARY) 512-219-7848 N/8/1 DS/HST 1200-19,200 baud Motorola FREEBBS: 512-891-3733 E/7/1 1200-9600 baud Electronic Design News (EDN) BBS: 617-558-4241 N/8/1 1200-9600 baud Neural Networks Related BBS's: Central Neural System, 509-627-6CNS. Operated by Wesley R. Elsberry; PO Box 1187, Richland, WA 99352; welsberr@sandbox.kenn.wa.us Also available through FidoNet. ---------------------------------------------------------------- ~Subject: [4] Artificial Life alife@cognet.ucla.edu The alife mailing list is for communications regarding artificial life, a formative interdisciplinary field involving computer science, the natural sciences, mathematics, medicine and others. Send mail to alife-request@cognet.ucla.edu to be added to the list. See also the UCLA Artificial Life Depository in question [4-0]. ---------------------------------------------------------------- ~Subject: [5] AI Applications to Human-Computer Interface Design AI-CHI All requests to be added to or deleted from this list, problems, questions, etc., should be sent to wiley!ai-chi-request@LLL-LCC.LLNL.GOV. [This machine seems to be defunct. Anybody knowing the new location of the mailing list should send mail to mkant+ai-faq@cs.cmu.edu.] ---------------------------------------------------------------- ~Subject: [6] AI in Education ai-ed@sun.com (was ai-ed@sumex-aim.stanford.edu) Includes ICAI (intelligent computer aided instruction) and ITS (intelligent tutoring systems). All requests to be added to or deleted from this list, problems, questions, etc., should be sent to ai-ed-request@sun.com. ---------------------------------------------------------------- ~Subject: [7] Artificial Intelligence and Law ail-l@austin.onu.edu To subscribe to AIL-L you should send a message to the internet address listserv@austin.onu.edu The body of the message should consist of: subscribe AIL-L ---------------------------------------------------------------- ~Subject: [8] AI in Medicine ai-medicine@med.stanford.edu Focus is on computer-based medical decision support. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to ai-medicine-request@med.stanford.edu ---------------------------------------------------------------- ~Subject: [9] AI for Development aidevaisb.ed.ac.uk An occasional newsletter for folk interested in AI applications in and for developing countries. The newsletter is sent to the mailing list and to the newsgroup comp.society.development. Send requests to be added to the mailing list to Kathleen King . ---------------------------------------------------------------- ~Subject: [9b] Advanced Technology for Finance at-finance-board@invnext.worldbank.org The Advanced Technology for Finance Special Interest Group of the INNS maintains the AT-Finance mailing list for discussions of financial or economic applications of advanced technology. Discussion sometimes involves Neural Networks, Genetic Algorithms, Fuzzy Logic, Statistics, Complexity theory, Artificial Life, and Nonlinear and Chaos Theory. To subscribe, send mail to at-finance-request@invnext.worldbank.org. For further information, send mail to the AT-Finance administrator at . ---------------------------------------------------------------- ~Subject: [10] Cellular Automata cellular-automata@think.com (aka ca@think.com) Gatewayed to the newsgroup comp.theory.cell-automata. Archived messages may be found at ftp.think.com in the files: mail/ca.archive* All other requests to be added to or deleted from this list, problems, questions, etc., should be sent to cellular-automata-request@think.com. ---------------------------------------------------------------- ~Subject: [11] Classification and Clustering class-l%sbccvm.bitnet@cunyvm.cuny.edu Mailing list and file server for researchers in classification, clustering, phylogenetic estimation, and related areas of data analysis. To subscribe to CLASS-L you should send a message to the internet address listserv%sbccvm.bitnet@cunyvm.cuny.edu The body of the message should consist of: subscribe CLASS-L To have your name removed from the CLASS-L subscriber list, send: signoff CLASS-L ---------------------------------------------------------------- ~Subject: [12] Connectionism and Neural Networks Connectionism: connectionists@cs.cmu.edu All requests to be added to or deleted from this list, problems, questions, etc., should be sent to connectionists-request@cs.cmu.edu. Neural Networks (moderated): Neuron@cattell.psych.upenn.edu Neuron-Digest is a moderated list (in digest form) dealing with all aspects of neural networks (and any type of network or neuromorphic system). Topics include both connectionist models (artificial neural networks) and biological systems ("wetware"). The digest is posted to comp.ai.neural-nets. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to neuron-request@cattell.psych.upenn.edu Neuron Digest archives are kept in the OSU Neuroprose collection and in cattell.psych.upenn.edu:/pub/Neuron-Digest Users of the Rochester Connectionist Simulator: simulator-users@cs.rochester.edu simulator-bugs@cs.rochester.edu All requests to be added to or deleted from this list, problems, questions, etc., should be sent to simulator-request@cs.rochester.edu. The simulator is available in cs.rochester.edu:/pub/simulator Users of the Stuttgart Neural Network Simulator: snns@informatik.uni-stuttgart.de To be added to the mailing list, send a message to listserv@informatik.uni-stuttgart.de with subscribe snns in the message body. The simulator is available in ifi.informatik.uni-stuttgart.de:/pub/SNNS/SNNSv2.1.tar.Z [129.69.211.1] RNA: RNA on LISTSERV@UTFSM.BITNET RNA is a Neural Net list in Spanish. RNA es una lista dedicada a todas aquellas personas interesadas en el desarrollo e investigacion en el campo de las Redes de Neuronas Artificiales. El proposito de esta lista es intercambiar informacion, favorecer el encuentro de personas con intereses afines, promover la formacion de grupos de trabajos y servir de apoyo a quienes se integran al area. Para subscribirse enviar una nota a LISTSERV@UTFSM.BITNET con el siguiente mensaje en el cuerpo de la nota: SUB RNA nombre apellido ---------------------------------------------------------------- ~Subject: [13] Cybernetics and Systems cybsys-l@bingvaxu.cc.binghamton.edu cybsys-l%bingvmb.bitnet@cunyvm.cuny.edu 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 to cybsys-l you should send a message to the internet address listserv@bingvaxu.cc.binghamton.edu listserv%bingvmb.bitnet@cunyvm.cuny.edu The body of the message should consist of: SUB CYBSYS-L To unsubscribe send the following command: UNSUB CYBSYS-L ---------------------------------------------------------------- ~Subject: [14] Distributed AI DAI-List: Send requests to DAI-List-request@mcc.com MAAMAW Blackboard (Modeling Autonomous Agents in a Multi-Agent World): Send requests to demazeau@lifia.imag.fr Send submissions to maamaw@lifia.imag.fr Distributed-AI Discussion List: To subscribe or get help send COMMAND (e.g. HELP) to mailbase@mailbase.ac.uk Send contributions to distributed-ai@mailbase.ac.uk For other questions, contact the list owner, lyndon@sx.ac.uk. Special interest group on cooperating knowledge based systems: ckbs@cs.keele.ac.uk. ---------------------------------------------------------------- ~Subject: [15] Intelligent Systems for Economics Digest (IE-Digest) IE-list@cs.ucl.ac.uk The IE-digest aims to act as a forum to exchange ideas on using `intelligent' techniques to model economic and financial systems. Calls for papers, paper announcements and queries are welcome. Techniques which were originally developed to model psychological and biological processes are now receiving considerable attention as tools for modelling and understanding economic and financial processes. These techniques, which include neural networks, genetic algorithms and expert systems are now being used in a wide variety of applications including the modelling of economic cycles, modelling of artificial economies, portfolio optimisation and credit evaluation. To be added to the list, send mail to IE-list-request@cs.ucl.ac.uk. An archive of back issues of the digest, as well as papers, bibliographies and software, may be obtained by anonymous ftp from cs.ucl.ac.uk:ie (128.16.5.31). List moderated by Suran Goonatilake, Dept. of Computer Science, University College London, Gower St., London WC1E 6BT, UK, . ---------------------------------------------------------------- ~Subject: [16] Expert Systems in Agriculture ag-exp-l%ndsuvm1.bitnet@cunyvm.cuny.edu To subscribe to ag-exp-l you should send a message to the internet address listserv%ndsuvm1.bitnet@cunyvm.cuny.edu The body of the message should consist of: subscribe AG-EXP-L ---------------------------------------------------------------- ~Subject: [17] Use of Computers in the Fine Arts fineart%ecs.umass.edu@relay.cs.net 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. One of the general areas of interest is Art & AI. ---------------------------------------------------------------- ~Subject: [18] Fuzzy Logic NAFIPS Fuzzy Logic Mailing List at Georgia State University: NAFIPS-L@gsuvm1.gsu.edu To subscribe send the following command to LISTSERV@GSUVM1.BITNET: SUB NAFIPS-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@GSUVM1.GSU.EDU. (NAFIPS = "North American Fuzzy Information Processing Society") Postings to this mailing list are automatically archived. Technical University of Vienna Fuzzy Logic Mailing List: fuzzy-mail@vexpert.dbai.tuwien.ac.at To subscribe send the following command to listserv@vexpert.dbai.tuwien.ac.at: SUB FUZZY-MAIL your_full_name where "your_full_name" is your real name, not your login Id. The listserver also gives access to some files, including the "Who is Who in Fuzzy Logic" database that is currently under construction by Robert Fuller . ---------------------------------------------------------------- ~Subject: [19] Genetic Algorithms and Genetic Programming Genetic Algorithms Digest: GA-List@AIC.NRL.NAVY.MIL (moderated; digest format) Send subscription requests to the -request form of the list or to gref@aic.nrl.navy.mil. Past copies of the digest are archieved on ftp.aic.nrl.navy.mil in the /pub/galist directory. Some software is also archived there. Discussion of genetic algorithms also appears from time to time in comp.ai.neural-nets and comp.theory.self-org-sys. Genetic Programming: genetic-programming@cs.stanford.edu A mailing list for discussion of Genetic Programming. See Koza's book for details. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to genetic-programming-request@cs.stanford.edu The genetic-programming mailing list is archived on ftp.cc.utexas.edu:pub/genetic-programming/ along with some code and papers. Evolutionary Programming Email Digest: The digest is intended to promote discussions on a wide range of technical issues in evolutionary optimization, as well as provide information on upcoming conferences, events, journals, special issues, and other items of interest to the EP community. Discussions on all areas of evolutionary computation are welcomed, including artificial life, evolution strategies, and genetic algorithms. The digest is meant to encourage interdisciplinary communications. To subscribe to the digest, send mail to ep-list-request@magenta.me.fau.edu and include the line "subscribe ep-list" in the body of the text. Further instructions will follow your subscription. The digest will be moderated by N. Saravanan of Florida Atlantic University, . ---------------------------------------------------------------- ~Subject: [20] Knowledge Acquisition kaw@swi.psy.uva.nl KAW is a list server provided by the University of Amsterdam for the knowledge acquisition community. It will carry news and discussion relating to KA activities. To join the KAW list, send a message with subscribe KAW in the body to service@swi.psy.uva.nl. For more information about the list server, send help in the body instead. ---------------------------------------------------------------- ~Subject: [21] Logic Programming, Prolog Prolog and Logic Programming: prolog@sushi.stanford.edu (general) prolog-hackers@sushi.stanford.edu (nitty gritty) All requests to be added to or deleted from this list, problems, questions, etc., should be sent to prolog-request@sushi.stanford.edu [The host sushi.stanford.edu no longer exists, as of 11/24/92. Does anybody know the new location of the mailing lists?] Concurrent Logic Programming: clp.x@xerox.com All requests to be added to or deleted from this list, problems, questions, etc., should be sent to clp-request.x@xerox.com or to Jacob Levy . ---------------------------------------------------------------- ~Subject: [22] Machine Learning ml@ics.uci.edu The Machine Learning List is moderated. Contributions should be relevant to the scientific study of machine learning. Mail requests to be added or deleted to ml-request@ics.uci.edu. Back issues may be FTP'd from ics.uci.edu in pub/ml-list/V/ or N.Z where X and N are the volume and number of the issue; ID: anonymous PASSWORD: ---------------------------------------------------------------- ~Subject: [23] Natural Language Processing Information Retrieval: irlist To subscribe send the following command to LISTSERV@UCCVMA.BITNET: 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%UCCVMA.BITNET@VM1.NODAK.EDU. Moderator: IRLUR%UCCMVSA.BITNET@VM1.NODAK.EDU Natural Language and Knowledge Representation (moderated): nl-kr@cs.rpi.edu (formerly nl-kr@cs.rochester.edu) Gatewayed to the newsgroup comp.ai.nlang-know-rep. BITNET subscribers: we now have a LISTSERVer for nl-kr. You may send submissions to NL-KR@RPIECS and any listserv-style administrative requests to LISTSERV@RPIECS. Back issues are available from host archive.cs.rpi.edu [128.213.10.18] 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. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to nl-kr-request@cs.rpi.edu. Natural Language Generation: siggen@cs.rpi.edu Parsing: sigparse@cs.cmu.edu Speech Interfaces: Electronic Communal Temporal Lobe (or ECTL) is a moderated mailing list for speech interface enthusiats. To subscribe, send a message with your name, institution, department, daytime phone and an email address to ectl-request@snowhite.cis.uoguelph.ca. If you have trouble with this mail address, call David Leip at (519) 824-4120 x3709 (office) x4297 (lab). ECTL has an anonymous ftp archive which is located at snowhite.cis.uoguelph.ca [131.104.48.1] in /pub/ectl. Included in the archive are: all issues of ECTL, as well as a list of subscribers, lists of speech related products (s/w & h/w),and a list of speech related technical report abstracts. If you would like to contribute to the archive, please mail: ectl-sub@snowhite.cis.uoguelph.ca If you need information about how to ftp, or such things, please send mail to: ectl-request@snoehite.cis.uoguelph.ca Statistics, Natural Language, and Computing: empiricists@csli.stanford.edu Corpus-based studies of natural language, statistical natural language processing, methods that enable systems to deal with and scale up to real-world usage, as well as how the various techniques can be useful in such areas as information retrieval and human-computer interaction. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to empiricists-request@csli.stanford.edu Dependency Grammar dg@ai.uga.edu Syntactic theory, analysis, and parsing using dependency grammar (i.e., using links between individual words rather than a constituency tree). All requests for subscriptions or other assistance should be addressed to mcovingt@ai.uga.edu. Prosody: To subscribe, send a one-line message to listserv@purccvm.bitnet in the following format: subscribe prosody Translation and Interpretation of Natural Language: lantra-l%finhutc.bitnet@cunyvm.cuny.edu To add or remove yourself from the list, send a message to listserv%finhutc.bitnet@cunyvm.cuny.edu. 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. Text Analysis and Natural Language Applications: SCHOLAR%CUNYVM.BITNET@uga.cc.uga.edu SCHOLAR is an online information service covering all aspects of natural language processing in such fields as literary studies, linguistics, history and lexicography. It consists of information like book reviews, project reports database listings, a conference calendar, and news of hardware and software relevant to the field. SCHOLAR is distributed occasionally as the quantity of information received allows. Contributions should be sent to Joseph Raben . To add or remove yourself from the list, send a message to listserv@cunyvm.cuny.edu. 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 SCHOLAR your_full_name or: SIGNOFF SCHOLAR where your_full_name is your normal name, not your E-mail address. For technical assistance, send mail to . SCHOLAR files are available by anonymous ftp from jhuvm.hcf.jhu.edu (128.220.2.2). Use username scholar and type your login userid as a password. The index of SCHOLAR files is index.scholar. The files are also available by listserv. For an explanation of the coding system for items in SCHOLAR, send mail to with the following as the body of the message: Get SCHOLAR COD To retrieve the entire release send mail to with the folowing as the body of the message: Get AZ Package Speech production and perception: foNETiks foNETiks is a monthly newsletter distributed by e-mail. The focus is on speech production, speech perception, speech disorders, automatic speech recognition and speech synthesis. It carries job advertisements, notices of conferences, and other news of general interest to phoneticians and speech scientists. The current editors are Linda Shockey and Gerry Docherty. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to FONETIKS-REQUEST@dev.rdg.ac.uk. ---------------------------------------------------------------- ~Subject: [24] Psychology and Cognitive Science PSYCGRAD (The Psychology Graduate Student Journal) is an online journal of technical papers by psychology graduate students and is edited by a team of 18 graduate student editors. To submit a paper or article, send email to psygrd-j@acadvm1.uottawa.ca. To subscribe, send a message "sub psygrd-j " to listserv@acadvm1.uottawa.ca or read the newsgroup bit.listserv.psycgrad. PSYCHE is a quarterly refereed electronic journal concerning the interdisciplinary exploration of the nature of consciousness and its relationship to the brain. To subscribe, send a message with "SUBSCRIBE PSYCHE-L Firstname Lastname" in the body to LISTSERV%NKI.BITNET@cunyvm.cuny.edu. Submissions may be sent to the executive editor, Patrick Wilken, Royal Melbourne Institute of Technology, Bundoora, Victoria 3083, AUSTRALIA, , (03) 388-2347. A discussion group PSYCHE-D has also been created for discussion of the contents of the journal and related topics. To subscribe, send a message with "SUBSCRIBE PSYCHE-D Firstname Lastname" in the body to the list server. The moderator of PSYCHE-D is David Casacuberta, . COGNEURO is a low volume mailing list for discussing matters at the interface of cognitive science and neuroscience. To subscribe to the list, send mail to cogneuro-request@ptolemy.arc.nasa.gov with subject line "cogneuro: subscribe". To unsubscribe send a message to the same address, but with subject line "cogneuro: unsubscribe". To submit an article to the list, send a message to cogneuro@ptolemy.arc.nasa.gov. ---------------------------------------------------------------- ~Subject: [25] Robot Controller Boards robot-board@oberon.com The purpose of the Robot Board mailing list is to discuss robot controller boards, and robot control in general. In particular, this list will be used to support the Miniboard 2.0 and 6.270 board design by Fred Martin and Randy Sargent of MIT. However, any and all traffic related to robot controllers is welcome. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to robot-board-request@oberon.com. You can also use ListServ to be added to or removed (send a message with "help" in the body to listserv@oberon.com for more information). ---------------------------------------------------------------- ~Subject: [26] Simulated Annealing Contact: anneal-request@cs.ucla.edu (Daniel R. Greening) This mailing list is for discussion of simulated annealing techniques, analysis, and related issues such as stochastic optimization, Boltzmann machines, and metricity of NP-complete move spaces. Membership in this list is restricted to those doing active research in simulated annealing or related areas. The list itself is unmoderated. ---------------------------------------------------------------- ~Subject: [27] Simulation simulation@ufl.edu Gatewayed to the newsgroup comp.simulation. All requests to be added to or deleted from this list, problems, questions, etc., should be sent to simulation-request@ufl.edu. ---------------------------------------------------------------- ~Subject: [28] Symbolic Math Symbolic Math Gatewayed to the newsgroup sci.math.symbolic. Mailing list covering symbolic math algorithms, applications and problems relating to the various symbolic math languages. Mail to be forwarded to the list should be sent to leff%smu.uucp@uunet.uu.net (ARPANET/MilNet) or sci.math.symbolic (USENET). Requests to be included on the list should be sent to leff%smu.uucp@uunet.uu.net. ---------------------------------------------------------------- ~Subject: [29] Uncertainty agosta@sumex-aim.stanford.edu This mailing list is an outgrowth of the "Uncertainty in AI" conference. Archives of the mailing list are available by anonymous ftp from sumex-aim.stanford.edu:/var/ftp/pub/unc/ This list is moderated by John Mark Agosta, 415-859-4931, johnmark@sri.com. ---------------------------------------------------------------- ~Subject: [30] Vision Research vision-list@ads.com All requests to be added to or deleted from this list, problems, questions, etc., should be sent to vision-list-request@ads.com. Moderated by Tod Levitt, . cvnet%yorkvm1.bitnet@cunyvm.cuny.edu Color and vision research. ---------------------------------------------------------------- ~Subject: [40] Miscellaneous: Artificial Morality Artificial Morality: artmoral-list@unixg.ubc.ca This is a mailing list for discussion of Peter Danielson's book, "Artificial Morality: Virtuous Robots for Virtual Games" (Routledge, New York, 1992) and related issues. It explores theories of rational morality with Prolog. To join the list, send an email message to artmoral-list-request@unixg.ubc.ca ---------------------------------------------------------------- ;;; *EOF* Xref: rde comp.ai:1813 news.answers:3188 comp.answers:689 Newsgroups: comp.ai,news.answers,comp.answers Path: rde!gator!tarpit!uunet!noc.near.net!howland.reston.ans.net!europa.eng.gtefsd.com!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!mkant From: mkant+@cs.cmu.edu (Mark Kantrowitz) Subject: FAQ: Artificial Intelligence Bibliography 3/5 [Monthly posting] Message-ID: Followup-To: poster Summary: Bibliography of AI introductory texts, overviews and references Sender: news@cs.cmu.edu (Usenet News System) Supersedes: Nntp-Posting-Host: a.gp.cs.cmu.edu Reply-To: mkant+ai-faq@cs.cmu.edu Organization: School of Computer Science, Carnegie Mellon University Date: Thu, 13 May 1993 07:23:36 GMT Approved: news-answers-request@MIT.Edu Expires: Thu, 24 Jun 1993 07:22:58 GMT Lines: 1290 Archive-name: ai-faq/part3 Last-Modified: Thu Apr 15 01:53:39 1993 by Mark Kantrowitz Version: 1.6 ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai-faq-3.text -- 47194 bytes This part of the AI FAQ provides a bibliography of good introductory texts and overviews of AI and specific subfields of AI. If you feel that there is a reference or set of references which should be added to this FAQ, or references which should be removed, please send email to mkant+ai-faq@cs.cmu.edu. When suggesting references to be included in a particular subfield, only suggest the best two or three references (or a particularly well-written overview). It is NOT the intention of this listing to be a comprehensive AI bibliography. Part 3 (Bibliography): Bibliography of introductory texts, overviews and references Addresses and phone numbers for major AI publishers Outline: [1] AI in general (Introductions, Overviews) [1a] Major AI Publishers [2] Search [3] Knowledge Representation [4] Logic [5] Planning [6] Natural Language Processing (NLP) [7] Connectionism and Neural Nets [8] Machine Learning [9] Case-Based Reasoning [10] Genetic Algorithms [11] Production Systems, Expert Systems and Match Algorithms [12] Integrated AI Architectures [13] Fuzzy Logic [14] Artificial Life [15] Qualitative Physics and Model Based Reasoning [16] Task-specific Architectures for Problem Solving [17] Automated Deduction [18] Probabilistic Reasoning [19] Nonmonotonic Reasoning and Truth Maintenance Systems (TMS) [20] Robotics and Computer Vision [21] Distributed AI [22] User/Agent Modeling [23] Philosophy of AI [24] What is Cyc? [25] Miscellaneous: PhD Theses [26] Videotapes and Magazines Search for [#] to get to question number # quickly. ---------------------------------------------------------------- ~Subject: [1] AI in general (Introductions, Overviews) Introductory texts: Elaine Rich & Kevin Knight, "Artificial Intelligence", 2nd edition, McGraw-Hill, New York, 1991. ISBN 0-07-052263-4 Patrick Henry Winston, "Artificial Intelligence", Third Edition, Addison Wesley, Reading, MA, 1992, ISBN 0-201-53377-4. Matthew L. Ginsberg, "Essentials of AI", Morgan Kaufmann Publishers, 1993, ISBN 1-55860-221-6, 430 pages, $49.95. Overviews and References: Shapiro, Stuart C. (ed), "Encyclopedia of Artificial Intelligence", 2nd Edition, John Wiley & Sons, New York, 1992. (1st ed, 1987) Alan Bundy, editor, "Catalogue of Artificial Intelligence Techniques", 3rd Edition, Springer Verlag, 1990, ISBN 0-387-52959-4, 179 pages, $29.50. Avron Barr and Edward A. Feigenbaum, "The Handbook of Artificial Intelligence", volumes 1-4, Addison-Wesley, Reading, MA, 1986. Sundermeyer, K., "Knowledge-Based Systems: Terminology and References", Wissenschaftverlag, 1991. ISBN 3-411-14941-8 Bonnie Lynn Webber and Nils J. Nilsson, "Readings in Artificial Intelligence", Morgan Kaufmann, San Mateo, CA, 1981. Glossaries and Dictionaries: Raoul N. Smith, editor, "The Facts on File Dictionary of Artificial Intelligence", Facts on File, New York, 1989, 211 pages. ISBN 0-8160-1593-3. Jerry M. Rosenberg, "Dictionary of Artificial Intelligence and Robotics", Wiley, New York, 1986, 203 pages. Ellen Thro, "The Artificial Intelligence Dictionary", Microtrend Books, San Marcos, CA, 1991, 407 pages, ISBN 0-915391-36-8. P610.8, "Draft Standard Glossary of Artificial Intelligence Terminology" referenced in "IEEE Std 610.12-1990, IEEE Standard Glossary of Software Technology, December 1990". Colin Beardon "Artificial Intelligence Terminology: a reference guide" Ellis Horwood Series in Artificial Intelligence Foundations and Concepts. ISBN 0-7458-0763-1 Older general introductions and overviews: Nils J. Nilsson, "Principles of Artificial Intelligence", Tioga Publishing Company, Palo Alto, CA, 1980. Eugene Charniak and Drew V. McDermott, "Introduction to Artificial Intelligence", Addison-Wesley, Reading, MA, 1985. Firebaugh, Morris W., "Artificial Intelligence: A Knowledge-Based Approach", PWS-Kent, Massachusetts, 1989. ISBN 0-87835-325-9 Emphasis on the role of knowledge in the design of intelligent systems. Includes intro to AI programming languages, extensive discussion of expert systems and robotics, survey of parallel machine architectures, and identification of bottlenecks in the implementation of useful AI systems. Surveys: Howard E. Shrobe, editor, "Exploring Artificial Intelligence", Morgan Kaufmann Publishers, San Mateo, CA, 1988. (Survey talks from the AAAI 1986 and 1987 conferences.) ---------------------------------------------------------------- ~Subject: [1a] Major AI Publishers Ablex Publishing Corporation 355 Chestnut Street, Norwood, NJ 07648-2090 201-767-8455/8450 Fax 201-767-6717 Academic Press 1250 Sixth Avenue, San Diego, CA 92101 Orders: 800-321-5068 Fax: 619-699-6715 Addison Wesley Publishing Company, Inc. Route 128, 1 Jacob Way, Reading, MA 01867 800-447-2226 (617-944-3700) Fax: 617-944-8243 Benjamin Cummings Publishing Company 2727 Sand Hill Road, Menlo Park, CA 94025 415-854-0300 390 Bridge Parkway, Redwood City, CA 94065 800-552-2499 Blackwell Scientific Publications, Inc. 3 Cambridge Center, Suite 208, Cambridge, MA 02142 617-225-0401 Fax: 617-225-0412 Osney Mead, PO Box 88, Oxford, 0X2 0EL, UK 0865-240201 Cambridge University Press 40 West 20th Street, New York, NY 10022 Orders: 800-221-4512, 212-924-3900 Columbia University Press 562 West 113th Street, New York, NY 10025 800-944-8648 Computer Science Press, Inc. 41 Madison Avenue, New York, NY 10010-3546 212-576-9400 Computing Reviews 11 West 42nd Street, New York, NY 10036 Cornell University Press Box 250, 124 Roberts Place, Ithica, NY 14851 800-666-2211 Digital Press 12 Crosby Drive, Bedford, MA 01730 617-276-1536 Elsevier Science Publishing 655 Avenue of the Americas, New York, NY 10017 212-633-3827/3650 PO Box 211, Amsterdam, 1000 AE, The Netherlands 020-580-3641 Fax: 020-580-3769 Harvard University Press 79 Garden Street, Cambridge, MA 02138 617-495-2600/2480 Houghton Miflin Company One Memorial Drive, Cambridge, MA 02142 617-252-3000 One Beacon Street, Boston, MA 02108 800-225-3362 John Wiley & Sons, Inc. 605 Third Avenue, New York, NY 10158 212-850-6000 Kluwer Academic Publishers 101 Philip Drive, Norwell, MA 02061 617-871-6600 Fax: 617-871-6528. Email: kluwer@world.std.com Ftp-server: world.std.com:Kluwer/{journals,books} The Kluwer ftp server offers the complete table of contents for Kluwer's EE & CS journals, the Aims & Scope, Instruction for Authors, Ordering information, and LaTeX style files. This service can also be reached using gopher. Lawrence Erlbaum Associates, Inc. 365 Broadway, Hillsdale, NJ 07642 800-926-6579, (201-666-4110) Fax: 201-666-2394 Little Brown & Company 34 Beacon Street, Boston, MA 02108 617-227-0730 Fax: 617-227-4633 Macmillan Publishing 866 Third Avenue, Third Floor, New York, NY 10022 800-257-5755 (212-702-2000) McGraw Hill Book Company 1221 Avenue of the Americas, 43rd Floor, New York, NY 10020 800-442-9685 (212-512-2000) MIT Press 55 Hayward Street, Cambridge, MA 02139 617-253-5642 Orders: 800-356-0343 (617-625-8569) Fax: 617-625-6660 Morgan Kaufmann Publishers, Inc. Department E17, 2929 Campus Drive, Suite 260, San Mateo, CA 94403 Orders: 800-745-7323 (415-578-9911) Fax: 415-578-0672 Email: morgan@unix.sri.com Their "Readings in X" series is a good source of information on various AI topics. (Many of them are listed below.) Oxford University Press 200 Madison Avenue, New York, NY 10016 800-451-7556 Pergamon Press 395 Saw Mill River Road, Elmsford, NY 10523 800-257-5755 (914-592-7700) Prentice Hall Inc. College Division, 440 Sylvan Avenue, Englewood Cliffs, NJ 07632 201-592-2377 Orders: 800-223-1360 (fax to 800-495-6991) Fax: 201-461-4573 Email: books@prenhall.com Princeton University Press 41 William Street, Princeton, NJ 08540 800-777-4726 Random House Publishing 201 East 50th Street, New York, NY 10022 212-751-2600 Springer Verlag 175 Fifth Avenue, New York, NY 10010 800-777-4643 (201-348-4033) University Microfilms International 300 North Zeeb Road, Ann Arbor, MI 48106 313-761-4700 Copies of PhD theses off of microfilm. University of Chicago Press 5801 South Ellis Avenue, Chicago, IL 60637 800-621-2736 (312-702-7700) Van Nostrand Reinhold Company, Inc. 115 Fifth Avenue, New York, NY 10003 212-254-3232 W. H. Freeman & Company 41 Madison Avenue, New York, NY 10010 212-576-9400 Fax: 212-689-2383 W. W. Norton & Company, Inc. 500 Fifth Avenue, New York, NY 10010 800-233-4830 (212-354-5500) ---------------------------------------------------------------- ~Subject: [2] Search [See also the Barr and Feigenbaum's Handbook of AI, chapter 1; Nilsson's Principles of AI, sections 2.4.1 through 2.4.4 (A*), sections 3.1 and 3.2 (AND/OR trees and AO*); and the Mackworth paper in Readings in Artificial Intelligence.] Pearl, J. and Korf, R. E., "Search techniques", Annual Review of Computer Science, volume 2, J.F. Traub, B.J. Grosz, B.W. Lampson and N.J. Nilsson, editors, pages 451-467, Annual Reviews Inc., Palo Alto, CA, 1987. L. Kanal and V. Kumar, "Search in Artificial Intelligence", Springer-Verlag, 1988. Hans J. Berliner, "The B* Tree Search Algorithm: A Best-First Proof Procedure", Artificial Intelligence, 12(1):23-40, May 1979. Also appears in "Readings in Artificial Intelligence". Pearl, J., "Heuristics: Intelligent Search Strategies for Computer Problem Solving", Addison-Wesley, 1984. Kirkpatrick, S. Gelatt, CD, and Vecchi, MP, "Optimization by Simulated Annealing", Science 220(4589):671-680, 1983. ---------------------------------------------------------------- ~Subject: [3] Knowledge Representation [Several papers in "Readings in Artificial Intelligence" are relevant, including S. Amarel "On Representations of Problems on Reasoning about Actions" and P.J. Hayes "The Frame Problem and Related Problems in AI".] Nick Cercone and Gordon McCalla, editors, "The Knowledge Frontier: Essays in the Representation of Knowledge", Springer-Verlag, New York, 1987. 512 pages, $40.00, ISBN 0-38796-557-2. (This is the much revised version of a special issue of COMPUTER on KR.) Brachman, Ronald J., Levesque, Hector J. and Reiter, Ray, editors, Special Volume on Knowledge Representation, Artificial Intelligence 49(1-3), January, 1991. Brachman, Ronald J. and Levesque, Hector J., editors, "Readings in Knowledge Representation", Morgan Kaufmann Publishers, 1985. Ronald J. Brachman and James G. Schmolze, "An overview of the KL-ONE knowledge representation system", Cognitive Science, 9:171-216, 1985. Ronald J. Brachman, Richard E. Fikes, and Hector J. Levesque, "KRYPTON: A functional approach to knowledge representation", IEEE Computer, 16:67-73, 1983. Ronald J. Brachman, "On the epistemological status of semantic networks", in N.V. Findler, editor, Associative Networks, pp. 318-353. New York: Academic Press, 1979. Allen Newell, "The Knowledge Level", Artificial Intelligence, 18:87-127, 1982. Allen Newell and Herb Simon, "Computer Science as Empirical Enquiry: Symbols and Search", Communications of the ACM, 19(3):113-126, 1976. Penny Nii, "Blackboard Systems", AI Magazine 7(3), 1986. Ronald J. Brachman, " ``I lied about the trees'', or, defaults and definitions in knowledge representation", AI Magazine 6(3):80-93, 1985. W.A. Woods, "What's in a link: Foundations for semantic networks", In D.G. Bobrow & A. Collins (Eds.), "Representation and Understanding", Academic Press, New York, 1975. Reprinted in "Readings in Cognitive Science", Collins & Smith (eds.), section 2.2. ---------------------------------------------------------------- ~Subject: [4] Logic Genesereth, M.R. and Nilsson, N.J., "Logical Foundations of Artificial Intelligence", Morgan Kaufmann Publishers, Los Altos, CA, 1987. ---------------------------------------------------------------- ~Subject: [6] Natural Language Processing (NLP) General: Gazdar, G. and Mellish, C., "Natural Language Processing in Lisp: An Introduction to Computational Linguistics", Addison-Wesley, Reading, Massachusetts, 1989. (There are three different editions of the book, one for Lisp, one for Prolog, and one for Pop-11.) Grosz, B.J., Sparck-Jones, K., and Webber, B.L., "Readings in Natural Language Processing", Morgan Kaufmann Publishers, Los Altos, CA, 1986. Robert C. Berwick, "Computational Linguistics", MIT Press, Cambridge, MA, 1989, ISBN 0262-02266-4. Brady, Michael, and Berwick, Robert C., "Computational Models of Discourse", MIT Press, Cambridge, MA, 1983. Klaus K. Obermeier, "Natural Language Processing Technologies in Artificial Intelligence: The Science and Industry Perspective", John Wiley & Sons, New York, 1989. Allen, James F., "Natural Language Understanding", The Benjamin/Cummings Publishing Company, Menlo Park, California, (Addison-Wesley Publishing Company, Reading, Massachusetts), 1988, ISBN 0-8053-0330-8. [A new edition is forthcoming.] Terry Winograd, "Language as a Cognitive Process", Addison-Wesley, Reading, MA, 1983. Schank, R. and Abelson, R. "Scripts, Plans, Goals, and Understandings," Lawrence Erlbaum Associates, Hillsdale, New Jersey, 1977. Terminology: David Crystal, "A Dictionary of Linguistics and Phonetics", 3rd Edition, Basil Blackwell Publishers, New York, 1991. Parsing: Tomita, M. (Editor), "Current Issues in Parsing Technology", Kluwer Academic Publishers, Norwell, MA, 1991. Tomita, M., "An Efficient Context-Free Parsing Algorithm", Computational Linguistics 13:31-46, 1987. Marcus, M. "A Theory of Syntactic Recognition for Natural Language," The MIT Press, Cambridge, MA, 1980. Pereira, F. and Sheiber, S. "Prolog and Natural-Language Analysis," Center for the Study of Language and Information, 1987. Probabilistic Parsing: Wright, J., "LR Parsing of Probabilistic Grammars with Input Uncertainty for Speech Recognition", Computer Speech and Language 4:297-323, 1990. Ted Briscoe and John Carroll, "Generalised Probabilistic LR Parsing of Natural Language (Corpora) with Unification-based Grammars", University of Cambridge Computer Laboratory, Technical Report Number 224, 1991. Natural Language Understanding: E. Charniak, "Passing Markers: A Theory of Contextual Influence in Language Comprehension", Cognitive Science, 7:171-190, 1983. Bertram C. Bruce, "Case systems for natural language", Artificial Intelligence 6:327-360, 1975. Yorick Wilks, "A Preferential, Pattern-Seeking, Semantics For Natural Language Inference", Artificial Intelligence, 6:53-74, 1975. Dyer, M. "In-Depth Understanding: A Computer Model of Integrated Processing for Narrative Comprehension," MIT Press, Cambridge, MA, 1983. Aravind Joshi, Bonnie Webber and Ivan Sag, "Elements of Discourse Understanding", Cambridge University Press, New York, 1981. Grosz, Barbara J. and Sidner, Candace L., "Attention, Intention, and the Structure of Discourse", Computational Linguistics 12(3):175-204, 1986. Cohen, P. R., Morgan, J. and Pollack, M., editors, "Intentions in Communication", MIT Press, Cambridge, MA, 1990. Natural Language Interfaces: Raymond C. Perrault and Barbara J. Grosz, "Natural Language Interfaces", Annual Review of Computer Science, volume 1, J.F. Traub, editor, pages 435-452, Annual Reviews Inc., Palo Alto, CA, 1986. Natural Language Generation: McKeown, Kathleen R. and Swartout, William R., "Language Generation and Explanation", in Zock, M. and Sabah, G., editors, Advances in Natural Language Generation, Volume 1, Pages 1-51, Ablex Publishing Company, Norwood, NJ, 1988. (Overview of the state of the art in natural language generation.) There are several books published as a result of the international workshops on natural language generation. Speech: John Allen, Sharon Hunnicut and Dennis H. Klatt, "From Text to Speech: The MITalk System", Cambridge University Press, 1987. [Synthesis, precursor of DECtalk.] Frank Fallside and William A. Woods (editors), "Computer Speech Processing" Prentice Hall, Englewood Cliffs, NJ, 1985. X. D. Huang, Y. Ariki and M. A. Jack, "Hidden Markov Models for Speech Recognition", Edinburgh University Press, 1990. [Analysis] A. Nejat Ince (editor), "Digital Speech Processing: Speech Coding, Synthesis, and Recognition", Kluwer Academic Publishers, Boston, 1992. [Analysis and Synthesis] Dennis H. Klatt, "Review of Text-To-Speech Conversion for English", Journal of the Acoustic Society of America (JASA), 82:737-793, September 1987. [Synthesis] Kai-Fu Lee, "Automatic Speech Recognition: The Development of the SPHINX System", Kluwer Academic Publishers, Boston, MA, 1989. [Analysis] S. E. Levinson, L. R. Rabiner and M. M. Sondhi, "An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition" in Bell Syst. Tech. Journal 62(4):1035-1074, April 1983. [Analysis] R. P. Lippmann, "Review of Neural Networks for Speech Recognition", Neural Computation, 1(1):1-38, 1989. [Analysis] Douglas O'Shaughnessy, "Speech Communication: Human and Machine" Addison-Wesley, MA, 1987. [Analysis and Synthesis] Lawrence R. Rabiner and Ronald W. Schafer, "Digital Processing of Speech Signals", Prentice Hall, Englewood Cliffs, NJ, 1978. [Analysis and Synthesis] Ronald W. Schafer and John D. Markel (editors), "Speech Analysis", IEEE Press, New York, 1979. [Analysis] Alex Waibel and Kai-Fu Lee (editors), "Readings in Speech Recognition" Morgan Kaufmann Publishers, San Mateo, CA, 1990. [Analysis] Alex Waibel, "Prosody and Speech Recognition", Morgan Kaufmann Publishers, San Mateo, CA, 1988. [Analysis] Linguistics: Vivian J. Cook, "Chomsky's Universal Grammar: An Introduction", Basil Blackwell Publisher, New York, 1988, 201 pages. Victoria Fromkin and Robert Rodman, "An Introduction to Language", Holt, Rinehart, and Winston, New York, 4th edition, 1988, 474 pages. Ralph Grishman, "Computational Linguistics: An Introduction", Cambridge University Press, New York, 1986, 193 pages. Liliane M.V. Haegeman, "Introduction to Government and Binding Theory", Basil Blackwell Publishers, Oxford, 1991, 618 pages. Michael A. K. Halliday, "An Introduction to Functional Grammar", Edward Arnold, London, 1985. Geoffrey C. Horrocks, "Generative Grammar", Longman, London, 1987, 339 pages. Andrew Radford, "Transformational Grammar: A First Course", Cambridge University Press, New York, 1988, 625 pages. ---------------------------------------------------------------- ~Subject: [5] Planning Intros, Overviews, Paper Collections: James Allen, James Hendler and Austin Tate, editors, "Readings in Planning", Morgan-Kaufmann Publishers, 1990. James Hendler, Austin Tate and Mark Drummond, "AI Planning: Systems and Techniques", AI Magazine, May, 1990. (Review article.) Georgeff, M. P., "Planning," in Annual Review of Computer Science, Annual Reviews Inc., pages 359-400, 1987. Drew McDermott, "Robot Planning", AI Magazine 13:2, Summer 1992, pp. 55-79. William R. Swartout, "DARPA Workshop on Planning", AI Magazine, 9(2):115-131, Summer, 1988. (Survey of current work and issues in planning.) [See also Waldinger's "Achieving several goals simultaneously", in "Readings in Artificial Intelligence".] STRIPS: Fikes, R.E. and Nilsson, N.J., "STRIPS: A new approach to the application of theorem proving to problem solving", Artificial Intelligence 2:189-208, 1971. ABSTRIPS: Sacerdoti, E. D., "Planning in a Hierarchy of Abstraction Spaces," Artificial Intelligence, 5:115-135, 1974. Conjunctive Goals: Chapman, D., "Planning for Conjunctive Goals", Artificial Intelligence 32:333-377, 1987. NOAH: Sacerdoti, E., "A Structure for Plans and Behavior", Artificial Intelligence, pages 1-65, American Elsevier, New York, 1977. Sacerdoti, E. D., "The Nonlinear Nature of Plans," Proc. of the Fourth Joint Conf. on Artificial Intelligence, Morgan Kaufmann, 1975, 206-214. Reactive Planning: Agre P.E. and Chapman, D., "Pengi: An Implementation of a Theory of Activity", in Proceedings of the Sixth National Conference on Aritificial Intelligence, Seattle, WA, July 1987. Georgeoff, M.P. and Lansky, A.L., "Reactive Reasoning and Planning", in Proceedings of the Sixth National Conference on Artificial Intelligence, Seattle, WA, pages 677-682, July 1987. Simmons, R.G., "A theory of debugging plans and interpretations", in Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88), Morgan Kaufmann Publishers, Palo Alto, CA, pages 94-99, 1988. Case-based Planning: Hammond, K., "Case-based Planning: Viewing Planning as a Memory Task", Academic Press, Cambridge, MA, 1989. Miscellaneous: Stefik, M.J., "Planning with Constraints", Artificial Intelligence 15:111-140 and 16:141-170, 1981. Wilkins, D.E., "Domain-Independent Planning: Representation and Plan Generation", Artificial Intelligence 22:269-301, 1984. R. Wilensky, "Meta-Planning: Representing and Using Knowledge About Planning in Problem Solving and Natural Language Understanding", Cognitive Science 5:197-233, 1981. Reprinted in Readings in Cognitive Science, Collins & Smith (eds.), section 5.6. ---------------------------------------------------------------- ~Subject: [7] Connectionism and Neural Nets Introductions and Overviews: Geoffrey E. Hinton, "Connectionist Learning Procedures", Artificial Intelligence 40(1-3):185-234, 1989. Reprinted in J. Carbonell, editor, "Machine Learning: Paradigms and Methods", MIT Press, 1990. Also appears as Technical Report CMU-CS-87-115 (version 2), Carnegie Mellon University, Pittsburgh, PA, December 1987. Kevin Knight, "A gentle introduction to subsymbolic computation: Connectionism for the AI researcher". Technical Report CMU-CS-89-150, Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, May 30, 1989. Scott Fahlman and Geoffrey Hinton, "Connectionist Architectures for Artificial Intelligence", IEEE Computer 20(1):100-109, January 1987. Hertz, J., Krogh, A., and Palmer, R.G., "Introduction to the Theory of Neural Computation", Addison-Wesley, 1991. 327 pages. ISBN 0-201-51560-1. Hecht-Nielsen, Robert, "Neurocomputing", Addison-Wesley, 1990, 433 pages. ISBN 0-201-09355-3. Paper Collections: Rumelhart, D.E, and McClelland, J.L., editors, "Parallel Distributed Processing: Explorations in the Microstructure of Cognition" (Vol. 1: Foundations; Vol. 2: Psychological and Biological Models), Cambridge, MA: MIT Press, 1986. Waltz, D., and Feldman, J.A., "Connectionist Models and their Implications: Readings from _Cognitive Science_", Ablex, 1988. Mark Watson, "Common Lisp Modules -- Artificial Intelligence in the Era of Neural Networks and Chaos Theory", Springer-Verlag, 1991. Includes code written in Macintosh Common Lisp and uses the Mac graphical interface (the modules are portable to other Common Lisp implementations, but without the graphics). Anderson, J.A., and Rosenfeld, E., editors, "Neurocomputing: Foundations of Research", Cambridge MA: MIT Press, 1988. Also "Neurocomputing Vol. 2: Directions for Research", Cambridge MA: MIT Press, 1991. Hinton, G.E., and Anderson, J.A., editors, "Parallel Models of Associative Memory" (updated edition), Lawrence Erlbaum Associates, 1989. Hinton, G.E., editor, "Connectionist Symbol Processing", MIT Press, 1990. [Was a special issue of Artificial Intelligence, vol. 46, nos. 1-2.] Touretzky, D.S., editor, "Neural Information Processing Systems", volumes 1-4 (1988-1991), Morgan Kaufmann. [Proceedings from the premier conference on neural networks.] Connectionist Language Processing: See the special issue of _Connection Science_, Volume 2 Numbers 1-2, 1990. Also the Hinton collection "Connectionist Symbol Processing", above. Connectionist Cognitive Science: Barnden, J.A., and Pollack, J.B., "Advances in Connectionist and Neural Computation Theory Vol. 1: High-Level Connectionist Models", Ablex, 1991. Quinlan, P., "Connectionism and Psychology: A Psychological Perspective on New Connectionist Research", University of Chicago Press, 1991. Waltz, D., and Feldman, J.A., editors, "Connectionist Models and their Implications: Readings from _Cognitive Science_", Ablex, 1988. Philosophical Foundations: Pinker, S., and Mehler, J, editors, "Connections and Symbols", MIT Press, 1988. [Was Cognition special issue Volume 28, 1988] Clark, A., "Microcognition: Philosophy, Cognitive Science, and Parallel Distributed Processing", MIT Press, 1989. ---------------------------------------------------------------- ~Subject: [8] Machine Learning General: J. G. Carbonell, editor, "Machine Learning: Paradigms and Methods", MIT Press, Cambridge, MA 1990. Tom Mitchell, Jaime G. Carbonell, and Ryszard S. Michalski, "Machine Learning: A guide to current research", Kluwer Academic Publishers, Boston, 1986. J. W. Shavlik and T. D. Dietterich, editors, "Readings in Machine Learning", Morgan Kaufmann Publishers, 1990. [See also the article on Machine Learning from the Encyclopedia of Artificial Intelligence, pages 464-485.] Decision Trees: Quinlan, J. Ross, "Induction of Decision Trees", Machine Learning 1:81-106, 1986. Quinlan, J. Ross, "C4.5: Programs for Machine Learning", Morgan Kaufmann Publishers, 1992. ISBN 1-55860-238-0. $44.95 US, $49.45 International. For a slight additional charge ($25), the book comes with software (ISBN 1-55860-240-2). For software only, (ISBN 1-55860-239-9) $34.95 US, $38.45 International. Probabilistic Clustering: Fisher, D.H., "Knowledge Acquisition Via Incremental Conceptual Clustering", Machine Learning 2:139-172, 1987. (Probabilistic clustering methods.) Clancey, W.J., "Classification Problem Solving", Proceedings of the National Conference on Aritificial Intelligence, 49-55, Los Altos, CA, Morgan Kaufmann. 1984. Version Spaces: Tom M. Mitchell, "Generalization as Search", Artificial Intelligence 18:203-226, 1982. Machine Discovery: Langley, P., and Zytkow, J. M., "Data-driven approaches to empirical discovery", Artificial Intelligence 40:283-312, 1989. Langley, P., Simon, H.A., Bradshaw, G.L., and Zytkow, J.M., "Scientific Discovery: Computational Explorations of the Creative Processes", MIT Press, Cambridge, MA, 1987. Langley, P., Simon, H.A. and Bradshaw, G.L., "Heuristics for Empirical Discovery", in L. Bolc, editor, Computational Models of Learning, Springer-Verlag, 1987. Also appears as CMU CS Tech Report CMU-CS-84-14. Chunking: Laird J.E., Rosenbloom, P.S. and Newell, A., "Chunking in SOAR: The Anatomy of a General Learning Mechanism", Machine Learning 1:1-46, 1986. Explanation-Based Learning: Mitchell, Tom M., Keller, R. M., and Kedar-Cabelli, S. T., "Explanation-based learning: A unified view", Machine Learning 1:47-80, 1986. Derivational Analogy: Carbonell, J. G., "Derivational analogy: A theory of reconstructive problem solving and expertise acquisition." In R.S. Michalski, Jaime G. Carbonell, and Tom M. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, Morgan Kaufmann Publishers, San Mateo, CA, 1986. Theoretical Results: Leslie G. Valiant, "A theory of the learnable", Communications of the ACM, 27(11):1134--1142, 1984. Haussler, D., "Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework", Artificial Intelligence, 36:177-221, 1988. ---------------------------------------------------------------- ~Subject: [9] Case-Based Reasoning Roger C. Schank, "Dynamic Memory: A Theory of Reminding and Learning in Computers and People", Cambridge University Press, New York, NY, 1982. Roger C. Schank and C. Riesbeck, "Inside Case-Based Reasoning", Lawrence Erlbaum Associates, Hillsdale, NJ, 1989. Craig Stanfill and David Waltz, "Toward Memory-Based Reasoning", Communications of the ACM, 29(12):1213-1228, December 1986. (Memory-based reasoning.) ---------------------------------------------------------------- ~Subject: [10] Genetic Algorithms For an extended bibliography, see the FAQ posting for comp.ai.genetic. Overviews: L. B. Booker, D.E. Goldberg and J.H. Holland, "Classifier Systems and Genetic Algorithms", Artificial Intelligence 40(1-3):235-282, September 1989. David E. Goldberg, "Genetic Algorithms in Search, Optimization, and Machine Learning", Addison-Wesley, Reading, MA, 1989, 412 pages. ISBN 0-201-15767-5. Davis, Lawrence (editor), "Handbook of Genetic Algorithms", Van Nostrand Reinhold, New York, 1991, ISBN 0-442-00173-8. See also the July 1992 issue of Scientific American. Collections: Davis, Lawrence, editor, "Genetic Algorithms and Simulated Annealing", Morgan Kaufmann, 1989. Rawlins, G., editor, "Foundations of Genetic Algorithms", Morgan Kaufmann, 1991. See also the Proceedings of the First/Second/Third/Fourth International Conference on Genetic Algorithms, published by Lawrence Erlbaum. Miscellaneous: Holland, J.H. "Adaptation in Natural and Artificial Systems", University of Michigan Press, 1975. Reprinted by MIT Press, 1992. Holland, J.H., Holyoak, K.J., Nisbett, R.E., and Thagard, P.R., "Induction: Processes of Inference, Learning, and Discovery", MIT Press, 1988. Michalewicz, Z., "Genetic algorithms + Data Structures = Evolution Programs", Springer-Verlag, New York, 1992. Genetic Programming: Koza, John R., "Genetic Programming: On the programming of computers by means of natural selection", MIT Press, 1992. ISBN 0-262-11170-5 ---------------------------------------------------------------- ~Subject: [11] Production Systems, Expert Systems and Match Algorithms Overviews: Bruce G. Buchanan and Edward H. Shortliffe, "Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project", Addison-Wesley, Reading, MA, 1985. The Davis and King paper (chapter 4, "An overview of production systems") provides a good overview. Frederick Hayes-Roth, "The knowledge based expert system: A tutorial", IEEE Computer 17(9):11-28, 1984. Bruce G. Buchanan and R.O. Duda, "Principles of Rule-Based Systems", Tech Report HPP-82-14, 1982. (Discusses the design of expert systems, including representation, inference, and uncertainty management. Examples from numerous specific systems, and discusses which problems are suitable for attack by rule-based systems.) OPS5: Charles L. Forgy, "OPS5 User's Manual", Technical Report CMU-CS-81-135, Carnegie Mellon University, School of Computer Science, Pittsburgh, PA 1981. RETE: Charles L. Forgy, "RETE: A fast algorithm for the many pattern/many object pattern match problem", Artificial Intelligence 19(1):17-37, September 1982. TREAT: Daniel P. Miranker, "TREAT: A better match algorithm for AI production systems". In Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI-87), pages 42-47, August 1987. MatchBox: Mark Perlin, "The match box algorithm for parallel production system match", Technical Report CMU-CS-89-163, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, May 1989. DRETE: Michael A. Kelly and Rudolph E. Seviora, "An evaluation of DRETE on CUPID for OPS5 matching", in Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), pages 84-90, Detroit MI, August 1989, Morgan Kaufmann Publishers. ---------------------------------------------------------------- ~Subject: [12] Integrated AI Architectures Kurt VanLehn, editor, "Architectures for Intelligence", Lawrence Erlbaum Associates, Hillsdale, NJ, 1991. SOAR: John E. Laird, Allen Newell, and Paul S. Rosenbloom, "SOAR: An Architecture for General Intelligence", Artificial Intelligence, 33(1):1-64, 1987. PRODIGY: Steven Minton, Jaime G. Carbonell, Craig A. Knoblock, Daniel R. Kuokka, Oren Etzioni, and Yolanda Gil. "Explanation-based learning: A problem solving perspective". Technical Report CMU-CS-89-103, Carnegie Mellon University, School of Computer Science, Pittsburgh, PA, 1989. THEO: Tom M. Mitchell, J. Allen, P. Chalasani, J. Cheng, Oren Etzioni, Marc Ringuette, and Jeffrey Schlimmer, "THEO: A Framework for Self-Improving Systems", in Kurt VanLehn, editor, Architectures for Intelligence, Lawrence Erlbaum Associates, Hillsdale, NJ, 1991. Subsumption Architectures: Brooks, R., "A Robust Layered Control System for a Mobile Robot", IEEE Journal of Robotics and Automation, RA-2, pages 14-23, April 1986. ---------------------------------------------------------------- ~Subject: [13] Fuzzy Logic Zadeh, L.A., "Fuzzy Sets," Information and Control, 8, 338-353, 1965. Klir, George J. and Folger, Tina A., "Fuzzy Sets, Uncertainty, and Information", Englewood Cliffs, NJ: Prentice Hall, 1988. Zimmermann, Hans J., "Fuzzy Set Theory and its Applications", Boston, MA, Kluwer-Nijhoff Publishing, 1985. Didier Dubois, Henri Prade, and Ronald R. Yager, editors, "Readings in Fuzzy Systems", Morgan Kaufmann Publishers, 1992. Brubaker, D.I., "Fuzzy-logic Basics: Intuitive Rules Replace Complex Math," EDN, June 18, 1992. Schwartz, D.G. and Klir, G.J., "Fuzzy Logic Flowers in Japan," IEEE Spectrum, July 1992. Kosko, B., Neural Networks and Fuzzy Systems, Prentice Hall, Englewood Cliffs, NJ, 1992. ---------------------------------------------------------------- ~Subject: [14] Artificial Life The best source for information is the proceedings of the Artificial Life conferences. The proceedings were edited by Christopher G. Langton and published by Addison-Wesley. ISBN 0-201-09356-1 and 0-201-52751-2. Langton, C.G., editor, "Artificial Life" (Proceedings of the First International Conference), Addison-Wesley, 1989. Langton, C.G., Taylor, C., Farmer, J.D., and Rasmussen, S., editors, "Artificial Life II", Addison-Wesley, 1991. Forrest, S., editor, "Emergent Computation", MIT Press, 1991. Levy, S., "Artificial Life", Pantheon, New York, 1992. [An excellent popularization] Jean-Arcady Meyer and Stewart W. Wilson, "From animals to animats: Proceedings of the First International Conference on Simulation of Adaptive Behavior (1990, Paris, France)", MIT Press, Cambridge, MA, 1991. ---------------------------------------------------------------- ~Subject: [15] Qualitative Physics and Model Based Reasoning QP Theory: Forbus, K. D., Qualitative Process Theory, Artificial Intelligence, 24:85-168, 1984. QSIM: Kuipers, B., Qualitative Reasoning with Causal Models in Diagnosis of Complex Systems, In D. S. Weld & J. deKleer, editors, Readings in Qualitative Reasoning about Physical Systems, pages 257-274, chapter 10, Morgan Kaufmann Publishers, 1989. MBR-based Diagnosis: Davis, R., Diagnostic Reasoning Based on Structure and Behavior, Artificial Intelligence, 24:347-410, 1984. Function-based MBR: Sticklen, J., Chandrasekaran, B., & Bond, W. Distributed Causal Reasoning. Knowledge Acquisition, 1:139-162, 1989. ---------------------------------------------------------------- ~Subject: [16] Task-specific Architectures for Problem Solving Generic Tasks: Chandrasekaran, B., Towards a Functional Architecture for Intelligence Based on Generic Information Processing Tasks, In IJCAI-87, pages 1183-1192, Milan, 1987. Components of Expertise: Steels, L., The Components of Expertise. AI Magazine, Summer, 1990. KADS: Breuker, J., & Wielinga, B., Models of Expertise in Knowledge Acquisition, in G. Guida & C. Tasso, editors, Topics in Expert Systems Design: Methodologies and Tools, Amsterdam: North Holland Publishing Company, 1989. Role-limiting Methods: McDermott, J., Preliminary Steps Toward a Taxonomy of Problem-Solving Methods, in S. Marcus, editor, Automating Knowledge Acquisition for Expert Systems, pages 225-255, Boston: Kluver Academic Publishers, 1988. ---------------------------------------------------------------- ~Subject: [17] Automated Deduction C. Chang and R.C. Lee, "Symbolic Logic and Mechanical Theorem Proving", Academic Press, 1973. Alan Bundy, "The Computer Modelling of Mathematical Reasoning", Academic Press, 1983. David Duffy, "Principles of Automated Theorem Proving", John Wiley and Sons, 1991. Larry Wos and Ross Overbeek and Ewing Lusk and Jim Boyle, "Automated Reasoning. Introduction and Applications", Second Edition, McGraw-Hill, 1992. ---------------------------------------------------------------- ~Subject: [18] Probabilistic Reasoning Neapolitan, Richard E., "Probabilistic Reasoning in Expert Systems: Theory and Algorithms", John Wiley and Sons, 1990. Oliver, Robert M., and Smith, James Q., editors, "Influence Diagrams, Belief Nets and Decision Analysis", John Wiley and Sons, 1990. Pearl, Judea, "Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference", Morgan Kaufmann, San Mateo, California, 1988. Shafer, Glenn, and Pearl, Judea, "Readings in Uncertain Reasoning", Morgan Kaufmann, San Mateo, California, 1990. R.O. Duda, P.E. Hart, and N.J. Nilsson, "Subjective Bayesian Methods for Rule-Based Inference Systems", In Proceedings of the 1976 National Computer Conference, pages 1075-1082, AFIPS, 1976. ---------------------------------------------------------------- ~Subject: [19] Nonmonotonic Reasoning and Truth Maintenance Systems (TMS) Matthew L. Ginsberg, "Readings in Nonmonotonic Reasoning", Morgan Kaufmann, San Mateo, CA, 1987. Reiter, Ray, "Nonmonotonic Reasoning", Annual Review of Computer Science, 2:147-186, 1987. (Appears in Ginsberg.) Doyle, J., "Truth Maintenance Systems", Artificial Intelligence, 12(3):231-272, 1979. Reiter, Raymond and de Kleer, Johan, "Foundations of Assumption-Based Truth Maintenance Systems: Preliminary Report", Proceedings of AAAI-87, pages 183-188. J.P. Martins, "The Truth, The Whole Truth And Nothing But the Truth: An Indexed Bibliography to the Literature of TMS's", AI Magazine (Special Issue), AAAI, 1990. De Kleer, J., "An assumption-based TMS", Artificial Intelligence 28:127-162, 1986. De Kleer, J., "Extending the ATMS", Artificial Intelligence 28:163-196, 1986. De Kleer, J., "Problem Solving with the ATMS", Artificial Intelligence 28:197-224, 1986. De Kleer, J., "A comparison of ATMS and CSP techniques", IJCAI 1989, pages 290-296. Proceedings of AAAI 1988. Martins & Shapiro, AI Journal, vol. 35, (1988) Martins & Reinfrank (eds), "Truth Maintenance Systems", published by Springer Verlag in their 'Lecture Notes in Computer Science' series, 1991. Reinfrank, M., Dressler, O. and Brewka, G., On the Relation Between Truth Maintenance and Autoepistemic Logic, IJCAI 1989. Selman, B. and Levesque, H.J., "Abductive and Default Reasoning: A Computational Core", Proceedings of AAAI-90. ---------------------------------------------------------------- ~Subject: [20] Robotics and Computer Vision John J. Craig, "Introduction to Robotics", Addison-Wesley, Reading, MA, 1989. Martin A. Fischler and Oscar Firschein, editors, "Readings in Computer Vision", Morgan Kaufmann, San Mateo, CA, 1987. J. Michael Brady, "Computational approaches to image understanding", ACM Computing Surveys 14(1):3-71, March 1982. (Survey of methods in computer vision.) David Marr, "Vision: a computational investigation into the human representation and processing of visual information", W.H. Freeman, San Francisco, CA, 1982. [Three papers in the Encyclopedia of Aritificial Intelligence are relevant: Path planning and obstacle avoidance, pages 708-715 Mobile robots, pages 957-961 Sensors, pages 1031-1036] The 6.270 Robot Builder's Guide, by Fred Martin. Available by anonymous ftp from kame.media.mit.edu (18.85.0.45) in ~ftp/pub/fredm/README or in cherupakha.media.mit.edu:pub/6270/docs [18.85.0.47]. This directory contains "The 6.270 Robot Builder's Guide", the course notes to the 1992 MIT LEGO Robot Design Competition. For more information, contact Fred Martin . ---------------------------------------------------------------- ~Subject: [21] Distributed AI Collections: Alan H. Bond and Les Gasser, "Readings in Distributed Artificial Intelligence", Morgan Kaufmann, San Mateo, CA, 1988. Michael N. Huhns, ed., "Distributed Artificial Intelligence", Morgan Kaufmann, 1987. Les Gasser and Michael N. Huhns, eds., "Distributed Artificial Intelligence, Volume II", Morgan Kaufmann, 1989. (Special Issue on Distributed AI) IEEE Transactions on Systems, Man, and Cybernetics, Vol. 11, No. 1, Jan 1981. (Special Issue on Distributed AI---10 years later) IEEE Transactions on Systems, Man, and Cybernetics, Vol. 21, No. 6, Nov/Dec 1991. Decentralized Artificial Intelligence, Y. Demazeau ed. 1990, Decentralized AI 2, Demazeau, Y. & Muller, J-P, eds. 1991, Decentralized AI 3, Werner & Demazeau eds. 1992, all published by Elsevier Science Publishers . [Surveys can be found in the Bond & Gasser book listed above, and in: The Handbook of AI volume 4 1989; IEEE Systems, Man, and Cybernetics-17(5) 1987; Kluwer Academic's AI Review-6(1)1992.] ---------------------------------------------------------------- ~Subject: [22] User/Agent Modeling Rapaport,W. J. (1987) "Belief Systems", in the Encyclopedia of Artificial Intelligence, pp. 63-73. Afzal Ballim and Yorick Wilks, "Artifical Believers", Lawrence Erlbaum Associates, Hillsdale, NJ, 1991. ISBN 0-8058-0453-6. Contains a 92 page background section on belief modeling in AI, Philosophy, NLP and Linguistics. Kobsa, A. & Wahlster, W. (1989) "User Models in Dialog Systems." Springer-Verlag, Heidelberg. See also the journal User Modeling and User-Adapted Interaction in [1-1]. ---------------------------------------------------------------- ~Subject: [23] Philosophy of AI D. McDermott, "Artificial Intelligence Meets Natural Stupidity," in Mind Design: Philosophy, Psychology, Artificial Intelligence, J. Haugeland, editor, chapter 5, pp. 143-160, MIT Press, 1981. H.A. Simon, "Sciences of the Artificial", 2nd Edition, MIT Press, 1981. A.M. Turing, "Computing Machinery And Intelligence," Mind, vol. LIX, no. 236, 1950. Reprinted in "Computers and Thought", Feigenbaum & Feldman (eds.), 1963. Also reprinted in "The Mind's I", Hofstadter & Dennett (eds.). Also reprinted in "Readings in Cognitive Science", Collins & Smith (eds.), section 1.1. Roger Penrose, "The Emperor's New Mind: Concerning computers, minds, and the laws of physics", Oxford University Press, New York, 1989, 466 pages, $30. Douglas R. Hofstadter and Daniel C. Dennett, "The Mind's I: Fantasies and Reflections on Self and Soul", Basic Books, New York, 1981, 501 pages, $15.50. Daniel C. Dennett, "Consciousness explained", 1st edition, Little, Brown and Company, Boston, 1991, 511 pages, $27.95. John Haugeland, "Artificial Intelligence: The very idea", MIT Press, Cambridge, MA, 1985, 287 pages. John Haugeland, editor, "Mind Design: Philosophy, Psychology, Artificial Intelligence", MIT Press, Cambridge, MA 1981, 368 pages. Margaret A. Boden, editor, "The Philosophy of Artificial Intelligence", Oxford University Press, New York, 1990, 452 pages. Hans Moravec, "Mind Children: The future of robot and human intelligence", Harvard University Press, Cambridge, MA, 1988, 214 pages. Kirsh, D., editor, "Foundations of Artificial Intelligence, Special issues of Artificial Intelligence", The MIT Press, 1991. Reprinted from Artificial Intelligence 47(1--3), 1991. ---------------------------------------------------------------- ~Subject: [24] What is Cyc? Cyc is a project at MCC in Texas to build an enCYClopedic database and reasoning engine for common sense knowledge. "CYC", AI Magazine 1986, 7(1), 1986. "Cyc: A Mid-Term Report," AI Magazine, 11(3):32-59, Fall 1990. "Cyc: Toward Programs With Common Sense," CACM, 33(8):30-49, August 1990. "Knowledge and Natural Language Processing," CACM, Aug 1990. "When will machines learn?," Machine Learning, 4(3-4):255-257, December 1989. D.B. Lenat, R.V. Guha, "Building Large Knowledge-Based Systems", Addison-Wesley, Reading, MA. ---------------------------------------------------------------- ~Subject: [25] Miscellaneous: PhD Theses Be sure to check the proceedings of the various national conferences in the area that interests you. PhD theses can often be obtained from University Microfilms Internatinal, 300 North Zeeb Road, Ann Arbor, MI 48106. ---------------------------------------------------------------- ~Subject: [26] Videotapes and Magazines Videotapes: The 4th episode of the PBS series "The Machine That Changed the World" is a good introduction to AI. It is available for $90 from Films for the Humanities, 1-800-257-5126. Morgan Kaufmann also has a good set of tapes of AI-related lectures, but it runs on the expensive side. AI-related magazines include: AI EXPERT Miller Freeman, Inc., 600 Harrison Street, San Francisco, CA 94107. Subscriptions: 1-800-274-2534 or 303-447-9330 $42/year (12 issues), $6 extra in Canada and Mexico, $15 extra (surface mail) or $40 (air mail) for overseas. PC AI 3310 West Bell Road, Suite 119, Phoenix, AZ 85023. Subscriptions: 602-971-1869, fax 602-971-2321. $28/year (6 issues); $54 for two years; $78 for three years. $9 extra in Canada and Mexico, $25 extra (air mail) for all other countries. Both magazines are excellent sources of commercial product reviews. ---------------------------------------------------------------- ;;; *EOF* Xref: rde comp.ai:1811 news.answers:3186 comp.answers:687 Newsgroups: comp.ai,news.answers,comp.answers Path: rde!gator!tarpit!uunet!europa.eng.gtefsd.com!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!mkant From: mkant+@cs.cmu.edu (Mark Kantrowitz) Subject: FAQ: Artificial Intelligence FTP Resources 4/5 [Monthly posting] Message-ID: Followup-To: poster Summary: FTP Resources for AI Sender: news@cs.cmu.edu (Usenet News System) Supersedes: Nntp-Posting-Host: a.gp.cs.cmu.edu Reply-To: mkant+ai-faq@cs.cmu.edu Organization: School of Computer Science, Carnegie Mellon University Date: Thu, 13 May 1993 07:24:56 GMT Approved: news-answers-request@MIT.Edu Expires: Thu, 24 Jun 1993 07:24:04 GMT Lines: 1229 Archive-name: ai-faq/part4 Last-Modified: Wed May 12 20:36:37 1993 by Mark Kantrowitz Version: 1.6 ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai-faq-4.text -- 60459 bytes If you think of questions that are appropriate for this FAQ, or would like to improve an answer, please send email to mkant+ai-faq@cs.cmu.edu. Please note that the FTP Resources are now split across parts 4 and 5 of the AI FAQ. Part 4 (FTP Resources): [4-0] General Information about FTP Resources for AI [4-1] FTP Repositories [4-2] FTP and Other Resources Search for [#] to get to question number # quickly. ---------------------------------------------------------------- ~Subject: [4-0] General Information about FTP Resources for AI Remember, when ftping compressed or compacted files (.Z, .z, .arc, .fit, etc.) to use binary mode for retrieving the files. Files that end with a .z suffix were compressed with the patent-free gzip (no relation to zip). Source for gzip is available from: prep.ai.mit.edu:pub/gnu/{gzip-1.0.7.shar,gzip-1.0.7.tar} In general, see the Lisp FAQ for Lisp-related software and the Prolog Resource Guide and the Prolog FAQ for Prolog-related software. If a Lisp-based or Prolog-based system is listed here, only the ftp site and directory will be listed; for a more detailed description, see the Lisp FAQ and the Prolog Resource Guide. For information on obtaining the Lisp FAQ or the Prolog Resource Guide see [1-0]. When referring to software, we use "alpha" to indicate an internal early release, "beta" to indicate an external early release, and "omega" to indicate an external "finished" release. Generally an "alpha" release means the creator hasn't yet tested for bugs. ---------------------------------------------------------------- ~Subject: [4-1] FTP Repositories Ada Repository: The Ada Repository on wsmr-simtel20.army.mil (mailing list ada-sw@wsmr-simtel20.army.mil) contains a directory of AI programs in PD2:*.*. A somewhat easier to access copy of the archives is available as wuarchive.wustl.edu:/mirrors/ada/ai. UCLA Artificial Life Depository: ftp.cognet.ucla.edu:~ftp/pub/alife [128.97.50.19] Repository of papers, articles, tech reports, software and other items of interest to Artificial Life researchers. It includes an archive of past postings to the alife mailing list, alife@cognet.ucla.edu (send mail to alife-request@cognet.ucla.edu to be added to the list). (Other artificial life information is available from santafe.edu or ftp.santafe.edu [192.12.12.1] in the directory pub/Artificial-Life-III.) Consortium for Lexical Research: clr.nmsu.edu [128.123.1.12] equivalently, lexical.nmsu.edu [128.123.1.12] Archive containing a variety of programs and data files related to natural language processing research, with a particular focus on lexical research. See the file catalog-short for a quick listing of the contents of the archive. Long descriptions are in the info/ subdirectory. Publicly available materials are in the pub/ subdirectory. Materials for paid-up members of the Consortium are in the members-only/ subdirectory. Public materials include the Alvey Natural Language Tools, Sowa's Conceptual Graph parser implemented in YACC by Maurice Pagnucco, a morphological parsing lexicon of English, a phonological rule compiler for PC-KIMMO, C source code for the NIST SGML parser, PC-KIMMO sources, the 1911 Roget Thesaurus, and a variety of word lists (including English, Dutch, and male/female/last names). Comments and questions may be directed to lexical@nmsu.edu. FJ Repository: The FJ Repository contains freeware from Japan (FJ = "From Japan"). The fj.sources subdirectory is a good place to look for free software from Japan. Some files in the repository may contain Kana and Kanji characters. The repository is available by anonymous ftp from utsun.s.u-tokyo.ac.jp:fj/fj.sources [133.11.11.11] The file Index contains an index of all the files in each volume. Files of particular interest include: v07/786: Portable Prolog for Common Lisp v25/2577: General-Purpose Fuzzy Inference Library Ver. 3.0 (1/1) Fuzzy Logic Repositories: ntia.its.bldrdoc.gov:pub/fuzzy [132.163.64.201] contains information concerning fuzzy logic, including bibliographies (bib/), product descriptions and demo versions (com/), machine readable published papers (lit/), miscellaneous information, documents and reports (txt/), and programs, code and compilers (prog/). You may download new items into the new/ subdirectory. If you deposit anything in new/, please inform fuzzy@its.bldrdoc.gov. The repository is maintained by Timothy Butler, tim@its.bldrdoc.gov. The Fuzzy Logic Repository is also accessible through a mail server, rnalib@its.bldrdoc.gov. For help on using the server, send mail to the server with the following line in the body of the message: @@ help Other commands available include index, list, find, send, and credits. Ostfold Regional College in Norway recently started a ftp site for material related to fuzzy logic, ftp.dhhalden.no:fuzzy/ [158.36.33.11]. Material to be included in the archive (e.g., papers and code) may be placed in the upload/ directory. Now holds the files from Togai's mail-server, and other files from Timothy Butler's site ntia.its.bldrdoc.gov. It also includes some demo programs. Send email to Asgeir Osterhus, . Togai InfraLogic, Inc. (TIL) also runs a fuzzy logic email server which contains demo versions of some of their software, fuzzy logic bibliographies, conference announcements, a short introduction to fuzzy logic, copies of the company newsletter, archives of comp.ai.fuzzy, and so on. See the entry in the answer to question [1-8] for more information on the company. To get started with the fuzzy logic email server, send a message with NO SUBJECT LINE to fuzzy-server@til.com, containing just the word "help" in the message body. The server will reply with a set of instructions. Please address any comments, questions or requests to either erik@til.com or tanaka@til.com. Most of the contents of the TIL server is mirrored at Tim Butler's fuzzy logic ftp repository at ntia.its.bldrdoc.gov and at Ostfold ftp repository at ftp.dhhalden.no. For more information, write to Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718 or call 714-975-8522. The Aptronix FuzzyNet files are available through an email server. Send email to fuzzynet@aptronix.com with "help" in the message body to get instructions on how to retrieve files. "catalog" or "index" will get you a listing of available files. (You can also connect to the FuzzyNet repository by modem to Aptronix FuzzyNet 408-428-1883 N/8/1 1200-19,200 baud.) Files on the server include descriptions of fuzzy logic applications (e.g., washing machines, camera focusing, air conditioning), introductory materials, Fide related information, archives of comp.ai.fuzzy, etc. If you'd like to have a file included in the FuzzyNet server (e.g., moderate length technical reports), send email to Scott Irwin . Genetic Algorithms: The Genetic Algorithms Repository is located at ftp.aic.nrl.navy.mil. It includes past copies of the genetic algorithms digest in /pub/galist/, a copy of Nici Schraudolph's survey of free and commercial GA software in /pub/galist/information/ga-software-survey.txt (send email to to add to the list), and some software, including GAC (a simple GA written in C), GAL (a simple GA written in Common Lisp), GAucsd, GECO (a Common Lisp toolbox for constructing genetic algorithms), GENESIS, GENOCOP, Paragenesis (a parallel version of GENESIS that runs on the CM-200), SGA-C (a C implementation/extension of Goldberg's SGA system). Genetic Programming: The Genetic Programming Repository is located at ftp.cc.utexas.edu:pub/genetic-programming/ [128.83.186.13]. It contains the archives of the genetic programming mailing list (including the GP FAQ posting), papers and source code. The source code includes the GP implementation from Koza's book and some related systems. UC/Irvine (UCI) AI/Machine Learning Repository: ics.uci.edu has a variety of AI-related materials, with a special focus on machine learning. The directory pub/machine-learning-databases contains over 80 benchmark data sets for classifier systems (30mb). Files may also be retrieved by email using the archive server archie-server@ics.uci.edu. Commands to the server should be given in the message body. Some commands are: help send find The help command replies with a useful help message. Site Librarian: Patrick M. Murphy (ml-repository@ics.uci.edu) Off-Site Assistant: David W. Aha (aha@cs.jhu.edu) Machine Learning: Various programs (e.g., ID3) and publications related to machine learning are available by anonymous ftp from the machine learning group (under Raymond Mooney) at UT-Austin, at cs.utexas.edu:pub/mooney. Subdirectories include ml-course information and homeworks from a graduate course in machine learning taught by Dr. Mooney. Homeworks include "miniatures" of various machine learning systems written in Common Lisp. ml-code Common Lisp code corresponding to the assignments for the course in the ml-course directory. ml-progs More "research-level" versions of inductive classification algorithms and software for automated experiments that generation learning curves that compare several systems. papers Publications producted by the machine learning research group. Machine Learning Algorithms Implemented in Prolog: In 1988 the Special Interest Group on Machine Learning of the German Society for Computer Science (GI e.V.) decided to establish a library of PROLOG implementations of Machine Learning algorithms. The library includes - amongst others - PROLOG implementations of Winston's arch, Becker's AQ-PROLOG, Fisher's COBWEB, Brazdil's generation of discriminations from derivation trees, Quinlan's ID3, inverse resolution, and Mitchell's version spaces algorithm. The programs are currently available via anonymous ftp-server from the GMD: ftp.gmd.de:/gmd/mlt/ML-Program-Library [129.26.8.90] Send additional PROLOG implementations of Machine Learning Algorithms, complaints about them and detected bugs or problems to Thomas Hoppe, . Send suggestions and complaints about the ftp library to Werner Emde, Gesellschaft fuer Mathematik und Datenverarbeitung, Bonn, . CMU Simulator Collection: The CMU Simulator Collection is available by anonymous ftp from ftp.cs.cmu.edu [128.2.206.173] in the directory /afs/cs.cmu.edu/project/connect/code/ The collection includes Lisp and C implementations of Scott Fahlman's Cascade Correlation algorithm, Scott Fahlman's Quickprop variation on the back-propagation algorithm, and Scott Fahlman's Recurrent Cascade-Correlation simulator. The collection also includes Aspririn/Migraines and Tesauro. The neural network benchmark collection is available in /afs/cs.cmu.edu/project/connect/bench/ The data sets include the NETtalk data, a vowel recognition task, and several others. The archives of the connectionists mailing list are kept in /afs/cs.cmu.edu/project/connect/connect-archives/ along with a Lisp implementation of a backprop simulator. Funic Neural FTP Archive Site: The Finnish University maintains an archive site containing a large collection of neural network papers and public domain software gathered from FTP sites in the US. The files are available by anonymous ftp from funic.funet.fi:/pub/sci/neural [128.214.6.100]. (Also know as ftp.funet.fi, nic.funet.fi.) See the file 01README for details. A list of mirrored ftp sites is in 04Neural_FTP_Sites. For further information, contact neural-adm@funic.funet.fi or Marko Gronroos (or ). OSU Neuroprose: archive.cis.ohio-state.edu:/pub/neuroprose [128.146.8.52] This directory contains technical reports as a public service to the connectionist and neural network scientific community which has an organized mailing list (for info: connectionists-request@cs.cmu.edu) NL Software Registry: The Natural Language Software Registry is a catalogue of software implementing core natural language processing techniques, whether available on a commercial or noncommercial basis. Some of the topics listed include speech signal processing, morphological analysis, parsers, and knowledge representation systems. The catalogue is available from the German Research Institute for Artificial Intelligence (DFKI) in Saarbruecken (Germany) by anonymous ftp to ftp.dfki.uni-sb.de:registry/, email to registry@dfki.uni-sb.de, or physical mail to NL Software Registry, Deutsches Forschungszentrum fuer Kuenstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbruecken, Germany, or by telephone to +49 (681) 303-5282. Miscellaneous AI: Some miscellaneous AI programs may be found on ftp.uu.net:/pub/ai Most are mirrors of programs available at other sites. AI_ATTIC is an anonymous ftp collection of classic AI programs and other information maintained by the University of Texas at Austin. It includes Parry, Adventure, Shrdlu, Doctor, Eliza, Animals, Trek, Zork, Babbler, Jive, and some AI-related programming languages. This archive is available by anonymous ftp from ftp.cc.utexas.edu (bongo.cc.utexas.edu, 128.83.186.13) in the directory /pub/AI_ATTIC. For more information, contact atticmaster@bongo.cc.utexas.edu. ---------------------------------------------------------------- ~Subject: [4-2] FTP and Other Resources In addition to programs available free by anonymous ftp, we've included some programs which are available by contacting the authors, and some programs which charge a nominal fee. Agent Modelling: ANIMALS is a simulation system written by Toby Tyrrell, , for his PhD thesis. The thesis examines the problem of action selection when dealing with realistic, animal-like situations: how to choose, at each moment in time, the most appropriate out of a repertoire of possible actions. It includes a description is given of a simulated environment which is an extensive and detailed simulation of the problem of action selection for animals. This simulated environment is used to investigate the adequacy of several theories of action selection (from both ethology and artificial intelligence) such as the drive model, Lorenz's psycho-hydraulic model and Maes' spreading activation network, and outlines deficiencies in each mechanism. Finally, it proposes a new approach to action selection is developed which determines the most appropriate action in a principled way, and which does not suffer from the inherent shortcomings found in other methods. The thesis includes a review and bibliography of existing work on action selection. The thesis is available by anonymous ftp from ftp.ed.ac.uk:pub/lrtt/ [129.215.146.5] as the files as.1.ps.Z, as.2.ps.Z, ..., and as.7.ps.Z. The simulation software is also available from the same site, as the file se.tar.Z. The simulation software was written in Suntools rather than Xtools. It can be run only from SunView or OpenWindows. The action selection problem modelled by the simulated environment comprises 15 different `sub-problems' (getting food, reproducing, not getting lost, being vigilant for predators, etc), many internal and external stimuli, and 35 different low-level actions to select between. ViewGen (Viewpoint Generator) is a Prolog program that implements a "Belief Ascription Algorithm" as described in Ballim and Wilks (see the bibliography section on User Modelling). This can be seen as a form of agent modelling tool, which allows for the generation of arbitrarily deep nested belief spaces based on the system's own beliefs, and on beliefs that are typically held by groups of agents. ViewGen is available by anonymous ftp from crl.nmsu.edu:pub/ViewFinder [128.123.1.18] (user anonymous) ftp.ims.uni-stuttgart.de:pub/ballim [141.58.127.8] (user ftp) as the file ViewGen.tar.Z. The theory of belief ascription upon which it is based is described in detail in Ballim and Wilks, and a general framework for attributing and maintaining nested propositional attitudes is described in Afzal Ballim's dissertation which is archived with the Viewgen program (in the files ViewFinder-{A4/A5/US}.tar.Z, the variable part indicating the format of the PostScript file). The inheritance reasoner is in the file vf-hetis.tar.Z. Implemented in Sicstus prolog, and hence easily convertible to any Edinburgh-style prolog. Contact Afzal Ballim for more information. Analogical Reasoning: SME -- multivac.ils.nwu.edu:pub/SME Contact: Brian Falkenhainer Ken Forbus the Structure-Mapping Engine, as described in Falkenhainer, Forbus, and Gentner's 1987 AIJ article. Artificial Life: Tierra is an artificial life system for studying the evolution of digital organisms. Tierra runs in Unix and MS-DOS. Source code and documentation is available by anonymous ftp at tierra.slhs.udel.edu (128.175.41.34) and life.slhs.udel.edu (128.175.41.33) in the directories almond/, beagle/, doc/, and tierra/. To be added to either the tierra-announce (official announcements only) or tierra-digest (moderated discussion plus announcements) mailing lists, send mail to tierra-request@life.slhs.udel.edu. Send bug reports to tierra-bug@life.slhs.udel.edu. Blackboard Architectures: GBB (PD Version) -- dime.cs.umass.edu:/gbb GEST -- Contact: Susan Coryell Blackboard system. Runs on Symbolics and SUN. Georgia Tech's Generic Expert System Tool (GEST) Available to academic institutions for classroom use. Case-based Reasoning: CL-Protos -- cs.utexas.edu:/pub/porter Contact: Dan Dvorak Ray Bareiss Erik Eilerts Bruce W. Porter MICRO-xxx -- cs.umd.edu:/pub/schank/icbr Contact: waander@cs.umd.edu The directory pub/schank/icbr contains the complete code for "Inside Case-Based Reasoning" by Riesbeck and Schank, 1989. This includes code for an instructional version of CHEF by Kristian Hammond. Chess: The SAN Kit chess programming C source toolkit provides common routines for move notation I/O, move generation, move execution, etc. Only search routines and an evaluation function need be added to obtain a working chess program. It runs on Apple Macintosh (Think C 5.0), Commodore Amiga (SAS C), MS-DOS, and Unix. It is available by anonymous ftp from valkyries.andrew.cmu.edu [128.2.232.4] in the directory pub/chess/misc as the compressed tar file SAN.tar.Z. Also at this site is the SCP package, a restructured ANSI C port of the 1987 Stanback Chess Program. Contact Steven J. Edwards, sje@xylos.ma30.bull.com for more information. Constraint Programming and Non-determinism: SCREAMER: Screamer is an extension of Common Lisp that adds support for nondeterministic programming. Screamer consists of two levels. The basic nondeterministic level adds support for backtracking and undoable side effects. On top of this nondeterministic substrate, Screamer provides a comprehensive constraint programming language in which one can formulate and solve mixed systems of numeric and symbolic constraints. Together, these two levels augment Common Lisp with practically all of the functionality of both Prolog and constraint logic programming languages such as CHiP and CLP(R). Furthermore, Screamer is fully integrated with Common Lisp. Screamer programs can coexist and interoperate with other extensions to Common Lisp such as CLOS, CLIM and Iterate. In several ways Screamer is more efficient than other implementations of backtracking languages. First, Screamer code is transformed into Common Lisp which can be compiled by the underlying Common Lisp system. Many competing implementations of nondeterministic Lisp are interpreters and thus are far less efficient than Screamer. Second, the backtracking primitives require fairly low overhead in Screamer. Finally, this overhead to support backtracking is only paid for those portions of the program which use the backtracking primitives. Deterministic portions of user programs pass through the Screamer to Common Lisp transformation unchanged. Since in practise, only small portions of typical programs utilize the backtracking primitives, Screamer can produce more efficient code than compilers for languages in which backtracking is more pervasive. Screamer is fairly portable across most Common Lisp implementations. It currently runs under Genera 8.1.1 and 8.3 on both Symbolics 36xx and Ivory machines, under Lucid 4.0.2 and 4.1 on Sun SPARC machines, under MCL 2.0 and 2.0p2 on Apple Macintosh machines, and under Poplog Common Lisp on Sun SPARC machines. It should run under any implementation of Common Lisp which is compliant with CLtL2 and with minor revision could be made to run under implementations compliant with CLtL1 or dpANS. Screamer is available by anonymous FTP from ftp.ai.mit.edu as the file /pub/screamer.tar.Z. Contact Jeffrey Mark Siskind for further information. Eliza and Similar Programs: The software from Peter Norvig's book "Paradigms of AI Programming" is available by anonymous ftp from unix.sri.com:pub/norvig and on disk in Macintosh or DOS format from the publisher, Morgan Kaufmann. The software includes Common Lisp implementations of: Eliza and pattern matchers, Emycin, Othello, Parsers, Scheme interpreters and compilers, Unification and a prolog interpreter and compiler, Waltz line-labelling, implementation of GPS, macsyma, and random number generators. For more information, write to Morgan Kaufmann, Dept. P1, 2929 Campus Drive, Suite 260, San Mateo CA 94403, call 800-745-7323, or fax 415-578-0672. (Mac ISBN 1-55860-227-5; DOS 3.5" ISBN 1-55860-228-3; or DOS 5.25" ISBN 1-55860-229-1). The doctor.el is an implementation of Eliza for GNU-Emacs emacs-lisp. Invoke it with "Meta-X doctor". Source code for ELIZA in Prolog (implemented by Viren Patel) is available by ftp from aisun1.ai.uga.edu. muLISP-87 (a MSDOS Lisp sold by Soft Warehouse) includes a Lisp implementation of Eliza. Compute!'s Gazette, June 1984, includes source for a BASIC implementation of Eliza. You can also find it in 101 more computer games, edited by David Ahl, published by Creative Computing (alas, they're defunct, and the book is out of print). Herbert Schildt "Artificial Intelligence using C", McGraw-Hill, 1987, ISBN 0-07-881255-0, pp315-338, includes a simple version of DOCTOR. ucsd.edu:pub/pc-ai contains implementations of Eliza for the IBM PC. The original Parry (in MLISP for a PDP-10) is available in labrea.stanford.edu:/pub/parry.tar.Z. RACTER is *not* public domain. According to A.K. Dewdney's book, "The Armchair Universe", Racter is available from John Owens, INRAC, Inc., 12 Schubert St., Staten Island, NY 10305. It was published in 1984, and written in compiled BASIC. To read some of RACTER's work, see "The Policeman's Beard is Half Constructed", Computer Prose and Poetry by Racter, Warner Books, 1984. ISBN 0-446-38051-2 (paperback). Written by William Chamberlain and Thomas Etter. Expert Systems: FOCL -- ics.uci.edu:pub/SaranWrap/{README,KR-FOCL-ES.cpt.hqx} Contact: pazzani@ics.uci.edu Expert System Shell and Machine Learning Program; Extends Quinlan's FOIL. OPS5 -- ftp.cs.cmu.edu:/afs/cs/user/mkant/Public/Lisp/ops5.tar.Z BABYLON-- gmdzi.gmd.de:gmd/ai-research/Software/ (129.26.8.90) (BinHexed stuffit archive of Babylon) Development environment for expert systems. CLIPS is an OPS-like forward chaining production system written in ANSI C by NASA. The CLIPS inference engine includes truth maintenance, dynamic rule addition, and customizable conflict resolution strategies. CLIPS, including the runtime version, is easily embeddable in other applications. CLIPS runs on IBM PC compatibles, Macintosh, VAX 11/780, Sun 3/260, and HP9000/500. CLIPS is available from COSMIC at a nominal fee for unlimited copies with no royalties. For more information, email service@cossack.cosmic.uga.edu, write COSMIC, University of Georgia, 382 East Broad Street, Athens, GA 30602, call 404-542-3265, or fax 404-542-4807. To subscribe to the CLIPS mailing list, send a message to the list server listserv@cossack.cosmic.uga.edu (128.192.14.4) with message body SUBSCRIBE CLIPS-LIST. An electronic bulletin board containing information regarding CLIPS can be reached 24 hours a day at 713-280-3896 or 713-280-3892. Communications information is 300, 1200, or 2400 baud, no parity, 8 data bits, and 1 stop bit. The CLIPS help desk phone number is 713-280-2233 and email address is stbprod@krakatoa.jsc.nasa.gov. The book "Expert Systems: Principles and Programming" by Joseph Girrantano and Garey Riley comes with an MS-DOS CLIPS interpreter. Frame Systems: FrameWork -- ftp.cs.cmu.edu: /afs/cs.cmu.edu/user/mkant/Public/Lisp/framework.lisp Theo -- Contact: Tom.Mitchell@cs.cmu.edu FrameKit -- Contact: Eric.Nyberg@cs.cmu.edu KR -- Contact: Brad.Myers@cs.cmu.edu PARKA -- Contact: spector@cs.umd.edu Frames for the CM PARMENIDES (Frulekit) -- Contact: Peter.Shell@cs.cmu.edu FROBS -- cs.utah.edu:/pub/frobs.tar.Z Contact: Robert Kessler PFC -- linc.cis.upenn.edu: YAK -- Contact: Enrico Franconi Fuzzy Logic: FLIE -- ural.ethz.ch:/robo/flie Contact: vestli@ifr.ethz.ch Fuzzy Logic Inference Engine, Institute of Robotics, ETH. Game Playing: METAGAME is a game-playing workbench for developing and playing metagame programs. It includes a generator for symmetric chess-like games; definitions of chess, checkers, chinese chess, shogi, lose chess, lose checkers, french checkers, and tic tac toe translated into symmetric chess-like games; a legal move generator; and a variety of player programs, from simple through sophisticated. The METAGAME Workbench runs in Quintus or Sictus Prolog. Available by anonymous ftp from ftp.cl.cam.ac.uk [128.232.0.56] in users/bdp/metagame.tar.Z. For more information, contact Barney Pell of the University of Cambridge Computer Laboratory. Genetic Algorithms: SCS (Simple Classifier System) is a C port of the system from Appendix D of "Genetic Algorithms in Search, Optimization, and Machine Learning" by David E. Goldberg. It was ported to C by Erik Mayer . For more information, contact the author. SCS-C is another port to C of Goldberg's Simple Classifier System. It includes some extensions, and runs on Sun 10/30 and Atari ST. SCS-C is available via anonymous ftp as scs-c-0.98j.tar.Z from lumpi.informatik.uni-dortmund.de:/pub/LCS/src/ [129.217.36.140]. The documentation alone is available as scs-c-doc.tar.Z in the directory /pub/LCS/docs/. For more information, contact Joerg Heitkoetter , c/o Systems Analysis Group, LSXI, Department of Computer Science, University of Dortmund, D-44221 Dortmund, Germany. GENITOR is available by anonymous ftp from the Colorado State University Computer Science Department in beethoven.cs.colostate.edu:pub/GENITOR.tar [129.82.102.183] For further information, contact starkwea@cs.colostate.edu or mathiask@cs.colostate.edu. If these fail to work, contact whitley@cs.colostate.edu. Other packages are described in detail in Nici Schraudolph's survey of free and commercial GA software (see the Genetic Algorithms Repository in [4-1]). Some of the free ones from Nici's list are summarized below. Many are available from the GA Repository. GAucsd Genetic algorithms software cs.ucsd.edu:/pub/GAucsd/GAucsd14.ps.Z [132.239.51.3] Nici Schraudolph To be put on a mailing list of GAucsd users, send the message "add GAucsd" to listserv@cs.ucsd.edu. GAbench Genetic algorithms benchmarks and test problems cs.ucsd.edu:/pub/GAbench/ Thomas Kammeyer (tkammeye@cs.ucsd.edu) EM Evolution Machine (EM) ftp-bionik.fb10.tu-berlin.de:pub/software/Evolution-Machine/ [130.149.192.50] em_tc.exe (EM for Turbo C) em_tcp.exe (EM for Turbo C++) em_man.exe (the manual) Joachim Born Genie GA-based modeling/forecasting system Lance Chambers GENOCOP GEnetic algorithm for Numerical Optimization for COnstrained Problems. Optimizes function with any number of linear constraints (equalities and inequalities) Genetic-2 Optimization package for the linear transportation problem. Genetic-2N Optimization package for the nonlinear transportation problem. All three were developed by Zbigniew Michalewicz and are described in detail in his book "Genetic Algorithms + Data Structures = Evolution Programs", Springer Verlag, August 1992. unccsun.uncc.edu:coe/evol/ [152.15.10.88] Zbigniew Michalewicz WOLF Simulator for G/SPLINES algorithm (genetic spline models) David Rogers GAC, GAL GA written in C/Lisp. Similar to John Grefenstette's Genesis. Bill Spears ESCaPaDE Experiments with evolutionary algorithsm. Frank Hoffmeister (Send mail with subject line "help" or "get ESCaPaDE") mGA1.0 Common Lisp implementation of a messy GA as described in TCGA report 90004. SGA-C C-language port and extension of the original Pascal SGA code presented in Goldberg's book "Genetic Algorithms in Search, Optimization & Machine Learning", Addison Wesley, 1989. See TCGA report 91002. SGA-Cube Goldberg's SGA code modified for nCUBE 2 hypercube parallel computer. All three are available by e-mail from Robert Elliott Smith . BUGS Demonstrates genetic algorithms. santafe.edu:pub/misc/BUGS/ Joshua Smith GENEsYs lumpi.informatik.uni-dortmund.de:pub/GA/src/ [129.217.36.140] Use "ftp" as user name, e-mail address as password. Thomas Baeck GAGA Jon Crowcroft Splicer Steve Bayer PARAGENESIS GA-Repository/e-mail Michael van Lent GENESIS GA-Repository/e-mail John Grefenstette OOGA GA-Repository/e-mail John Grefenstette DGENESIS Erick Cantu or . ICOT: Japan's Institute for New Generation Computer Technology (ICOT) has made their software available to the public free of charge. The collection includes a variety of prolog-based programs in symbol processing, knowledge representation, reasoning and problem solving, natural language processing. All programs are available by anonymous ftp from ftp.icot.or.jp. Note that most of the programs are written for the PSI machines, and very few have been ported to Unix-based emulators. For further information, send email to ifs@icot.or.jp, or write to ICOT Free Software Desk, Institute for New Generation Computer Technology, 21st Floor, Mita Kokusai Bldg., 4-28, Mita 1-chome, Minato-ku, Tokyo 108, Japan, fax +81-3-4456-1618. Knowledge Representation: KNOWBEL -- ai.toronto.edu:/pub/kr/{knowbel.tar.Z,manual.txt.tar.Z} Contact: Bryan M. Kramer, Telos temporal/sorted logic system. SB-ONE -- Contact: kobsa@cs.uni-sb.de KL-ONE family KRIS -- Contact: baader@dfki.uni-kl.de KL-ONE family (Symbolics only) BACK -- Contact: back@cs.tu-berlin.de KL-ONE family CLASSIC -- Contact: dlm@research.att.com KL-ONE family MOTEL -- Contact: hustadt@mpi-sb.mpg.de Modal KL-ONE (contains KRIS as a kernel). Implemented in Prolog. FOL GETFOL -- Contact: fausto@irst.it Weyrauch's FOL system SNePS -- Contact: shapiro@cs.buffalo.edu Semantic Nets COLAB/RELFUN -- Contact: boley@informatik.uni-kl.de Logic Programming COLAB/FORWARD -- Contact: hinkelma@dfki.uni-kl.de Logic Programming COLAB/CONTAX -- Contact: meyer@dfki.uni-kl.de Constraint System for Weighted Constraints over Hierarchically Structured Finite Domains. COLAB/TAXON -- Contact: hanschke@dfki.uni-kl.de Terminological Knowl. Rep. w/Concrete Domains Machine Learning: COBWEB/3 -- Contact: cobweb@ptolemy.arc.nasa.gov FOIL -- ftp.cs.su.oz.au:pub/{foil4.sh,foil5.sh} [129.78.8.208] Each shell archive contains source, a brief manual, and several sample datasets. FOIL2 should be available from sumex-aim.stanford.edu:/pub/FOIL.sh. RWM -- Contact: H. Altay Guvenir RWM is a program for learning problem solving strategies, written in Common Lisp (tested on Suns and NeXT). IND -- Contact: NASA COSMIC, Tel: 706-542-3265 (ask for customer support) Fax: 706-542-4807 IND is a C program for the creation and manipulation of decision trees from data, integrating the CART, ID3/C4.5, Buntine's smoothing and option trees, Wallace and Patrick's MML method, and Oliver and Wallace's MML decision graphs which extend the tree representation to graphs. Written by Wray Buntine, . Medical Reasoning: TMYCIN -- sumex-aix.stanford.edu:/tmycin Natural Language Processing: YACC -- ftp.cs.cmu.edu: /afs/cs/user/mkant/Public/Lisp/johnson-yacc.lisp Contact: Mark Johnson Lisp YACC/Parser. BABBLER -- Contact: rsf1@ra.msstate.edu Markov chains/NLP PENMAN -- Contact: hovy@isi.edu Natural Language Generation. PC-KIMMO -- msdos.archive.umich.edu:/msdos/linguistics/pckim105.zip An implementation of KIMMO morphological analyzer for the IBM PC. FUF -- Contact: elhadad@bengus.bgu.ac.il cs.columbia.edu: or ftp: black.bgu.ac.il:/pub/fuf/fuf5.2.tar.Z surge.tar.Z Natural language generation system based on Functional Unification Grammars. Includes unifier, large grammar of English (surge) user manual and many examples. Written in Common Lisp. InterBASE -- Contact: Sergei Kuchin ftp: files interbas.exe, interba1.exe, interbas.txt on sics.se:/pub/packet-incoming ftp.uu.net:/tmp clr.nmsu.edu:/incoming debra.dgbt.doc.ca:/pub/incoming Natural language database front end Common Lisp versions of the miniature natural language understanding programs from "Inside Computer Understanding" by Schank and Riesbeck, 1981, are available by anonymous ftp from cs.umd.edu in the directory pub/schank/icu. This includes the SAM and ELI miniatures. It will eventually include copies of the miniature versions of PAM, POLITICS, and Tale-Spin. The FOR macro is also available in this directory, as are a set of functions for manipulating and matching lisp representations of Conceptual Dependency formulas. Contact Bill Andersen for more information. The Link Parser is a highly efficient English parser written by Danny Sleator and Davy Temperley. It uses a novel grammatical formalism known as Link Grammar to represent a robust and diverse collection of English-language phenomena. The system is available by anonymous ftp from spade.pc.cs.cmu.edu in the directory /usr/sleator/public/. Read the README file for more information. The Xerox part-of-speech tagger is available by anonymous ftp from parcftp.xerox.com:pub/tagger/tagger-1-0.tar.Z. It is implemented in Common Lisp and has been tested in Allegro CL 4.1, CMU CL 16e, and Macintosh CL 2.0p2. For more information, contact the authors, Doug Cutting , and Jan Pedersen . The Prolog and DCG programs from Pereira and Shieber's book, "Prolog and Natural Language Analysis", are available by anonymous ftp from das.harvard.edu:pub/shieber/pnla/. See the file README for the conditions under which the material is distributed. If you retrieve the files, please send an email message to the authors letting them know how you plan to use them. For further information, write to Fernando Pereira or Stuart Shieber . Neural Networks: Aspirin/MIGRAINES is a neural network simulator available free from the MITRE Corporation. It contains a neural network simulation code generator which generates high performance C code implementations for backpropagation networks. It runs on the following platforms: Apollo, Convex, Cray, DecStation, HP, IBM RS/6000, Intel 486/386 (Unix System V), NeXT, News, Silicon Graphics Iris, Sun3, Sun4, Mercury i860 (40MHz) Coprocessors, Meiko Computing Surface w/i860 (40MHz) Nodes, Skystation i860 (40MHz) Coprocessors, and iWarp Cells. The software is available by anonymous ftp from the CMU simulator collection on pt.cs.cmu.edu (128.2.254.155) in the directory /afs/cs/project/connect/code (you must cd to this directory in one atomic operation) and UCLA's cognitive science collection on ftp.cognet.ucla.edu (128.97.50.3) in the directory alexis as the file am6.tar.Z. They include many examples in the release, include an implementation of NETtalk. For more information, contact Russell Leighton . MUME (Multi-Module Neural Computing Environment) is a simulation environment for multi-modules neural computing. It provides an object oriented facility for the simulation and training of multiple nets with various architectures and learning algorithms. The object oriented structure makes simple the addition of new network classes and new learning algorithms. _ MUME includes a library of network architectures including feedforward, simple recurrent, and continuously running recurrent neural networks. Each architecture is supported by a variety of learning algorithms, including backprop, weight perturbation, node perturbation, and simulated annealing. MUME can be used for large scale neural network simulations as it provides support for learning in multi-net environments. It also provide pre- and post-processing facilities. MUME can be used to include non-neural computing modules (decision trees, etc.) in applications. _ MUME is being developed at the Machine Intelligence Group at Sydney University Electrical Engineering. The software is written in 'C' and is being used on Sun and DEC workstations. Efforts are underway to port it to the Fujitsu VP2200 vector processor using the VCC vectorising C compiler, HP 9000/700, SGI workstations, DEC Alphas, and PC DOS (with DJGCC). MUME is available to research institutions on a media/doc/postage cost arrangement after signing a license agreement. The license agreement is available by anonymous ftp from 129.78.13.39:/pub/license.ps. An overview of mume is available from the same machine as /pub/mume-overview.ps.Z. It is also available free for MSDOS by anonymous ftp from brutus.ee.su.oz.au:/pub/MUME-0.5-DOS.zip For further information, write to Marwan Jabri, SEDAL, Sydney University Electrical Engineering, NSW 2006 Australia, call +61-2-692-2240, fax +61-2-660-1228, or send email to Marwan Jabri . To be added to the mailing list, send email to mume-request@sedal.su.oz.au. Adaptive Logic Network (ALN) The atree adapative logic network simulation package is available by anonymous ftp from ftp.cs.ualberta.ca [129.128.4.241] in pub/atree/atree2.tar.Z (Unix). The MS-Windows 3.x version for the IBM PC is available as either pub/atree/atre27.exe (includes C/C++ sources) or pub/atree/a27exe.exe (just the executables). The PC version has a lot more documentation than the Unix version. The Unix version has been ported to the Macintosh, Amiga, and other machines. Documentation is in pub/atree/atree2.ps.Z. Also in this directory is a rather impressive OCR demo using atree. To be added to the mailing list, send email to alnl-request@cs.ualberta.ca. For more information, contact William W. Armstrong, . BPS Neural network simulator. Other files of interest. Executables are free; source code for a small fee. gmuvax2.gmu.edu:/pub/nn NeuralShell Availible by anonymous ftp from quanta.eng.ohio-state.edu [128.146.35.1] in the directory pub/NeuralShell/ as the file NeuralShell.tar. CONDELA A neural network definition language. tut.cis.ohio-state.edu:/pub/condela ROCHESTER CONNECTIONIST SIMULATOR Available from cs.rochester.edu:pub/simulator [192.5.53.209]. Includes a backprop package and an X11/SunView interface. UCLA-SFINX retina.cs.ucla.edu:pub/sfinx_v2.0.tar.Z [131.179.16.6] Username sfinxftp, password joshua. Contact sfinx@retina.cs.ucla.edu for more information. XERION A neural network simulator from Drew van Camp at the University of Toronto. It provides a library of routines for building networks and graphically displaying them. Written in C and uses the X window system for graphics. Example simulators include Back Propagation, Recurrent Back Propagation, Boltzmann Machine, Mean Field Theory, Free Energy Manipulation, Kohonnen Net, and Hard and Soft Competitive Learning. Xerion runs on SGI Personal Iris, SGI 4d, Sun3 (SunOS), Sun4 (SunOS). Available by anonymous ftp from ai.toronto.edu:/pub/xerion. See the file /pub/xerion.README for more information. To be added to the mailing list, send mail to xerion-request@ai.toronto.edu. Bugs should be reported to xerion-bugs@ai.toronto.edu. Complaints, suggestions or comments may be sent to xerion@ai.toronto.edu. SNNS (Stuttgart Neural Network Simulator) is a software simulator for neural networks on Unix workstations developed at the Institute for Parallel and Distributed High Performance Systems (IPVR) at the University of Stuttgart. The SNNS simulator contains a simultor kernel written in ANSI C and a 2D/3D graphical user interface running under X11R4/X11R5. It runs under Sun Sparc (SLC, ELC, SS2, GX, GS), DECstation (2100, 3100, 5000/200), IBM RS 6000, HP 9000, and IBM-PC (386/486). SNNS includes the following learning procedures: backpropagation (online, batch, with momentum and flat spot elimin., time delay), counterpropagation, quickprop, backpercolation 1, and generalized radial basis functions (RBF), RProp, recurrent ART1, ART2 and ARTMAP, Cascade Correlation and Recurrent Cascade Correlation, Dynamic LVQ, and Time delay networks (TDNN). (Elman networks and some other network paradigms have already been implemented but are scheduled for a later release.) The SNNS simulator can be obtained via anonymous ftp from ftp.informatik.uni-stuttgart.de:/pub/SNNS/SNNSv2.1.tar.Z [129.69.211.2]. The PostScript version of the user manual can be obtained as file SNNSv2.1.Manual.ps.Z. To be added to the mailing list, send a message to listserv@informatik.uni-stuttgart.de with "subscribe snns " in the message body. Submissions may be sent to snns@informatik.uni-stuttgart.de. For further information, contact Andreas Zell, . NEOCOGNITRON SIMULATOR The Neocognitron Simulator is written in C and is available by anonymous ftp from tamsun.tamu.edu:/pub/neocognitron.Z.tar [128.194.15.32] unix.hensa.ac.uk:/pub/uunet/pub/ai/neural/neocognitron.tar.Z [129.12.21.7] PLANET (aka SunNet) Simulator that runs under X Windows. Written by Yoshiro Miyata of Chukyo University, Japan. Available by anonymous ftp from tutserver.tut.ac.jp:pub/misc/PlaNet5.7.tar.Z [133.15.240.3] boulder.colorado.edu:pub/generic-sources/PlaNet5.7.tar.Z [128.138.240.1] Includes documentation. LVQ_PAK and SOM_PAK LVQ_PAK (Learning Vector Quantization) and SOM_PAK (Self-Organizing Maps) were written by the LVQ/SOM Programming Team of the Helsinki University of Technology, Laboratory of Computer and Information Science, Rakentajanaukio 2 C, SF-02150 Espoo, FINLAND. The PAKs run in Unix and MS-DOS systems. Available by anonymous ftp from cochlea.hut.fi [130.233.168.48] in the directories /pub/lvq_pak/ and /pub/som_pak/. MACTIVATION bruno.cs.colorado.edu:/pub/cs/misc/ [128.138.243.151] as the file Mactivation-3.3.sea.hqx. DartNet A Macintosh-based Neural Network Simulator with a nice graphical interface. Available by anonymous ftp from dartvax.dartmouth.edu:/pub/mac/dartnet.sit.hqx [129.170.16.4] or by email from bharucha@dartmouth.edu. New network architectures and learning algorithms can be added to the system by writing small XCMD-like CODE resources called nDEF's ("Network Definitions"). For more information, send email to Sean P. Nolan, . Probabilistic Reasoning: BELIEF -- ftp.stat.washington.edu (128.95.17.34) Contact: Russell Almond IDEAL -- Contact: srinivas@rpal.rockwell.com Bayesian networks Planning: NONLIN -- cs.umd.edu:/pub/nonlin (128.8.128.8) Contact: nonlin-users-request@cs.umd.edu nonlin-bugs@cs.umd.edu ABTWEAK -- jupiter.drev.dnd.ca:pub/steve/Abtweak Contact: Steven Woods RHETORICAL -- cs.rochester.edu:/pub/knowledge-tools Contact: Brad Miller SNLP -- cs.washington.edu:/pub/snlp.tar.Z Contact: weld@cs.washington.edu Nonlinear planner. IDM -- sauquoit.gsfc.nasa.gov (128.183.101.29) Contact: idm-users@chelmsford.gsfc.nasa.gov STRIPS-like planning. PRODIGY -- Contact: prodigy@cs.cmu.edu Integrated Planning and Learning System SOAR -- ftp.cs.cmu.edu:/afs/cs.cmu.edu/project/soar/5.2/2/public/ Contact: soar-request@cs.cmu.edu Integrated Agent Architecture MATS -- Contact: kautz@research.att.com Temporal constraints Qualitative Reasoning/Qualitative Physics: QSIM -- cs.utexas.edu:/pub/qsim Contact: Ben Kuipers QPE -- multivac.ils.nwu.edu:pub/QPE contact: Prof. Kenneth D. Forbus Qualitative Process Engine (an implementation of QP theory) Robotics (Planning Testbeds and Simulators): TILEWORLD -- cs.washington.edu:new-tileworld.tar.Z Planning testbed The ARS MAGNA abstract robot simular provides an abstract world in which a planner controls a mobile robot. This abstract world is more realistic than typical blocks worlds, in which micro-world simplifying assumptions do not hold. Experiments may be controlled by varying global world parameters, such as perceptual noise, as well as building specific environments in order to exercise particular planner features. The world is also extensible to allow new experimental designs that were not thought of originally. The simulator also includes a simple graphical user-interface which uses the CLX interface to the X window system. ARS MAGNA can be obtained by anonymous ftp from ftp.cs.yale.edu, as ars-magna.tar.Z in the pub/nisp directory. Installation instructions are in the file Installation.readme. The simulator is written in Nisp, a macro-package for Common Lisp. Nisp can be retrieved in the same way as the simulator. Version 1.0 of the ARS MAGNA simulator is documented in Yale Technical Report YALEU/DCS/RR #928, "ARS MAGNA: The Abstract Robot Simulator". This report is available in the distribution as a PostScript file. Comments should be directed to Sean Philip Engelson . Simderella is a robot simulator consisting of three programs: CONNEL (the controller), SIMMEL (the robot simulator), and BEMMEL (the X-windows oriented graphics back-end). SIMMEL performs a few matrix multiplications, based on the Denavit Hartenberg method, calculates velocities with the Newton-Euler scheme, and communicates with the other two programs. BEMMEL only displays the robot. CONNEL is the controller, which must be designed by the user (in the distributed version, CONNEL is a simple inverse kinematics routine.) The programs use Unix sockets for communication, so you must have sockets, but you can run the programs on different machines. The software is available by anonymous ftp from galba.mbfys.kun.nl:pub/neuro-software/pd/ [131.174.82.73] as the file simderella.1.0.tar.Z The software has been compiled using gcc on SunOS running under X11R4/5 on Sun3, Sun4, Sun Sparc 1, 2, and 10, and Silicon Graphics architectures. For more information, send email to Patrick van der Smagt, . The Michigan Intelligent Coordination Experiment (MICE) testbed is a tool for experimenting with coordination between intelligent systems under a variety of conditions. MICE simulates a two-dimensional grid-world in which agents may move, communicate, and affect their environment. MICE is essentially a discrete-event simulator that helps control the domain and a graphical representation, but provides relatively few constraints on the form of the domain and the agents' abilities. Users may specify the time required by various activities, the constraints on an agents' sensors, the configuration of the domain and its properties, etc. MICE runs under XWindows on Un*x boxes, on Macs, and on TI Explorers, with relatively consistent graphical displays. Source code, documentation, and examples are available via anonymous ftp to ftp.eecs.umich.edu:Mice/Mice.tar.Z. MICE was produced by the University of Michigan's Distributed Intelligent Agent Group (UM DIAG). For further information, write to umdiagmice@caen.engin.umich.edu. Simulated Annealing: VFSR (Very Fast Simulated Reannealing) is a powerful global optimization C-code algorithm especially useful for nonlinear and/or stochastic systems. Most current copies usually can be obtained by anonymous ftp from ftp.uu.net:tmp/vfsr.Z. Older versions can be found in the Netlib archive (research.att.com:opt/, logging in as netlib), the Statlib archive (lib.stat.cmu.edu, logging in as statlib), the UMIACS archive (ftp.umiacs.umd.edu:pub/ingber), and the UTSA archive (ringer.cs.utsa.edu:/pub/rosen). The authors have (p)reprints related to VFSR in their archives: Lester Ingber has a review article, sarev.ps.Z, in the UMIACS archive (and on uunet in /tmp), and Bruce Rosen has a comparison study, "Function Optimization based on Advanced Simulated Annealing", which is available in the UTSA archive as the file rosen.advsim.ps.Z. Copies of the code are also available by email from the author, Lester Ingber . Speech: RECNET is a complete speech recognition system for the DARPA TIMIT and Resource Management tasks. It uses recurrent networks to estimate phone probabilities and Markov models to find the most probable sequence of phones or words. The system is a snapshot of evolving research code. There is no documentation other than published research papers. It is configured for the two specific databases and is unlikely to be of use as a complete system for other tasks. It is available by anonymous ftp from svr-ftp.eng.cam.ac.uk:misc/recnet-1.0.tar. Related publications can be found in svr-ftp.eng.cam.ac.uk:reports/ (see the ABSTRACT file first). You will need the relevant CDROMs, 150MByte of free space for TIMIT and 300MByte for RM. If you use the code, the author would appreciate an email message so that he can keep you informed of new releases. Write to Tony Robinson, , for more information. Theorem Proving/Automated Reasoning: Otter -- info.mcs.anl.gov:pub/Otter/Otter-2.2/otter22.tar.Z anagram.mcs.anl.gov:pub/Otter/ Contact: otter@mcs.anl.gov Resolution-based theorem prover. ATP Problems -- anagram.mcs.anl.gov:pub/ATP_Problems/* Collection of ATP problems from Otter, CADE, and JAR. The problems include algebra, analysis, circuits, geometry, logic problems, Pelletier's problem set, program verification, puzzles, set theory, and topology. SETHEO -- flop.informatik.tu-muenchen.de:pub/fki/ [131.159.8.35] Get the files setheo.info and setheo.tar.Z. SETHEO (SEquential THEOrem prover) is an automated theorem prover for formulae of predicate logic. SETHEO is based on the calculus of ``connection tableaux''. SETHEO runs on Sun SPARCs only. Contact: setheo@informatik.tu-muenchen.de Isabelle -- ftp.cl.cam.ac.uk:ml/ [128.232.0.56] ftp.informatik.tu-muenchen.de:lehrstuhl/nipkow/ [131.159.0.110] Relevant files include: intro.dvi.Z "Introduction to Isabelle" ref.dvi.Z "The Isabelle Reference Manual" logics.dvi.Z "Isabelle's Object-Logics" 92.tar.Z Isabelle-92 distribution directory Contact: Larry.Paulson@cl.cam.ac.uk Tobias.Nipkow@informatik.tu-muenchen.de MVL -- t.stanford.edu:/mvl/mvl.tar.Z Contact: ginsberg@t.stanford.edu Multi-valued logics Boyer-Moore -- cli.com:pub/nqthm/nqthm.tar.Z rascal.ics.utexas.edu:/pub/nqthm 128.83.138.20 Contact: kaufman@cli.com DTP -- meta.stanford.edu:/pub/dtp/ [36.8.0.54] Contact: Don Geddis Domain-independent search control of inference. Runs in Allegro and Lucid Common Lisp. Truth Maintenance: The truth maintenance system and problem solver implementations described in the book "Building Problem Solvers" by Ken Forbus and Johan de Kleer are available by anonymous ftp from parcftp.xerox.com:/ftp/pub/bps/. For more information send mail to Johan de Kleer . Miscellaneous: University of Toronto: ftp -- ftp.cs.toronto.edu:/pub/ailist Archives of ailist mailing list, defunct as of January 19, 1990 PAIL (Portable AI Lab) ftp -- pobox.cscs.ch:/pub/ai/pail-2.2/ [148.187.10.13] contact: Mike Rosner and Dean Allemang {dean,mike}@idsia.ch pail-info@idsia.ch CD-ROMS: The Artificial Intelligence CD-ROM (Volume One, 1992) is available from Network Cybernetics Corporation for $129.00 per copy (plus $5 shipping domestic, $10 shipping international). The AI CD-ROM is an ISO-9660 format disk usable on any computer system, and contain a variety of public domain, shareware, and other software of special interest to the AI community. The disk contains source code, executable programs, demonstration versions of commercial programs, tutorials and other files for a variety of operating systems. Among the supported operating systems are MS-DOS, OS/2, Mac, Amiga, and Unix. Among the items included are CLIPS v5.1 and NETS, courtesy of COSMIC, the collected source code from AIExpert magazine from the premier issue in June of 1986 to the present, and complete transcriptions of the first annual Loebner Prize competition, which took place at the Boston Computer Museum. It also includes examples many different kinds of neural networks, genetic algorithms, artificial life simulators, natural language software, public domain and shareware compilers for a wide range of languages such as Lisp, Xlisp, Scheme, XScheme, Smalltalk, Prolog, ICON, SNOBOL, and many others. Complete collections of the Neural Digest, Genetic Algorithms Digest, and Vision List Digest are included. Network Cybernetics Corporation intends to release annual revisions to the AI CD-ROM to keep it up to date with current developments in the field. For more information, write to Network Cybernetics Corporation, 4201 Wingren Road, Suite 202, Irving, Texas 75062-2763, call 214-650-2002, fax 214-650-1929, or send email to ai-cdrom@ncc.com or steve.rainwater@ncc.com (Steve Rainwater). PTF is a semi-annual CD-ROM collection of UNIX-related freeware source code and documentation. PTF in no way modifies the legal restrictions on any package it includes. Each issue consists of two ISO-9660 CD-ROMs, bound into a 50+ page booklet. PTF is particularly useful for programmers who do not have FTP access, but may also be useful as a way of saving disk space and avoiding annoying FTP searches and retrievals. The current issue (2-1; January, 1993) includes, among other things, ICOT collection and several varieties of Lisp and other AI languages. It sells (list) for $60 US plus applicable sales tax and shipping and handling charges. SUG and USENIX members may purchase the issue for $50. Payable through Visa, Mastercard, postal money orders in US funds, and checks in US funds drawn on a US bank. For more information write to Prime Time Freeware, 370 Altair Way, Suite 150, Sunnyvale, CA 94086 call 408-433-9662, fax 408-432-6149, or send email to ptf@cfcl.com. ---------------------------------------------------------------- ;;; *EOF* Xref: rde comp.ai:1812 news.answers:3187 comp.answers:688 Newsgroups: comp.ai,news.answers,comp.answers Path: rde!gator!tarpit!uunet!europa.eng.gtefsd.com!fs7.ece.cmu.edu!crabapple.srv.cs.cmu.edu!mkant From: mkant+@cs.cmu.edu (Mark Kantrowitz) Subject: FAQ: Artificial Intelligence FTP Resources 5/5 [Monthly posting] Message-ID: Followup-To: poster Summary: FTP Resources for AI Sender: news@cs.cmu.edu (Usenet News System) Nntp-Posting-Host: a.gp.cs.cmu.edu Reply-To: mkant+ai-faq@cs.cmu.edu Organization: School of Computer Science, Carnegie Mellon University Date: Thu, 13 May 1993 07:26:13 GMT Approved: news-answers-request@MIT.Edu Expires: Thu, 24 Jun 1993 07:25:35 GMT Lines: 466 Archive-name: ai-faq/part5 Last-Modified: Wed May 12 16:16:47 1993 by Mark Kantrowitz Version: 1.6 ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai-faq-5.text -- 19558 bytes If you think of questions that are appropriate for this FAQ, or would like to improve an answer, please send email to mkant+ai-faq@cs.cmu.edu. Please note that the FTP Resources are now split across parts 4 and 5 of the AI FAQ. Part 5 (FTP Resources): [5-1] AI Bibliographies available by FTP [5-2] AI Technical Reports available by FTP [5-3] Where can I get a machine readable dictionary, thesaurus, and other text corpora? [5-4] List of Smalltalk implementations. Search for [#] to get to question number # quickly. ---------------------------------------------------------------- ~Subject: [5-1] AI Bibliographies available by FTP The Computer Science Department at the University of Saarbruecken, Germany, maintains a large bibliographic database of articles pertaining to the field of Artificial Intelligence. Currently the database contains more than 25,000 references, which can be retrieved by electronic mail from the LIDO mailserver at lido@cs.uni-sb.de. Send a mail message with subject line "lidosearch help info" to get instructions on using the mail server. A variety of queries based on author names, title and year of publication are possible. The references can be provided in BibTeX or Refer formats. The entire bibliographic database can be obtained for a fee by ftp or on tape. Questions may be directed to bib-1@cs.uni-sb.de. A variety of AI-related bibliographies are located on nexus.yorku.ca in the directory /pub/bibliographies. For information on a fairly complete bibliography of computational linguistics and natural language processing work from the 1980s, send mail to clbib@csli.stanford.edu with the subject HELP. Stanford University (SUMEX-AIM) has a large BibTeX bibliography of Artificial Intelligence papers and technical reports. Available by anonymous ftp from aim.stanford.edu:/pub/ai{1,2,3}.bib A BibTeX database of references addressing neuro-fuzzy issues can be obtained by anonymous ftp from ftp.tu-bs.de (134.169.34.15) in the directory local/papers as the (ascii) file fuzzy-nn.bib. Robert Dale's Natural Language Generation (NLG) bibliography is available by anonymous ftp from scott.cogsci.ed.uk [129.215.144.3] in the directory pub/nlg. Note that it is formatted for A4 paper. For further information, write to Robert Dale, University of Edinburgh, Centre for Cognitive Science, 2 Buccleuch Place, Edinburgh EH8 9LW Scotland, or . ---------------------------------------------------------------- ~Subject: [5-2] Technical Reports available by FTP This section lists the anonymous ftp sites for technical reports from several universities and other organizations. Some of the sites provide only an online catalog of technical reports, while the rest make the actual reports available online. The email address listed is that of the appropriate person to contact with questions about ordering technical reports. When ftping compressed .Z files, remember to set the transfer type to binary first, using the command ftp> binary Other general locations for technical reports from several universities include: wuarchive.wustl.edu:/doc/techreports/ [128.252.135.4] cs-archive.uwaterloo.edu:cs-archive (see Index for an index) AKA watdragon.uwaterloo.ca [129.97.140.24] The uwaterloo archive includes tech reports from the Logic Programming and Artificial Intelligence Group (LPAIG) of the University of Waterloo. The newsgroup comp.doc.techreports is devoted to distributing lists of tech reports and their abstracts. MIT Artificial Intelligence Laboratory: ftp -- ftp.ai.mit.edu:ai-pub/{bibliography,general-info,publications} email -- publications@ai.mit.edu browse -- telnet reading-room.lcs.mit.edu A full catalog of MIT AI Lab technical reports (and a listing of recent updates) may be obtained from the above location, by writing to Publications, Room NE43-818, M.I.T. Artificial Intelligence Laboratory, 545 Technology Square, Cambridge, MA 02139, USA, or by calling 1-617-253-6773. The catalog lists the technical reports ("AI Memos") with a short abstract and their current prices. There is also a charge for shipping. Some recent tech reports are available in the publications/ subdirectory; older technical reports are NOT available by ftp. Sandiway Fong's 1991 PhD thesis, ``The Computational Properties of Principle-Based Grammatical Theories,'' may be found in the directory pub/sandiway/. CMU School of Computer Science: ftp -- reports.adm.cs.cmu.edu email -- Technical.Reports@cs.cmu.edu CMU Software Engineering Institute: ftp -- ftp.sei.cmu.edu:/pub/documents email -- bjz@sei.cmu.edu Yale: ftp -- dept.cs.yale.edu:/pub/TR/ University of Washington CSE Tech Reports: ftp -- june.cs.washington.edu:/tr email -- tr-request@cs.washington.edu ================ AT&T Bell Laboratories: ftp -- research.att.com:/netlib/research/cstr bib.Z contains short bibliography, including all the technical reports contained in this directory. ftp -- research.att.com:/dist/ai Argonne National Laboratory: ftp -- anagram.mcs.anl.gov:pub/tech_reports email -- wright@mcs.anl.gov Contains MCS Division preprints and technical memoranda, available as either .dvi or .ps files. For descriptions of the contents, see the subdirectory pub/tech_reports/abstracts; for the files themselves see the subdirectory pub/tech_reports/reports. Boston University: ftp -- cs.bu.edu:techreports/ email -- techreports@cs.bu.edu Brown University: ftp -- wilma.cs.brown.edu:techreports/ email -- techreports@cs.brown.edu Columbia University: ftp -- cs.columbia.edu:/pub/reports email -- tech-reports@cs.columbia.edu DEC Cambridge Research Lab: ftp -- crl.dec.com:/pub/DEC/CRL/{abstracts,tech-reports} DEC Paris Research Lab: email -- doc-server@prl.dec.com Put commands in Subject: line of the message. To get a list of articles, use send index articles To get a list of tech reports, use send index reports DEC WRL: email -- wrl-techreports@decwrl.dec.com To get a helpfile, send a message with help in the subject line. DFKI: ftp -- duck.dfki.uni-sb.de:/pub/papers email -- Martin Henz (henz@dfki.uni-sb.de) Duke University: ftp -- cs.duke.edu:/dist/{papers,theses} email -- techreport@cs.duke.edu Edinburgh: A list of available reports can be sent via email. Send requests for information about reports from the Center for Cognitive Science to cogsci%ed.ac.uk@nsfnet-relay.ac.uk, and from the Human Communication Research Center to HCRC%ed.ac.uk@nsfnet-relay.ac.uk. Electrotechnical Laboratory, Japan: Reports from the Cooperative Architecture project (half AI, half software engineering). ftp -- etlport.etl.go.jp:pub/kyocho/Papers [192.31.197.99] See file Index.English. email -- Hideyuki Nakashima . Georgia Tech College of Computing, AI Group: ftp -- ftp.cc.gatech.edu:pub/ai (130.207.3.245) email -- Professor Ashwin Ram Illinois: email -- Erna Amerman Illinois Genetic Algorithms Laboratory (IlliGAL): email -- Eric Thompson phone -- 217-333-2346 (9AM to 5PM CT, M-F) mail -- Illinois Genetic Algorithms Laboratory Department of General Engineering 117 Transportation Building 104 South Mathews Avenue Urbana, IL 61801-2996 ftp -- coming soon. Indiana: ftp -- cogsci.indiana.edu:pub [129.79.238.12] ftp -- cs.indiana.edu:pub/techreports [129.79.254.191] Institute for Learning Sciences at Northwestern University: ftp -- aristotle.ils.nwu.edu:/pub/papers/ New York University (NYU): ftp -- cs.nyu.edu:/pub/tech-reports OGI: ftp -- cse.ogi.edu:/pub/tech-reports email -- csedept@cse.ogi.edu Ohio State University, Laboratory for AI Research ftp -- nervous.cis.ohio-state.edu:/pub/papers email -- lair-librarian@cis.ohio-state.edu OSU Neuroprose: ftp -- archive.cis.ohio-state.edu:/pub/neuroprose (128.146.8.52) This directory contains technical reports as a public service to the connectionist and neural network scientific community which has an organized mailing list (for info: connectionists-request@cs.cmu.edu) Includes several bibliographies. Stanford: ftp -- elib.stanford.edu:/cs Very spotty collection. SUNY Buffalo: ftp -- ftp.cs.buffalo.edu:/pub/tech-reports/ SUNY at Stony Brook: ftp -- sbcs.sunysb.edu:/pub/TechReports email -- rick@cs.sunysb.edu or stark@cs.sunysb.edu The /pub/sunysb directory contains the SB-Prolog implementation of the Prolog language. Contact warren@sbcs.sunysb.edu for more information. TCGA (The Clearinghouse for Genetic Algorithms): email -- Robert Elliott Smith Department of Engineering of Mechanics Room 210 Hardaway Hall The University of Alabama PO Box 870278 Tuscaloosa, AL 35487 205-348-1618, fax 205-348-6419 Thinking Machines: ftp -- ftp.think.com:think/techreport.list This file contains a list of Thinking Machines technical reports. Orders may be placed by email (limit 5) to t-rex@think.com, or by US Mail to Thinking Machines Corporation, Attn: Technical reports, 245 First Street, Cambridge, MA 01241. In addition, the directories cm/starlisp and cm/starlogo contain code for the *Lisp and *Logo simulators. Tulane University: ftp -- rex.cs.tulane.edu:pub/tech/ [129.81.132.1] University of Arizona: ftp -- cs.arizona.edu:reports/ email -- tr_libr@cs.arizona.edu The directory /japan/kahaner.reports contains reports on AI in Japan, among other things, written by Dr. David Kahaner, a numerical analyst on sabbatical to the Office of Naval Research-Asia (ONR Asia) in Tokyo from NIST. The reports are not written in any sort of official capacity, but are quite interesting. University of California/Santa Cruz: ftp -- ftp.cse.ucsc.edu:/pub/{bib,tr} email -- jean@cs.ucsc.edu University of Colorado: ftp -- ftp.cs.colorado.edu:/pub/cs/techreports University of Florida: ftp -- bikini.cis.ufl.edu:/cis/tech-reports University of Illinois at Urbana: ftp -- a.cs.uiuc.edu:/pub/dcs email -- erna@a.cs.uiuc.edu University of Indiana, Center for Research on Concepts and Cognition: ftp -- cogsci.indiana.edu:pub/ email -- helga@cogsci.indiana.edu University of Kaiserslautern, Germany: ftp -- ftp.uni-kl.de:reports_uni-kl/computer_science/ University of Kentucky: ftp -- ftp.ms.uky.edu:ftp/pub/tech-reports/UK/cs/ University of Massachusetts at Amherst: email -- techrept@cs.umass.edu University of Michigan: ftp -- ftp.eecs.umich.edu:/techreports University of North Carolina: ftp -- ftp.cs.unc.edu:/pub/technical-reports/ University of Pennsylvania: ftp -- ftp.cis.upenn.edu:/pub/papers/ email -- publications@upenn.edu USC/Information Sciences Institute: email -- Sheila Coyazo is the contact. University of Toronto: ftp -- ftp.cs.toronto.edu:/pub/reports email -- tech-reports@cs.toronto.edu University of Virginia: ftp -- uvacs.cs.virginia.edu:/pub/techreports/cs University of Wisconsin: ftp -- ftp.cs.wisc.edu:/tech-reports email -- tech-reports-archive@cs.wisc.edu Some AI authors have set up repositories of their own papers: Matthew Ginsberg: t.stanford.edu:/u/ftp/papers ---------------------------------------------------------------- ~Subject: [5-3] Where can I get a machine readable dictionary, thesaurus, and other text corpora? Free: Roget's 1911 Thesaurus is available by anonymous FTP from the Consortium for Lexical Research (clr.nmsu.edu, [128.123.1.12]). The pathname is /pub/lexica/thesauri/roget-1911. It is also available from src.doc.ic.ac.uk:/literary/collections/project_gutenberg/roget11.txt.Z An old Webster's dictionary is in /text/dict/{DICT.Z,DICT.INDEX.Z}. Project Gutenberg also has Roget's 1911 Thesaurus. The Project Gutenberg archive is at mrcnext.cso.uiuc.edu. For more information, write to Michael S. Hart, Professor of Electronic Text, Executive Director of Project Gutenberg Etext, Illinois Benedictine College, Lisle, IL 60532 or send email to hart@vmd.cso.uiuc.edu. For people without FTP, Austin Code Works sells floppy disks containing Roget's 1911 Thesaurus for $40.00. This money helps support the production of other useful texts, such as the 1913 Webster's dictionary. The Online Book Initiative maintains a text repository on world.std.com (a public access UNIX system, 617-739-WRLD). See the README file on obi.std.com:/obi/. For more information, send email to obi@world.std.com, write to Software Tool & Die, 1330 Beacon Street, Brookline, MA 02146, or call 617-739-0202. The CHILDES project at Carnegie Mellon University has a lot of data of children speaking to adults, as well as the adult written and adult spoken corpora from the CORNELL project. Contact Brian MacWhinney for more information. The Association for Computational Linguistics (ACL) has a Data Collection Initiative. For more information, contact Donald Walker at Bellcore, walker@flash.bellcore.com. Two lists of common female first names (4967 names) and male first names (2924 names) are available for anonymous ftp from ftp.cs.cmu.edu in the directory /afs/cs.cmu.edu/user/mkant/Public/Corpii/Names/. Read the file README first. [Note that you must cd to this directory in one atomic operation, as superior directories are protected during an anonymous ftp.] Send mail to mkant@cs.cmu.edu for more information. A list of 110,000 English words (one per line, in ASCII) is available in the PD1: directory on SIMTEL20 as the files WORDS1.ZIP, WORDS2.ZIP, WORDS3.ZIP, and WORDS4.ZIP. Although the list is in MS-DOS files, it can easily be used on other machines (but first you'll have to unzip the files on a DOS machine). The list includes inflected forms of the words, such as plural nouns and the -s, -ed, and -ing forms of verbs; thus the number of lexical stems in the list is considerably smaller than the total number of word forms. These files are available via FTP from WSMR-SIMTEL20.ARMY.MIL [192.88.110.20]. SIMTEL20 files are mirrored on wuarchive.wustl.edu. The Collins English Dictionary encoded as a Prolog fact base is available from the Oxford Text Archive by anonymous ftp from black.ox.ac.uk:ota/dicts/1192/ [129.67.1.165] The Oxford Text Archive includes many other texts, dictionaries, thesauri, word lists, and so on, most of which are available for scholarly use and research only. See the files black.ox.ac.uk:ota/textarchive.{form,info,list,sgml} for more information, or write to archive@ox.ac.uk, Oxford Text Archive, Oxford University Computing Services, 13 Banbury Road, Oxford OX2 6NN, UK, call 44-865-273238 or fax 44-865-273275. Chuck Wooters has extracted the most likely pronunciation for each of about 6100 words in the hand-labeled TIMIT database, and made them available by anonymous ftp from ftp.icsi.berkeley.edu:pub/speech/TIMIT.mostlikely.Z. Commercial: Illumind publishes the Moby Thesaurus (25,000 roots/1.2 million synonyms), Moby Words (560,000 entries), Moby Hyphenator (155,000 entries), and the Moby Part-of-Speech (214,000 entries) and Moby Pronunciator (167,000 entries with IPA encoding, syllabification, and primary, secondary, and tertiary stress marks) lexical databases. All databases are supplied in pure ASCII, royalty-free, in both Macintosh and MS-DOS disk formats (also in .Z file formats). Both commercial (to resell derived structures as part of commercial applications) and educational/research licenses are available. For more information, write to Illumind, Attn: Grady Ward, 3449 Martha Court, Arcata, CA 95521, call 707-826-7715, or send email to grady@netcom.com. The Oxford Text Archive has hundreds of online texts in a wide variety of languages, including a few dictionaries (the OED, Collins, etc.). The Lancaster-Oslo-Bergen (LOB), Brown, and London-Lund corpii are also available from them. For more information, write to Oxford Electronic Publishing, Oxford University Press, 200 Madison Avenue, New York, NY 10016, call 212-889-0206, or send mail to archive@vax.oxford.ac.uk. (Their contact information in England is Oxford Text Archive, Oxford University Computing Service, 13 Banbury Road, Oxford OX2 6NN, UK, +44 (865) 273238.) Mailing Lists: CORPORA is a mailing list for Text Corpora. It welcomes information and questions about text corpora such as availability, aspects of compiling and using corpora, software, tagging, parsing, and bibliography. To be added to the list, send a message to corpora-request@x400.hd.uib.no. Contributions should be sent to corpora@x400.hd.uib.no. Linguistic Data Consortium: The Linguistic Data Consortium was established to broaden the collection and distribution of speech and natural language data bases for the purposes of research and technology development in automatic speech recognition, natural language processing, and other areas where large amounts of linguistic data are needed. Information about the LDC is available by anonymous ftp from ftp.cis.upenn.edu:/pub/ldc [130.91.6.8]. Documents available in this directory include a paper on the background, rationale and goals of the LDC, a brief list of available data bases, and some tables summarizing these corpora. For further information, contact Elizabeth Hodas, , Mark Liberman , or Jack Godfrey . ---------------------------------------------------------------- ~Subject: [5-4] List of Smalltalk implementations. Little Smalltalk -- Tim Budd's version of Smalltalk cs.orst.edu: /pub/budd/small.v3.tar GNU Smalltalk prep.ai.mit.edu:/pub/gnu/smalltalk-1.1.1.tar.Z ---------------------------------------------------------------- ;;; *EOF*