Abstract
AbstractThis article is a tribute to the scientific legacy of automated reasoning pioneer and JAR founder Lawrence T. (Larry) Wos. Larry’s main technical contributions were the set-of-support strategy for resolution theorem proving, and the demodulation and paramodulation inference rules for building equality into resolution. Starting from the original definitions of these concepts in Larry’s papers, this survey traces their evolution, unearthing the often forgotten trails that connect Larry’s original definitions to those that became standard in the field.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference189 articles.
1. Anantharaman, S., Andrianarivelo, N.: Heuristical criteria in refutational theorem proving. In: Miola, A. (ed.) Proceedings of 1st International Symposium on Design and Implementation of Symbolic Computation Systems (DISCO). Lecture Notes in Computer Science, vol. 429, pp. 184–193. Springer, Berlin (1990)
2. Anantharaman, S., Bonacina, M.P.: Automated proofs in Łukasiewicz logic. Technical report, Department of Computer Science, State University of New York at Stony Brook and LIFO, Université d’Orléans (1989)
3. Anantharaman, S., Bonacina, M.P.: An application of automated equational reasoning to many-valued logic. In: Okada, M., Kaplan, S. (eds.) Proceedings of 2nd International Workshop on Conditional and Typed Term Rewriting Systems (CTRS 1990). Lecture Notes in Computer Science, vol. 516, pp. 156–161. Springer, Berlin (1991)
4. Andrews, P.B.: Theorem proving via general matings. J. ACM 28(2), 193–214 (1981)
5. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Log. 10(1), 129–179 (2009)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献