CALL FOR PARTICIPATION

       -----------------------------------------------------------------
       INTERNATIONAL COMPETITION AND SYMPOSIUM ON SATISFIABILITY TESTING
       -----------------------------------------------------------------

			   March 15-17, 1996
			    Beijing, China
			   
			    General Chair:
			     Wei Li, BUAA

			  Program co-chairs:
			   Shuo Bai, NCIC
		      Jun Gu, Univ. of Calgary/HKUST
		       Bart Selman, AT&T Bell Labs
 
			Competition Co-Chairs:
		    James Crawford, CIRL / U. of Oregon
			DingXin Wang, TsingHua Univ.
	
			   Advisory Committee:
	  Chenwei Wang (China High-Tech Programme) * Guojie Li (NCIC)
   		     *  Rina Dechter (UC Irvine) 
	    Olivier Dubois (U. of Paris) * Mike Trick (CMU) 

				WWW
		  http://tango.ncic.ac.cn/sat/cfp
		(also see http://www.cirl.uoregon.edu/jc/beijing)

			       GOAL

There has been substantial recent progress in our ability to solve large 
Boolean satisfiability (SAT) problems. Progress has been made both in terms
of new practical procedures and in terms of more efficient implementations 
of previously known methods. The goal of the Competition is to evaluate 
and compare the performance of the latest SAT procedures. 

Teams participating in the SAT Competition will submit a Sparc executable
program of their SAT procedure at the start of the competition (9am, March
15, 1996). The relative performance of the programs will be determined by
running each procedure on a benchmark of SAT instances. Full details on
the competition are available on the WWW, see
http://tango.ncic.ac.cn/sat/guidelines, via anonymous ftp
to tango.ncic.ac.cn pub/sat/guidelines, or by email from jc@cs.uoregon.edu.

In conjunction with the competition, there will be a general
symposium on the SAT problem. We encourage submissions on all aspects
of the SAT problem, for example, Algorithms (complete and incomplete),
Complexity Analyses, Phase Transitions, Applications, Evaluations, and
Relations to other Combinatorial Problems.

Both the Competition and the symposium are sponsored and will be organized by
China's "863" High-Tech R&D project on Intelligent Computing Systems.
 
			  IMPORTANT DATES

COMPETITION: 
    By JANUARY 31st, 1996, notify DingXin Wang(dcswdx@tsinghua.edu.cn) 
    or  James Crawford (jc@cs.uoregon.edu) of your intention to participate.

SYMPOSIUM:
    By JANUARY 31st, 1996, submit extended abstracts (up to 4 pages; 
    postscript or LaTeX) to Shuo Bai (bai@tango.ncic.ac.cn).

    Authors will be notified of acceptance or rejection on February 15th,
    1996. Authors will be invited to submit within three month after the
    Symposium a full length version of their paper to be considered
    for inclusion in a thoroughly refereed special issue of the Journal
    of Computer Science & Technology published by Alerton Publishing Corp.,
    New York.
 

			      SPONSORS

The Competition and Symposium is supported by the Chinese High-Tech Programme.
Partial travel subsidies may be available to students and junior researchers.

		     HOTEL AND TRAVEL INFORMATION

details needed

	       FURTHER INFORMATION AND FUTURE ANNOUNCEMENTS 

Contact:                     Prof. Wei Li
		       Dept. of Computer Science
	      Beijing University of Aeronautics and Astronautics
			  Beijing 100083, P.R. China
		     E-mail: liwei@cs.sebuaa.ac.cn