Modular Termination Proofs for Rewriting Using Dependency Pairs

Jürgen Giesl; Thomas Arts; Enno Ohlebusch

If you have questions, need help, find a bug or just want to give us feedback you may use this form, or contact us per e-mail research.lib@chalmers.se.

Message

Your email address

Research.chalmers.se contains research information from Chalmers University of Technology, Sweden. It includes information on projects, publications, research funders and collaborations.

More about coverage period and what is publicly available

Privacy and cookies

Accessibility

Citation Style Language
citeproc-js (Frank Bennett)

Chalmers Library

Chalmers Research

Chalmers Student Theses

SE-412 96 GOTHENBURG, SWEDEN
PHONE: +46 (0)31-772 10 00
WWW.CHALMERS.SE

Modular Termination Proofs for Rewriting Using Dependency Pairs
Journal article, 2002

Author

Jürgen Giesl

Thomas Arts

Enno Ohlebusch

Journal of Symbolic Computation

Subject Categories

More information

Created

Modular Termination Proofs for Rewriting Using Dependency Pairs Journal article, 2002