Resolution With Merging

Authors:
Peter B. Andrews
Affiliations:
Carnegie-Mellon University, Mathematics Department, Pittsburgh, Pennsylvania
Venue:
Journal of the ACM (JACM)
Year:
1968

Citing 2
Cited 25

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)

A Correction Concerning Resolution

Journal of the ACM (JACM)
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness

Journal of the ACM (JACM)
The Unit Proof and the Input Proof in Theorem Proving

Journal of the ACM (JACM)
Two Results on Ordering for Resolution with Merging and Linear Format

Journal of the ACM (JACM)
A New Class of Automated Theorem-Proving Algorithms

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

Journal of the ACM (JACM)
Resolution Strategies as Decision Procedures

Journal of the ACM (JACM)
Another Generalization of Resolution

Journal of the ACM (JACM)
An Assessment of Techniques for Proving Program Correctness

ACM Computing Surveys (CSUR)
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A Semantically Guided Deductive System for Automatic Theorem Proving

IEEE Transactions on Computers
Resolution, Refinements, and Search Strategies: A Comparative Study

IEEE Transactions on Computers
Refutations by Matings

IEEE Transactions on Computers
R2: a natural language question-answering system

AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
New directions in legal information processing

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Ground Interpolation for Combined Theories

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
A new clause learning scheme for efficient unsatisfiability proofs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
E-resolution: extension of resolution to include the equality relation

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
A semantically guided deductive system for automatic theorem-proving

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Experimental tests of resolution-based theorem-proving strategies

Information Sciences: an International Journal
Theorem proving with variable-constrained resolution

Information Sciences: an International Journal
On Modern Clause-Learning Satisfiability Solvers

Journal of Automated Reasoning
Clause-learning algorithms with many restarts and bounded-width resolution

Journal of Artificial Intelligence Research
Interpolant strength

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Interpolant strength revisited

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A refinement of the resolution method for mechanical theorem proving is presented. A resolvent C of clauses A and B is called a merge if literals from A and B merge together to form some literal of C. It is shown that the resolution method remains complete if it is required that two noninitial clauses which are not merges never be resolved with one another. It is also shown that this strategy can be combined with the set-of-support strategy.