Result 1 to 20 of 23 total
Declarative representation of algorithms of completion by critical pairs. (English)
Cybernetics and Systems Analysis 37, No.6, 795-799 (2001); translation from Kibern. Sist. Anal. 2001, No.6, 18-24 (2001).
1
A categorical critical-pair completion algorithm. (English)
J. Symb. Comput. 27, No.5, 435-477 (1999).
2
About changing the ordering during Knuth-Bendix completion. (English)
Enjalbert, Patrice (ed.) et al., STACS 94. 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 775, 175-186 (1994).
3
A fine-grained parallel completion procedure. (English)
Von zur Gathen, Joachim (ed.) et al., ISSAC ’94. Proceedings of the international symposium on symbolic and algebraic computation, Oxford, GB, July 20-22, 1994. Baltimore, MD: ACM Press. 269-277 (1994).
4
Solving divergence in Knuth‒Bendix completion by enriching signatures. (English)
Theor. Comput. Sci. 112, No.1, 145-185 (1993).
5
Term rewriting systems and completion theorems proving: A short survey. (English)
Stud. Univ. Babeş-Bolyai, Math. 37, No.3, 117-125 (1992).
6
Automating the Knuth Bendix ordering. (English)
Acta Inf. 28, No.2, 95-119 (1990).
7
Automatic proofs by induction in theories without constructors. (English)
Inf. Comput. 82, No.1, 1-33 (1989).
8
Semi-unification. (English)
Foundations of software technology and theoretical computer science, Proc. 8th Conf., Pune/India 1988, Lect. Notes Comput. Sci. 338, 435-454 (1988).
9
Knuth-Bendix procedure and non deterministic behavior - an example. (English)
Bull. EATCS 32, 86-92 (1987).
10
Synthesis of specifications from programs. (English)
Artificial intelligence, Proc. 3. Österr. Tag., Wien 1987, Inf.- Fachber. 151, 157-167 (1987).
11
Systems of reductions. (English)
Lecture Notes in Computer Science, 277. Berlin etc.: Springer-Verlag. X, 265 p.; DM 40.50 (1987).
12
What strategy to compute a standard basis? (English)
Computers and computing, Proc. Int. Conf. dedic. N. Gastinel, Grenoble/France 1985, Étud. Rech. Inf., 62-66 (1986).
13
A simple non-termination test for the Knuth-Bendix method. (English)
Automated deduction, Proc. 8th Int. Conf., Oxford/Engl. 1986, Lect. Notes Comput. Sci. 230, 79-88 (1986).
14
On nontermination of Knuth-Bendix algorithm. (English)
Automata, languages and programming, Proc. 13th Int. Colloq., Rennes/France 1986, Lect. Notes Comput. Sci. 226, 146-156 (1986).
15
Equational completion by proof transformation. (English)
Zürich: Swiss Federal Institute of Technology, Thesis, III, 40 p. (1986).
16
Equational methods in first order predicate calculus. (English)
J. Symb. Comput. 1, 7-29 (1985).
17
Rewrite systems on a lattice of types. (English)
Acta Inf. 22, 149-169 (1985).
18
Term rewriting systems and algebra. (English)
Automated deduction, Proc. 7th int. Conf., Napa/Calif. 1984, Lect. Notes Comput. Sci. 170, 166-174 (1984).
19
Unification in some equational theories and the Knuth-Bendix algorithm. (English)
TRITA-NA, R. Inst. Technol., Stockh. 8411, 67 p. (1984).
20
Result 1 to 20 of 23 total
Start
Contact
Print
General Help
