Automated Termination Proofs for Logic Programs by Term Rewriting.

Saved in:

Bibliographic Details
Title:	Automated Termination Proofs for Logic Programs by Term Rewriting.
Authors:	Schneider-Kamp, Peter¹, petersk@imada.sdu.dk, Giesl, Jürgen², giesl@informatik.rwth-aachen.de, Serebrenik, Alexander³, a.serebrenik@tue.nl, Thiemann, René⁴, rene.thiemann@uibk.ac.at
Source:	ACM Transactions on Computational Logic; Oct2009, Vol. 11 Issue 1, p2-2:52, 52p, 4 Charts
Database:	Applied Science & Technology Source

Description
ISSN:	15293785
DOI:	10.1145/1614431.1614433