SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Symbolic Computation

Volumn 12, Issue 6, 1991, Pages 633-653

Combining matching algorithms: The regular case

(1) Nipkow, Tobias a

a UNIVERSITY OF CAMBRIDGE (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000657780 PISSN: 07477171 EISSN: None Source Type: Journal
DOI: 10.1016/S0747-7171(08)80145-9 Document Type: Article

Times cited : (23)

References (19)

1
- 0041805676
- Matching — A special case of unification?
- (1989) J. Symbolic Computation , vol.8 , pp. 523-536
- Bürckert, H.-J.¹

2
- 0018504528
- Proving termination with multiset orderings
- (1979) Commun. ACM , vol.22 , pp. 465-476
- Dershowitz, N.¹ Manna, Z.²

3
- 0022188648
- Principles of OBJ2
- (1985) Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages , pp. 52-66
- Futatsugi, K.¹ Goguen, J.A.² Jouannaud, J.-P.³ Meseguer, J.⁴

4
- 84976861590
- An overview of LP, The Larch prover. Proceedings of the Third International Conference on Rewriting Techniques and Applications
- (1989) Springer Lec. Notes Comp. Sci. , vol.355 , pp. 137-151
- Garland, S.J.¹ Guttag, J.V.²

5
- 85035782513
- Combination of unification algorithms. Proceedings of the Eighth International Conference on Automated Deduction
- (1986) Springer Lec. Notes Comp. Sci. , vol.230 , pp. 450-469
- Herold, A.¹

6
- 0011470135
- Ph.D. Thesis, Fachbereich Informatik, Universität Kaiserslautern
- (1987) Combination of Unification Algorithms in Equational Theories
- Herold, A.¹

7
- 84976811006
- Confluent reductions: Abstract properties and applications to term rewriting systems
- (1980) Journal of the ACM , vol.27 , pp. 797-821
- Huet, G.¹

8
- 0002939136
- Equations and rewrite rules — A survey
- R. Book, Academic Press, New York
- (1982) Formal Languages: Perspectives and Open Problems , pp. 349-405
- Huet, G.¹ Oppen, D.C.²

9
- 0001686885
- Completion of a set of rules modulo a set of equations
- (1986) SIAM Journal on Computing , vol.15 , pp. 1155-1194
- Jouannaud, J.-P.¹ Kirchner, H.²

10
- 22244450569
- Thèse d'état, Université de Nancy I
- (1985) Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles
- Kirchner, C.¹

11
- 85032476972
- REVE: A rewrite rule laboratory
- (1986) Proceedings of the Eighth International Conference on Automated Deduction. Springer Lee, Notes Comp. Sci. , vol.230 , pp. 695-696
- Lescanne, P.¹

12
- 84976745321
- An efficient unification algorithm
- (1982) ACM Transactions on Programming Languages and Systems , vol.4 , pp. 258-282
- Martelli, A.¹ Montanari, U.²

13
- 84976823860
- Complete sets of reductions for some equational theories
- (1981) Journal of the ACM , vol.28 , pp. 233-264
- Peterson, G.E.¹ Stickel, M.E.²

14
- 84937708748
- Unification in a combination of arbitrary disjoint equational theories
- (1989) J. Symbolic Computation , vol.8 , pp. 51-99
- Schmidt-Schauβ, M.¹

15
- 84990727549
- Unification theory
- (1989) Journal of Symbolic Computation , vol.7 , pp. 207-274
- Siekmann, J.H.¹

16
- 0011565560
- Ph.D. Thesis, Universität Karlsruhe
- (1982) Unifikationstheorie erster Ordnung
- Szabó, P.¹

17
- 85035746639
- Unification in combinations of collapse-free theories with disjoint sets of function symbols
- (1986) Proceedings of the Eighth International Conference on Automated Deduction. Springer Lec. Notes Comp. Sci. , vol.230 , pp. 431-449
- Tidén, E.¹

18
- 0000730036
- Ph.D. Thesis, Department of Numerical Analysis and Computing Science, The Royal Institute of Technology, Stockholm
- (1986) First-order unification in combinations of equational theories
- Tidén, E.¹

19
- 84976845770
- Unification in combinations of collapse-free regular theories
- (1987) Journal of Symbolic Computation , vol.3 , pp. 153-181
- Yelick, K.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.