<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">******************************************************************************
<br>
<br>
<br>
UNIF 2022: 36TH International Workshop on Unification
<br>
-- co-located with FLoC/IJCAR 2022 --
<br>
<br>
August 12, 2022, Haifa, Israel
<br>
<br>
Website: cs.cas.cz/unif-2022
<br>
Poster: <a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__http://www.cs.cas.cz/unif-2022/Poster.pdf__;!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7AhQq0Wbw$">http://www.cs.cas.cz/unif-2022/Poster.pdf</a>
<br>
Submission link: <a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__https://easychair.org/conferences/?conf=unif2022__;!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7AXTPvmJA$">https://easychair.org/conferences/?conf=unif2022</a>
<br>
Paper submission deadline: May 5, 2022
<br>
Topics: Unification, Anti-unification, Constraint solving
<br>
<br>
<br>
******************************************************************************
<br>
<br>
UNIF 2022 is associated with IJCAR 2022 part of the Federated
Logic Conference 2022.
<br>
<br>
UNIF 2022 is the 36th in a series of annual workshops on
unification and related <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">topics (<a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__https://www.irif.fr/*treinen/unif/__;fg!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7BtFQ9DUw$">https://www.irif.fr/~treinen/unif/</a>).
Just as its predecessors', the purpose</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode"> of UNIF 2022 is to bring
together researchers interested in unification theory and <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">its applications, as well as
closely related topics, such as matching (i.e., one-</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">sided unification),
anti-unification (i.e., the dual problem to unification), <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">disunification (i.e., solving
equations and inequations) and the admissibility <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">problem (which generalizes
unification in modal logics). It is a forum for <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">presenting recent (even
unfinished) work, and discuss new ideas and trends in this <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">and related fields.
<br>
<br>
Unification is concerned with the problem of identifying given
(first- or higher-</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">order) terms, either
syntactically or modulo a theory. It is a fundamental technique <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">that is employed in various
areas of Computer Science and Mathematics. In <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">particular, unification
algorithms are key components in completion of term <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">rewriting systems,
resolution-based theorem proving, and logic programming. But <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">unification is, for example,
also investigated in the context of natural language <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">processing, program analysis,
types, modal logics, and in knowledge representation.
<br>
<br>
Submission Information
<br>
---------------------
<br>
Following the tradition of UNIF, we call for submissions of
extended abstracts (5 <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">pages) in EasyChair style, to
be submitted electronically as PDF through the <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">EasyChair submission site: <a class="moz-txt-link-freetext" href="https://urldefense.com/v3/__https://easychair.org/my/conference?conf=unif2022__;!!IBzWLUs!EH-EqRExaQxAVzRvjNdEoN5jp4vVckgWjpclrL7YTeIXwj3p3fCzASv_j4N4mdOXnaV0I7C2uXXnZw$">https://easychair.org/my/conference?conf=unif2022</a>
<br>
<br>
Abstracts will be evaluated by the Program Committee (if necessary
with support from</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode"> external reviewers) regarding
their significance for the workshop. We also allow</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode"> submission of work
presented/submitted in/to another conference. <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">
<br>
Accepted abstracts will be presented at the workshop and made
available at the <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">Web-page of UNIF 2022. <br>
</div>
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 12px;" lang="x-unicode">
<br>
Topics include, but are not limited to:
<br>
--------------------------------------
<br>
Topics of interest of the workshop include, but are not limited
to:
<br>
- Syntactic and equational unification algorithms
<br>
- Matching and constraint solving
<br>
- Unification in modal, temporal, and description logics
<br>
- Higher-order unification
<br>
- Narrowing
<br>
- Disunification
<br>
- Anti-unification
<br>
- As well as relevant investigations concerning:
<br>
* Complexity
<br>
* Combination methods
<br>
* Implementation
<br>
* Applications
<br>
<br>
Chairs
<br>
------
<br>
* David M. Cerna (RISC JKU, CAS ICS)
<br>
* Barbara Morawska (tba)
<br>
<br>
Invited Speakers
<br>
----------------
<br>
* Philippe Balbiani (Institut de recherche en informatique de
Toulouse)
<br>
* Christopher Lynch (Clarkson University)
<br>
<br>
Programme Committee
<br>
-------------------
<br>
* Mauricio Ayala-Rincón (Universidade de Brasilía)
<br>
* Franz Baader (TU Dresden)
<br>
* Daniel Dougherty (Worcester Polytechnic Institute)
<br>
* Besik Dundua (Institute of Applied Mathematics, Tbilisi State
University)
<br>
* Serdar Erbatur (Ludwig Maximilian University of Munich)
<br>
* Santiago Escobar (Universitat Politècnica de València)
<br>
* Maribel Fernandez (Universidade de Brasilía)
<br>
* Silvio Ghilardi (Dipartimento di Matematica, Università degli
Studi di Milano)
<br>
* Pascual Julián-Iranzo (University of Castilla-La Mancha)
<br>
* Temur Kutsia (RISC, Johannes Kepler University Linz)
<br>
* Jordi Levy (IIIA - CSIC)
<br>
* Andrew M. Marshall (University of Mary Washington)
<br>
* Daniele Nantes-Sobrinho (Universidade de Brasilía)
<br>
* Paliath Narendran (University at Albany, SUNY)
<br>
* Christophe Ringeissen (INRIA)
<br>
* David Sabel (Ludwig-Maximilians-University Munich)
<br>
* Manfred Schmidt-Schauss (Goethe-University Frankfurt am Main)
<br>
<br>
Publication
<br>
-----------
<br>
Depending on the number and quality of submissions a
<br>
special issue in AMAI or MSCS is envisioned.
<br>
<br>
Venue
<br>
-----
<br>
FLoC 2022 at Haifa, Israel
<br>
<br>
Important dates
<br>
---------------
<br>
* Paper submission: May 5, 2022
<br>
* Notification of acceptance: June 10, 2022
<br>
* Final version of accepted papers: June 18, 2022
<br>
* Registration deadline: June 30, 2022
<br>
* Workshop date: August 12, 2022
<br>
<br>
</div>
</body>
</html>