Modular Termination of Basic Narrowing-Reference-Cited by-同舟云学术

Modular Termination of Basic Narrowing

Published: Issue: Volume: Page:1-16
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Alpuente María,Escobar Santiago,Iborra José

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70590-1_1.pdf

Reference26 articles.

1. Alpuente, M., Escobar, S., Iborra, J.: Modular termination of basic narrowing. Technical Report DSIC-II/04/08, Universidad Politécnica de Valencia (2007)

2. Alpuente, M., Escobar, S., Iborra, J.: Termination of Narrowing revisited. Theoretical Computer Science (to appear, 2008)

3. Alpuente, M., Falaschi, M., Gabbrielli, M., Levi, G.: The semantics of equational logic programming as an instance of CLP. In: Logic Programming Languages, pp. 49–81. The MIT Press, Cambridge (1993)

4. Alpuente, M., Falaschi, M., Levi, G.: Incremental Constraint Satisfaction for Equational Logic Programming. Theoretical Computer Science 142(1), 27–57 (1995)

5. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2), 133–178 (2000)

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

1. Variant-based Equational Unification under Constructor Symbols;Electronic Proceedings in Theoretical Computer Science;2020-09-19

2. Most General Variant Unifiers;Electronic Proceedings in Theoretical Computer Science;2019-09-19

3. Modular termination of basic narrowing and equational unification;Logic Journal of IGPL;2010-04-29

4. Folding Variant Narrowing and Optimal Variant Termination;Rewriting Logic and Its Applications;2010

5. Unification and Narrowing in Maude 2.4;Rewriting Techniques and Applications;2009