SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion
暂无分享,去创建一个
[1] Mark E. Stickel,et al. A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity , 1984, CADE.
[2] Michaël Rusinowitch,et al. Complete Inference Rules for the Cancellation Laws , 1987, IJCAI.
[3] Nachum Dershowitz,et al. Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. , 1989 .
[4] Michaël Rusinowitch,et al. On Word Problems in Equational Theories , 1987, ICALP.
[5] Mark E. Stickel,et al. Complete Sets of Reductions for Some Equational Theories , 1981, JACM.
[6] Jalel Mzali. Méthodes de filtrage équationnel et de preuve automatique de théorèmes , 1986 .