Speaker: Jan Johannsen
Titel: On the Complexity of Resolution Refinements
Abstract: Resolution is the basis of logic programming languages,
most automatic theorem provers and many SAT algorithms. Most of these
applications do not actually use the full power of resolution, but
only restricted forms, so called resolution refinements.
The talk will present several recent results, showing that already in
the case of propositional logic, some of the most important
refinements, viz. negative, linear and regular resolution, are
exponentially less efficient than full resolution.
Time and Place:
Tuesday, February 5, 16:30.
Seminarraum SEM 185/2,
Institut für Computersprachen E185.2
Favoritenstr. 9, E185-2.
Stiege 1, 3. Stock (4th floor), left.
This archive was generated by hypermail 2b30 : Thu Jan 24 2002 - 13:39:08 MET