[om-a] CADE-18 FINAL CALL FOR WORKSHOPS AND TUTORIALS

Mateja Jamnik M.Jamnik at cs.bham.ac.uk
Wed Oct 10 14:36:09 CEST 2001



                   FINAL CALL FOR WORKSHOPS AND TUTORIALS
                                CADE-18
			     
   The  18th  International  Conference  on  Automated  Deduction

                    July 27-30, 2002 (CADE-18)
      July 25, 26 and July 31, August 1 2002 (workshops/tutorials)
                         Copenhagen, Denmark
		   http://www.uni-koblenz.de/~cade-18/

CADE is the major forum for the presentation of new research in all
aspects of automated deduction. Proposals for workshops and for
tutorials are solicited.  Pre-CADE workshops and tutorials will run
Thursday July 25 - Friday July 26, 2002, and post-CADE ones will run
Wednesday July 31 - Thursday August 1, 2002. Workshops and tutorials
will ordinarily run for one or two days, but half a day ones may be
possible as well. 

Workshop Topics
---------------

Recent CADE workshops have included term schematisations and their
applications, reasoning, automation of proofs by induction, empirical
studies in logic algorithms, mechanisations of partial functions,
proof search in type-theoretic languages, automated model building,
evaluation of automated theorem-proving systems, strategies in
automated deduction, automated theorem proving in software
engineering and in mathematics, integration of symbolic computation
and deduction. 

We would like to encourage workshops which build on previous
events as well as new ones in novel research areas broadly
related to automation and deduction.

Tutorial Topics
---------------

Recent CADE tutorials have included equality reasoning in semantic
tableaux, proof systems for nonmonotonic logics, rewrite techniques
in theorem proving, proof planning, parallelisation of deduction
strategies, resolution decision methods, constructive type theory,
the use of semantics in Herbrand-based proof procedures, logical
frameworks, theorem proving by the inverse method, deduction
methods based on boolean rings, higher-order equational logic, and
term indexing in automated reasoning. 

Tutorials may be introductory, intermediate, or advanced. Tutorials
on novel research are also encouraged.

Proposals
---------

Anyone wishing to organise a workshop or tutorial in conjunction
with  CADE-18 should send (e-mail preferred) a proposal (in ASCII
text format) no longer than two pages to the workshop/tutorial chair
and the programme chair by October 12, 2001. The proposal
should describe:    

- The title of the workshop or tutorial.
- The names and affiliations of person or persons who will chair the 
  workshop or present the tutorial.
- A brief technical description of the topic of the workshop or
  tutorial. 
- Contact details (email, web page, phone, fax, etc.)
- A list of workshops or tutorials previously organised or given in 
  this or related areas.
- The preferred date for the workshop or tutorial (pre-CADE,
  post-CADE or any).  
- The proposed duration of workshop or tutorial (1 day, 2 days).
- Will there be invited speakers at the workshop or tutorial, and
  how many?
- Are there plans to have proceeding or other publications of the
  workshop or tutorial?

Proposals will be evaluated, and decisions will be communicated by
October 26, 2001.  Further information about the arrangements for
workshops and tutorials can be obtained from the CADE-18 Web site.

Proposal deadline:            October 12, 2001
Notification of acceptance:   October 26, 2001


Workshop/Tutorial Chair:
Mateja Jamnik <M.Jamnik at cs.bham.ac.uk>
School of Computer Science
The University of Birmingham
Birmingham, B15 2TT, ENGLAND, UK

Programme Chair:
Andrei Voronkov <voronkov at cs.man.ac.uk>
Department of Computer Science
University of Manchester
Oxford Road, Manchester M13 9PL, ENGLAND, UK



[NB: Apologies if you receive this call more than once.]
--
om-announce at openmath.org  -  public announcements concerning OpenMath
Post discussion to om at openmath.org
Automatic list maintenance software at majordomo at openmath.org
Mail om-announce-owner at openmath.org for assistance with any problems



More information about the Om-announce mailing list