Proving Termination for Logic Programs by the Query-Mapping Pairs Approach-Reference-Cited by-同舟云学术

Proving Termination for Logic Programs by the Query-Mapping Pairs Approach

Published:2004 Issue: Volume: Page:453-498
ISSN:0302-9743
Container-title:Program Development in Computational Logic
language:
Short-container-title:

Author:

Lindenstrauss Naomi,Sagiv Yehoshua,Serebrenik Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25951-0_14.pdf

Reference83 articles.

1. Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1997)

2. Apt, K.R., Bezem, M.: Acyclic Programs. New Generation Computing 9, 335–363 (1991)

3. Lecture Notes in Computer Science;K.R. Apt,1995

4. Apt, K.R., Pedreschi, D.: Reasoning about Termination of Pure Prolog Programs. Information and Computation 106, 109–157 (1993)

5. Apt, K.R., Pedreschi, D.: Modular Termination Proofs for Logic and Pure Prolog Programs. In: Advances in Logic Programming Theory, pp. 183–229. Oxford University Press, Oxford (1994)

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

1. A practical analysis of non-termination in large logic programs;Theory and Practice of Logic Programming;2013-07

2. Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs;Practical Aspects of Declarative Languages;2013

3. Probabilistic Termination of CHRiSM Programs;Logic-Based Program Synthesis and Transformation;2012

4. Non-termination Analysis and Cost-Based Query Optimization of Logic Programs;Web Reasoning and Rule Systems;2012

5. Monotonicity Constraints for Termination in the Integer Domain;Logical Methods in Computer Science;2011-08-24