Linear second-order unification-Reference-Cited by-同舟云学术

Linear second-order unification

Published:1996 Issue: Volume: Page:332-346
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Levy Jordi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61464-8_63.pdf

Reference18 articles.

1. H. Comon. Completion of rewrite systems with membership constraints, part I: Deduction rules and part II: Constraint solving. Technical report, CNRS and LRI, Université de Paris Sud, 1993. (To appear in J. of Symbolic Computation).

2. J. H. Gallier and W. Snyder. Designing unification procedures using transformations: A survey. Bulletin of the EATCS, 40:273–326, 1990.

3. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225–230, 1981.

4. W. E. Gould. A Matching Procedure for ω-Order Logic. PhD thesis, Princeton Univ., 1966.

5. G. Huet. The undecidability of unification in third-order logic. Information and Control, 22(3):257–267, 1973.

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

1. Recompression: Technique for Word Equations and Compressed Data;Language and Automata Theory and Applications;2020

2. Deciding Context Unification;Journal of the ACM;2019-12-31

3. Deciding Context Unification (with Regular Constraints);Developments in Language Theory;2019

4. A Constraint Solver for Equations over Sequences and Contexts;Advanced Computational Methods for Knowledge Engineering;2016

5. Context Unification is in PSPACE;Automata, Languages, and Programming;2014