Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CORR
2008
Springer

favoriteEmaildiscussreport

92views Education» more CORR 2008»

Automated Termination Proofs for Logic Programs by Term Rewriting

13 years 4 months ago

Automated Termination Proofs for Logic Programs by Term Rewriting

Download tocl.acm.org

Peter Schneider-Kamp, Jürgen Giesl, Alexander

Real-time Traffic

CORR 2008 | Education |

claim paper

Related Content

» A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

» Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems

» A3PAT an approach for certified automated termination proofs

» Termination of justfair computations in term rewriting

» Logic Programs as term Rewriting Systems

» Automated Termination Proofs for Java Programs with Cyclic Data

» Termination of Priority Rewriting

» Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

» Automated termination proofs for haskell by term rewriting

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann

Comments (0)