SCOPUS 정보 검색 플랫폼

Volumn 9, Issue 2, 1992, Pages 261-288

Complexity of unification problems with associative-commutative operators

(2) Kapur, Deepak a Narendran, Paliath a

a STATE UNIVERSITY OF NEW YORK (United States)

Author keywords

associative; commutative; complexity; equational theories; idempotent; identity; matching; NP complete; set matching; Unification; unit; word equations

Indexed keywords

EID: 0000365516 PISSN: 01687433 EISSN: 15730670 Source Type: Journal
DOI: 10.1007/BF00245463 Document Type: Article

Times cited : (59)

References (35)

1
- 84935258903
- Arnborg, S. and Tiden, E., ‘Unification problems with one-sided distributivity’, in: Proc. First international conference on Rewriting Techniques and Applications (RTA-85), Dijon, France, May 1985, LNCS 202, Springer Verlag, pp. 398–406. A revised version appeared in J. Symbolic Computation3 (1987).

2
- 51249175553
- Unification in varieties of idempotent semigroups
- (1987) Semigroup Forum , vol.36 , pp. 132
- Baader, F.¹

3
- 84935258896
- Benanav, D., Kapur, D. and Narendran, P., ‘Complexity of matching problems’, in : Proc. First international conference on Rewriting Techniques and Applications (RTA-85), Dijon, France, May 1985, LNCS 202, Springer Verlag. A revised version appeared in J. Symbolic Computation3, 203–216 (1987).

4
- 0024143039
- Opening the AC-unification race
- (1988) J. Automated Reasoning , vol.4 , pp. 465-474
- Bürchert, H.-J.¹ Herold, A.² Kapur, D.³ Siekmann, J.H.⁴ Stickel, M.⁵ Tepp, M.⁶ Zhang, H.⁷

5
- 84935258895
- Chandra, A. and Kanellakis, P., Personal communication (1985).

6
- 0021509216
- Linear time algorithms for testing the satisfiability of propositional Horn formula
- (1984) J. Logic Programming , vol.3 , pp. 267-284
- Dowling, W.F.¹ Gallier, J.²

7
- 84935258898
- Fages, F., ‘Associative-commutative unification’, in: Proc. 7th Conference on Automated Deduction (CADE-7), Napa Valley, California, 1984, LNCS 170, Springer Verlag. A revised version appeared in J. Symbolic Computation3(3), June (1987).

8
- 84935258897
- Fay, M., ‘First-order unification in an equational theory’, in: Proc 4th Workshop on Automated Deduction, Austin, Texas (1979).

9
- 84935258900
- Fortenbacher, A., ‘An algebraic approach to unification under associativity and commutativity’, in: Proc. First international conference on Rewriting Techniques and Applications (RTA-85), Dijon, France, 1985, LNCS 202, Springer Verlag. A revised version appeared in J. Symbolic Computation3, June (1987).

10
- 0003603813
- W. H. Freeman and Co., San Francisco
- (1979) Computers and intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

11
- 84935258899
- Herold, A. and Siekmann, J., ‘Unification in Abelian semigroups’. Memo SEKI-85-III-KL, Universitaet Kaiserslautern (1985). A revised version appeared in J. Automated Reasoning3(3) (1987).

12
- 84935258902
- Kandri-Rody, A., Kapur, D. and Narendran, P., ‘Word and unification problems over commutative algebras’, in: Proc. First international conference on Rewriting Techniques and Applications (RTA-85), Dijon, France, 1985, LNCS 202, Springer-Verlag.

13
- 84935258901
- Kapur, D. and Narendran, P., ‘NP-completeness of the set unification and matching problems’, in: Proc. 8th Conference on Automated Deduction (CADE-8), Oxford, U.K. (1986), LNCS 230, Springer Verlag.

14
- 84935258894
- Computer Science Branch, General Electric Corporate Research and Development, Schenectady, NY
- (1986) NP-completeness of the associative-commutative unification and related problems
- Kapur, D.¹ Narendran, P.²

15
- 84935258893
- Kapur, D. and Narendran, P., ‘Matching, unification, and complexity’, SIGSAM Bulletin (1987).

16
- 84935258892
- Kapur, D., Narendran, P. and Otto, F., ‘On ground confluence of term rewriting systems’. Technical Report, Department of Computer Science, State University of New York at Albany (1988). A revised version appeared in Information and Computation (May 1990).

17
- 84935258891
- Knuth, D. E. and Bendix, P. B., ‘Simple word problems in universal algebras’, in Computational Problems in Abstract Algebras (ed. J. Leech), Pergamon Press, pp. 263–297 (1970).

18
- 0010584319
- Dept. of Computer Science, Cornell University, Ithaca, NY
- (1976) Complexity of finitely presented algebras
- Kozen, D.¹

19
- 0004470473
- Dept. of Mathematics and Computer Sciences, Univ. of Texas, Austin, TX
- (1975) Canonical inference
- Lankford, D.S.¹

20
- 0003805224
- Memo ATP, 39, Dept. of Mathematics and Computer Sciences, Univ. of Texas, Austin, TX
- (1977) Decision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions
- Lankford, D.S.¹ Ballantyne, A.M.²

21
- 84935258890
- Livesey, M. and Siekmann, J., ‘Unification in sets and multisets’. Memo SEKI-76-11, Universitaet Karlsruhe (1976).

22
- 84935258889
- Livesey, M., Siekmann, J., Szabo, P. and Unvericht, E., ‘Unification problems for combinations of associativity, commutativity, distributivity, and idempotence axioms’, in: Proc. 4th Workshop on Automated Deduction, Austin, Texas, pp. 161–167 (1979).

23
- 33646332337
- The problem of solvability of equations in a free semi-group
- (1977) Akad. Nauk. SSSR, Transactions on Mathematics , vol.233 , pp. 2
- Makanin, G.S.¹

24
- 84935258888
- Papadimitriou, C. H. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall (1982).

25
- 0000920987
- Linear unification
- (1978) J. Computer and System Sciences , vol.16 , pp. 158-167
- Paterson, M.S.¹ Wegman, M.N.²

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

27
- 84935258887
- Plotkin, G., ‘Building in equational theories’, Machine Intelligene7 (eds. Meltzer an Michie), pp. 73–90 (1972).

28
- 84935258886
- Sethi, R., cited in [10], p. 252.

29
- 84935258885
- Siekmann, J. H., ‘Universal unification’, in: Proc. 7th Conference on Automated Deduction (CADE-84), Napa Valley, California, LNCS 170, Springer Verlag (1984).

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

31
- 0016115108
- Automated theorem proving with simplifiers, commutativity and associativity
- (1974) J. Assoc. Comp. Mach. , vol.21 , pp. 622-642
- Slagle, J.¹

32
- 84935258884
- Stickel, M. E., ‘A complete unification algorithm for associative-commutative functions’, 4th International Joint Conf. Artificial Intelligence, Tbilisi, USSR (1975).

33
- 84976741234
- A unification algorithm for associative-commutative functions
- (1981) Journal of the ACM , vol.28 , pp. 423-434
- Stickel, M.E.¹

34
- 84935258881
- Szabo, P., ‘Unifikationstheorie erster Ordnung’, Dissertation, Universitat Karlsruhe, West Germany (1982).

35
- 2742542215
- Paramodulation and set of support
- Springer Verlag, New York
- (1968) Proceedings of the IRIA Symposium on Automatic Demonstration
- Wos, L.¹ Robinson, G.²

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