AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL), no. 1 (2009): ArticleNo.2-ArticleNo.2

Cited: 55|Views27

Full Text

View via Publisher

Other Links

dl.acm.org dblp.uni-trier.de academic.microsoft.com arxiv.org

Bibtex

Keywords

dependency pairstransformational approachtermination prover aproveautomated termination analysistheoryMore(11+)

Abstract

There are two kinds of approaches for termination analysis of logic programs: “transformational” and “direct” ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into a Term Rewrite System (TRS) and then analyze termination of the resulting TRS instead...More

Code:

Data:

Full Text

PPT (Upload PPT)

Similar

Reference

Cited

Author

[0]

[0]

[0]

[0]

Your rating :

No Ratings