Elimination of Self-Resolving Clauses

Authors:
Hans Jürgen Ohlbach
Affiliations:
Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, e-mail: h.ohlbach@doc.ic.ac.uk
Venue:
Journal of Automated Reasoning
Year:
1998

Citing 3
Cited 1

Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
Completeness, Confluence, and Related Properties of Clause Graph Resolution

Completeness, Confluence, and Related Properties of Clause Graph Resolution

Encoding two-valued nonclassical logics in classical logic

Handbook of automated reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown how self-resolving clauses like symmetry or transitivity, oreven clauses like condensed detachment, can faithfully be deleted from theclause set, thus eliminating or at least reducing recursiveness andcircularity in clause sets. Possible applications are reducing the searchspace for automated theorem provers, eliminating loops in Prolog programs,parallelizing simple closure computation algorithms, and supportingautomated complexity analysis.