메뉴 건너뛰기




Volumn 31, Issue 2, 2003, Pages 129-168

Abstract congruence closure

Author keywords

Associative commutative theories; Congruence closure; Term rewriting

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; INFERENCE ENGINES; THEOREM PROVING;

EID: 0346076868     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JARS.0000009518.26415.49     Document Type: Article
Times cited : (51)

References (30)
  • 2
    • 0024960706 scopus 로고
    • Completion for rewriting modulo a congruence
    • (Oct.)
    • Bachmair, L. and Dershowitz, N.: Completion for rewriting modulo a congruence, Theoret. Comput. Sci. 67(2 & 3) (Oct. 1989), 173-201.
    • (1989) Theoret. Comput. Sci. , vol.67 , Issue.2-3 , pp. 173-201
    • Bachmair, L.1    Dershowitz, N.2
  • 3
    • 85032070107 scopus 로고
    • Equational inference, canonical proofs, and proof orderings
    • Bachmair, L. and Dershowitz, N.: Equational inference, canonical proofs, and proof orderings, J. ACM 41 (1994), 236-276.
    • (1994) J. ACM , vol.41 , pp. 236-276
    • Bachmair, L.1    Dershowitz, N.2
  • 7
    • 0346376752 scopus 로고
    • New decision algorithms for finitely presented commutative semigroups
    • Ballantyne, A. M. and Lankford, D. S.: New decision algorithms for finitely presented commutative semigroups, Comp. Math. Appl. 7 (1981), 159-165.
    • (1981) Comp. Math. Appl. , vol.7 , pp. 159-165
    • Ballantyne, A.M.1    Lankford, D.S.2
  • 13
    • 0018504528 scopus 로고
    • Proving termination with multiset orderings
    • Dershowitz, N. and Manna, Z.: Proving termination with multiset orderings, Comm. ACM 22(8) (1979), 465-476.
    • (1979) Comm. ACM , vol.22 , Issue.8 , pp. 465-476
    • Dershowitz, N.1    Manna, Z.2
  • 15
    • 84976799536 scopus 로고
    • Variations on the common subexpressions problem
    • Downey, P. J., Sethi, R. and Tarjan, R. E.: Variations on the common subexpressions problem, J. ACM 27(4) (1980), 758-771.
    • (1980) J. ACM , vol.27 , Issue.4 , pp. 758-771
    • Downey, P.J.1    Sethi, R.2    Tarjan, R.E.3
  • 16
    • 84963053678 scopus 로고
    • The word problem for abstract algebras
    • Evans, T.: The word problem for abstract algebras, J. London Math. Soc. 26 (1951), 64-71.
    • (1951) J. London Math. Soc. , vol.26 , pp. 64-71
    • Evans, T.1
  • 17
    • 0041837290 scopus 로고
    • Word problems
    • Evans, T.: Word problems, Bull. Amer. Math. Soc. 84(5) (1978), 789-802.
    • (1978) Bull. Amer. Math. Soc. , vol.84 , Issue.5 , pp. 789-802
    • Evans, T.1
  • 21
    • 0001751788 scopus 로고
    • The complexity of the word problems for commutative semigroups and polynomial ideals
    • Mayr, E. W. and Meyer, A. R.: The complexity of the word problems for commutative semigroups and polynomial ideals, Adv. in Math. 46 (1982), 305-329.
    • (1982) Adv. in Math. , vol.46 , pp. 305-329
    • Mayr, E.W.1    Meyer, A.R.2
  • 23
    • 0019003680 scopus 로고
    • Fast decision procedures based on congruence closure
    • (Apr.)
    • Nelson, G. and Oppen, D.: Fast decision procedures based on congruence closure, J. Assoc. Comput. Mach. 27(2) (Apr. 1980), 356-364.
    • (1980) J. Assoc. Comput. Mach. , vol.27 , Issue.2 , pp. 356-364
    • Nelson, G.1    Oppen, D.2
  • 24
    • 84976823860 scopus 로고
    • Complete sets of reductions for some equational theories
    • (Apr.)
    • Peterson, G. E. and Stickel, M. E.: Complete sets of reductions for some equational theories, J. ACM 28(2) (Apr. 1981), 233-264.
    • (1981) J. ACM , vol.28 , Issue.2 , pp. 233-264
    • Peterson, G.E.1    Stickel, M.E.2
  • 25
    • 0004453922 scopus 로고    scopus 로고
    • Proof lengths for equational completion
    • Plaisted, D. and Sattler-Klein, A.: Proof lengths for equational completion, Inform. and Comput. 125 (1996), 154-170.
    • (1996) Inform. and Comput. , vol.125 , pp. 154-170
    • Plaisted, D.1    Sattler-Klein, A.2
  • 27
    • 33846093299 scopus 로고    scopus 로고
    • Factotum: Automatic and systematic sharing support for systems analyzers
    • Sherman, D. J. and Magnier, N.: Factotum: Automatic and systematic sharing support for systems analyzers, in Proc. TACAS, Lecture Notes in Comput. Sci. 1384, 1998.
    • (1998) Proc. TACAS, Lecture Notes in Comput. Sci. , vol.1384
    • Sherman, D.J.1    Magnier, N.2
  • 28
    • 0021125949 scopus 로고
    • Deciding combinations of theories
    • Shostak, R. E.: Deciding combinations of theories, J. ACM 31(1) (1984), 1-12.
    • (1984) J. ACM , vol.31 , Issue.1 , pp. 1-12
    • Shostak, R.E.1
  • 29
    • 0002196939 scopus 로고
    • A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
    • Snyder, W.: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations, J. Symbolic Comput. 15(7) (1993).
    • (1993) J. Symbolic Comput. , vol.15 , Issue.7
    • Snyder, W.1
  • 30
    • 26344454878 scopus 로고    scopus 로고
    • Decision procedures in automated deduction
    • Ph.D. thesis, State University of New York at Stony Brook, New York
    • Tiwari, A.: Decision procedures in automated deduction, Ph.D. thesis, State University of New York at Stony Brook, New York, 2000.
    • (2000)
    • Tiwari, A.1


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