-
2
-
-
0024960706
-
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
-
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
-
4
-
-
23044517715
-
Congruence closure modulo associativity-commutativity
-
in H. Kirchner and C. Ringeissen (eds); Springer, Berlin
-
Bachmair, L., Ramakrishnan, I., Tiwari, A. and Vigneron, L.: Congruence closure modulo Associativity-Commutativity, in H. Kirchner and C. Ringeissen (eds), Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 2000, Lecture Notes in Artificial Intelligence 1794, Springer, Berlin, 2000, pp. 245-259.
-
(2000)
Frontiers of Combining Systems, Third International Workshop, FroCoS 2000, Nancy, France, March 2000, Lecture Notes in Artificial Intelligence
, vol.1794
, pp. 245-259
-
-
Bachmair, L.1
Ramakrishnan, I.2
Tiwari, A.3
Vigneron, L.4
-
5
-
-
84937429063
-
Abstract congruence closure and specializations
-
in D. McAllester (ed.); Springer, Berlin
-
Bachmair, L. and Tiwari A.: Abstract congruence closure and specializations, in D. McAllester (ed.), Conference on Automated Deduction, CADE 2000, Pittsburgh, PA, June 2000, Lecture Notes in Artificial Intelligence 1831, Springer, Berlin, 2000, pp. 64-78.
-
(2000)
Conference on Automated Deduction, CADE 2000, Pittsburgh, PA, June 2000, Lecture Notes in Artificial Intelligence
, vol.1831
, pp. 64-78
-
-
Bachmair, L.1
Tiwari, A.2
-
7
-
-
0346376752
-
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
-
9
-
-
84976664421
-
Exponential space complete problems for petri nets and commutative semigroups
-
Cardozo, E., Lipton, R. and Meyer, A.: Exponential space complete problems for petri nets and commutative semigroups, in Proc. 8th Ann. ACM Symp on Theory of Computing, 1976, pp. 50-54.
-
Proc. 8th Ann. ACM Symp on Theory of Computing, 1976
, pp. 50-54
-
-
Cardozo, E.1
Lipton, R.2
Meyer, A.3
-
10
-
-
0004060205
-
Tree automata techniques and applications
-
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S. and Tommasi, M.: Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
-
(1997)
-
-
Comon, H.1
Dauchet, M.2
Gilleron, R.3
Jacquemard, F.4
Lugiez, D.5
Tison, S.6
Tommasi, M.7
-
11
-
-
84957670988
-
On Shostak's decision procedure for combination of theories
-
in M. A. McRobbie and J. Slaney (eds); Springer, Berlin
-
Cyrluk, D., Lincoln, P. and Shankar, N.: On Shostak's decision procedure for combination of theories, in M. A. McRobbie and J. Slaney (eds), Proceedings of the 13th Int. Conference on Automated Deduction, Lecture Notes in Comput. Sci. 1104, Springer, Berlin, 1996, pp. 463-477.
-
(1996)
Proceedings of the 13th Int. Conference on Automated Deduction, Lecture Notes in Comput. Sci.
, vol.1104
, pp. 463-477
-
-
Cyrluk, D.1
Lincoln, P.2
Shankar, N.3
-
12
-
-
0000029077
-
Rewrite systems
-
in J. van Leeuwen (ed.); North-Holland, Amsterdam
-
Dershowitz, N. and Jouannaud, J. P.: Rewrite systems, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), North-Holland, Amsterdam, 1990.
-
(1990)
Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics)
-
-
Dershowitz, N.1
Jouannaud, J.P.2
-
13
-
-
0018504528
-
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
-
14
-
-
0346262626
-
Shallow AC theories
-
Domenjoud, E. and Klay, F.: Shallow AC theories, in Proceedings of the 2nd CCL Workshop, La Escala, Spain, Sept. 1993.
-
Proceedings of the 2nd CCL Workshop, La Escala, Spain, Sept. 1993
-
-
Domenjoud, E.1
Klay, F.2
-
15
-
-
84976799536
-
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
-
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
-
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
-
18
-
-
84947715642
-
Shostak's congruence closure as completion
-
in H. Comon (ed.); Spinger, Berlin
-
Kapur, D.: Shostak's congruence closure as completion, in H. Comon (ed.), Rewriting Techniques and Applications, RTA 1997, Sitges, Spain, July 1997, Lecture Notes in Comput. Sci. 1103, Spinger, Berlin, pp. 23-37.
-
Rewriting Techniques and Applications, RTA 1997, Sitges, Spain, July 1997, Lecture Notes in Comput. Sci.
, vol.1103
, pp. 23-37
-
-
Kapur, D.1
-
20
-
-
0012608563
-
On ground AC-completion
-
in R. V. Book (ed.); Springer, Berlin
-
Marche, C.: On ground AC-completion, in R. V. Book (ed.), 4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci. 488, Springer, Berlin, 1991, pp. 411-422.
-
(1991)
4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci.
, vol.488
, pp. 411-422
-
-
Marche, C.1
-
21
-
-
0001751788
-
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
-
22
-
-
84947437390
-
Any ground associative-commutative theory has a finite canonical system
-
in R. V. Book (ed.); Springer, Berlin
-
Narendran, P. and Rusinowitch, M.: Any ground associative-commutative theory has a finite canonical system, in R. V. Book (ed.) 4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci. 488, Springer, Berlin, 1991, pp. 423-434.
-
(1991)
4th International Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci.
, vol.488
, pp. 423-434
-
-
Narendran, P.1
Rusinowitch, M.2
-
23
-
-
0019003680
-
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
-
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
-
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
-
26
-
-
0346949048
-
A precedence-based total AC-compatible ordering
-
in C. Kirchner (ed.); Springer, Berlin
-
Rubio, A. and Nieuwenhuis, R.: A precedence-based total AC-compatible ordering, in C. Kirchner (ed.), Proceedings of the 5 Intl. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci. 960, Springer, Berlin, 1993, pp. 374-388.
-
(1993)
Proceedings of the 5 Intl. Conference on Rewriting Techniques and Applications, Lecture Notes in Comput. Sci.
, vol.960
, pp. 374-388
-
-
Rubio, A.1
Nieuwenhuis, R.2
-
28
-
-
0021125949
-
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
-
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
-
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
|