This page contains links to
postscript versions of the extended abstract accepted at UNIF 2001. The
complete proceedings will be handed out at the workshop.
·
Extensions of AC
P. Narendran , pages 3-3.
·
Uniform E-Semi-Unification
A. Oliart and V. Perez , pages 4-7.
·
A Superposition Based Methodology to Design Satisfiability Decision
Procedures
A. Armando, S. Ranise and M. Rusinowitch , pages 8-12.
·
Combining Decision Procedures for Positive
Theories
C. Tinelli , pages 13-17.
·
Solving Matching Problems in Unions of Non-Disjoint Equational Theories
C. Ringeissen , pages 18-19.
·
Unification in the Empty and Flat Theories with Sequence Variables and
Flexible Arity Symbols
T. Kutsia , pages 20-23.
·
Unification and Projectivity in Propositional Logic
S. Ghilardi , pages 24-26.
·
Solving Linear Equations over Regular Languages
F. Baader and R. Kuesters , pages 27-31.
·
Solving Knuth-Bendix ordering constraints
K. Korovin and A. Voronkov , pages 32-34.
·
Context Congruence Closure and Context Rewriting for Commutative
Context-Free Grammars
S. Anantharaman, pages 35-40.
·
Simultaneous Rigid E-unification and Formula Instantiation
A. Voronkov , pages 41-41.
·
Theories of Equations in Finitely Presented Groups
M. Lohrey, pages 42-44.
·
Parametrized Rewriting on Words
B. Monate, pages 45-48.
·
Second-Order Schema Matching Based on Projection Point Labeling
K. Yamada, K. Hirata and M. Harao, pages 49-53.
·
The Complexity of Word Equations
C. Gutierrez, pages 54-54.
·
Complexity of Unification and Matching Problems in the Varieties of
Idempotent Semigroups
O. Klima, pages 55-58.
·
On the Complexity of Bounded Second Order Unification
M. Schmidt-Schauss, pages 59-62.
·
Approximating E-Unification
C. Lynch and B. Morawska, pages 63-64.
·
Non-Structural Subtype Entailment in Automata Theory
J. Niehren and T. Priesnitz, pages 65-70.