UNIF 2022 is the 36th in a series of annual workshops on un ification and related topics. Unification is conce rned with the problem of identifying given (first- or higher-order) terms, either syntactically or m odulo a theory. It is a fundamental technique that is employed in various areas of Computer Science and Mathematics. In particular, unification algori thms are key components in completion of term rewr iting systems, resolution-based theorem proving, a nd logic programming. But unification is, for exam ple, also investigated in the context of natural l anguage processing, program analysis, types, modal logics, and in knowledge representation.
\n\nJust as its predecessors', the purpose of UNIF 2022 is to bring together researchers interested in unification theory and its applications, as wel l as closely related topics, such as matching (i.e ., one-ided unification), anti-unification (i.e., the dual problem to unification), disunification ( i.e., solving equations and inequations) and the a dmissibility problem (which generalizes unificatio n in modal logics). It is a forum for presenting r ecent (even unfinished) work, and discuss new idea s and trends in this and related fields. UNIF 2022 is associated with IJCAR 2022 part of the Federat ed Logic Conference 2022.
\nF ollowing the tradition of UNIF, we call for submis sions of extended abstracts (5 pages) in EasyChair style. Abstracts will be evaluated by the Program Committee (if necessary with support from externa l reviewers) regarding their significance for the workshop. We also allow submission of work present ed/submitted in/to another conference. Accepted ab stracts will be presented at the workshop and made available at the Web-page of UNIF 2022. Depending on the number and quality of submissions a specia l issue in AMAI or MSCS is envisioned.
\n