We propose a notion of complexity for oriented conditional term rewrite systems satisfying certain restrictions. This notion is realistic in the sense that it measures not only successful computations, but also partial computations that result in a failed rule application. A transformation to unconditional context-sensitive rewrite systems is presented which reflects this complexity notion, as well as a technique to derive runtime and derivational complexity bounds for the result of this transformation. Comment: This is an extended and improved version of "Conditional Complexity" as published in the proceedings of RTA 2015. It has been submitted for journal publication in LMCS

@article{paperbot205,
  title = {Complexity of Conditional Term Rewriting},
  author = {Cynthia Kop and Aart Middeldorp and Thomas Sternagel},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 13, Issue 1},
  year = {2017},
  doi = {10.23638/lmcs-13(1:6)2017}
}