Computing congruent closures on terms
- 14 Downloads
KeywordsEquivalence Class Substitutional Consequence Total Time Complexity Smith Normal Form Associative Operation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.A. B. Godlevskii, Yu. V. Kapitonova, S. L. Krivoi, and A. A. Letichevskii, “Iterative methods of program analysis” Kibernetika, No. 2, 9–19 (1989).Google Scholar
- 2.F. Baader and J. Siekman, “Unification theory,” J. Symb. Comp., 3, No. 1/2 (1995).Google Scholar
- 4.S. L. Krivoi, “Algorithms to compute congruent closures of finite automata and some applications,” Kibern. Sist. Anal., No. 1, 34–44 (1994).Google Scholar
- 5.G. S. Tscitin, “Associative calculus with undecidable equivalence problem,” Trudy Mat. Inst. im. Steklova AN SSSR, 52, 172–189 (1958).Google Scholar
- 6.A. A. Markov, Theory of Algorithms, Trudy Mat. Inst. im. Steklova AN SSSR, Vol. 42 (1954).Google Scholar
- 7.V. G. Timkovskii, “Complexity of finding common subsequences, supersequences, and similar problems,” Kibernetika, No. 5, 1–13 (1989).Google Scholar
- 8.A. Sgreijver, Linear and Integer Programming Theory [Russian translation], Mir, Moscow (1991).Google Scholar
- 9.E. Contenjean and H. Devie, “Solving systems of linear Diophantine equations,” Proc. 3rd Workshop on Unification, University of Kaiserslautern, Lambrecht, Germany, (June 1989).Google Scholar
© Plenum Publishing Corporation 1998