Loading...
Please wait, while we are loading the content...
Similar Documents
Automated termination analysis for logic programs with cut
| Content Provider | Scilit |
|---|---|
| Author | Schneider-Kamp, Peter Giesl, Jürgen Ströder, Thomas Serebrenik, Alexander Thiemann, René |
| Copyright Year | 2010 |
| Description | Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator. We introduce a novel pre-processing method which automatically transforms Prolog programs into logic programs without cuts, where termination of the cut-free program implies termination of the original program. Hence after this pre-processing, any technique for proving termination of definite logic programs can be applied. We implemented this pre-processing in our termination prover AProVE and evaluated it successfully with extensive experiments. |
| Related Links | http://arxiv.org/pdf/1007.4908 http://arxiv.org/abs/1007.4908 https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6085A3B69C49E113A6D88E38D7CBCABB/S1471068410000165a.pdf/div-class-title-automated-termination-analysis-for-logic-programs-with-cut-a-href-fn01-ref-type-fn-a-div.pdf |
| Ending Page | 381 |
| Page Count | 17 |
| Starting Page | 365 |
| ISSN | 14710684 |
| e-ISSN | 14753081 |
| DOI | 10.1017/s1471068410000165 |
| Journal | Theory and Practice of Logic Programming |
| Issue Number | 4-6 |
| Volume Number | 10 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2010-07-01 |
| Access Restriction | Open |
| Subject Keyword | Theory and Practice of Logic Programming Hardware and Architecture Automated Termination Analysis Definite Logic Programs |
| Content Type | Text |
| Resource Type | Article |
| Subject | Artificial Intelligence Theoretical Computer Science Computational Theory and Mathematics Hardware and Architecture Software |
