Abstract
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set, thus eliminating or at least reducing recursiveness and circularity in clause sets. Possible applications are reducing the search space for automated theorem provers, eliminating loops in Prolog programs, parallelizing simple closure computation algorithms, and supporting automated complexity analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bachmair, L. and Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification, Journal of Logic and Computation 4(3) (1994), 217–247.
Basin, D. and Ganzinger, H.: Automated complexity analysis based on ordered resolution, Technical report, Saarbrücken, 1995.
Brand, D.: Proving theorems with the modification method, SIAM Journal on Computing 4(4) (1975), 412–430.
Eisinger, N.: Completeness, Confluence, and Related Properties of Clause Graph Resolution, Research Notes in Artificial Intelligence, Pitman Ltd., London, 1991.
Kowalski, R.: A proof procedure using connection graphs, Journal of the Association for Computing Machinery (JACM) 22(4) (1975), 572–595.
Łukasiewicz, J.: Selected Works, L. Borkowski (ed.), North Holland, 1970.
McAllester, D. A.: Automated recognition of tractability in inference relations, Journal of the Association for Computing Machinery (JACM) 40(2) (1993), 284–303.
Smaus, J.: Finding resolution K-transformations, Diploma thesis, Max-Planck-Institut für Informatik, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ohlbach, H.J. Elimination of Self-Resolving Clauses. Journal of Automated Reasoning 20, 317–336 (1998). https://doi.org/10.1023/A:1005894718064
Issue Date:
DOI: https://doi.org/10.1023/A:1005894718064