UNIF 2000   Carnegie Mellon University - School of Computer Science
 

UNIF 2000
Program

Talks are in Wean Hall 8220. Coffee breaks and lunch in the Newell Simon Hall Atrium, accessible from the 4th floor of Wean Hall.


Friday, June 16

9:00 Combining Decision Procedures for the word problem
  Franz Baader (RWTH Aachen, Germany), Cesare Tinelli (University of Iowa)
10:00 Coffee Break
10:30 Congruence closure and syntactic unification
  Leo Bachmair, Ashish Tiwari (SUNY at Stonybrook)
11:00 Goal-directed completion of noncommutative Gröbner bases
  Ben Keller (Virginia Tech.), Chris Lynch (Clarkson Univ.)
11:30 End of Session
12:00 Lunch
1:30 Learning a Semantic Lexicon for a Unification Grammar (Invited Talk)
  Andrew Haas (Univ. at Albany --- SUNY)
2:30 On the search for a phase transition in AC-matching
  Thomas Raffill (University of California at Santa Cruz)
3:00 Normal forms and reduction for theories of binary relations
  Dan Dougherty, Claudio Gutierrez (Wesleyan University)
3:30 Break
4:00 Business Meeting
4:30 End of Workshop


[ Home | Program ]
[ CADE-17 | On-Line Registration ]

www.cs.cmu.edu/~unif