nl-kr-request@cs.rpi.edu (NL-KR Moderator Chris Welty) (11/17/90)
NL-KR Digest (Fri Nov 16 12:45:08 1990) Volume 7 No. 24 Today's Topics: CALL FOR PAPERS - Applications of Informatics Cuny Sentence Processing Conference Announcement ASL/LSA conference on logic and linguistics KnowledgePro MAILSERVER FOR AI LITERATURE Submissions: nl-kr@cs.rpi.edu Requests, policy: nl-kr-request@cs.rpi.edu Back issues are available from host archive.cs.rpi.edu [128.213.5.17] 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. 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. ----------------------------------------------------------------- To: nl-kr@cs.rpi.edu Date: Fri, 09 Nov 90 12:44:01 CST >From: "Centro de Inteligencia Artificial(ITESM)" <ISAI@TECMTYVM.MTY.ITESM.MX> Subject: CALL FOR PAPERS - Applications of Informatics INTERNATIONAL SYMPOSIUM ON ARTIFICIAL INTELLIGENCE APPLICATIONS IN INFORMATICS: Software Engineering, Data Base Systems, Computer Networks, Programming Environments, Management Information Systems, Decision Support Systems. C A L L F O R P A P E R S Preliminary Version. The Fourth International Sysmposium on Artificial Intelligence will be held in Cancun Mexico on November 13-15, 1991. The Symposium is sponsored by the ITESM (Instituto Tecnologico y de Estudios Superiores de Monterrey) in cooperation with the International Joint Conferences on Artificial Intelligence Inc., the American Association for Artificial Intelligence, the Canadian Society for Computational Studies of Intelligence, the Sociedad Mexicana de Inteligencia Artificial and IBM of Mexico. Papers from all countries are sought that: (1) Present applications of artificial intelligence technology to the solution of problems in Software Engineering, Data Base Systems, Computer Networks, Programming Environments, Management Information Systems, Decision Support Systems and other Informatics technologies; and (2) Describe research on techniques to accomplish such applications, (3) Address the problem of transfering the AI Technology in different socio-economic contexts and environments. Areas of application include but are no limited to: Software development, software design, software testing and validation, computer-aided software engineering, programming environments, structured techniques, intelligent databases, operating systems, intelligent compilers, local networks, computer network design, satellite and telecommunications, MIS and data processing applications, intelligent decision support systems. AI techniques include but are not limited to: Expert systems, knowledge acquisition and representation, natural language processing, computer vision, neural networks and genetic algorithms, automated learning, automated reasoning, search and problem solving, knowledge engineering tools and methodologies. Persons wishing to submit a paper should send five copies written in English to: Hugo Terashima, Program Chair Centro de Inteligencia Artificial, ITESM. Ave. Eugenio Garza Sada 2501, Col.Tecnologico C.P. 64849 Monterrey, N.L. Mexico Tel.(52-83) 58-2000 Ext.5134 Telefax (52-83) 58-1400 Dial Ext.5143 or 58-2000 Ask Ext.5143 Net address: ISAI@tecmtyvm.bitnet or ISAI@tecmtyvm.mty.itesm.mx The paper should identify the area and technique to which it belongs. Extended abstract is not required. Use a serif type font, size 10, sigle-spaced with a maximum of 10 pages. No papers will be accepted by electronic means. Important dates: Papers must be received by April 30,1991. Authors will be notified of acceptance or rejection by June 15,1991. A final copy of each accepted paper, camera ready for inclusion in the Symposium proceedings, will be due by July 15,1991. ======================================================================= ------------------------------ To: nl-kr@cs.rpi.edu Date: Fri, 9 Nov 90 15:25:06 EST >From: Lynn Hofsass <hofsass@prodigal.psych.rochester.edu> Subject: Cuny Sentence Processing Conference Announcement y t i s PREREGISTER TODAY! r e y v k t i w r i n of e o C U N Y SENTENCE PROCESSING CONFERENCE e p e o n s w r t t k r a a t l e PRELIMINARY ANNOUNCEMENT The annual Cuny sentence processing conference will take place this year at the University of Rochester, May 9 - 12th. We plan to send out several more announcements. If you do not wish to get more messages, contact Hofsass@prodigal.psych.rochester.edu. If it is likely that you will attend the conference, please contact us now at the same address. The exact schedule depends on some funding decisions which are pending: you will receive a final schedule as soon as possible. We are hoping to avoid sunday meetings, but that will depend on how we fare with grant proposals. We plan for two kinds of sessions, normal presentation of papers, and special didactic symposia: each symposium will have a main presenter and several commentators. The basic schedule we hope for is: Thursday early afternoon - Japanese psycholinguistics (invited speakers) late afternoon - Symposium on semantics and psychology of conditionals (invited speakers) evening - Symposium on new kinds of connectionism and language (invited speakers) Friday early morning - Paper session late morning - Symposium on second language learning (invited speakers) early afternoon - Paper session late afternoon - Symposium on psycholinguistic methodologies (invited speakers) evening - barbecue and poster session Saturday early morning - Paper session late morning - Paper session early afternoon - Symposium on lexical concepts in and out of sentences (invited speakers) late afternoon - Paper session evening - Banquet and special talk SUBMITTED PAPERS AND POSTERS Some of the session papers will be given by invited speakers. In addition, we will accept for presentation a number of papers based on submitted abstracts. We will consider any topics related to sentence processing with some attention to grouping them when possible. We urge graduate students and researchers who have not presented papers before to send in abstracts. We also would like to expand the importance of the poster session. We urge not only students but also senior researchers to submit posters. Send all abstracts to: Michael Tanenhaus, Dept. of Psychology, University of Rochester, Rochester, NY, 14627, Mtan@prodigal.psych.rochester.edu. Please submit your abstract via email, or with an accompanying computer disk copy in a neutral format; this will facilitate dissemination of accepted abstracts before the conference. Please indicate whether you would like to present your paper as a poster if there is not time for it as a paper. The review panel will include Chuck Clifton, Janet Fodor, Jay McClelland, Lissa Newport, Mark Steedman and Mike Tanenhaus. THE DEADLINE FOR RECEIPT OF ABSTRACTS IS Feb 15, 1991. FINANCES As always, the conference depends a good deal on the ability of speakers to provide for their own transportation and local costs. We will attempt to pay the costs when this is not possible. Our greatest emphasis is on supporting students by arranging free local housing and paying their travel. There will be a modest registration fee to cover some local costs such as coffee and meals. The next message from us will include a preregistration form. STUDENT FELLOWSHIPS We have secured funds to contribute towards the travel and local expenses of a number of graduate students. Students giving papers or posters will be given priority in the award of these fellowships. Applications should be sent to Tom Bever, Bever@prodigal.psych.rochester.edu, to be received by March 1. TRAVEL AND ACCOMMODATIONS We have secured a conference rate arrangement with Usair, dependent on at least 20 round trips being booked. To ensure this, we request that those of you who know now that you wish to travel here by air, please contact Hofsass@prodigal.psych.rochester.edu, so we can compile a list. With current high airfares, this kind of approach is necessary. If enough participants are interested, we may arrange for vans to drive groups from Boston and New York (about 7 hour's drive in each case). We will attempt to house faculty with us personally, where possible and desired; in addition, there are a number of houses and apartments where visiting graduate students can crash. We have booked a block of rooms at a nearby hotel, The Luxury Budget Inn, at a moderate price ($43 per room, single or double occupancy). Fancier hotels are available. We will provide local transportation to and from the airport. We will make arrangements for meals. For information and reservations for local housing contact hofsass@prodigal.psych.rochester.edu LET US KNOW NOW IF YOU THINK YOU WILL ATTEND! It will help us a great deal to get a general idea of how many people plan to attend the conference. We would appreciate an email note from you right now if you think the chances are reasonably good that you will attend the conference. Send email to: Hofsass@prodigal.psych.rochester.edu; 716-275-2469 PLEASE FORWARD THIS NOTICE TO ALL POTENTIALLY INTERESTED PEOPLE ------------------------------ To: nl-kr@cs.rpi.edu Date: Tue, 13 Nov 90 09:24 MST >From: OEHRLE@ccit.arizona.edu Subject: ASL/LSA conference on logic and linguistics PRELIMINARY ANNOUNCEMENT AND CALL FOR PAPERS ASL/LSA CONFERENCE ON LOGIC AND LINGUISTICS to be held at University of California at Santa Cruz July 20-21, 1991 in conjunction with the 1991 LSA Linguistic Institute sponsored by The Association for Symbolic Logic and The Linguistic Society of America with a special session on `Compositionality and the Dynamics of Anaphora' Abstracts are invited for papers which deal with problems on the border between logic and linguistics, including (but not limited to) the logical analysis of natural languages, artificial languages, and linguistic formalisms; the application of model-theoretic and proof-theoretic techniques to natural language problems. Papers will be allotted 30 minutes for presentation and 10 minutes for discussion. The Program Committee consists of Jon Barwise, William Ladusaw, Alice ter Meulen, Richard Oehrle, and Rich Thomason. Abstracts should be not more than one page in length and should indicate the paper's title; its author's name, affiliation, and e-mail and postal addresses; and whether or not the paper is to be considered for inclusion in the special session `Compositionality and Dynamic Theories of Anaphora'. Abstracts should be submitted by April 1, 1991 either via e-mail to oehrle@ccit.arizona.edu or to Richard Oehrle, Department of Linguistics, Douglass 200E, University of Arizona, Tucson, AZ 85721. Submission via e-mail is strongly encouraged. Notification of acceptance will be mailed May 1, 1991. supported by a grant from IBM ************************************************************************** \documentstyle{article} \setlength{\textwidth}{5.50in} \setlength{\oddsidemargin}{.50in} \begin{document} \begin{center} \rule{1in}{.01in}please post\rule{1in}{.01in}\\ \bigskip {\large PRELIMINARY ANNOUNCEMENT AND CALL FOR PAPERS}\\ \bigskip \bigskip {\large \bf ASL/LSA} \\ \medskip {\Large \bf CONFERENCE ON LOGIC AND LINGUISTICS}\\ \medskip to be held at \\ University of California at Santa Cruz \\ July 20-21, 1991 \\ in conjunction with the \\ 1991 LSA Linguistic Institute \\ \medskip sponsored by \\ The Association for Symbolic Logic \\ and \\ The Linguistic Society of America \\ \medskip with a special session on \\ \smallskip {\bf Compositionality and the Dynamics of Anaphora} \end{center} \noindent Abstracts are invited for papers which deal with problems on the border between logic and linguistics, including (but not limited to) the logical analysis of natural languages, artificial languages, and linguistic formalisms; the application of model-theoretic and proof-theoretic techniques to natural language problems. Papers will be allotted 30 minutes for presentation and 10 minutes for discussion. The Program Committee consists of Jon Barwise, William Ladusaw, Alice ter Meulen, Richard Oehrle, and Richmond Thomason. Abstracts should be not more than one page in length and should indicate the paper's title; its author's name, affiliation, and e-mail and postal addresses; and whether or not the paper is to be considered for inclusion in the special session `Compositionality and Dynamic Theories of Anaphora'. Abstracts should be submitted by April 1, 1991 either via e-mail to oehrle@ccit.arizona.edu or to Richard Oehrle, Department of Linguistics, Douglass 200E, University of Arizona, Tucson, AZ 85721. Submission via e-mail is strongly encouraged. Notification of acceptance will be mailed May 1, 1991. \medskip \begin{center}supported by a grant from IBM\end{center} \end{document} ------------------------------ To: nl-kr@cs.rpi.edu Date: Thu, 15 Nov 90 16:34 EST >From: <S_RICHMOND%UTOROISE.BITNET@VM.ECS.RPI.EDU> Subject: KnowledgePro Original_To: JNET%"nl-kr@rpiecs" Original_Cc: S_RICHMOND I would appreciate comments about experience using the hypertext/expert language "KnowledgePro" by Knowledge Garden, Inc. Thanks. Sheldon Richmond S_RICHMOND@UTOROISE.BITNET ------------------------------ To: nl-kr@cs.rpi.edu >From: "Alfred Kobsa" <ak@cs.uni-sb.de> Date: Tue, 6 Nov 90 13:23:49 +0100 Subject: MAILSERVER FOR AI LITERATURE THE LIDO MAILSERVER FOR AI LITERATURE Version 2.0 A mail server has been developed at the Computer Science Department of the University of Saarbruecken which accesses a large database of bibliographic data of articles pertaining to the field of Artificial Intelligence. At the moment, this database contains more than 13.000 articles, which can be retrieved via electronic mail. The result will be returned either in LaTeX (Bibtex) format or in a Refer-like format. This mail server is a "by-product" of the bibliographic information system LIDO which is currently under development at the University of Saarbruecken. The following people are involved in this project: Coordination: Alfred Kobsa Hacker: Monika Klar Alfred Kobsa Peter Schwarz Wizards: Gerd Herzog Clemens Huwig Mail-Freak: Roman Jansen-Winkeln Data Input: Christa Weinen Gisela Veit The LIDO MAILSERVER is partly based on the UNIX refer system. Queries to the bibliographic database are restricted to the names of the author(s), the title, and the year of publication. Users may select between full word search (fast, since index-based; hence prioritized processing) and substring search with optional regular expressions. Global search with key words is *not* possible. Users who already have a certain overview of a field will thus probably profit more from the LIDO MAILSERVER than novices familiarizing themselves with a new area. In order to keep the network and computer workload tolerable and to control erroneous queries, certain security limits have been introduced: 1. Not more than 150 articles may be retrieved per query, and not more than 500 per message. 2. Queries with the option `nosubstring' are handled with priority. Since LIDO is still under development, it cannot be distributed yet. However, the bibliographic data (3 MB at the moment) may be obtained on a license basis for a fee of U.S.$ 75.00-300.00 via ftp or on tape. Please understand that it is not possible for us to lend out or to copy articles which you retrieve in the bibliographic databases. If you find an error, please send a note to bib-1@cs.uni-sb.de. Messages to the LIDO MAILSERVER should be sent to lido@cs.uni-sb.de and should have the following format: a) Subject field: - First the key word `lidosearch'. - Then the desired format of the bibliographic data in the return message: `latex' (= Bibtex format) or `nolatex' (= refer-like format). The default is `nolatex'. - Then the form of retrieval: a) `nosubstring': Your search patterns (see below) must be full words. Your message will be handled with priority. b) `substring' (default): Your search patterns may be substrings. Regular expressions in the egrep notation (see Appendix) may be used as well. Plural forms and spelling variants can thereby be accounted for. - Then the language that should be used for comments and error messages in the return message: `english' or `deutsch' (default). b) Body of the Message: Each line of the body of the message contains one or more search patterns which may refer to the names of the authors, to words in the title, or to the year of publication. If a line contains more than one search pattern, only those articles are retrieved which match *all* patterns. German umlauts and the `scharfes s' should be transliterated as follows: A", O", U", a", o", u", s" Example 1: - -------- mail lido@cs.uni-sb.de Subject: lidosearch latex nosubstring english wahlster generation kobsa models 1989 This message contains three different queries. In the first case, all articles are retrieved which contain the word `wahlster' as an author's name or as a word in the title. In the second case, the same applies to `generation'. In the third case, all articles are retrieved which contain both `kobsa' and `model' and 1985 (but not `models', since `nosubstring' was selected). The message will be handled with priority since `nosubstring' was chosen. The references in the return message will be in LaTeX (Bibtex) format, and error messages and comments will be in English. Example 2: - -------- mail lido@cs.uni-sb.de Subject: lidosearch latex substring english kobs natu"rlichspr This message contains a single query only. All articles will be retrieved which contain both the substring `kobs' (like in `Kobsa' or `Jakobson') and the substring `natu"rlichspr'. The return message will come in LaTeX format, and error messages and comments will be in English. Example 3: - -------- mail lido@cs.uni-sb.de Subject: lidosearch substring english morpholog(y|ie) modell?ing modell*ing model+ing ja[ck]obson \<kobs This message contains 6 queries which will yield articles containing the following strings in the titles or authors' names (the output will come in a refer-like format, and the comments will be in English): Query 1: `morphology' or `morphologie' (German spelling) Query 2: `modeling' or `modelling' Query 3+4: `modeling', `modelling', `modellling', etc. Query 5: `jacobson' or `jakobson' Query 6: `kobs' at the beginning of a word (thus articles of Kobsa but not of Jakobson are found). Summary: mail lido@cs.uni-sb.de Subject: lidosearch [help][info] Sends this message {[latex][nolatex]} Default: nolatex {[substring][nosubstring]} Default: substring {[english][deutsch]} Default: deutsch Body of message: Query pattern(s) of first query Query pattern(s) of second query : : Bugs: Very long words are truncated by the refer program which underlies the 'nosubstring' mode of LIDO. Theoretically it could therefore happen that additional undesired articles are retrieved by the LIDO MAILSERVER in this mode when long patterns are employed. Good luck with your bibliographic search with LIDO! - ------------------------------------------------------------------------------ REGULAR EXPRESSIONS (egrep) (explanation) _c a single (non-meta) character matches itself. . matches any single character except newline. ? postfix operator; preceeding item is optional. * postfix operator; preceeding item 0 or more times. + postfix operator; preceeding item 1 or more times. | infix operator; matches either argument. \< matches the empty string at the beginning of a word. \> matches the empty string at the end of a word. [_c_h_a_r_s] match any character in the given class; if the first character after [ is ^, match any character not in the given class; a range of characters may be specified by _f_i_r_s_t-_l_a_s_t; for example, \W (below) is equivalent to the class [^A-Za-z0-9] ( ) parentheses are used to override operator precedence. \_d_i_g_i_t \_n matches a repeat of the text matched earlier in the regexp by the subexpression inside the nth opening parenthesis. \ any special character may be preceded by abackslash to match it literally. (the following are for compatibility with GNU Emacs) \b matches the empty string at the edge of a word. \B matches the empty string if not at the edge of a word. \w matches word-constituent characters (letters & digits). \W matches characters that are not word-constituent. Operator precedence is (highest to lowest) ?, *, and +, con- catenation, and finally |. All other constructs are syntac- tically identical to normal characters. For the truly interested, the file dfa.c describes (and implements) the exact grammar understood by the parser. ------------------------------ End of NL-KR Digest *******************