A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness

Authors:
Robert Anderson;W. W. Bledsoe
Affiliations:
University of Texas, Austin, Texas;University of Texas, Austin, Texas
Venue:
Journal of the ACM (JACM)
Year:
1970

Citing 3
Cited 28

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)
Resolution With Merging

Journal of the ACM (JACM)

Logical foundations of object-oriented and frame-based languages

Journal of the ACM (JACM)
Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution

Journal of the ACM (JACM)
Completeness of Linear Refutation for Theories with Equality

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

Journal of the ACM (JACM)
A Unifying View of Some Linear Herbrand Procedures

Journal of the ACM (JACM)
An Approach for Finding C-Linear Complete Inference Systems

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

Journal of the ACM (JACM)
A propositional theorem prover to solve planning and other problems

Annals of Mathematics and Artificial Intelligence
A Tribute to Woody Bledsoe

Journal of Automated Reasoning
A Framework for Automated Reasoning in Multiple-Valued Logics

Journal of Automated Reasoning
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy

Journal of Automated Reasoning
Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Resolution-Based Theorem Proving for SHn-Logics

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
A Search Technique for Clause Interconnectivity Graphs

IEEE Transactions on Computers
Completeness results for e-resolution

AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
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
On the refutational completeness of signed binary resolution and hyperresolution

Fuzzy Sets and Systems
Automated deduction by theory resolution

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Experimental tests of resolution-based theorem-proving strategies

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

Information Sciences: an International Journal
Formal versus rigorous mathematics: how to get your papers published

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Pool resolution and its relation to regular resolution and DPLL with clause learning

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Input distance and lower bounds for propositional resolution proof length

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Preliminary report on input cover number as a metric for propositional resolution proofs

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Adapting Classical Inference Techniques To Multiple-Valued Logics Using Signed Formulas

Fundamenta Informaticae
Contributions to the theory of practical quantified boolean formula solving

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Producing and verifying extremely large propositional refutations

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

A new technique is given for establishing the completeness of resolution-based deductive systems for first-order logic (with or without equality) and several new completeness results are proved using this technique. The technique leads to very simple and clear completeness proofs and can be used to establish the completeness of most resolution-based deductive systems reported in the literature. The main new result obtained by means of this technique is that a linear format for resolution with merging and set of support and with several further restrictions is a complete deductive system for the first-order predicate calculus.