Local computation on acyclic hypertrees (and related graphical structures) has proved to be a very general method of computing deductions in knowledge representation formalisms. It has been shown to be applicable, in particular, to probabilities, possibility theory and other uncertainty calculi, constraints including finite constraints, soft constraints, linear constraints and inequalities, and a wide range of logics, including propositional and first-order classical logics and modal logics.
The purpose of the workshop is to bring together for the first time a group of researchers interested in the theory, the methods and applications of local computation (or computations based on hypertrees). Of interest are local computation in logic (satisfiability, consequence finding or other in classical or non-classical logics), uncertainty (probabilistic, possibilistic, belief functions or other), constraint solving (crisp or soft constraints), data bases, optimization and decision problems, or its application to any other field.
Please note that participants are expected to register for the main ECAI 2004 conference ( http://www.dsic.upv.es/ecai2004/index2.html) and registration to the workshop is done through the main conference registration. The number of participants is limited.
Jérôme Mengin
Institut de Recherche en Informatique de Toulouse, Université Paul Sabatier,
Toulouse, France.
mengin@irit.fr.
Nic Wilson
Cork Constraint Computation Centre, University College Cork, Ireland.
n.wilson@4c.ucc.ie