| UNIF'06 | 20th International Workshop on Unification Seattle, August 11, 2006 |
Overview
UNIF is the main international meeting on unification. Unification is concerned with the problem of identifying given terms, either syntactically or modulo a given logical theory. Syntactic unification is the basic operation of most automated reasoning systems, and unification modulo theories can be used, for instance, to build in special equational theories into theorem provers.
The aim of UNIF 2006, as that of the previous meetings, is to to bring together people interested in unification, present recent (even unfinished) work, and discuss new ideas and trends in unification and related fields. This includes scientific presentations, but also descriptions of applications and softwares using unification as a strong component.
Program
- UNIF program
- UNIF accepted papers
- UNIF pre-proceedings
- Camara ready versions of the papers (numbers according to the program):
Important Dates
| July 17, 2006 | Camera-ready papers |
|---|---|
| August 11 , 2006 | Workshop |
Submission and Publication
Authors are invited to submit an abstract (1-5 pages), a paper (no longer than 15 pages), or a system description (no more than 5 pages) in Postscript or PDF format using the UNIF'06 submission page, handled by the EasyChair conference system.Authors have been encouraged to use LaTeX2e and the Springer llncs class files.
Informal proceedings of accepted contributions will be available on-line. A hard copy will be distributed at the workshop to registered participants.
Topics of Interest
The meeting will include invited talks, contributed talks, and social time to discuss current topics of interest, which include (but are not limited to):
- Unification
- E-unification
- Unification Algorithms
- Higher-Order Unification
- String Unification
- Context Unification
- Nominal Unification
- Combination problems
- Disunification
- Typed Unification
- Related Topics
- Constraint Solving
- Tree Descriptions
- Matching
- Narrowing
- Applications
- Type Checking and Type Inference
- Automated Deduction
- Rewriting
- Functional and Logic Programming
- Grammars
- Computational Linguistics
- Implementations
Program Committee
| Temur Kutsia |
Research Institute for Symbolic Computation Johannes Kepler University of Linz, Linz, Austria |
| Jordi Levy (chair) |
Institut d'Investigació en Intel.ligència Artificial (IIIA) Consejo Superior de Investigaciones Científicas (CSIC), Barcelona, Spain |
| Christian Urban |
Mathematisches Institut der LMU Munchen, Germany |
| Mateu Villaret |
Dept. Informàtica i Matemàtica Aplicada (IMA) Universitat de Girona (UdG), Girona, Spain |
History
This workshop is the twentieth in the series: UNIF'87 (Val D'Ajol, France), UNIF'88 (Val D'Ajol, France), UNIF'89 (Lambrecht, Germany), UNIF'90 (Leeds, England), UNIF'91 (Barbizon, France), UNIF'92 (Dagstuhl, Germany), UNIF'93 (Boston, USA), UNIF'94 (Val D'Ajol, France), UNIF'95 (Sitges, Spain), UNIF'96 (Herrsching, Germany), UNIF'97 (Orléans, France), UNIF'98 (Rome, Italy), UNIF'99 (Frankfurt, Germany), UNIF'00 (Pittsburgh, USA), UNIF'01 (Siena, Italy), UNIF'02 (Copenhagen, Denmark). UNIF'03 (Valencia, Spain). UNIF'04 (Cork, Ireland). UNIF'05 (Nara, Japan).
