Papers
Lee A. Barnett. Advanced Redundancy-Based Methods for SAT. PhD Thesis. Johannes Kepler University Linz, 2022.
[preprint, bibtex]
Lee A. Barnett and Armin Biere. Non-Clausal Redundancy Properties. In Proc. 28th Intl. Conf. on Automated Deduction (CADE '21). LNCS vol. 12699, pp. 252--272. Springer, 2021.
[extended preprint, slides, bibtex]
David A. Plaisted and Lee A. Barnett. A Term-Rewriting Semantics for Imperative Style Programming: Summary. In 9th Intl. Symposium on Symbolic Computation in Software Science (SCSS '21), short and work-in-progress papers. RISC Report Series No. 21-16, pp. 40--45. 2021.
Lee A. Barnett, David Cerna, and Armin Biere. Covered Clauses Are Not Propagation Redundant. In Proc. 10th Intl. Joint Conf. on Automated Reasoning (IJCAR '20). LNCS vol. 12166, pp. 32--47. Springer, 2020.
[preprint, slides, bibtex]
Lee A. Barnett. Goal-Sensitive Reasoning with Disconnection Tableaux. In Proc. 26th Intl. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX '17). LNCS vol. 10501, pp. 163--174. Springer, 2017.
[preprint, bibtex]