Please note that this newsitem has been archived, and may contain outdated information or links.
12 August 2022, 36th International Workshop on Unification (UNIF 2022), Haifa, Israel
UNIF 2022 is the 36th in a series of annual workshops on unification and related topics. Unification is concerned with the problem of identifying given (first- or higher-order) terms, either syntactically or modulo a theory. It is a fundamental technique that is employed in various areas of Computer Science and Mathematics. In particular, unification algorithms are key components in completion of term rewriting systems, resolution-based theorem proving, and logic programming. But unification is, for example, also investigated in the context of natural language processing, program analysis, types, modal logics, and in knowledge representation.
Just as its predecessors', the purpose of UNIF 2022 is to bring together researchers interested in unification theory and its applications, as well 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 admissibility problem (which generalizes unification in modal logics). It is a forum for presenting recent (even unfinished) work, and discuss new ideas and trends in this and related fields. UNIF 2022 is associated with IJCAR 2022 part of the Federated Logic Conference 2022.
Following the tradition of UNIF, we call for submissions of extended abstracts (5 pages) in EasyChair style. Abstracts will be evaluated by the Program Committee (if necessary with support from external reviewers) regarding their significance for the workshop. We also allow submission of work presented/submitted in/to another conference. Accepted abstracts 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 special issue in AMAI or MSCS is envisioned.
Please note that this newsitem has been archived, and may contain outdated information or links.