UNIF 2013 is the 27th event in a series of international meetings devoted to unification theory and its applications. Unification is concerned with the problem of identifying terms, finding solutions for equations or making formulae equivalent. The aim of UNIF 2013, as that of the previous meetings, is to bring together researchers from different areas of computer science and logic, who are interested in unification theory and related topics, to present recent (even unfinished) work, and discuss new ideas and trends in this and related fields.
The meeting will consist of invited and contributed talks, but also provide ample time for informal discussions.
Topics of InterestA non-exhaustive list of topics of interest:
- Unification algorithms, calculi and implementations
- Equational unification and unification modulo theories: algorithms and calculi
- Unification in modal, temporal and description logics
- Admissibility of Inference Rules
- Matching algorithms
- Constraint solving
- Combination problems
- Higher-Order Unification
- Type checking and reconstruction
- Typed unification
- Complexity issues
- Query answering
- Implementation techniques
- Applications of unification
Submissions should not exceed 5 pages in LNCS style. Papers should be submitted in PDF- or PS-format through EasyChair.