UNIF 2001

Invited Speakers

Claudio Gutierrez (Universidad de Chile, Santiago, Chile)
Paliath Narendran (SUNY at Albany, USA)
Andrei Voronkov (University of Manchester, UK)


Timetable


Monday, June 18

10:30 Coffee Starter
 
11:00 Invited Talk: Extensions of AC, by P. Narendran
 
12:00 Uniform E-Semi-Unification, by A. Oliart and V. Perez
 
12:30 Lunch
 
2:00 A Superposition Based Methodology to Design Satisfiability Decision Procedures, by A. Armando, S. Ranise and M. Rusinowitch
 
2:30 Combining Decision Procedures for Positive Theories, by C. Tinelli
 
3:00 Solving Matching Problems in Unions of Non-Disjoint Equational Theories, by C. Ringeissen
 
3:30 Coffee Break
 
4:00 Unification in the Empty and Flat Theories with Sequence Variables and Flexible Arity Symbols, by T. Kutsia
 
4:30 Unification and Projectivity in Propositional Logic, by S. Ghilardi
 
5:00 Solving Linear Equations over Regular Languages, by F. Baader and R. Kuesters
 
5:30 Solving Knuth-Bendix ordering constraints, by K. Korovin and A. Voronkov
 
6:00 Context Congruence Closure and Context Rewriting for Commutative Context-Free Grammars, by S. Anantharaman
 
6:30 End of First Day

 


Tuesday, June 19

9:30 Invited Talk: Simultaneous Rigid E-unification and Formula Instantiation, by A. Voronkov
 
10:30 Coffee Break
 
11:00 Theories of Equations in Finitely Presented Groups, by M. Lohrey
 
11:30 Parametrized Rewriting on Words, by B. Monate
 
12:00 Second-Order Schema Matching Based on Projection Point Labeling, by K. Yamada, K. Hirata and M. Harao
 
12:30 Lunch
 
2:00 Invited Talk: The Complexity of Word Equations, by C. Gutierrez
 
3:00 Complexity of Unification and Matching Problems in the Varieties of Idempotent Semigroups, by O. Klima
 
3:30 Coffee Break
 
4:00 On the Complexity of Bounded Second Order Unification, by M. Schmidt-Schauss
 
4:30 Approximating E-Unification, by C. Lynch and B. Morawska
 
5:00 Non-Structural Subtype Entailment in Automata Theory, by J. Niehren and T. Priesnitz
 
5:30 End of Workshop