UNIF — PROGRAM
Days: Friday, 24 July 2026
Friday, 24 July 2026
09:00-10:00
Session 1A
UNIF
Session Chair:
Location:
C5.05
| 09:00-10:00 |
Specification of languages with binders and structural congruences: matching and unification modulo alpha, A, C (abstract) 60 min
1 King's College London
|
10:00-10:30
Session 1B
UNIF
Session Chair:
Location:
C5.05
| 10:00-10:30 |
An Order-Theoretic View on Optimal Repairs and Complete Sets of Unifiers (Extended Abstract) (abstract) 30 min
1 TU Dresden
|
10:30-11:00
Coffee Break
UNIF
Location:
C5.05
11:00-12:30
Session 2
UNIF
Location:
C5.05
| 11:00-11:30 |
Quantitative Generalization for Variadic Nominal Terms (abstract) 30 min
1 Instituto de Ciencias de la Ingeniería, Universidad de O'Higgins
2 Research Institute for Symbolic Computation, Johannes Kepler University
|
| 11:30-12:00 |
The Unification Type of an Equational Theory May Depend on the Instantiation Preorder (Extended Abstract) (abstract) 30 min
1 TU Dresden
|
| 12:00-12:30 |
On Completeness of Absorptive Anti-Unification (abstract) 30 min
1 Universidade de Brasília
2 Czech Academy of Sciences
3 Research Institute for Symbolic Computation, JKU
4 Universidade de Brasilía
|
12:30-14:00
Lunch
UNIF
Location:
C5.05
14:00-15:00
Session 3A
UNIF
Session Chair:
Location:
C5.05
| 14:00-15:00 |
TBA (abstract) 60 min
1 University of Porto
|
15:00-15:30
Session 3B
UNIF
Session Chair:
Location:
C5.05
| 15:00-15:30 |
Anti-unification preserving special constants with variants (abstract) 30 min
1 CEA Paris-Saclay, CentraleSupélec, University of Paris-Saclay
2 CEA Paris-Saclay, University of Paris-Saclay
3 CentraleSupélec, University of Paris-Saclay
|
15:30-16:00
Coffee Break
UNIF
Location:
C5.05
16:00-18:00
Session 4
UNIF
Session Chair:
Location:
C5.05
| 16:00-16:30 |
Dynamic E-unification (abstract) 30 min
1 Clarkson University
|
| 16:30-17:00 |
On the Compatible Expansion of Boolean Rings (abstract) 30 min
1 Purdue University
|
| 17:00-17:30 |
Matching in the Description Logic EL without the Top Concept (abstract) 30 min
1 TU Dresden
|
| 17:30-18:00 |
Proving Equations with Nonterminating Term Rewriting Systems using Context-Sensitive Rewriting (abstract) 30 min
1 Universitat Politècnica de València
|