1996 FEDERATED LOGIC CONFERENCE (FLOC'96) July 27-August 3, 1996, Rutgers U., New Brunswick, New Jersey, USA * Participating Conferences. Rewriting Techniques and Applications (RTA), Conference on Automated Deduction (CADE), Computer-Aided Verification (CAV), and Logic in Computer Science (LICS). LICS and RTA will be held in parallel during the first four days of FLoC. CADE and CAV will be held during the last four days, with CADE workshops running in parallel with the last day of LICS. Plenary events involving all the conferences are scheduled. * Call for Papers. FLoC itself does not have a separate submissions process. Submissions must be directed to the individual conferences. Parallel submissions are not allowed -- a paper cannot be submitted to more than one of the participating conferences. See the newsletter items below for summaries of the RTA, CADE and CAV calls for papers. The full versions, as well as the LICS call for papers, can be obtained via the FLoC web page (URL above). * Host. The conference is being hosted by the Center for Discrete Mathematics and Computer Science (DIMACS), Rutgers University, as part of its Special Year on Logic and Algorithms. * Further Information. Further information on FLoC and the participating conferences may be obtained via the FLoC WWW page. Information about the DIMACS Special Year can be found in the DIMACS home page. 7TH INT'L CONF ON REWRITING TECHNIQUES AND APPLICATIONS (RTA-96) July 27-30, 1996, Rutgers University, NJ, USA * Topics. Term rewriting systems; symbolic and algebraic computation; constrained rewriting and deduction; equational programming languages; string and graph rewriting; completion techniques; rewrite-based theorem proving; unification and matching algorithms; conditional and typed rewriting; constraint solving; higher-order rewriting; architectures for rewriting; parallel/distributed rewriting and deduction. * Submissions. 6 (six) copies of a full draft paper of no more than 15 (fifteen) pages, to reach the program chair, at the address below, no later than January 15, 1996. Using Springer LNCS style files is strongly recommended. Electronic submission in Postscript form is encouraged. In addition to full research papers, descriptions of new working systems (4 proceedings pages) and problem sets that provide realistic, interesting challenges in the field of rewriting techniques are also welcome. Papers on new applications of rewriting techniques are particularly encouraged. Late papers and papers that require major revision, including submissions that are too long, will be rejected. * Program Chair. Harald Ganzinger, RTA96, Max Planck Institute for Computer Science, Im Stadtwald, D-66123 Saarbruecken, Germany. Telephone: +49 681 302-5360. Fax: +49 681 302-5401. Email: rta96@mpi-sb.mpg.de. * Program Committee (tentative). J. Avenhaus, H. Comon, N. Dershowitz, H. Ganzinger, P. Lescanne, U. Martin, A. Middeldorp, P. Narendran, R. Nieuwenhuis, T. Nipkow, F. Pfenning, D. Plaisted, W. Snyder, H. Zhang. 13TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION (CADE-13) July 30 - August 3, 1996, Rutgers U., New Brunswick, New Jersey, USA * Topics. CADE conferences cover all aspects of automated deduction: first vs. higher order logics; classical vs. non-classical logics; special vs. general purpose inference; interactive vs. automatic systems. Specific topics of interest include (but are not limited to) resolution, sequent calculus, decision procedures, unification, rewrite rules, mathematical induction, and any applications of automated deduction, including deductive databases, logic and functional programming, commonsense reasoning, software and hardware development, distributed theorem proving, learning search heuristics. **Papers on commercial or industrial applications of automated deduction are especially encouraged.** * Submissions. Send 4 (four) copies to the Program Co-Chairs by 12 January, 1996. Research papers should not exceed 15 (fifteen) proceedings pages. System descriptions and problem sets should not exceed 5 (five) proceedings pages. Springer style files should be used if possible (available via the www page). The Program Committee may ask authors to furnish evidence of scientific claims, e.g., computer programs, detailed proofs, or full experimental data. * Program Co-Chairs. Michael McRobbie & John Slaney, Centre for Information Science Research, The Australian National University, ACT 0200, Australia. Tel: [+61] 6-249-2035. Fax: [+61] 6-249-0747. Email: cade13@cisr.anu.edu.au. * Program Committee. O. Astrachan, J. Avenhaus, L. Bachmair, D. Basin, W. Bibel, B. Buchberger, F. Bry, R. Caferra, K.S. Choi, A. Cohn, L. Farinas del Cerro, W. Farmer, A. Felty, M. Fitting, M. Fujita, S. Garland, F. Giunchiglia, E. Gunter, R. Hasegawa, L. Henschen, L. Hines, S. Hoelldobler, M. Kaufman, A. Leitsch, E. Lusk, U. Martin, D. McAllester, W. McCune, H.-J. Ohlbach, J. Posegga, W. Pase, F. Pfenning, F. Pirri, D. Plaisted, U. Reddy, M. Rusinowitch, K. Satoh, J. Schumann, C. Schwind, N. Shankar, J. Siekman, A. Smaill, G. Smolka, M. Stickel, G. Sutcliffe, E. Tiden, A. Voronkov, L. Wallen, D. Wang, H. Zhang. CONFERENCE ON COMPUTER-AIDED VERIFICATION (CAV '96) July 31 - August 3, 1996, Rutgers U., New Brunswick, New Jersey, USA. * Topics. Modeling and specification formalisms (such as logical, automata-based, and algebraic methods). Algorithms and tools (such as state-space exploration, model checking, synthesis, and automated deduction). Verification techniques (such as state-space and transition-relation reduction methods, symbolic methods, probabilistic methods, compositional and modular reasoning, integration of algorithmic and deductive methods). Applications and case studies (such as synchronous and asynchronous circuits, communication protocols and distributed algorithms, real-time and embedded control systems). Verification in practice (integration of verification with design, specification, testing, debugging, and code generation). * Submissions. Submissions are invited in two categories. A. Regular papers: an extended abstract not exceeding 12 pages. B. Project and tool presentations: an abstract not exceeding 4 pages. In category B we encourage presentations and status reports on case studies, industrial applications, and tools. In both categories, authors may submit a paper by mailing electronically a self contained Postscript(tm) version to cav96-submit@research.att.com (strongly encouraged whenever possible for speeding up the reviewing process), or by sending seven (7) hard-copies of the submission to Rajeev Alur, Re: CAV '96, AT&T Bell Labs, Room 2D-144, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. Submission deadline (firm): January 4, 1996. Submissions that are not received by January 4, 1996, and submissions that exceed the page limit run the risk of automatic rejection. * Program Committee. Rajeev Alur (co-chair), Robert Brayton, Karlis Cerans, David L. Dill, E. Allen Emerson, Orna Grumberg, Thomas A. Henzinger (co-chair), Kim Larsen, David Long, Ken McMillan, Al Mok, Doron Peled, Amir Pnueli, Carl Seger, Joseph Sifakis, Scott Smolka, Mandayam Srivas, Wolfgang Thomas, Frits Vaandrager, Moshe Vardi, Pierre Wolper. * Full Call for Papers. From the www page, or by ftp from ftp.cs.cornell.edu in pub/tah/Cav96. NEW WWW PAGE CONTAINING UNIFIED JOURNAL/CONFERENCE BIBLIOGRAPHIES * Journals/Conferences. Information and Computation (with abstracts). Journal of the ACM (with abstracts). ACM Symposium on Theory of Computing (STOC). IEEE Symposium on Logic in Computer Science (LICS). IEEE Symposium on Foundations of Computer Science (FOCS). * Features. Keyword searches on authors, titles, and abstracts; links to author home pages; cross-references between articles that cite one another. In addition, the I&C and JACM bibliographies include: abstracts of recent papers (available in HTML, LaTeX, DVI, or PostScript format); up-to-date backlog information; hypertext lists of journal editors; Information for Authors and directions for electronic submission of manuscripts. * Author. David M. Jones; Editorial Assistant, Information and Computation; Editorial Assistant, Journal of the ACM. * Links and Abstracts Needed. If you have published in any of these forums and have your own WWW page or similar resource (such as a public ftp directory or gopher document) where information about you or your research may be found, please let me know, and I'll add a link to it from our bibliographies. Also, if you have published in I&C or JACM and the abstract of your work is not currently on our page, it would be extremely helpful if you could take a few minutes to send the abstract. * Volunteers Needed. I have support for JACM and I&C, but I can't indefinitely maintain the FOCS, STOC and LICS bibliographies myself. So we are looking for volunteers to keep these up to date and on the Web. Alternatively, volunteering a few hours of time simply to add further bibliographies and abstracts would directly improve the current database. If you think you might be interested in doing this, please send me email for more information. WORKSHOP ON LOGIC AND RANDOM STRUCTURES November 5-7, 1995, DIMACS Center, Rutgers U., New Brunswick, NJ, USA * Description: The central theme will be the relationship between logic and probabilistic techniques in the study of finite structures. In one direction, this topic includes recent research on limit laws and zero-one laws. A limit law holds in a class of finite structures if all properties decribable in some logical language have limiting probabilities as structure size grows; a zero-one law holds (as in the classic work of Glebskii et. al. and Fagin) if the limiting probabilities are always 0 or 1. This work has been applied to areas such as analysis of algorithms for database query optimization and polynomial time approximation of NP optimization problems. In the other direction, this topic covers use of probabilistic methods to establish lower bounds in circuit complexity. Particular emphasis will be placed on the connections between first-order logic and constant depth circuits with unbounded fan-in. While there will be natural connections to the workshop on "Descriptive complexity and finite models", here calculation of probabilities has center stage. * Presentations. A limited number of presentations have been solicited by the organizers. Additional presentations are not being solicited, in order to leave ample time for informal discussions. * Registration. Attendance at the workshop is open to all. To register, contact Pat Toci [toci@dimacs.rutgers.edu, (908) 445-5930]. If possible, please register beforehand, although registration at the conference is permitted. There is no registration fee. POSITION IN LOGIC AT CARNEGIE MELLON UNIVERSITY The Philosophy Department at Carnegie Mellon University solicits candidates for a tenure-track position at the Assistant/beginning Associate Professor rank. The job will commence with Autumn Term, 1996. * Responsibilities. Applicants should be prepared to teach undergraduate and graduate courses in mathematical logic and closely related areas, but should also be interested in teaching general philosophy courses at the undergraduate level; in particular, courses in the history of philosophy. It is expected that a successful candidate will engage in cross-disciplinary research, assist in the advising of students in the degree programs and the administration of the programs. Candidates ideally should have strong backgrounds in mathematics as well as philosophy. * Applications. Candidates should include with their application a statement of research interests, a sample of papers, curriculum vitae, and the names of at least three people from whom letters of recommendation have been requested. Applicants who do not already have the Ph.D. degree must offer evidence that the degree will be granted by August 1996. Send applications by December 1, 1995, to: Logic Search Committee, Department of Philosophy, Carnegie Mellon University, Schenley Park, Pittsburgh, Pennsylvania 15213-3890 (USA). 1ST INT'L CONF. ON COORDINATION MODELS AND LANGUAGES (COORDINATION'96) April 15-17, 1996, Cesena, Italy [Second call for papers. See Newsletter 28 for the first.] * Submission Deadline. October 30, 1995. 6TH CONF ON THEORETICAL ASPECTS OF RATIONALITY AND KNOWLEDGE (TARK VI) March 17-20, 1996, De Zeeuwse Stromen, The Netherlands [Second call for papers. See Newsletter 28 for the first.] * Submission Deadline. October 10, 1995. FIRST INT'L WORKSHOP ``FRONTIERS OF COMBINING SYSTEMS'' (FROCOS'96) March 26-29, 1996, Munich, Germany [Second call for papers. See Newsletter 27 for the first.] * Submission Deadline. October 16, 1995