| 09:00 – 09:10 (GMT-3) Opening | ||
| 1. Session: Unification in Modal and Description Logics. (Session chair: Manfred Schmidt-Schauß) | ||
| 09:10 – 09:35 | Majid Alizadeh, Mohammad Ardeshir, Philippe Balbiani and Mojtaba Mojtahedi. | About the unification type of modal logic K5 and its extensions. |
| 09:35 – 10:00 | Franz Baader, Oliver Fernandez Gil and Maryam Rostamigiv. | Restricted Unification in the Description Logic FL0. |
| 10:00 – 10:30 (GMT-3) Break | ||
| 2. Session: Nominal *-Unification. (Session chair: Mauricio Ayala-Rincón) | ||
| 10:30 – 10:55 | Leonardo Batista, Maribel Fernandez, Daniele Nantes-Sobrinho and Deivid Vale. | Nominal Disunification via Fixed-Point Constraints. |
| 10:55 – 11:20 | Manfred Schmidt-Schauss. | Nominal Anti-Unification with Atom-Variables. |
| 11:20 – 11:40 (GMT-3) Break | ||
| 3. Session: Unification for Security. (Session chair: Christophe Ringeissen) | ||
| 11:40 – 12:05 | Hai Lin and Christopher Lynch. | Checking Symbolic Security of Cryptographic Modes of Operation. |
| 12:05 – 12:30 | Hai Lin and Christopher Lynch. | Formal Analysis of Symbolic Authenticity. |
| 12:30 – 13:00 (GMT-3) Break | ||
| 4. Session: Variants of Unification. (Session chair: Franz Baader) | ||
| 13:00 – 13:25 | Richard Waldinger. | What, Again? Automatic Deductive Synthesis of the Unification Algorithm. |
| 13:25 – 13:50 | David Cerna. | When First-order Unification Calls itself. |
| 13:50 – 14:25 | Wei Du, Paliath Narendran and Bharvee Acharya. | A Polynomial-time Algorithm for the Common Left Multiplier Problem for Forward-closed String Rewriting Systems. |
| 14:25 – 14:30 (GMT-3) Closing | ||
Program
Registration
Registration is open until July 11th. All participants have to register using the FSCD registration form:
https://fscd2021.dc.uba.ar/registration.html