Author of the publication

Constraints for Argument Filterings.

, , and . SOFSEM (1), volume 4362 of Lecture Notes in Computer Science, page 579-590. Springer, (2007)

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

Uncurrying for Innermost Termination and Derivational Complexity, , and . HOR, volume 49 of EPTCS, page 46-57. (2010)Tyrolean termination tool: Techniques and features., and . Inf. Comput., 205 (4): 474-511 (2007)Predictive Labeling., and . RTA, volume 4098 of Lecture Notes in Computer Science, page 313-327. Springer, (2006)Dependency Pairs Revisited., and . RTA, volume 3091 of Lecture Notes in Computer Science, page 249-268. Springer, (2004)CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems., and . CADE, volume 9195 of Lecture Notes in Computer Science, page 127-136. Springer, (2015)Confluence of Non-Left-Linear TRSs via Relative Termination., and . LPAR, volume 7180 of Lecture Notes in Computer Science, page 258-273. Springer, (2012)Weighted Path Orders Are Semantic Path Orders., and . FroCoS, volume 14279 of Lecture Notes in Computer Science, page 63-80. Springer, (2023)Infinite Runs in Abstract Completion., , , and . FSCD, volume 84 of LIPIcs, page 19:1-19:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Maximal Completion., and . RTA, volume 10 of LIPIcs, page 71-80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)A New and Formalized Proof of Abstract Completion., , and . ITP, volume 8558 of Lecture Notes in Computer Science, page 292-307. Springer, (2014)