activity
20122017
most citedComplexity of Conditional Term Rewriting

9 citations · 17 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LO2017

Certified Non-Confluence with ConCon 1.5

Thomas Sternagel, Christian Sternagel

We present three methods to check CTRSs for non-confluence: (1) an ad hoc method for 4-CTRSs, (2) a specialized method for unconditional critical pairs, and finally, (3) a method t…

cs.LO2016

A Characterization of Quasi-Decreasingness

Thomas Sternagel, Christian Sternagel

In 2010 Schernhammer and Gramlich showed that quasi-decreasingness of a DCTRS R is equivalent to μ-termination of its context-sensitive unraveling Ucs(R) on original terms. While t…

cs.LO2016★ 2 cited

Formalized Confluence of Quasi-Decreasing, Strongly Deterministic Conditional TRSs

Thomas Sternagel, Christian Sternagel

We present an Isabelle/HOL formalization of a characterization of confluence for quasi-reductive strongly deterministic conditional term rewrite systems, due to Avenhaus and Loría-…

cs.LO2016★ 2 cited

Level-Confluence of 3-CTRSs in Isabelle/HOL

Christian Sternagel, Thomas Sternagel

We present an Isabelle/HOL formalization of an earlier result by Suzuki, Middeldorp, and Ida; namely that a certain class of conditional rewrite systems is level-confluent. Our for…

cs.LO2015★ 9 cited

Complexity of Conditional Term Rewriting

Cynthia Kop, Aart Middeldorp, Thomas Sternagel

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 suc…

cs.LO2015★ 1 cited

KBCV 2.0 - Automatic Completion Experiments

Thomas Sternagel

This paper describes the automatic mode of the new version of the Knuth-Bendix Completion Visualizer. The internally used data structures have been overhauled and the performance w…