Comments are welcome!
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
date : 12 September 1994
e-mail to: amast@cs.utwente.nl
__________________________________
e-mailed to : 252 subscribers
A preliminary program was announced on page 3 of AMAST News Sample Issue 01.
The completed program is now available
Please note :
early registration deadline : September 15, 1994
The Program includes:
Further Information:
FORTE'94 Organization Committee, University of Berne,
P.O. Box 900, CH-3000 Berne 9, Switzerland
Tel.: + 41 31 631 4994 (Dieter Hogrefe)
_ _ _ _ _ _ 4430 (Stefan Leue, Patrick Zumbrunn)
_ _ _ _ _ _ 3568 (Manuela Beck, Lucia Engel)
_ _ _ _ _ _ 8955 (Heike Horn)
_ _ _ _ _ _ 8957 (Sylvia Schaad)
_ _ _ _ _ _ 3965 (Fax)
Email: forte94@iam.unibe.ch
To obtain additional information and latest news please login via ftp on host `siam.unibe.ch' (IP address 130.92.66.11) as user `anonymous' and give your email address as password, then get the appropriate file from directory `forte94' (for particular filenames see file `README').
See first announcement on page 1-2 of AMAST News Sample Issue 03.
Update: The GraGra'94 Preliminary Program is now available.
Conference Secretariat:
PLILP-ALP'94 (Att: Juan Jos'e Moreno-Navarro), Facultad de Inform'atica,
Universidad Polit'ecnica de Madrid, Campus de Montegancedo s/n,
Boadilla del Monte, E-28660 Madrid, Spain
e-mail:plilp-alp-info@dia.fi.upm.es
ftp : dia.fi.upm.es, pub/plilp-alp-94
www (warning: home-page under construction)
fax : +34 1 336 74 12
Following the three previous ALP conferences in Gaussig (1988), Nancy (1990), and Volterra (1992), as well as the five previous PLILP meetings in Orleans (1988), Linkoping (1990), Passau (1991), Leuven (1992), and Tallinn (1993), the Fourth International Conference on Algebraic and Logic Programming and the Sixth International Symposium on Programming Language Implementation and Logic Programming will be held concurrently in Madrid (Spain). The event is organized jointly by the Computer Science Departments of the Complutense University of Madrid (UCM) and the Technical University of Madrid (UPM).
The technical program includes 27 refereed papers corresponding to PLILP and 17 refereed papers corresponding to ALP, poster presentations, system demonstrations and 3 invited lectures by Robert Paige (New York University), Dale Miller (U. Pennsylvania), and Catuscia Palamidessi (U. Genova).
In addition to the technical program the official social program includes an excursion to one of the nearby historic cities, a reception, and a conference banquet. Madrid, a city of contrasts, traditional and contemporary at the same time, offers the opportunity to enjoy both Spain and one of the most attractive capitals in Europe.
A plain-text version of the program, general information and registration form, are available by anonymous ftp.
The Second COMPULOG-NET Workshop and Area Meeting on Parallelism and Implementation Technology for Computational Logic will be held in Madrid on September 17, 1994, immediately following ALP and PLILP 1994 (and in parallel with the 1994 Programming Languages Workshop and Area meeting). The meeting is intended to be a communication vehicle for people interested in subjects from research in basic technologies for the implementation of Computational Logic systems to practical issues in such implementation. The transfer to and exploitation of such technology by industry are also issues of central interest to the meeting. Abstracts are invited describing recent work on any topic related to Implementation Techniques, Foundations of Parallelism and Concurrency, Abstract Machines, Compilation Methods, Program Optimization, Sequential and Parallel Execution Models, Automatic Parallelization, Concurrent/Parallel Languages, Performance Evaluation Methodologies and Studies, Experience in System Implementation, etc.
Abstracts from both academia and industry are invited. Presentations of work in progress are welcome. Discussions during the workshop will be encouraged. Recent work already presented at another meeting or that will be presented in the near future may also be considered, depending on the number of submissions. A UPM technical report with the abstracts will be distributed to all participants.
Please send a 2-3 page extended abstract (or full paper) preferably by email (LaTeX or plain ascii) to:
compulognet-parimp-meeting@dia.fi.upm.es(confirmation of receipt of all submissions will be returned by email)
+34-1-352-4819 Attention -- Maria Jose Garcia de la Bandaor (in case no other option is available) by surface mail to:
Maria Jose Garcia de la Banda, COMPULOG-NET Area Meeting,
Facultad de Informatica - UPM, E-28660 Boadilla del Monte, Madrid, Spain
Please specify whether this work was already presented at another meeting or whether it is submitted or accepted for presentation in the future.
If you are submitting an abstract, and also if you simply wish to attend the meeting please fill the registration and hotel reservation form, and send it as soon as possible by email, fax or (if no other option available) surface mail to address above. There is no registration fee.
A limited number of grants to support attendance at the meeting are available. Priority will be given to authors of accepted abstracts. If you are interested, please send your request to
compulognet-parimp-meeting@dia.fi.upm.es
Coffee will be available at 9:30AM.
All lectures will be in the auditorium of the Schapiro Center for Engineering and Physical Sciences Research. This building is adjacent to the Mudd Building and entrance is from the campus.
The lectures are free and open to the public.
Call (212) 939-7000 for more information.
Theory Day is supported in part by a grant from the National Science Foundation.
At the occasion of the publication of the book
Selected Papers on Automaththere will be a symposium at the Van Trierzaal, Bestuursgebouw, Eindhoven University of Technology, on October 6, 1994.
(Studies in Logic and the Foundations of Mathematics, North-Holland,
eds. R.P. Nederpelt, J.H. Geuvers and R.C. de Vrijer),
The program of the symposium is as follows:
The Symposium is organised by the research group Logic and Information Systems of Eindhoven University of Technology and Brabant University in Tilburg, in cooperation with the Dutch Union for Logic and Foundations of the Exact Sciences.
Participation is free and registration is not necessary. Lunch reservations can be made to:
Mrs. A. Bouten, tel. (0)40-474124,
e-mail wsinti@win.tue.nl
Wsk&I, Eindhoven University of Technology,
PO Box 513, 5600 MB Eindhoven, Netherlands.
The organizing committee: Herman Geuvers, Rob Nederpelt (Eindhoven University of Technology).
Full information available on the WWW.
Register early by September 28!
Graph drawing addresses the problem of constructing geometric representations of abstract graphs and networks. The automatic generation of drawings of graphs has important applications in key computer technologies such as software engin- eering, database design, and visual interfaces. Recent progress in algorithm design, computational geometry, topological graph theory, and order theory has considerably affected the evolution of the field, and has widened the range of issues being investigated.
Specific topics include, but are not limited to:
Aim of Graph Drawing '94 (GD'94) is to cover the major trends in the area. The format of the workshop will be informal. The technical program includes the presentation of papers and demos, a panel discussion on ``Graph Drawing: Too Much Theory, Too Little Practice?'' organized by Joe Marks (Mitsubishi Electrical Research Labs, USA), and a poster gallery, organized by Sue Whitesides (McGill Univ.). Also, in conjunction with GD'94, there is a graph drawing competition organized by Peter Eades (Univ. Newcastle, Australia) and Joe Marks (as above).
Industry representatives are welcome to attend. It is anticipated that the workshop will further collaborative efforts between computer scientists, mathematicians, and applied researchers.
GD '94 is sponsored by DIMACS, the NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science hosted by Rutgers University, Princeton University, AT&T Bell Laboratories, and Bellcore.
>>>>>>>>>>>>>>>>>>> SUBMISSION DEADLINE: 15 OCTOBER 1994 <<<<<<<<<<<<<<<<<<<
TAPSOFT brings together theoretical computer scientists and software engineers (researchers and practitioners) with a view to discussing how formal methods can usefully be applied in software development. Includes CAAP, FASE, TOOLS.
CAAP: COLLOQUIUM ON TREES IN ALGEBRA AND PROGRAMMING.
FASE: COLLOQUIUM ON FORMAL APPROACHES IN SOFTWARE ENGINEERING.
TOOLS. Demonstration of support tools for practical use of formal approaches.
WWW
FTP: ftp.daimi.aau.dk, get pub/TAPSOFT/README.
E-mail:tapsoft@daimi.aau.dk
Fax: +45 8942 3255
BRICS - TAPSOFT'95, Dept. of Computer Science, Univ. of Aarhus, Ny Munkegade Bldg. 540, DK-8000 Aarhus C, Denmark.
The Twenty-seventh ACM Symposium on Theory of Computing (STOC), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory, will be held in Las Levas, Nevada, May 29--June 1, 1995.
Papers presenting original research on theoretical aspects of computer science are sought. Typical, but not exclusive, topics of interest include: algorithms and data structures, complexity theory, computational algebra and geometry, computational biology, cryptography, databases, machine learning, algorithmic graph theory, applications of logic, parallel and distributed computation, probabilistic computations, computer architectures, and robotics.
Submission: send 15 copies (possibly printed 2-side) of extended abstract to Allan Borodin, STOC 95 Program Chair, Department of Computer Science, University of Toronto, Toronto, Ontario M5S 1A4, Canada.
Authors from locations where access to reproduction facilities is severely limited may submit a single copy. This year, electronic submission will also be possible. Papers in printable PostScript(TM) format will be received via email at the address:
stoc95-submit@cs.dartmouth.edu
Further information available:
stoc95-submit-info@cs.dartmouth.edu
The abstract (whether sent by hard copy or by electronic submission) must be received by 23:59 EST November 30, 1994 (or postmarked by Nov. 25 and sent via airmail). This is a firm deadline. Simultaneous submission of the same abstract to another conference with published proceedings is not allowed.
Notification by February 6, 1995. Camera-ready copy by March 21, 1995. One author of each accepted paper should attend the conference and present the paper.
Best Student Paper Award: A prize of $500 will be given to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). A paper is eligible if all its authors are full-time students at the time of submission. This must be indicated in the submission cover letter.
Committee Members: H. Attiya, M. Ben Or, A. Borodin, A. Broder, H. Gabow, N. Immerman, R. Karp, L. Levin, K. Mulmuley, C. Papadimitriou, R. Schapire, C. Schnorr, M. Sudan, M. Vardi, F. Yao.
Conference Chair: Lawrence L. Larmore, Department of Computer Science, University of Nevada at Las Vegas, P.O. Box 454019, Las Vegas, Nevada, 89154-4019; larmore@cs.unlv.edu.
(LaTeX and Postscript(tm) versions of the Call for Papers are available by anonymous FTP from ftp.montefiore.ulg.ac.be (139.165.16.58) in directory pub/cav95).
This conference is the seventh in a series dedicated to advancing theory and practice of computer-assisted formal verification. It is centered on the theme that computer assistance is essential for wider use of verification techniques, but encourages all styles of verification approaches and a variety of applica- tion areas. It covers the spectrum from theory to concrete applications, with emphasis on verification tools and algorithms and techniques needed for their implementation. The conference will include contributed papers, invited papers, tutorials, and tool demonstrations.
The conference boundaries are not rigid. In the past, papers on the following topics have been enthusiastically received.
Any paper of potential interest for computer-aided verification will be considered.
Submission: Authors may submit a paper by mailing electronically a self-contained Postscript(tm) version to the address
cav95-submit@montefiore.ulg.ac.be (strongly encouraged)and by sending 5 copies of it to the Program Chairman. Unprintable electronic submissions for which paper copies are not received will not be considered. Length is limited to 12 typed pages (with normal font sizes, line spacing, margins, etc.) Each submission should provide sufficient detail for the program committee to assess the merit of the contribution. Simultaneous submission to other conferences with proceedings, or submission of already published material is not allowed.
Program Chairman:
Pierre Wolper
Universite de Liege
Institut Montefiore, B28
Grande Traverse 10
B-4000 Liege, BELGIUM
cav95@montefiore.ulg.ac.be
Program Committee: R. Alur, R. Brayton, C. Courcoubetis, W. Damm, R. De Simone, R. Devillers, E. Allen Emerson, S. Garland, O. Grumberg, N. Halbwachs, T. Henzinger, R. Koymans, G. Leduc, K. McMillan, J. Parrow, N. Shankar, F. Somenzi, B. Steffen, P. Varaiya, M. Vardi, T. Yoneda.
Steering Committee: E. Clarke, R. Kurshan, A. Pnueli, J. Sifakis.
The 6th symposium on Combinatorial Pattern Matching will be held in Helsinki, Finland, on July 4-7, 1995. The first meeting was in Paris in 1990, followed by meetings in London, Tucson, Padova, and Pacific Grove. Papers in all areas related to combinatorial pattern matching and applications will be considered, including, but not limited to, string algorithms, pattern recognition, applications in molecular biology, text searching, information retrieval, symbolic computing, and data compression. Papers reporting on original research unpublished elsewhere are primarily sought. Surveys of important results, especially recent ones, are also invited.
Proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. The goal is to keep the attendance to under 100 participants to allow ample time for informal interaction. The participation will require advance registration. On July 2-4, 1995, just before the symposium, a short international summer school is planned to be organized in the same location.
To submit a paper, please send 10 copies of an extended abstract (5-10 pages -- standard, single-spacing single-column 11 pt or 12 pt format) to the address below by January 10, 1995. This is a strict deadline. Papers arriving after that date or submitted electronically will not be considered. Please include your e-mail address if possible. Authors will be notified by March 3, 1995. Camera-ready manuscripts will be due April 7, 1995.
Esko Ukkonen
Department of Computer Science
P. O. Box 26
FIN-00014 University of Helsinki, Finland
e-mail address: cpm95@cs.helsinki.fi
Program Committee: A. Ehrenfeucht, Z. Galil (co-chair), D. Gusfield, U. Manber, M. Paterson, P. Pevzner, I. Simon, J. Storer, E. Ukkonen (co-chair), M. Wegman.
Invited Speaker(s): To be announced.
Local Organizers: P. Kilpelainen, J. Karkkainen, E. Sutinen, and J. Tarhio.
Helsinki, the capital of Finland, is a combination of old and new, city and country. Because of the northern location, the area is abundant of light in summer. The symposium venue will be Hanasaari Cultural Centre, a high-quality conference hotel charmingly overlooking the Baltic Sea just a few kilometers from downtown.
An intermediate representation is the basis of any tool for manipulating computer programs. A good representation permits powerful operations to be performed more simply, and may enable operations that a weaker representation cannot support. This workshop will examine current trends and research in the design and use of intermediate representations.
Submissions are invited for this workshop; the range of topics includes
Program Committee: R. Ballance, M. Ernst (chair), J. Ferrante, S. Horwitz, S. Muchnick, C. Offner, K. Pingali, D. Tarditi, POPL General Chair: Ron Cytron.
Submission: Authors should submit 9 copies of a detailed summary not to exceed 5000 words (approx. 10 pages) to the program chair by September 30, 1994. Excessively long submissions may not be fully reviewed. The cover page should include a return postal address and an electronic mail address (if possible). The research should not be submitted or published elsewhere. Please follow the same guidelines as for writing summaries for the POPL conference.
More information is available on the WWW, or by anonymous FTP from directory ftp.cs.cmu.edu:/user/petel/popl95.
Electronic submission of portable PostScript is permitted. Submissions may be emailed or, preferably, made available for ftp by the program chair. All authors will receive confirmation of receipt of their submissions.
Authors will be notified of paper acceptance by November 30, 1994. Final versions of accepted papers are due on January 6, 1995. A proceedings containing the accepted papers will be distributed at the workshop.
Send correspondence to:
Michael Ernst
IR'95
Microsoft Research, 1
Microsoft Way, Bldg 9S/1
Redmond, WA 98052
USA E-mail: ir95@research.microsoft.com
Guest Editor: Michel Goemans
Recently, there have been several ground-breaking results in the area of approximation algorithms. Through major advances in complexity theory, the hardness of approximation has become better understood. At the same time, improved approximation algorithms have recently been discovered for a surprising number of classical optimization problems, including maximum satisfiability, graph coloring, and the Steiner tree problem. Although approximation algorithms tend to be problem specific, progress has also been made in isolating tools for their design.
Algorithmica is dedicating a special issue to approximation algorithms, in recognition of the current interest and progress in this area. Authors should note the benefits of publication in a special issue---a collection of high-quality related papers in one volume, plus a guarantee of publication of accepted papers with minimal time delay. Manuscripts are solicited on all aspects of approximation algorithms, including their design and analysis, and the limits of approximability.
Authors should send four copies of their submission to the guest editor
Michel Goemansby October 31, 1994. Authors are encouraged to submit as early as possible. All manuscripts will be promptly and carefully refereed according to the normal Algorithmica editorial process. The special issue is scheduled to appear in the first quarter of 1996.
MIT
Department of Mathematics
Room 2-382
Cambridge, MA 02139
USA
Phone: (617) 253-2688
Fax: (617) 253-4358
E-mail: goemans@math.mit.edu
The Department of Computer Science (DCCE) of the Sao Paulo State University (UNESP) at Sao Jose do Rio Preto, Brazil, is inviting applications for visiting positions at the full/associate professor levels. Applicants must have a PhD in electrical engineering or computer science with at least 5 years of experience, be strongly committed to graduate level teaching and have an outstanding research record. The successful candidate(s) is(are) expected to teach at the graduate level, supervise MSc theses, and help to establish a strong research program in one of the following areas: computer and parallel architectures, CAD for VLSI systems (mainly circuit level simulations), Petri net applications (preferably to system level simulations), and artificial neural networks. These positions are for one year appointment, possibly renewable for another one year period. The benefits include a fellowship (+/- US$2,000.00 / mo.) from CAPES (the Brazilian foundation for the enhancement of graduate level staff), air transportation to and from Brazil, and settlement allowances. There are also openings for periods of more than one and less than twelve months. The benefits for these short term stayings are basically the same as those for long term applications. However, settlement allowances will only be granted to those applying for six months or more.
Applications should follow the schedule below:
visit beginning during application deadline analyses' results given during 1st quarter of 1995 15 September 1994 November 1994 2nd quarter of 1995 30 November 1994 February 1995 3rd quarter of 1995 28 February 1995 May 1995 4th quarter of 1995 31 May 1995 August 1995
Candidates should send resume, copy of PhD diploma, statement of interests, to:
Prof. Dr. Norian Marranghello
DCCE/IBILCE/UNESP - Caixa Postal 136
15054-000 S.J.Rio Preto, SP - BRAZIL
Tel: +55 172 24 4966 ext. 41, Fax: +55 172 24 8692,
E_mail: norian@nimitz.ibilce.unesp.br
It is strongly recomended, especially to those candidates applying for visiting positions beginning in the first quarter 1995, that their documents be sent by fax or e_mail as soon as possible, to reach us up to the deadline. However, to meet Brazilian laws a copy of the original documentation must also be sent via regular mail service to become processual pieces.
(Vacancy UAC.490. Excerpt from the full text of the notice .)
The University of Auckland seeks to appoint a qualified Computer Scientist who has the research and teaching skills to make a significant contribution to its Department of Computer Science. The University, with over 22,000 students, is sited in the heart of New Zealand's largest city, Auckland. The department has over 500 equivalent full-time students and is projected to have substantial future growth in graduate student numbers. The new chair holder is expected to play a leading role in developing advanced teaching and research. The precise conditions of appointment will be subject to negotiation.
Applications are welcomed from those who believe they are qualified for this challenging position. The successful applicant is expected to have an accomplished teaching and research record. We are willing to accept applications from candidates from all backgrounds, but may favour those in the applied or experimental Computer Science area.
The Professor will be responsible for such teaching and related duties, including examining, as may be required by the Head of the Department, and will be expected to encourage, supervise and engage in research within the University. Teaching at undergraduate and graduate levels will be required. A Professor who holds a Chair within a Department may be asked from time to time to undertake the duties of Acting Head of the Department.
The appointment will be for an initial period of four years and may be continued thereafter by agreement. The appointment is a full-time one.
At present, professorial salaries are established within the range of $NZ80,000 - $NZ100,000 per annum having regard to the qualifications of the candidate concerned.
Applications in accordance with the Method of Application and quoting Vacancy UAC.490 should be forwarded as soon as possible, but not later than 28Nov.1994.
Further information about this Chair and the Department of Computer Science may be obtained by addressing specific questions to
Professor R W Doran
Phone 64-9-373-7599 Ext 8754
Fax 64-9-373-7453
e-mail bob@cs.auckland.ac.nz
The University has an EEO policy and welcomes applications from all qualified persons.
UnCover is a `Table of Contents and Document Delivery' database in the USA which provides up-to-date access to (the ToC pages of) almost 17000 journals. Telnet address: database.carl.org. On April 6, the UnCover Company released UnCover Reveal, a new literature alert service delivered through e-mail.
Users with an UnCover profile which includes an email address and fax number may create a list of journal titles in which they are interested. When the next issue of any of those titles is entered into the UnCover database, the ToC will automatically be e-mailed to them. Ordering an article may take place through Reveal by just replying to the e-mail message, for those users who include a credit card no. in their user profile or set up a deposit account with UnCover (whilst, generally, articles are ordered on-line while logged into UnCover).
There is no charge for the e-mail ToC service. Articles ordered by reply e-mail will be delivered for a flat rate of US$8.50 plus copyright fee, and a fax surcharge if applicable.
The basic instructions relating to the Reveal service are summarized below. More detailed information is also available.
__________________
Acknowledgement:
Information originally made available by the Monash University Library, Melbourne, May 1994
__________________
After the release of my referee's guide in 1989, a number of people asked me to create a referee's form. At first I resisted this idea on the grounds that no single form can do justice to the variety of refereeing scenarios that occur in the theoretical computer science community. However, the purpose of a form is to handle 90% of cases in 10% of the time, so that more time can be spent on the remaining cases that really need the extra attention.
I've been experimenting with a vanilla form since 1992. Now I think it is ready for public use. You can obtain it by anonymous ftp from ftp.unt.edu (129.120.1.1) in directory ian/guides/form. It is in LaTeX format and consists of 4 parts:
Comments and constructive criticism will be gratefully received by the author at
ian@ponder.csci.unt.eduA print version will appear in SIGACT News in some future issue (as soon as we have the space).
____
Ian Parberry (ian@ponder.csci.unt.edu)
Dept. of Computer Sciences, Univ. of North Texas
"Bureaucracy is expanding
to meet the needs of an expanding bureaucracy"
by Graham A Stephen (University of Wales)
String searching is a subject of both theoretical and practical interest in computer science. This book presents a bibliographic overview of the field and an anthology of detailed descriptions of the principal algorithms available. The aim is twofold: on the one hand, to provide an easy-to-read comparison of the available techniques in each area, and on the other, to furnish the reader with a reference to in-depth descriptions of the major algorithms.
Topics covered include methods for finding exact and approximate string matches, calculating `edit' distances between strings, finding common sequences and finding the longest repetitions within strings. For clarity, all the algorithms are presented in a uniform format and notation.
Contents: Introduction; String Matching; String Distance and Common Sequences; Suffix Trees; Approximate String Matching; Repeated Substrings.
A more detailed Table of Contents is available.
Readership: Computer scientists, software developers, computational biologists.
250pp (approx), Pub date: October 1994, ISBN 981-02-1829-X, US$ 34/UK pounds 25
For further information, please contact
Marketing Department, World Scientific Publishing Co Pte Ltd
at fax no: (65) 382 5919 or e-mail address: worldscp@singnet.com.sg
by Cristian Calude, The University of Auckland, New Zealand
Forewords by G.J.Chaitin and A.Salomaa
"Algorithmic information theory (AIT) is the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously"" says G.J.Chaitin, one of the founders of this theory. (AIT) provides a mathematical definition of what it means for a string or sequence of bits to be random, unpredictable, typical. It is also relevant for Logic (a new light on Gödel's incompleteness phenomenon is obtained by analysing the information-theoretic power of axiomatic systems), Physics (a characterization of chaotic physical motion), Biology (How likely is life to appear and evolve? How common is life in the Universe?), Metaphysics (Is the Universe ordered, rational or random?).
"This book, benefiting as it does from Cristian Calude's own research in AIT and from his experience teaching AIT in university courses around the world, should help to make the detailed mathematical techniques of AIT accessible to a much wider audience." (G.J.Chaitin)
Contents: Mathematical Background; Noiseless Coding; Program Size; Recursively Enumerable Instantaneous Codes; Random Strings; Random Sequences; Applications; Open Problems; Bibliography.
A more detailed Table of Contents is available.
Readership: Theoretical Computer Science; Mathematics; Logic; Science and Philosophy
XVI + 238 pages, Pub date: September 1994, Springer-Verlag, ISBN 3-540-57456-5, DM 68.00, A$ 60.00, NZ$ 72.50 (Price at July 1994)
Quentin: I have thought of a pair of numbers, integers between 2 and 100 inclusive, and I am going to tell Sally the sum and Peter the product of these numbers (He does so, so that the other cannot hear.)
Peter: I cannot tell what the numbers are.
Sally: I knew you could not tell. Neither can I.
Peter: In that case I know what they are.
Sally: So do I!
What are the two numbers?
(From: Teaching Mathematics and its Applications, Vol. 12, No. 4, 1993, p. 190;
Ed. Prof. David Burghes, IMA, Oxford University Press.)
As Puzzle 1, but with the interval [2, 100] replaced by the interval [1, 10].
Test your favourite logical formalism(s) and programming language(s) against the following:
URL : ftp://ftp.cs.utwente.nl/pub/doc/amast/
Date : 12/09/1994
Contents : README, amast91/, amast93/, amast95/, info/, newsletter/,
/pstv95/, sigala/
Note: to date, only one template is available, and it actually refers to the whole structure of the HTML version of the AMAST Newsletter.Contents : SIAN.html
was put together and edited by Giuseppe Scollo, thanks to contributions by:
Dieter Hogrefe [1-1] ,
Grzegorz Rozenberg [1-2] ,
Pepe Manas [1-3] ,
Manuel Hermenegildo [1-4] ,
Zvi Galil [1-5] ,
Herman Geuvers [1-6] ,
Roberto Tamassia [1-7] ,
Peter D. Mosses [2-1] ,
Allan Borodin [2-2] ,
Pierre Wolper [2-3] ,
Jorma Tarhio [2-4] ,
Michael Ernst [2-5] ,
Michel Goemans [2-6] ,
Norian Marranghello [3-1] ,
Cris Calude [3-2] , [5-2] ,
Rebecca Brown, Dan Corbett [4-1] ,
Ian Parberry [4-2] ,
Graham A Stephen [5-1] ,
Len Colgan [6-1] .
This fifth sample issue of the AMAST newsletter is available in three forms:
(*) within the AMAST directory of the Twente WWW server, in the directory for this issue.