An Abstract Interpretation Approach to Termination of Logic Programs-Reference-Cited by-同舟云学术

An Abstract Interpretation Approach to Termination of Logic Programs

Published: Issue: Volume: Page:362-380
ISSN:
Container-title:Logic for Programming and Automated Reasoning
language:
Short-container-title:

Author:

Gori Roberta

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44404-1_23.pdf

Reference43 articles.

1. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495–574. Elsevier and The MIT Press, 1990. 365

2. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997. 362

3. K. R. Apt and D. Pedreschi. Studies in Pure Prolog: Termination. In J. W. Lloyd, editor, Computational Logic, pages 150–176. Springer-Verlag, 1990. 372

4. K. R. Apt and D. Pedreschi. Reasoning about termination of pure PROLOG programs. Information and Computation, 106(1):109–157, 1993. 372

5. K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In G. Levi, editor, Advances in Logic Programming Theory, pages 183–229. Oxford University Press, 1994. 372

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proving Termination for Logic Programs by the Query-Mapping Pairs Approach;Program Development in Computational Logic;2004

2. Characterisations of Termination in Logic Programming;Program Development in Computational Logic;2004

3. An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations;Theoretical Computer Science;2003-01

4. Classes of terminating logic programs;Theory and Practice of Logic Programming;2002-04-23