Termination of logic programs using semantic unification-Reference-Cited by-同舟云学术

Termination of logic programs using semantic unification

Published:1996 Issue: Volume: Page:219-233
ISSN:0302-9743
Container-title:Logic Program Synthesis and Transformation
language:
Short-container-title:

Author:

Arts Thomas,Zantema Hans

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60939-3_17.pdf

Reference20 articles.

1. G. Aguzzi and U. Modigliani. Proving termination of logic programs by transforming them into equivalent term rewriting systems. Proceedings of FST&TCS 13, LNCS(761):114–124, December 1993.

2. Thomas Arts. Termination by absence of infinite chains of dependency pairs. In Proceedings of CAAP'96, April 1996. Full version appeared as technical report UU-CS-1995-32, Utrecht University.

3. Thomas Arts and Hans Zantema. Termination of logic programs via labelled term rewrite systems. Technical Report UU-CS-1994-20, Utrecht University.

4. Thomas Arts and Hans Zantema. Termination of constructor systems using semantic unification. Technical Report UU-CS-1995-17, Utrecht University.

5. Maher Chtourou and Michaël Rusinowitch. Méthode transformationnelle pour la preuve de terminaison des programmes logiques. Unpublished manuscript in French, 1993.

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

1. Multi-paradigm Programming in Maude;Rewriting Logic and Its Applications;2018

2. A Finite Representation of the Narrowing Space;Logic-Based Program Synthesis and Transformation;2014

3. Functional Logic Programming in Maude;Specification, Algebra, and Software;2014

4. Termination of narrowing via termination of rewriting;Applicable Algebra in Engineering, Communication and Computing;2010-02-25

5. Automated Termination Analysis for Logic Programs by Term Rewriting;Logic-Based Program Synthesis and Transformation;2007