RDP                     
Home page
Organization
Sponsors

MEETINGS        
RTA
TLCA
FTP
WG1.6
RULE
UNIF
WFLP
WRS
WST

VENUE               
Valencia
Registration
Accomodation
Travelling
Program
Conference Venue
Internet

UNIF'03
17th International Workshop on Unification
Valencia, Spain, June 8-9, 2003

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 2003, 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. In particular, it is intended to offer a good opportunity for young researches and researchers working in related areas to get an overview of the current state of the art in unification theory and get in contact with the experts in the field.

This workshop is the seventeenth 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).

This worshop will include a panel on Open Problems in Unification


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 
    • 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

INVITED SPEAKERS


BEST STUDENT PAPER AWARD

An award of 300 EUR will be given to the best paper exclusively written by one or several young researchers who have not yet obtained their PhD degrees. The organizing committee may decline to make the award or may split it among several papers. Papers included in this category should be clearly marked "student paper" in the submission.


SUBMISSION

Authors are invited to submit via email 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 to unif03@iiia.csic.es before April 17, 2003. Authors are encouraged to use LaTeX2e and the Springer llncs class files , and will be expected to attend and present their work at the workshop.

Postscript version of the Call for Papers


IMPORTANT DATES
    Thursday, April 17, 2003 (extended) Deadline for submission of papers, abstracts and system descriptions
    Monday, April 28, 2003 Notification of acceptance
    Monday, May 12, 2003 Camera-ready papers
    June 8 -9 , 2003 Workshop

PROGRAM COMMITTEE
    Jordi Levy (chairman)
    Institut d'Investigació en Intel.ligència Artificial (IIIA)
    Consejo Superior de Investigaciones Científicas (CSIC), Barcelona, Spain
    Email: levy@iiia.csic.es

LINKS

SPONSORS