Unif `98

Twelfth International Workshop on Unification
Rome, June 29-July 1, 1998

Preliminary Program

Monday, June 29


Simona Ronchi della Rocca
  Unifying Intersection Types
10:00 Agnes Tellez-Arenas, Siva Anantharaman
  Set Constraints and Program Synthesis. Applications

10:35 Coffee break

11:00 Manfred Schmidt-Schauß, Klaus U. Schulz
  Decidability of Context Equations with Two Variables
11:35 Christopher Lynch
  The Unification Problem for One Relation Thue Systems
12:10 Laurent Juban, Miki Hermann
  On the Complexity of Counting Minimal Solution of Hilbert Basis

12:45 Lunch break

15:00 Benedetto Intrigila, Stefano Sorgi, Marisa Venturini Zilli
  Parametric Iterative Processes
15:35 Sébastien Limet, Frédéric Saubion
  Primal Grammars for R-unification

16:10 Coffee break

16:40 Franz Baader
  On the Complexity of Boolean Unification
17:15 Claude Marché
  Solving Termination Constraints
  via Finite Domain Polinomial Interpretations

Tuesday, June 30

9:00 Franco Barbanera
  Combining Computational Paradigms
10:00 Franz Baader, Martin Leucker
  Comparison of two Semantic Approaches to Unification

10:35 Coffee break

11:00 Anne-Cécile Caron,Franck Seynhaeve, Sophie Tison, Marc Tommasi
  One Step Rewriting
11:35 Ivan E.Tavares Araújo, Mauricio Ayala Rincon
  Unification Problems in Monoidal Theories and Presburger Arithmethic
12:10 Alexandre Boudet, Evelyne Contejean
  About the Confluence of Equational Pattern Rewriting Systems

12:45 Lunch break

15:00 Jordi Levy, Margus Veanes
  On Unification Problems in Restricted Second-Order Languages
15:35 Robert Niruwenhuis, Jose Miguel Rivero
  On Ordering Constraints and Solved Forms

16:10 Coffee break

16:40 Business Meeting

19:00 Excursion and buffet on the ``Appia antica''

Wednesday, July 1

9:00 Joe Wells
  Problems and Results in Unification and Type Search
10:00 Jordi Levy, Mateu Villaret
  Complexity Study of some Classes of Context
  and Second-Order Unification Problems

10:35 Coffee break

11:00 Miki Hermann, Gernot Salzer
  On the Word, Subsumption, and Complement Problem
  for Recurrent Term Schematizations
11:35 Bernhard Gramlich
  On (Un)Sound Simplifications of Equational Theories
12:10 Sergei Vorobyov
  The "$8 Equational Theory of
  Context Unification is Co-Recursively Enumerable Hard

12:45 End of Unif'98

This document was translated from LATEX by HEVEA.