Verification of logic programs with delay declarations-Reference-Cited by-同舟云学术

Verification of logic programs with delay declarations

Published:1995 Issue: Volume: Page:66-90
ISSN:0302-9743
Container-title:Algebraic Methodology and Software Technology
language:
Short-container-title:

Author:

Apt Krzysztof R.,Luitjes Ingrid

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60043-4_47.pdf

Reference22 articles.

1. K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS 93), Lecture Notes in Computer Science, pages 1–19, Berlin, 1993. Springer-Verlag.

2. K. R. Apt and A. Pellegrini. On the occur-check free Prolog programs. ACM Toplas, 16(3):687–726, 1994.

3. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493–574. Elsevier, 1990. Vol. B.

4. K. R. Apt. Declarative programming in Prolog. In D. Miller, editor, Proc. International Symposium on Logic Programming, pages 11–35. MIT Press, 1993.

5. F. Bronsard, T.K. Lakshman, and U.S. Reddy. A framework of directionality for proving termination of logic programs. In K. R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 321–335. MIT Press, 1992.

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

1. A Note on Occur-Check;Electronic Proceedings in Theoretical Computer Science;2021-09-17

2. Logic + control: On program construction and verification;Theory and Practice of Logic Programming;2017-06-19

3. Input-Termination of Logic Programs;Logic Based Program Synthesis and Transformation;2005

4. Termination of Logic Programs Using Various Dynamic Selection Rules;Logic Programming;2004

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