Non-termination of String and Cycle Rewriting by Automata Hans Zantema and Alexander Fedotov Eindhoven, Nijmegen The Netherlands

Source URL: cl-informatik.uibk.ac.at

Termination of term graph rewriting Hans Zantema Technische Universiteit Eindhoven and Radboud Universiteit Nijmegen Joined work with Dennis Nolte and Barbara K¨ onig

Source URL: cl-informatik.uibk.ac.at

SAT Instances for Termination Analysis with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

Source URL: www.dcs.bbk.ac.uk

• Theoretical computer science
• Logic in computer science
• Formal languages
• Hans Zantema
• International Conference on Rewriting Techniques and Applications
• Rewriting
• Termination analysis
• Divergence
• NP-completeness

Degrees of undecidability of in Term Rewriting J¨org Endrullis, Herman Geuvers, Hans Zantema Radboud University Nijmegen, Technical University Eindhoven, Free University Amsterdam, The Netherlands CSL 2009

Source URL: www.cs.ru.nl

• Theoretical computer science
• Mathematics
• Logic
• Mathematical logic
• Formal languages
• Logic in computer science
• Automated theorem proving
• Logic programming
• Rewriting
• Confluence
• Rewrite order
• Substitution