To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Modular Termination Proof… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Modular Termination Proofs for Rewriting Using Dependency Pairs

Journal article
Authors Jürgen Giesl
Thomas Arts
Enno Ohlebusch
Published in Journal of Symbolic Computation
Volume 34
Issue 1
Pages 21-58
Publication year 2002
Published at Department of Applied Information Technology (GU)
Pages 21-58
Language en
Subject categories
Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?