Path resolution with link deletion

Authors:
Neil V. Murray;Erik Rosenthal
Affiliations:
State University of NY at Albany, Department of Computer Science, Albany, NY;University of New Haven, Department of Mathematics, West Haven, CT
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 12
Cited 3

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
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 Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
Theorem Proving by Covering Expressions

Journal of the ACM (JACM)
Theorem Proving via General Matings

Journal of the ACM (JACM)
On Matrices with Connections

Journal of the ACM (JACM)
A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
A production system for automatic deduction

A production system for automatic deduction
Problems and Experiments for and with Automated Theorem-Proving Programs

IEEE Transactions on Computers
Refutations by Matings

IEEE Transactions on Computers

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
Path dissolution: a strongly complete rule of inference

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Path dissolution: a strongly complete rule of inference

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a graphical representation of quantifier-free predicate calculus formulas and a new rule of inference which employs this representation. The new rule is an amalgamation of resolution and Prawitz analysis which we call path resolution. Path resolution allows Prawitz analysis of an arbitrary subgraph of the graph representing a formula. If such a subgraph is not large enough to demonstrate a contradiction, a path resolvent of the subgraph may be generated with respect to the entire graph. This generalizes the notions of large inference present in hyper-resolution, clash-resolution, NC-resolution, and PL-resolution. Two forms of path resolution are described for which deletion of the links resolved upon preserves the spanning property.