{"id":4,"date":"2011-12-08T11:55:34","date_gmt":"2011-12-08T11:55:34","guid":{"rendered":"http:\/\/project.inria.fr\/template1\/?page_id=4"},"modified":"2023-07-13T13:09:25","modified_gmt":"2023-07-13T11:09:25","slug":"home","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/unif2023\/","title":{"rendered":"Home"},"content":{"rendered":"<p>UNIF 2023: The 37th International Workshop on Unification is a satellite event of CADE\/FSCD 2023, affiliated with <a href=\"https:\/\/easyconferences.eu\/fscd2023\/\">FSCD 2023<\/a> that will take place in Rome, Italy.<\/p>\n<p><strong>NEWS<\/strong>:<\/p>\n<ul>\n<li><strong>The extended abstracts can be found in the electronic <a href=\"https:\/\/inria.hal.science\/UNIF2023\">informal proceedings<\/a><\/strong>.<\/li>\n<\/ul>\n<p>UNIF 2023 will be the 37th in a series of annual international workshops on unification. Previous editions have taken place mostly in Europe (Austria, Denmark, France, Germany, Ireland, Italy, Poland, UK), but also in the USA and Japan. For more details on previous UNIF workshops, please see the <a href=\"https:\/\/www.irif.fr\/~treinen\/unif\/\">UNIF homepage<\/a>.<\/p>\n<p>Unification is concerned with the problem of identifying terms, finding solutions for equations, or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc.<\/p>\n<p>The International Workshop on Unification (UNIF) is a yearly forum for researchers in unification theory and related fields to meet old and new colleagues, to present recent (even unfinished) work, and to discuss new ideas and trends. It is also a good opportunity for young researchers and scientists working in related areas to get an overview of the current state of the art in unification theory.<\/p>\n<p>Topics of interest to UNIF include, but are not limited\u00a0to:<\/p>\n<ul>\n<li><span style=\"font-family: 'Source Sans Pro';\">unification algorithms, calculi and implementations<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">equational<\/span>\u00a0<span style=\"font-family: 'Source Sans Pro';\">unification and matching<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\"> narrowing<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">disunification<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">higher-order\u00a0<\/span><span style=\"font-family: 'Source Sans Pro';\">unification<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">unification in modal, temporal, and description logics<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">admissibility rules<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\"> constraint solving<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">complexity issues<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">type checking and reconstruction<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">query<\/span>\u00a0<span style=\"font-family: 'Source Sans Pro';\">answering<\/span><\/li>\n<li><span style=\"font-family: 'Source Sans Pro';\">security protocol analysis<\/span><\/li>\n<\/ul>\n<p>UNIF 2023 will be the 37th edition of the annual <a href=\"https:\/\/www.irif.fr\/~treinen\/unif\/\">international\u00a0workshop on Unification<\/a>.<\/p>","protected":false},"excerpt":{"rendered":"<p>UNIF 2023: The 37th International Workshop on Unification is a satellite event of CADE\/FSCD 2023, affiliated with FSCD 2023 that will take place in Rome, Italy. NEWS: The extended abstracts can be found in the electronic informal proceedings. UNIF 2023 will be the 37th in a series of annual international\u2026<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/unif2023\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":"","_members_access_role":[],"_members_access_error":""},"class_list":["post-4","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/pages\/4","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/comments?post=4"}],"version-history":[{"count":12,"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/pages\/4\/revisions"}],"predecessor-version":[{"id":172,"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/pages\/4\/revisions\/172"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/unif2023\/wp-json\/wp\/v2\/media?parent=4"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}