Research Topics:
- Term Rewriting
- Saturation-based Theorem Proving
- Transitivity, Equality, first-order Theorem Proving, Redundancy and Simplification, algebraic Refinements
- Decidable Fragments of first-order Logic
- Constraint Logics, Word Problems, Decision Procedures, Complexity
- Automated Complexity Analysis
- Meta-comlexity Theorems, logic Programming with guaranteed Complexity, Complexity Analysis through Saturation
More about Prof. Harald Ganzinger can be found here |
