Author of the publication

Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules.

, , and . RTA, volume 36 of LIPIcs, page 257-268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Complete Selection Function for Lazy Conditional Narrowing., and . FLOPS, volume 2024 of Lecture Notes in Computer Science, page 201-215. Springer, (2001)Equational Termination by Semantic Labelling., , and . CSL, volume 1862 of Lecture Notes in Computer Science, page 457-471. Springer, (2000)Certifying Proofs in the First-Order Theory of Rewriting., , , and . TACAS (2), volume 12652 of Lecture Notes in Computer Science, page 127-144. Springer, (2021)A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems., and . CPP, page 197-210. ACM, (2023)AC-KBO Revisited., , , and . FLOPS, volume 8475 of Lecture Notes in Computer Science, page 319-335. Springer, (2014)Revisiting Matrix Interpretations for Proving Termination of Term Rewriting., and . RTA, volume 10 of LIPIcs, page 251-266. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence., , and . RTA, volume 21 of LIPIcs, page 335-351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Leftmost Outermost Revisited., , and . RTA, volume 36 of LIPIcs, page 209-222. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Conditional Complexity., , and . RTA, volume 36 of LIPIcs, page 223-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Lazy Narrowing: Strong Completeness and Eager Variable Elimination., , and . UNIF, page 43-46. (1995)