SCOPUS 정보 검색 플랫폼

Electronic Notes in Theoretical Computer Science

Volumn 4, Issue C, 1996, Pages 90-109

Fast matching in combinations of regular equational theories

(1) Eker, S a

a SRI INTERNATIONAL (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATA STRUCTURES; FORMAL LOGIC; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

EQUATORIAL THEORIES; IDEMPOTENCE EQUATIONS; NON-LINEAR VARIABLES; REWRITING LOGICS;

COMPUTATION THEORY;

EID: 19144370694 PISSN: 15710661 EISSN: None Source Type: Journal
DOI: 10.1016/S1571-0661(04)00035-0 Document Type: Article

Times cited : (21)

References (13)

1
- 84916557312
- L. Bachmair, T. Chen, and I. V. Ramakrishnan. Associative-commutative discrimination nets. In M.-C. Gaudel and J.-P. Jouannaud, editors, TAPSOFT '93: Theory and Practice of Software Development, 4th International J oint Conference CAAP/FASE, pages 61–74. Springer-Verlag, 1993.

2
- 0001016028
- Complexity of matching problems
- (1987) Journal of Symbolic Computation , vol.3 , pp. 203-216
- Benanav¹ Kapur² Narendran³

3
- 85035020121
- Automata, Languages and Programming, Seventh Colloquium
- Springer-Verlag
- (1980) A characterization of computable data types by means of a finite equational specification method , pp. 76-90
- Bergstra¹ Tucker²

4
- 84916557311
- M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. This volume.

5
- 84916557310
- S. Eker. Associative matching for linear terms. Technical Report CS-R9224, Center for Mathematics and Computer Science, Amsterdam, July 1992.

6
- 0001286753
- Associative-commutative matching via bipartite graph matching
- (1995) The Computer Journal , vol.38 , Issue.5 , pp. 381-399
- Eker¹

7
- 0027116146
- Order sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
- (1992) Theoretical Computer Science , vol.105 , pp. 217-273
- Goguen¹ Meseguer²

8
- 84916557309
- J. A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ3. Technical Report SRI-CSL-92-03, Computer Science Laboratory, SRI International, March 1992.

9
- 84916557308
- J.-M. Hullot. Compilation de Formes Canoniques dans les Theories Equationnelles. PhD thesis, University de Paris Sud, Orsay, France, 1980.

10
- 84916557307
- Narciso Martí-Oliet and José Meseguer. Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, August 1993.

11
- 0027113376
- Conditional rewriting logic as a unified model of concurrency
- (1992) Theoretical Computer Science , vol.96 , Issue.1 , pp. 73-155
- Meseguer¹

12
- 0000657780
- Combining matching algorithms The regular case
- (1991) Journal of Symbolic Computation , vol.12 , pp. 633-653
- Nipkow¹

13
- 84916588112
- Automata, Languages and Programming, 19th Colloquium
- Springer-Verlag
- (1992) Adaptive pattern matching , pp. 247-260
- Sekar¹ Ramesh² Ramakrishnan³

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