<!DOCTYPE html>
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<font face="monospace">[Apologies for multiple copies]<br>
<br>
=======================================================================<br>
Last Call for Papers<br>
UNIF 2025<br>
The 39th International Workshop on Unification<br>
<br>
Birmingham, UK, July 14, 2025<br>
A satellite workshop of FSCD<br>
<a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__https://cs.newpaltz.edu/unif2025/__;!!IBzWLUs!QKvEM5VR4NdU_4QzWRSAgVa7uLO624WsvkF7IjgeMoiHGD22_SawvfDzA1PIbXlrQfpylTW0ivcoLly5sCQZzLOzmL6S3Lyh3-DIJONEWvI$">https://cs.newpaltz.edu/unif2025/</a><br>
=======================================================================<br>
<br>
<b>*** Submission deadline: May 7, 2025 ***</b><br>
<br>
UNIF 2025 is the 39th event in a series of international meetings<br>
devoted to unification theory and its applications. Unification is<br>
concerned with the problem of making two given terms equal, either<br>
syntactically or modulo an equational theory. It is a fundamental<br>
process used in various areas of computer science, including
automated<br>
reasoning, term rewriting, logic programming, natural language<br>
processing, program analysis, knowledge representation, types,
etc.<br>
<br>
The International Workshop on Unification (UNIF) is a forum for<br>
researchers in unification theory and related fields to present
recent<br>
(even unfinished) work, and to discuss new ideas and trends. It is
also<br>
a good opportunity for students, young researchers and scientists
working<br>
in related areas to get an overview of the current state of the
art in<br>
unification theory.<br>
<br>
Invited Speakers<br>
----------------<br>
- David M. Cerna (Dynatrace Research, Czech Academy of Sciences)<br>
- Oliver Fernández Gil (TU Dresden, Germany)<br>
<br>
Topics<br>
------<br>
A non-exhaustive list of topics of interest includes:<br>
* syntactic and equational unification algorithms<br>
* matching and constraint solving<br>
* higher-order unification<br>
* unification in modal, temporal, and description logics<br>
* admissibility of inference rules<br>
* narrowing<br>
* disunification<br>
* anti-unification<br>
* complexity issues <br>
* combination methods<br>
* implementation techniques<br>
* applications<br>
<br>
Submission<br>
----------<br>
Short papers or extended abstracts, up to 5 pages in EasyChair
style,<br>
should be submitted electronically as PDF files through the
EasyChair<br>
submission site:<br>
<a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__https://easychair.org/conferences/?conf=unif2025__;!!IBzWLUs!QKvEM5VR4NdU_4QzWRSAgVa7uLO624WsvkF7IjgeMoiHGD22_SawvfDzA1PIbXlrQfpylTW0ivcoLly5sCQZzLOzmL6S3Lyh3-DI_Co7Ujo$">https://easychair.org/conferences/?conf=unif2025</a><br>
<br>
Abstracts will be evaluated by the Program Committee regarding
their<br>
significance for the workshop. We allow submissions of work
presented/<br>
submitted in/to another conference.<br>
<br>
Accepted abstracts will be presented at the workshop and included
in<br>
the informal proceedings of the workshop, available in electronic
form<br>
on the Web page of UNIF 2025. At least one of the authors should
register<br>
for the workshop.<br>
<br>
Based on the number and quality of submissions, a special issue of
the<br>
Journal of Logical and Algebraic Methods in Programming (JLAMP)
will<br>
be considered.<br>
<br>
Important Dates<br>
---------------<br>
* Paper submission: May 7, 2025 (AoE)<br>
* Author notification: May 29, 2025 (AoE)<br>
* Camera-ready version: June 13, 2025 (AoE)<br>
* UNIF 2025: July 14, 2025<br>
</font><br>
</body>
</html>