An Application of Automated Equational Reasoning to Many-valued Logic
暂无分享,去创建一个
[1] Jieh Hsiang,et al. SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion , 1989, RTA.
[2] 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 .
[3] Pierre Lescanne,et al. Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.
[4] Michaël Rusinowitch,et al. Complete Inference Rules for the Cancellation Laws , 1987, IJCAI.
[5] Michaël Rusinowitch,et al. On Word Problems in Equational Theories , 1987, ICALP.
[6] Maria Paola Bonacina,et al. Automated proofs in Lukasiewicz logic , 1989 .
[7] Nirina Andrianarivelo,et al. Heuristical Criteria in Refutational Theorem Proving , 1990, DISCO.
[8] Nachum Dershowitz,et al. A Maximal-Literal Unit Strategy for Horn Clauses , 1990, CTRS.