[Past issues of the newsletter are available at http://www.bell-labs.com/topic/conferences/lics/] NEW URL FOR THE ASSOCIATION FOR SYMBOLIC LOGIC http://www.aslonline.org/ ACM SIGACT-SIGMOD-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS'99) Call for papers May 31 - June 2, 1999, Philadelphia, PA http://www.research.att.com/conf/sigmod99/ * The symposium will focus on new developments in the fundamental aspects of databases. It will be held jointly with the ACM SIGMOD International Conference on Management of Data. * Topics. Access methods and physical design, active databases, complexity and performance evaluation, concurrency control, constraint databases, data integration and interoperability, data mining, data models, database programming languages, database updates, databases on Internet and Intranet, deductive databases and knowledge bases, distributed databases, heterogeneous databases, integrity and security, logic in databases, multimedia databases, object-oriented databases, OLAP, query languages, real-time databases, semi-structured data, spatial and temporal databases, transaction management, views and warehousing. * Submission. Hardcopy or electronic submissions are acceptable. Electronic submissions are encouraged. See http://sigact.csci.unt.edu/~pods99/PODS99.html for instructions. It is also possible to send 16 copies of an extended abstract by the the deadline of November 16, 1998 to: Christos Papadimitriou, Computer Science Division, Soda Hall, University of California Berkeley, California 94720 USA. The firm deadline is November 16, 1998. * Program committee. Serge Abiteboul, Catriel Beeri, Sophie Cluet, Gosta Grahne, Joe Hellerstein, Yannis Ioannidis, Alon Levy, Udi Manber, Heikki Mannila, Alberto Mendelzon, Christos Papadimitriou (chair), Prabhakar Raghavan, Jeff Ullman, Limsoon Wong, Mihalis Yannakakis. * Further information. E-mail christos@cs.berkeley.edu, or see the URL above. ANNUAL CONFERENCE OF THE EUROPEAN ASSOCIATION FOR COMPUTER SCIENCE LOGIC (CSL'99) September 20-25, 1999, Madrid, Spain Call for papers http://mozart.sip.ucm.es:1580/csl99 * Topics. abstract datatypes, automated deduction, categorical and topological approaches, concurrency theory, constructive mathematics, database theory, domain theory, finite model theory, lambda and combinatory calculi, logical aspects of computational complexity, logical foundations of programming paradigms, linear logic, modal and temporal logics, model checking, program logics and semantics, program specification, transformation and verification, rewriting, symbolic computation. * Program committee Samson Abramsky, Marc Bezem, Peter Clote, Hubert Comon, Jorg Flum, Harald Ganzinger, Neil Immerman, Neil Jones, Jan Maluszynski, Michael Maher, Catuscia Palamidessi, Mario Rodriguez-Artalejo, Wolfgang Thomas, Jerzy Tiuryn, Glynn Winskel, Martin Wirsing. * Invited speakers. Jose Luis Balcazar, Javier Esparza, Martin Grohe, Peter D. Mosses, Victor Vianu. * Tutorials. Douglas Howe, Aart Middeldorp. * Submission. Submissions, not exceeding 15 pages, must arrive by March 19, 1999. Authors are invited to send manuscripts by electronic mail, as uuencoded gzipped postscript files. See the URL for instructions. * Publication. Papers accepted by the Program Committee must be presented at the conference and will appear in a proceedings volume, to be published by Springer Verlag in the "Lecture Notes in Computer Science" series. The second refereeing round which was requested in previous CSL editions before accepting a paper for publication in the proceedings, has been suppressed following the decision taken by the EACSL membership meeting held during CSL'98 (Brno, Czech Republic, August 25th 1998). CONFERENCE ON AUTOMATED DEDUCTION (CADE-16) July 7-10, 1999, Trento, Italy Change of deadline http://www.mpi-sb.mpg.de/cade-16/ * The deadline has been changed to January 5, 1999. INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT'99) January 10-12, 1999, Jerusalem, Israel Call for Participation http://www.cs.huji.ac.il/icdt99 http://www.cis.upenn.edu/~icdt99/ * Highlights. invited talks: "Issues raised by three years of developing PJama: An orthogonally persistent platform for Java(TM)", by Malcolm Atkinson and "Novel computational approaches to information retrieval and data mining", by Christos H. Papdimitriou, a tutorial: "Description logics and their relationships with databases" by Maurizio Lenzerini, and 26 papers. * Further information. See the above URLs. LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS (LACL'98) Grenoble, France, December 14-16 Call for participation http://www-bshm.upmf-grenoble.fr/LACL98/ * See the above URL for further details. COMPUTATIONAL COMPLEXITY May 4-6, 1999, Atlanta, Georgia Call for papers http://cs.utep.edu/longpre/complexity.html * Topics. Structure of complexity classes, Communication complexity Resource-bounded reducibilities, Theory of relativizations Interactive proof systems, Complexity and logic Computational randomness, Kolmogorov complexity Circuits and other concrete computational models, Cryptographic complexity, Complexity and learning, Proof complexity, Quantum computation. * Submission. Electronic submissions are preferred; see the URL for details. A submission must be received by November 13th, 1998 for consideration. Papers should not exceed 10 pages. * Program committee. Lance Fortnow (chair), Manindra Agrawal, Paul Beame, Richard Chang, Frederic Green, Lane Hemaspaandra, Pierre McKenzie, Ronitt Rubinfeld, Amnon Ta-Shma, Thomas Thierauf. SCHOOL ON FINITE MODEL THEORY December 15-16, 1998, IMSc. Chennai, India satellite event to FSTTCS98 conference, for more information see conf. URL http://www.imsc.ernet.in/~fsttcs98/ * Organizers: Anil Seth and Anuj Dawar. * Scope: The school is aimed at graduate students and researchers in the area of Theoretical Computer Science and Formal Logic. The programme will consist of talks on core as well as on application areas of finite model theory. * Speakers: A. Dawar (Swansea), M. Grohe (Freiburg), N. Immerman (Massachusetts at Amherst), A. Seth (IMSc. Chennai), W. Thomas (Kiel), M. Vardi (Rice Univ.), V. Vianu (San Diego). * Participation: For logistic reasons, participation in the school will be limited to about sixty participants. Interested persons should send e-mail to: seth@imsc.ernet.in before November 15, 1998. TWENTY-THIRD HOLIDAY MATHEMATICS SYMPOSIUM New Mexico State University, January 8-12, 1999 Call for participation http://math.nmsu.edu/~holsymp * Series of five one hour lectures on algebraic structures for logic will be given by Willem Blok and Bjarni Jonsson. * For further details, see the URL above. BOOK ANNOUNCEMENT Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications by Christoph Meinel and Thorsten Theobald Springer-Verlag, 1998, ISBN 3-540-64486-5 http://www.informatik.uni-trier.de/~theobald/obdd.html * Contents. 1. Introduction. 2. Basics. Part I. Data Structures for Switching Functions: 3. Boolean Functions. 4. Classical Representations. 5. Requirements on Data Structures in Formal Circuit Verification. Part II. OBDDs: An Efficient Data Structure: 6. OBDDs - Ordered Binary Decision Diagrams. 7. Efficient Implementation of OBDDs. 8. Influence of the Variable Order on the Complexity of OBDDs. 9. Optimizing the Variable Order. Part III. Applications and Extensions: 10. Analysis of Sequential Systems. 11. Symbolic Model Checking. 12. Variants and Extensions of OBDDs. 13. Transformation Techniques for Optimization. ANNOUNCING A COMPUTING RESEARCH REPOSITORY http://www.acm.org/repository * Researchers have made their papers available by putting them on personal web pages, departmental pages, and on various ad hoc sites known only to cognoscenti. Until now, there has not been a single repository to which researchers from the whole field of computing can submit reports. This is about to change. Through a partnership of ACM, the Los Alamos e-Print archive, and NCSTRL (Networked Computer Science Technical Reference Library), an online Computing Research Repository (CoRR) is being established. The Repository has been integrated into the collection of over 20,000 computer science research reports and other material available through NCSTRL (http://www.ncstrl.org) and will be linked with the ACM Digital Library. Most importantly, the Repository will be available to all members of the community at no charge. For further information, see the above URL.