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

Author

Jürgen Giesl

Thomas Arts

University of Gothenburg

Other publications Research

Enno Ohlebusch

Journal of Symbolic Computation

Vol. 34 1 21-58

Subject Categories (SSIF 2011)

Computer and Information Science

More information

Created

10/10/2017

Feedback and support

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.

About

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)

Links

Chalmers Library
Chalmers Research
Chalmers Student Theses

Chalmers University of Technology

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