From: Manfred Meyer
Subject: RFD: comp.ai.constraints
Date: 
Message-ID: <comp.ai.constraints-RFD1@uunet.uu.net>
                      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: ·····@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: Manfred Meyer
Subject: 2nd RFD: comp.constraints
Date: 
Message-ID: <comp.constraints-RFD2@uunet.uu.net>
                      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 (···@cs.cmu.edu), on CSP (········@saturne.cert.fr), and the list of 
the German ALP branch (········@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: ·····@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: Ron "Asbestos" Dippold
Subject: CFV: comp.constraints
Date: 
Message-ID: <comp.constraints-CFV1@uunet.uu.net>
		     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
<········@intellektik.informatik.th-darmstadt.de>, CLP mailing list
<···@cs.cmu.edu>, CSP mailing list <········@saturne.cert.fr>.

This vote is being conducted by a neutral third party.  For voting
questions only contact ········@qualcomm.com.  For questions about the
proposed group contact Manfred Meyer <·····@dfki.uni-kl.de>.


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:   ······@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: Ron "Asbestos" Dippold
Subject: 2nd CFV: comp.constraints
Date: 
Message-ID: <comp.constraints-CFV2@uunet.uu.net>
		      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
<········@intellektik.informatik.th-darmstadt.de>, CLP mailing list
<···@cis.ohio-state.edu>, CSP mailing list <········@saturne.cert.fr>.

This vote is being conducted by a neutral third party.  For voting
questions only contact ········@qualcomm.com.  For questions about the
proposed group contact Manfred Meyer <·····@dfki.uni-kl.de>.


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:   ······@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
------------------------------------------------------------------------------
·····@hcsd.hac.com.I.vote.YES.on.comp.constraints
···@cc.drev.dnd.ca
···@chenas.inria.fr
·······@dfd.dlr.de