Title:
Logical Constrained Term Rewrite Systems

Abstract:
The first part of this talk gives an introduction to logical constrained term rewrite systems (LCTRSs) including a quick overview of the tool Ctrl which is currently the only tool capable of testing for confluence of LCTRSs.
Furthermore in the second part we focus on confluence criteria for LCTRSs such as orthogonality, strongly closedness and (almost) parallel closedness.
I will introduce those criteria and give a high-level overview of the proofs for key lemmata.