Third International Workshop on Modelling and
	   Reformulating Constraint Satisfaction Problems:
		Towards Systematisation and Automation

			  27 September 2004


			  === PROGRAMME ===

Session 1 (9:00-10:40)

  9:00  Invited Talk: Formulations and Reformulations in Integer Programming
        - M. Trick

  9:40  Tight and Tractable Reformulations for Uncertain CSPs
        - N. Yorke-Smith, C. Gervet

 10:05  The Rules of Modelling: Towards Automatic Generation of Constraint ProgRams
        - A.M. Frisch, C. Jefferson, B. Martinez-Hernandez, I. Miguel.

 10:30  Towards the Categorisation of Set and Multiset Representations
        in Constraint Satisfaction Problems
        - C. Jefferson, A.M. Frisch.


Coffee Break (10:40 - 11:00)


Session 2 (11:00-12:25)

 11:00  Exploiting Functional Dependencies in Declarative Problem Specifications 
            and
        Using a Theorem Prover for Reasoning on Constraint Problems
        - M. Cadoli, T. Mancini.

 11:30  A Compact Reformulation of Propositional Satisfiability as 
        Binary Constraint Satisfaction
        - M. Jarvisalo, I. Niemela.

 11:55  Tools for Modelling and Solving Search Problems
        - D. East, M. Iakhiaev, A. Mikitiuk, M. Truszczynski.

 12:05  A New Encoding of AllDifferent into SAT
        - P. Nightingale, I. Gent.

 12:15  On Infinite CSPs
        - S. Dantchev, F.D. Valencia.