From meyer@dfki.uni-kl.de Fri Oct 29 16:33:30 1993 Path: uunet!bounce-back From: Manfred Meyer Newsgroups: news.announce.newgroups,news.groups,comp.ai,comp.ai.shells,comp.databases,comp.object,comp.lang.lisp,comp.lang.prolog,de.sci.ki.announce Subject: RFD: comp.ai.constraints Followup-To: news.groups Date: 29 Oct 1993 11:27:06 -0400 Organization: DFKI, University of Kaiserslautern, Germany Lines: 91 Sender: tale@uunet.uu.net Approved: tale@uunet.uu.net Message-ID: NNTP-Posting-Host: rodan.uu.net Xref: uunet news.announce.newgroups:4212 news.groups:86190 comp.ai:19306 comp.ai.shells:1274 comp.databases:30650 comp.object:13454 comp.lang.lisp:11196 comp.lang.prolog:8744 de.sci.ki.announce:212 REQUEST FOR DISCUSSION (RFD) ============================ This is a formal Request for Discussion for the creation of a new news- group under the comp.ai.* hierarchy. This RFD is being cross-posted to comp.ai, comp.ai.shells, comp.databases, comp.object, comp.lang.prolog, comp.lang.lisp, de.sci.ki.announce, and news.announce.newgroups. It is also being mailed to the mailing lists on CLP and that of the German ALP branch. Discussion of this RFD is to take place in news.groups. Could people reading this post mention it to colleagues and friends who might be interested and benefit from a constraint processing newsgroup but do not normally read these newsgroups nor are on the mailing lists. PROPOSED NAME AND STATUS ======================== comp.ai.constraints (unmoderated) RATIONALE ========= An increasing number of researchers all over the world are now dealing with different aspects of constraint processing regarded as a general paradigm of computation. However, the constraint processing community appears to be very heterogeneous: Researchers from logic programming, knowledge representation, expert systems, theoretical computer science, operations research and other related fields are investigating the use of constraint processing methods, their theoretical foundations, as well as their applications to real-life problems. Each of these communities has its own subgroup dealing with constraint processing issues, some of them with specialized meetings and workshops. Discussion on constraint processing issues is currently split over several newsgroups and mailing lists each dealing with constraint processing from different viewpoints. Thus, it appears that a common communication media is missing for the discussion of general issues and for initiating a cross-fertilization between the different communities. The proposed newsgroup is intended to provide an international forum for communication between researchers working on different aspects of con- straint processing in order to investigate similarities and differences between their basic viewpoints as well as to work out the common prin- ciples, vocabulary, and techniques that are used. PROPOSED CHARTER ================ BACKGROUND During the International Workshop on Constraint Processing at CSAM'93 in St. Petersburg (Russia) this summer, many participants expressed a need for a common forum to discuss all aspects of constraint processing from different viewpoints and to work out the common principles, techniques, and vocabulary, as well as to contrast and compare different approaches. TOPICS OF DISCUSSIONS Discussion and announcements on all aspects of constraint processing are welcome, including (but not limited to) * constraint-satisfaction methods and consistency techniques, * constraint logic programming, * concurrent constraint languages, * constraints and knowledge representation, * object-oriented constraint processing, * constraint programming, * constraint maintenance, * constraint relaxation techniques, * hierarchical constraint problems, * parallel and distributed computing with constraints, * finite as well as continous domain handling, * constraint processing in deductive databases, * relations to operations research, * complexity results, * theoretical foundations, * implementation techniques, * and, especially, real-life applications. PROCESS The normal group creation guidelines will be followed. Discussion will continue for 30 days from this posting, and after that, a Call for Votes (CFV) will be posted if appropriate. -- Manfred Meyer email: meyer@dfki.uni-kl.de German Research Center for AI (DFKI) phone: +49-631-205-3468 P. O. Box 2080, D-67608 Kaiserslautern fax: +49-631-205-3210 From meyer@dfki.uni-kl.de Thu Dec 16 15:48:42 1993 Path: uunet!bounce-back From: Manfred Meyer Newsgroups: news.announce.newgroups,news.groups,comp.ai,comp.ai.shells,comp.databases,comp.object,comp.lang.lisp,comp.lang.prolog,comp.programming,comp.graphics,de.sci.ki.announce Subject: 2nd RFD: comp.constraints Followup-To: news.groups Date: 15 Dec 1993 14:50:43 -0500 Organization: DFKI, University of Kaiserslautern, Germany Lines: 117 Sender: tale@uunet.uu.net Approved: tale@uunet.uu.net Message-ID: References: NNTP-Posting-Host: rodan.uu.net Xref: uunet news.announce.newgroups:4408 news.groups:90286 comp.ai:19922 comp.ai.shells:1354 comp.databases:32003 comp.object:14170 comp.lang.lisp:11503 comp.lang.prolog:9104 comp.programming:7749 comp.graphics:48495 de.sci.ki.announce:242 REQUEST FOR DISCUSSION (RFD) ============================ This is a formal Request for Discussion for the creation of a new second level newsgroup under the comp hierarchy. This RFD is being cross-posted to comp.ai, comp.ai.shells, comp.databases, comp.object, comp.lang.lisp, comp.lang.prolog, comp.programming, comp.graphics, de.sci.ki.announce, and news.announce.newgroups. It is also being mailed to mailing lists on CLP (clp@cs.cmu.edu), on CSP (csp-list@saturne.cert.fr), and the list of the German ALP branch (alp-list@intellektik.informatik.th-darmstadt.de). Discussion of this proposal is to take place in news.groups. Could people reading this post mention it to colleagues and friends who might be interested and benefit from a constraint processing newsgroup but do not normally read these newsgroups nor are on the mailing lists. The proposed newsgroup has previously been RFDed as comp.ai.constraints. During the discussion period it has been agreed to create the newsgroup under the name 'comp.constraints' because the topics to discuss here are only partly covered by the field of artificial intelligence (AI) as the previous title comp.ai.constraints would suggest. Constraint processing deals with the general paradigm of constraint-based computation and the newsgroup should thus be organized directly under the comp hierarchy. When trying to start the voting process for comp.constraints it appeared that the news.announce.newgroups moderator and other group-advice people do not like to include any new second level group unless they have been convinced that the proposed new newsgroup would really not fit below any other existing second level group. [[news.announce.newgroups moderator's note --- or that another embracing category cannot reasonably be made to hold the group and related groups.]] Therefore, a further discussion of the role of constraint processing and the name for the new newsgroup has become necessary --- any comments and suggestions, arguments pro and cons having a (second level) newsgroup on constraint processing etc. are most welcome! PROPOSED NAME AND STATUS ======================== comp.constraints (unmoderated) RATIONALE ========= An increasing number of researchers all over the world are now dealing with different aspects of constraint processing regarded as a general paradigm of computation. However, the constraint processing community appears to be very heterogeneous: Researchers from logic programming, knowledge representation, expert systems, theoretical computer science, operations research and other related fields are investigating the use of constraint processing methods, their theoretical foundations, as well as their applications to real-life problems. Each of these communities has its own subgroup dealing with constraint processing issues, some of them with specialized meetings and workshops. Discussion on constraint processing issues is currently split over several newsgroups and mailing lists each dealing with constraint processing from different viewpoints. Thus, it appears that a common communication media is missing for the discussion of general issues and for initiating a cross-fertilization between the different communities. The proposed newsgroup is intended to provide an international forum for communication between researchers working on different aspects of con- straint processing in order to investigate similarities and differences between their basic viewpoints as well as to work out the common prin- ciples, vocabulary, and techniques that are used. PROPOSED CHARTER ================ BACKGROUND During the International Workshop on Constraint Processing at CSAM'93 in St. Petersburg (Russia) this summer, many participants expressed a need for a common forum to discuss all aspects of constraint processing from different viewpoints and to work out the common principles, techniques, and vocabulary, as well as to contrast and compare different approaches. TOPICS OF DISCUSSIONS Discussion and announcements on all aspects of constraint processing are welcome, including (but not limited to) * constraint-satisfaction methods and consistency techniques, * constraint logic programming, * concurrent constraint languages, * constraints and knowledge representation, * object-oriented constraint processing, * constraint programming, * constraint maintenance, * constraint relaxation techniques, * hierarchical constraint problems, * parallel and distributed computing with constraints, * finite as well as continous domain handling, * constraint processing in deductive databases, constraints in SQL, * constraint processing in compilation for supercomputers, * constraint processing in computer graphics and user interfaces, * relations to operations research, * complexity results, * theoretical foundations, * implementation techniques, * and, especially, real-life applications. PROCESS The normal group creation guidelines will be followed. Discussion will continue for 21 days from this posting, and after that, a Call for Votes (CFV) will be posted if appropriate. -- ------------------------------------------------------------------------ Manfred Meyer email: meyer@dfki.uni-kl.de German Research Center for AI (DFKI) phone: +49-631-205-3468 P. O. Box 2080, D-67608 Kaiserslautern fax: +49-631-205-3210 From rdippold@qualcomm.com (RonDippold) Wed Jan 12 20:19:35 1994 Path: uunet!bounce-back From: rdippold@qualcomm.com (Ron "Asbestos" Dippold) Newsgroups: news.announce.newgroups,news.groups,comp.ai,comp.ai.shells,comp.databases,comp.object,comp.lang.lisp,comp.lang.prolog,comp.programming,comp.graphics Subject: CFV: comp.constraints Followup-To: poster Date: 9 Jan 1994 22:50:09 -0500 Organization: Usenet Volunteer Votetakers Lines: 92 Sender: tale@uunet.uu.net Approved: tale@uunet.uu.net Expires: 1 Feb 1994 00:00:00 GMT Message-ID: References: Reply-To: voting@qualcomm.com (Ron Dippold Voting Alias) NNTP-Posting-Host: rodan.uu.net Xref: uunet news.announce.newgroups:4456 news.groups:91611 comp.ai:20121 comp.ai.shells:1373 comp.databases:32364 comp.object:14482 comp.lang.lisp:11615 comp.lang.prolog:9168 comp.programming:7988 comp.graphics:49258 FIRST CALL FOR VOTES (of 2) unmoderated group comp.constraints Newsgroups line: comp.constraints Constraint processing and related topics. Votes must be received by 23:59:59 UTC, 31 January 1994. After this CFV appears in news.announce.newgroups it will be mailed by the votetaker to the following mailing lists: German Branch of the ALP , CLP mailing list , CSP mailing list . This vote is being conducted by a neutral third party. For voting questions only contact rdippold@qualcomm.com. For questions about the proposed group contact Manfred Meyer . CHARTER During the International Workshop on Constraint Processing at CSAM'93 in St. Petersburg (Russia) this summer, many participants expressed a need for a common forum to discuss all aspects of constraint processing from different viewpoints and to work out the common principles, techniques, and vocabulary, as well as to contrast and compare different approaches. TOPICS OF DISCUSSIONS Discussion and announcements on all aspects of constraint processing are welcome, including (but not limited to) * constraint-satisfaction methods and consistency techniques, * constraint logic programming, * concurrent constraint languages, * constraints and knowledge representation, * object-oriented constraint processing, * constraint programming, * constraint maintenance, * constraint relaxation techniques, * hierarchical constraint problems, * parallel and distributed computing with constraints, * finite as well as continous domain handling, * constraint processing in deductive databases, constraints in SQL, * constraint processing in compilation for supercomputers, * constraint processing in computer graphics and user interfaces, * relations to operations research, * complexity results, * theoretical foundations, * implementation techniques, * and, especially, real-life applications. An increasing number of researchers all over the world are now dealing with different aspects of constraint processing regarded as a general paradigm of computation. However, the constraint processing community appears to be very heterogeneous: Researchers from logic programming, knowledge representation, expert systems, theoretical computer science, operations research and other related fields are investigating the use of constraint processing methods, their theoretical foundations, as well as their applications to real-life problems. Each of these communities has its own subgroup dealing with constraint processing issues, some of them with specialized meetings and workshops. Discussion on constraint processing issues is currently split over several newsgroups and mailing lists each dealing with constraint processing from different viewpoints. Thus, it appears that a common communication media is missing for the discussion of general issues and for initiating a cross-fertilization between the different communities. The proposed newsgroup is intended to provide an international forum for communication between researchers working on different aspects of con- straint processing in order to investigate similarities and differences between their basic viewpoints as well as to work out the common prin- ciples, vocabulary, and techniques that are used. HOW TO VOTE Send MAIL to: voting@qualcomm.com Just Replying should work if you are not reading this on a mailing list. Your mail message should contain one of the following statements: I vote YES on comp.constraints I vote NO on comp.constraints You may also ABSTAIN in place of YES/NO - this will not affect the outcome. Anything else may be rejected by the automatic vote counting program. The votetaker will respond to your received ballots with a personal acknowledge- ment by mail - if you do not receive one within several days, try again. It's your responsibility to make sure your vote is registered correctly. Only one vote per person and per account will be counted. Addresses and votes of all voters will be published in the final voting results list. From rdippold@qualcomm.com (RonDippold) Sat Jan 22 17:58:52 1994 Path: uunet!bounce-back From: rdippold@qualcomm.com (Ron "Asbestos" Dippold) Newsgroups: news.announce.newgroups,news.groups,comp.ai,comp.ai.shells,comp.databases,comp.object,comp.lang.lisp,comp.lang.prolog,comp.programming,comp.graphics Subject: 2nd CFV: comp.constraints Supersedes: Followup-To: poster Date: 22 Jan 1994 17:14:23 -0500 Organization: Usenet Volunteer Votetakers Lines: 100 Sender: tale@uunet.uu.net Approved: tale@uunet.uu.net Expires: 1 Feb 1994 00:00:00 GMT Message-ID: References: Reply-To: voting@qualcomm.com (Ron Dippold Voting Alias) NNTP-Posting-Host: rodan.uu.net Xref: uunet news.announce.newgroups:4499 news.groups:92728 comp.ai:20315 comp.ai.shells:1394 comp.databases:32646 comp.object:14760 comp.lang.lisp:11720 comp.lang.prolog:9297 comp.programming:8190 comp.graphics:49928 LAST CALL FOR VOTES (of 2) unmoderated group comp.constraints Newsgroups line: comp.constraints Constraint processing and related topics. Votes must be received by 23:59:59 UTC, 31 January 1994. After this CFV appears in news.announce.newgroups it will be mailed by the votetaker to the following mailing lists: German Branch of the ALP , CLP mailing list , CSP mailing list . This vote is being conducted by a neutral third party. For voting questions only contact rdippold@qualcomm.com. For questions about the proposed group contact Manfred Meyer . CHARTER During the International Workshop on Constraint Processing at CSAM'93 in St. Petersburg (Russia) this summer, many participants expressed a need for a common forum to discuss all aspects of constraint processing from different viewpoints and to work out the common principles, techniques, and vocabulary, as well as to contrast and compare different approaches. TOPICS OF DISCUSSIONS Discussion and announcements on all aspects of constraint processing are welcome, including (but not limited to) * constraint-satisfaction methods and consistency techniques, * constraint logic programming, * concurrent constraint languages, * constraints and knowledge representation, * object-oriented constraint processing, * constraint programming, * constraint maintenance, * constraint relaxation techniques, * hierarchical constraint problems, * parallel and distributed computing with constraints, * finite as well as continous domain handling, * constraint processing in deductive databases, constraints in SQL, * constraint processing in compilation for supercomputers, * constraint processing in computer graphics and user interfaces, * relations to operations research, * complexity results, * theoretical foundations, * implementation techniques, * and, especially, real-life applications. An increasing number of researchers all over the world are now dealing with different aspects of constraint processing regarded as a general paradigm of computation. However, the constraint processing community appears to be very heterogeneous: Researchers from logic programming, knowledge representation, expert systems, theoretical computer science, operations research and other related fields are investigating the use of constraint processing methods, their theoretical foundations, as well as their applications to real-life problems. Each of these communities has its own subgroup dealing with constraint processing issues, some of them with specialized meetings and workshops. Discussion on constraint processing issues is currently split over several newsgroups and mailing lists each dealing with constraint processing from different viewpoints. Thus, it appears that a common communication media is missing for the discussion of general issues and for initiating a cross-fertilization between the different communities. The proposed newsgroup is intended to provide an international forum for communication between researchers working on different aspects of con- straint processing in order to investigate similarities and differences between their basic viewpoints as well as to work out the common prin- ciples, vocabulary, and techniques that are used. HOW TO VOTE Send MAIL to: voting@qualcomm.com Just Replying should work if you are not reading this on a mailing list. Your mail message should contain one of the following statements: I vote YES on comp.constraints I vote NO on comp.constraints You may also ABSTAIN in place of YES/NO - this will not affect the outcome. Anything else may be rejected by the automatic vote counting program. The votetaker will respond to your received ballots with a personal acknowledge- ment by mail - if you do not receive one within several days, try again. It's your responsibility to make sure your vote is registered correctly. Only one vote per person and per account will be counted. Addresses and votes of all voters will be published in the final voting results list. unmoderated group comp.constraints Bounce Ack List - no need to revote ------------------------------------------------------------------------------ cegli@hcsd.hac.com.I.vote.YES.on.comp.constraints luc@cc.drev.dnd.ca ret@chenas.inria.fr rodosek@dfd.dlr.de From rdippold@qualcomm.com (RonDippold) Fri Feb 4 16:18:15 1994 Path: uunet!bounce-back From: rdippold@qualcomm.com (Ron "Asbestos" Dippold) Newsgroups: news.announce.newgroups,news.groups,comp.ai,comp.ai.shells,comp.databases,comp.object,comp.lang.lisp,comp.lang.prolog,comp.programming,comp.graphics Subject: RESULT: comp.constraints passes 501:13 Supersedes: Followup-To: news.groups Date: 4 Feb 1994 16:07:06 -0500 Organization: Usenet Volunteer Votetakers Lines: 611 Sender: tale@uunet.uu.net Approved: tale@uunet.uu.net Message-ID: References: NNTP-Posting-Host: rodan.uu.net Xref: uunet news.announce.newgroups:4576 news.groups:94278 comp.ai:20518 comp.ai.shells:1417 comp.databases:32947 comp.object:15014 comp.lang.lisp:11804 comp.lang.prolog:9452 comp.programming:8329 comp.graphics:50598 RESULT unmoderated group comp.constraints passes 501:13 There were 501 YES votes and 13 NO votes, for a total of 514 valid votes. There were 2 abstains and 1 invalid ballot. For group passage, YES votes must be at least 2/3 of all valid (YES and NO) votes. There also must be at least 100 more YES votes than NO votes. There is a five day discussion period after these results are posted. If no serious allegations of voting irregularities are raised, the moderator of news.announce.newgroups will create the group shortly thereafter. Newsgroups line: comp.constraints Constraint processing and related topics. This vote was conducted by a neutral third party. For voting questions only contact rdippold@qualcomm.com. For questions about the proposed group contact Manfred Meyer . CHARTER During the International Workshop on Constraint Processing at CSAM'93 in St. Petersburg (Russia) this summer, many participants expressed a need for a common forum to discuss all aspects of constraint processing from different viewpoints and to work out the common principles, techniques, and vocabulary, as well as to contrast and compare different approaches. TOPICS OF DISCUSSIONS Discussion and announcements on all aspects of constraint processing are welcome, including (but not limited to) * constraint-satisfaction methods and consistency techniques, * constraint logic programming, * concurrent constraint languages, * constraints and knowledge representation, * object-oriented constraint processing, * constraint programming, * constraint maintenance, * constraint relaxation techniques, * hierarchical constraint problems, * parallel and distributed computing with constraints, * finite as well as continous domain handling, * constraint processing in deductive databases, constraints in SQL, * constraint processing in compilation for supercomputers, * constraint processing in computer graphics and user interfaces, * relations to operations research, * complexity results, * theoretical foundations, * implementation techniques, * and, especially, real-life applications. An increasing number of researchers all over the world are now dealing with different aspects of constraint processing regarded as a general paradigm of computation. However, the constraint processing community appears to be very heterogeneous: Researchers from logic programming, knowledge representation, expert systems, theoretical computer science, operations research and other related fields are investigating the use of constraint processing methods, their theoretical foundations, as well as their applications to real-life problems. Each of these communities has its own subgroup dealing with constraint processing issues, some of them with specialized meetings and workshops. Discussion on constraint processing issues is currently split over several newsgroups and mailing lists each dealing with constraint processing from different viewpoints. Thus, it appears that a common communication media is missing for the discussion of general issues and for initiating a cross-fertilization between the different communities. The proposed newsgroup is intended to provide an international forum for communication between researchers working on different aspects of con- straint processing in order to investigate similarities and differences between their basic viewpoints as well as to work out the common prin- ciples, vocabulary, and techniques that are used. unmoderated group comp.constraints Final Vote Ack Voted Yes ------------------------------------------------------------------------------ A.Fajner@frtb.bull.fr Alain.Fajner A.Sattar@cit.gu.edu.au Abdul Sattar aabecker@dfki.uni-kl.de Andreas Abecker abramson@verdi.sra.com Myriam Abramson x7815 ad187@city.ac.uk adams@cs.wisc.edu Paul Adams ado@bigcomm.gun.de Christoph Adomeit Agata.Wrzos-Kaminska@idt.unit.no aiba@icot.or.jp Aiba Akira alaoui@ilog.ilog.fr Younes Alaoui alb@ipvaim.unipv.it Alberto Riva albert@ilog.ilog.fr Patrick Albert Alexander.Herold@ecrc.de Alexander Herold alf@sics.se Thomas Sjoeland allan@sis.yorku.ca Allan Cobb alt@fzi.de Jochen Alt amci@dcs.ed.ac.uk andrei@uni.irkutsk.su Andrei V. Mantsivoda anton@mips.complang.tuwien.ac.at Anton Ertl aoe@doc.ic.ac.uk Amin O. El-Kholy apanoiu@roearn.ici.ro apt@ncc.up.pt Ana Paula Tomas Arthur.Chance@Smallworld.co.uk Arthur Chance arvind@cs.ait.ac.th C. Aravindan askuechl@faui80.informatik.uni-erlangen.de Andreas Kuechler asma@lamport.rhon.itam.mx Alfonso San Miguel A. astrid@dfki.uni-sb.de Astrid Scheller-Houy ault@cs.albany.edu Jim Ault bach@iis.ee.ethz.ch Carlo Bach bachmann@dfki.uni-kl.de bagnara@DI.UniPi.IT Roberto Bagnara bai@Cs.Nott.AC.UK Bai Li bakker@cs.utwente.nl Rene Bakker balasub@instruction.CS.ORST.EDU Bhanurekha Balasubramaniam baldwin@brastias.cs.geneseo.edu barth@mpi-sb.mpg.de Peter Barth bastaeni@hp817s.rz.uni-duesseldorf.de Christoph Bastaenier bayardo@cs.utexas.edu Roberto Bayardo benham@gia.univ-mrs.fr Frederic Benhamou bernhard@mail2.ai.univie.ac.at Bernhard Pfahringer Bertrand.Neveu@sophia.inria.fr Bertrand Neveu bhyde@gensym.com Ben Hyde billb@ripley.sunquest.com Bill Burcham bimbart@cs.kuleuven.ac.be Bart Demoen bjornc@sics.se bkr@melb.bull.oz.au Bret Krieger blatz@cs.uni-sb.de Bernhard Latz blk@orbit.dalmatian.com Barry Kaplan bludov@uni.irkutsk.su Vasiliy V. Bludov bmayoh@daimi.aau.dk bmcphers@alias.com Brent McPherson bnfb@ursaminor.scs.carleton.ca Bjorn Freeman-Benson bobak@nemo.life.uiuc.edu Michael Bobak bockmayr@mpi-sb.mpg.de Alexander Bockmayr bogdan@erix.ericsson.se Bogumil Hausman bohusc@storm.cs.orst.edu boizu@ucoima.math-appli-uco.fr Patrice Boizumault boley@informatik.uni-kl.de Harold Boley borning@cs.washington.edu Alan Borning bouvin@daimi.aau.dk Niels Olof Bouvin Brad.Myers@BAM.GARNET.CS.CMU.EDU britt@tigercat.den.mmc.com Dan Britt brzoska@ira.uka.de Christoph Brzoska bslawson@phobos.astro.uwo.ca Bob Slawson bts@quintus.com Bruce Smith burnett@research.CS.ORST.EDU Margaret Burnett butler@aaii.oz.au Jim Butler Carlos.Cardeira@loria.fr Carlos Cardeira Carmen.Gervet@ecrc.de Carmen Gervet caseau@bellcore.com Yves J Caseau castelli@mac-castelli.iei.pi.cnr.it Donatella Castelli catuscia@di.unipi.it cckwanwh@uxmail.ust.hk Mr. Paul W.H. KWAN cegli@hcsd.hac.com.I.vote.YES.on.comp.constraints Christian Egli cengarle@informatik.uni-muenchen.de Maria Victoria Cengarle cerious@char.vnet.net Phillip Crews chaillou@ilog.ilog.fr Jerome Chailloux Cheng-Chung.Cheng@BLOB.CIMDS.RI.CMU.EDU chomicki@cis.ksu.edu Jan Chomicki choueiry@lia.di.epfl.ch Berthe Y. Choueiry chris@eurdev.eurassi.co.za Chris Ruprecht Christian.Codognet@ens.fr Christian Codognet christian@ai.univie.ac.at Christian Holzbaur Claude.Kirchner@loria.fr Claude Kirchner cmacleod@mcs.dundee.ac.uk Colin Macleod CMLUI@BCSC02.GOV.BC.CA Chuck Lui corron@masi.ibp.fr Gilles CORRON csc6bms@gps1.leeds.ac.uk B M Smith cuno@arti9.vub.ac.be Cuno Duursma dac@biu.icnet.uk Dominic Clark - BIU dagk@protek.unit.no damost@shaddam.usb.ve LDC - Daniel Mostacero dan@sics.se Dan Sahlin danher@informatik.tu-muenchen.de Daniel Hernandez Darko.Zupanic@IJS.si dave.bowen@quintus.com David Bowen dave@delphi.bsd.uchicago.edu Dave Griffith daveat@essex.ac.uk Davenport A J davew@cs.UMD.EDU David G. Wonnacott DBROWNE@diamond.kbsi.com David C. Browne deacon@inf.ethz.ch Andrew Deacon dikker@cs.utwente.nl Frank Dikker Dirk.Dussart@cs.kuleuven.ac.be Dirk Dussart djangk@storm.cs.orst.edu Djang Kevin Stacey DJEVANS%ESOC.BITNET@vm.gmd.de Dave Evans ECNOD/TSS dkenny@swell.actrix.gen.nz Dmitri.Boulanger@cs.kuleuven.ac.be Dmitri Boulanger dobrowiecki@mmt.bme.hu dohmen@duticg.twi.tudelft.nl Maurice Dohmen drayer@minerva.cis.yale.edu Rebecca Drayer dridi@dfki.uni-kl.de Fredj Dridi drouven@cs.tu-berlin.de Uwe Drouven ds1@kepler.unh.edu Daniel Sabin dsiegel@panix.com David Siegel dubin@ilog.com Joseph Dubin dufourd@elec.enst.fr Jean-Claude Dufourd DVERRIER%ESOC.BITNET@vm.gmd.de D. Verrier dwampl@atl.com Dean Wampler (dwampl@atl.com) dziadzka@ai-lab.fh-furtwangen.de Mirko Dziadzka eamoore@billerica.applicon.slb.com Eric Moore ebubra@ebu.ericsson.se Bertil Askelid ecf@chuck.cs.unh.edu Gene Freuder ejr@cs.UMD.EDU Evan Rosser emacinty@cs.strath.ac.uk epontell@NMSU.Edu erich@vnacsu.enet.dec.com Erich Kreisler erik@abalon.se Erik Westlin esantos@afit.af.mil Eugene Santos Jr. etr@doc.ic.ac.uk Thomas Richards evelina@deis33.cineca.it Evelina Lamma falko@ikmfbs.ing.tu-bs.de Falko Sauermann fbarber@dsic.upv.es Federico A. Barber feldman@bimacs.cs.biu.ac.il Ronen Feldman fernando@ims.uni-stuttgart.de Tim Fernando FHCAA46@cc1.kuleuven.ac.be Gunter Loos fhd@panix.com Frank Deutschmann finleyd@ukelele.GCR.COM David Finley fjjunge@cs.vu.nl F.J. Jungen France.Dacar@IJS.si Francois.Fages@ens.fr Francois Fages Frank_Pfenning@ALONZO.TIP.CS.CMU.EDU Frank Pfenning freeman@gradient.cis.upenn.edu Jon W. Freeman frits@rulglj.LeidenUniv.nl Frits Daalmans fromherz@parc.xerox.com Markus Fromherz gadi@black.bgu.ac.il solotorvsky gadi gaines@cpsc.ucalgary.ca Brian Gaines galadan@csd.uwo.ca Michael Dent galagun@jemez.cs.sandia.gov Glenn A. Laguna gebhardt@picasso.informatik.rwth-aachen.de Michael Gebhardt Geir.Hasle@si.sintef.no gelle@lia.di.epfl.ch Esther Gelle Gerda.Janssens@cs.kuleuven.ac.be Gerda Janssens geske@prosun.first.gmd.de Ulrich Geske giba@gte.com Glenn A. Iba Gilles.Trombettoni@sophia.inria.fr Gilles Trombettoni ginsberg@cs.uoregon.edu Matthew L. Ginsberg giovanna@sia.cise.it Giovanna Dondossola gnpaulle@bluebox.UWaterloo.ca Glenn Paulley graf@dfki.uni-sb.de Winfried Graf Greet.Bilsen@esat.kuleuven.ac.be gregory@cs.sfu.ca Gregory Sidebottom griffith@sfs.nphil.uni-tuebingen.de John Griffith grivas@inf.ethz.ch Georgios Grivas gross@inf.ethz.ch Roman Gross grosse@ares.informatik.uni-ulm.de Malte Grosse gupta@NMSU.Edu gv@chuck.cs.unh.edu Gerard Verfaillie gwydion@gnu.ai.mit.edu Basalat ALi Raja Hakan.Millroth@csd.uu.se H}kan Millroth Hans.van.Hintum@cwi.nl hans@cs.aukuni.ac.nz Hans Guesgen hans@erix.ericsson.se Hans Nilsson hanschke@dfki.uni-kl.de Philipp Hanschke hanyi@bruce.cs.monash.edu.au Han Yi harald@cs.mu.OZ.AU havens@cs.sfu.ca Bill Havens hein@dfki.uni-kl.de Hans-Guenther Hein helz@ecn.purdue.edu Randall A Helzerman Henk.Vandecasteele@cs.kuleuven.ac.be Henk Vandecasteele henz@dfki.uni-sb.de Martin Henz herault@dsys.ceng.cea.fr Laurent Herault herme@clip.dia.fi.upm.es Manuel Hermenegildo herzog@ira.uka.de Uwe Herzog hester_tom@smtpmac.bah.com Hester Tom hinkelma@dfki.uni-kl.de Knut Hinkelmann hkirchne@loria.fr Helene Kirchner hmf%rwtwzv.uucp@Germany.EU.net Hans Marggraff hoefling@dfki.uni-kl.de Bjoern Hoefling hoehle@post.inf-wiss.ivp.uni-konstanz.de Joerg-Cyril Hoehle hoellere@informatik.tu-muenchen.de Fr. Hoellerer Hubert.Comon@lri.fr Hubert Comon hulthage@torsk.usc.edu Ingemar Hulthage hutch@redrock.com Bob Hutchison i3160503@ws.rz.tu-bs.de ockemeyer ia@biu.icnet.uk Iain Archer - BIU iain@cs.strath.ac.uk icheckle@orca1.vic.design.telecom.com.au Ian Checkley ilya@uni.irkutsk.su Ilya S. Abdrakhimov imbert@gia.univ-mrs.fr Jean-Louis Imbert Ingvar.Eidhammer@ii.uib.no izambo@uranus.di.uoa.ariadne-t.gr Izambo Karali J.P.Wilks@computer-science.birmingham.ac.uk Jacek.Wrzos-Kaminski@idt.unit.no jackson@cs.sfu.ca Ken Jackson jacob@blackbox.enmu.edu Jacob Gore Jacques.Cohen@imag.fr Jacques Cohen Jacques.Noye@irisa.fr Jacques Noye jak@cs.man.ac.uk J A Keane jampel@cs.city.ac.uk Michael Jampel jeffc@hpcvusc.cv.hp.com Jeff Cavener jeffmar@umiacs.UMD.EDU Jeffery D Martin Jerome.Gensel@imag.fr Jerome Gensel jfh@matilda.vut.edu.au John Horwood jga@harlequin.com John Aspinall jm0@engr.uark.edu Jerry Mathew jm@sics.se jmc3@jconrad.engr.uark.edu Dr. James M. Conrad joachim@nada.kth.se joanne@sst.icl.co.uk Joanne Dicker joohwee@iss.nus.sg Joo Hwee joslin@cs.pitt.edu David Joslin joxan@watson.ibm.com jpa@llaor.unice.fr Jean-Pierre Angoujard jpm@dfki.uni-sb.de Joerg Mueller jsa@cs.man.ac.uk Jin Sa juergen.walther@gmd.de Juergen Walther justict@research.CS.ORST.EDU juwang@icaen.uiowa.edu Juite Wang kamp@informatik.uni-hamburg.de kay@mercury.cosytec.fr Philip Kay keller@muddcs.cs.hmc.edu Robert M. Keller Ken.Brown@bristol.ac.uk BrownKN khan@hebron.connected.com Erik Seaberg khan@itd.nrl.navy.mil Umar Khan kirsch@ENH.NIST.GOV Russell A. Kirsch kiselev@uni.irkutsk.su Konstantin V. Kiselev kjellt@ii.uib.no kjx@Comp.VUW.AC.NZ R James Noble kk@cs.ait.ac.th Kanchana Kanchanasut kokeny@lirmm.fr Tibor Kokeny konstan@cs.umn.edu Joe Konstan konstant@qucis.queensu.ca Konstantinos Konstantoulis Kowalczyk_Richard/perth@perth.atd.cra.com.au krishna@media.mit.edu B. C. Krishna Kristof.VanBelleghem@cs.kuleuven.ac.be Kristof Van Belleghem krussll@CC.UManitoba.CA ksb@cs.UMD.EDU Kelvin Bryant kubek@insage.insa-tlse.fr J.Marie Kubek L15D@ZFN.UNI-BREMEN.DE Martin Schroeder Laurent.Trilling@imag.fr Laurent Trilling laurent@toshiba.tic.oz.au Laurent Meister lehmke@lysithea.informatik.uni-dortmund.de Stephan Lehmke lemke@dfki.uni-kl.de Oliver Lemke lemoine@citroen.cert.fr Michel Lemoine lenngray@netcom.com Lenny Gray lepape@ilog.ilog.fr Claude Le Pape levy@ilog.ilog.fr Bruno Levy liberte@cs.uiuc.edu Daniel LaLiberte LOCK%DHDIBM1.BITNET@vm.gmd.de loofbour@cis.ohio-state.edu Nathan Loofbourrow lopez@laas.fr Pierre Lopez Luc.DeRaedt@cs.kuleuven.ac.be Luc De Raedt luc@cc.drev.dnd.ca Luc Lamontagne lunna@essex.ac.uk Lunness A P lutzy@dfki.uni-kl.de Ottmar Lutzy lynch@ils.nwu.edu Richard Lynch M.Eisenstadt@open.ac.uk Marc Eisenstadt M.Paltrinieri@frcl.bull.fr Massimo.Paltrinieri mack@cs.ubc.ca Alan Mackworth maeder@inf.ethz.ch Roman Maeder mafm@cs.uwa.edu.au Matthew McDonald mandel@informatik.uni-muenchen.de Luis Mandel mantha@wrc.xerox.com Surya Mantha Marc.Corsini@labri.u-bordeaux.fr Marc-Michel CORSINI Marcel.Holsheimer@cwi.nl Mark.Wallace@ecrc.de Mark Wallace Marko.Grobelnik@IJS.si marriott@bruce.cs.monash.edu.au marti@thorgal.unice.fr Marti Philippe martin@CS.UCLA.EDU david l. martin matsc@sics.se Mats Carlsson mbridge@halcyon.com Mike Templeman mchapple@aristotle.helios.nd.edu michael chapple mcvil@lirmm.fr Marie-Cath. Vilarem mehl@dfki.uni-sb.de Michael Mehl meinolf@pz-oekosys.uni-kiel.d400.de MEINOLF ASSHOFF meltsner@ctc.com Ken Meltsner menju@swl.cl.nec.co.jp MENJU Satoshi mescbm@di.uminho.pt Carlos Baquero meyer@dfki.uni-kl.de Manfred Meyer mfx@cs.tu-berlin.de Markus Freericks mg@ulysses.att.com mgv@usceast.cs.scarolina.edu Marco Valtorta mhaor@conicit.ve Moises Haor (USB) mheuboe!annelie@urmel.informatik.rwth-aachen.de mheuboe!fahid@urmel.informatik.rwth-aachen.de Michael.Salmon@eos.ericsson.se Michael Salmon Michael.Sierchio@EBay.Sun.COM Michael Sierchio michel.dao@issy.cnet.fr Michel DAO mig@ncc.up.pt Miguel Filgueiras minton@ptolemy-ethernet.arc.nasa.gov Steve Minton missura@inf.ethz.ch Stephan Missura mjm@watson.ibm.com Michael J. Maher mklein@atc.boeing.com mmarkley@microsoft.com Mike Markley mmr@informatik.uni-kl.de Prof. Richter DFKI mmt@RedBrick.COM Maxime Taksar KC6ZPS mmueller@dfki.uni-sb.de Martin Mueller mpp@icad.COM Marty Plotkin mr@essi2.cerisi.fr msk@doc.ic.ac.uk Manolis S Koubarakis mst@vexpert.dbai.tuwien.ac.at Markus Stumptner murka@cs.UMD.EDU Tatiana Shpeisman murray@rmcmath.rmc.ca Mike Murray mwatkins@dsd.es.com Mark Watkins mwhite@linc.cis.upenn.edu Michael White nholtz@ccs.carleton.ca Neal Holtz Nicolas.Chleq@sophia.inria.fr Nicolas Chleq niehren@dfki.uni-sb.de Joachim Niehren nik@uni.irkutsk.su Nikolai A. Peryazev nix@COBOL.FOX.CS.CMU.EDU Nick Thompson nmj@ICSEAAda.levels.unisa.edu.au Nick Jeitner nuijten@win.tue.nl Wim Nuijten nutt@dfki.uni-sb.de Werner Nutt Olga.Caprotti@risc.uni-linz.ac.at Olga Caprotti P.J.Soper@ecs.southampton.ac.uk Paul Soper pao@ai.mit.edu Patrick A. O'Donnell parama@cs.unc.edu Paramasivam pat@cs.strath.ac.uk patl@goldfish.mitron.tek.com Patrick Logan pb@harar.unice.fr Philippe Blache pesant@iro.umontreal.ca Gilles Pesant pete@sharp.co.uk Pete Whitelock Peter.Schotman@USERS.INFO.WAU.NL Petr.Lisonek@risc.uni-linz.ac.at Petr LISONEK petrie@sunrise.stanford.edu pets@cs.mu.OZ.AU pgeorge@bailey.com Paul C. George ph@anweald.exnet.co.uk Patrick Herring phand@arch.adelaide.edu.au Peter Hand Philippe.Charman@sophia.inria.fr Philippe Charman Philippe.Codognet@inria.fr Philippe Codognet pjs@cs.mu.OZ.AU Peter Stuckey pkron@corona.com Peter Kron prangana@stern.nyu.edu Nicky Ranganathan puget@ilog.ilog.fr Jean-Francois Puget pugh@cs.UMD.EDU Bill Pugh pulkka@cs.washington.edu Aaron Kaleva Pulkka quinn@phoenix.Princeton.EDU Michael J. Quinn quinton@cs.uct.ac.za Quinton Hoole quiroz@cs.rochester.edu Cesar A Quiroz ralexand@mason1.gmu.edu Roger T Alexander Raoul.Vorch@irisa.fr Raoul Vorc'h RBAHGAT@vrit01.eg regin@lirmm.fr reich@austin.lockheed.com l Reich Remco.Moolenaar@cs.kuleuven.ac.be Remco Moolenaar remco@info.win.tue.nl Remco Veltkamp Rene.Quiniou@irisa.fr Rene Quiniou renga@blanco.cs.uoregon.edu ret@chenas.inria.fr Philippe RETIF ricci@irst.it Francesco Ricci richard@cit.gu.edu.au Richard DALEK rick@bcm.tmc.edu Richard H. Miller rico.cozzio@chcrc.abb.ch Rico Cozzio rmc@toulouse.inra.fr Roger MARTIN-CLOUAIRE robert@cae.ca Robert Prager rodosek@dfd.dlr.de Robert Rodosek roland@bruce.cs.monash.edu.au Roland Yap roman@mmt.bme.hu Roman Gyula rpandey@research.CS.ORST.EDU (Rajeev K. Pandey) rthomson@dsd.es.com Rich Thomson rw@arch.adelaide.edu.au Robert Woodbury ryan.bayne@canrem.com Ryan Bayne R_Mugridge@cs.aukuni.ac.nz Rick Mugridge sakai@is.tsukuba.ac.jp SAKAI Ko sam@engr.engr.uark.edu Dr. Susan A. Mengel sammy@icarus.smds.com Samuel Murphy san@sics.se sannella@cs.washington.edu Michael Sannella saraswat@parc.xerox.com Vijay Saraswat sasi@saathi.ncst.ernet.in Sasikumar M sawtelle@stonecutter.com Don Sawtelle scgk@dcs.ed.ac.uk Simon Kinahan schiex@thalassa.cert.fr Thomas Schiex schlegel@zaphod.in.tu-clausthal.de Juergen Schlegelmilch schoelle@dfki.uni-kl.de Anne Schoeller schrag@cs.utexas.edu Robert C. Schrag schulte@dfki.uni-sb.de Christian Schulte schulz@uran10.informatik.uni-bonn.de Dirk Schulz sekar@ms.uky.edu Arcot Rajasekar shane@spr.com Shane Hartman shrdlu@willow.sdd.trw.com Lynda L. True Shyam.Mudambi@ecrc.de Shyam Mudambi simuni@tor.spb.su Michael Simuni sintek@dfki.uni-kl.de Michael Sintek sivand@Eng.Auburn.EDU Sivand Lakmazaheri slkleinman@amoco.com Steve Kleinman smd@media.mit.edu Steven Drucker smith@lia.di.epfl.ch Ian Smith smolka@dfki.uni-sb.de Gert Smolka solo@hq.math.lgu.spb.su Igor P. Soloviev solo@uni.irkutsk.su Kostantin N. Solovienko speel@cs.utwente.nl Piet Speel spiro@cis.ohio-state.edu Spiro Michaylov squires@mne.com Gregg Squires sshankar@cs.umn.edu Subash Shankar stein@informatik.uni-kl.de Werner Stein stein@uni-paderborn.de Benno Stein steiner@iesd.auc.dk Jens Steiner steiner@inf.ethz.ch Andreas Steiner steinle@dfki.uni-kl.de Frank stelio@illiac.lysis.ch Stelio Tzonis Stephan@RWTH-Aachen.DE KLAUS STEPHAN Steven.Pemberton@cwi.nl sto@cs.hut.fi Seppo T|rm{ stu@valinor.mythical.com Stu Labovitz sudarsha@research.att.com S. Sudarshan suresh@iss.nus.sg Suresh Thennarangam surjan@mmt.bme.hu Surj\an L\aszl\s: Sven-Olof.Nystrom@csd.uu.se Sven-Olof Nystrom sverker@sics.se swildner@channelz.gun.de Sascha Wildner szeredi@iqsoft.hu Peter Szeredi tadepall@research.CS.ORST.EDU Prasad Tadepalli takikawm@research.CS.ORST.EDU TAKIKAWA MASAMI takis@uranus.di.uoa.ariadne-t.gr Takis Stamatopoulos tangaroa@werple.apana.org.au Simon Crase thaddeus@vuse.vanderbilt.edu Thaddeus R. Crews Thierry.LeProvost@ecrc.de Thierry Le Provost thierry@laas.fr Thierry Vidal thomas@gris.informatik.uni-tuebingen.de Thomas Grunert tilly@mmt.bme.hu tim@sol.cs.brandeis.edu Timothy Hickey timd@aisb.edinburgh.ac.uk Tim Duncan Timo.Rinne@hut.fi Timo Rinne tmgeisle@faui80.informatik.uni-erlangen.de Tim Geisler tmueller@dfki.uni-sb.de Tobias Mueller torkel@sics.se trans@carnap.srl.ford.com Advanced Transmission treinen@dfki.uni-sb.de Ralf Treinen tsaoj@cs.tamu.edu Jungfu Tsao tsarcho@dfki.uni-kl.de Panagiotis Tsarchopoulos tschaits@dfki.uni-kl.de Bidjan Tschaitschian turcotte@BCH.UMontreal.CA Marcel TURCOTTE twombly@credtech.com Christopher Twombly twood@tcis3.tcis.com Thomas A Wood uli@zoodle.RoBIN.de Ulrich Grepel unruh@latte.spdc.ti.com Amy Unruh uribe@CS.Stanford.EDU Tomas Uribe ute@intellektik.informatik.th-darmstadt.de Ute Sigmund uwe@mpi-sb.mpg.de Uwe Waldmann vadik@cs.UMD.EDU Vadim Maslov vagelis@eng.auth.gr Vagelis Vassiliadis vaidyana@cis.uab.edu Viswanathan Vaidyana vaillant@POOL.Informatik.RWTH-Aachen.DE valent@ii.uib.no Valentinas Kriauciukas vanbeek@cs.ualberta.ca Peter van Beek vanroy@prl.dec.com vellino@bnr.ca andre (a.n.) vellino ven@info.fundp.ac.be Vincent ENGLEBERT Vera.Kamp@arbi.informatik.uni-oldenburg.de Vera Kamp verkoule@cs.utwente.nl Peter A.C. Verkoulen Veroniek.Dumortier@cs.kuleuven.ac.be Veroniek Dumortier vlasier@essi.cerisi.fr Vlasie Romulus Dan voronkov@csd.uu.se Andrei Voronkov vr@cs.brown.edu wache@dfki.uni-kl.de Holger Wache wagnermi@informatik.tu-muenchen.de Wagner Michael wak@cs.UMD.EDU Wayne Kelly walter@informatik.uni-koblenz.de wardcf@essex.ac.uk Ward C O warren@sbcs.sunysb.edu David Scott Warren wave@media-lab.media.mit.edu Michael B. Johnson weigel@lia.di.epfl.ch Rainer Weigel wellman@engin.umich.edu Michael Wellman wendy@csi.on.ca Wendy Williams werner@ira.uka.de Andreas Werner wieger@info.win.tue.nl Wieger Wesselink will@aristotle.ils.nwu.edu William Fitzgerald Wim.Simoens@cs.kuleuven.ac.be Wim Simoens wiren@CoLi.Uni-SB.DE Mats Wiren wnr@research.CS.ORST.EDU Bill Robinson wojcik@dfki.uni-sb.de Marek Wojcik wsi@vexpert.dbai.tuwien.ac.at Wolfgang Slany wuertz@dfki.uni-sb.de Joerg Wuertz wunderwa@informatik.tu-muenchen.de Jens E Wunderwald wupp@cip.informatik.uni-wuerzburg.de Armin Grau y-man@uni.irkutsk.su Alexey I. Weimann Y.C.Chan@frcl.bull.fr Peter.Chan yang@storm.cs.orst.edu Sherry Yang yde@info.ucl.ac.be Yves Deville yk@trc.rwcp.or.jp yokoo@cslab.kecl.ntt.jp Makoto YOKOO yosikawa@swl.cl.nec.co.jp Masazumi Yoshikawa yury@parrot.Eng.Sun.COM Yury Kamen zameln@research.CS.ORST.EDU Nabil Zamel zb@doc.ic.ac.uk Zacharias Bobolakis zeller@ips.cs.tu-bs.de zimmerm2@uran.informatik.uni-bonn.de Joerg Zimmermann zsofi@cs.vu.nl Zsofia Ruttkay Voted No ------------------------------------------------------------------------------ aland@informix.com Colonel Panic aspgd21!dt07039%aspgd202@uunet.UU.NET Greg Stanton a_rubin@dsg4.dse.beckman.com Arthur Rubin chip@chinacat.unicom.com Chip Rosenthal crouchkp@flidh102.delcoelect.com dmarcher@acsu.buffalo.edu fsspr@camelot.acf-lab.alaska.edu Sean P. Ryan jrm@globalvillag.com John R. MacWilliamson leon.kos@uni-lj.si Leon Kos, FS-LECAD, +386 61 1261310 x375 revu@midway.uchicago.edu Sendhil Revuluri smarry@io.org Smarasderagd Draco srogers@tad.eds.com Steve Rogers urlichs@smurf.noris.de Matthias Urlichs Abstained ------------------------------------------------------------------------------ lonadar@judy.indstate.edu Lonadar the Wanderer rainer.staudte@informatik.tu-chemnitz.de Rainer Staudte Votes in error ------------------------------------------------------------------------------ matomira@di.epfl.ch Fernando Mato Mira ! No vote statement in message