Path dissolution: a strongly complete rule of inference

Authors:
Neil V. Murray;Erik Rosenthal
Affiliations:
Dept. of Computer Science, State Univ. of N.Y. at Albany, Albany, NY;Dept. of Computer Science, Wellesley College, Wellesley, MA
Venue:
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Year:
1987

Citing 8
Cited 0

What you always wanted to know about clause graph resolution

Proc. of the 8th international conference on Automated deduction
Inference with path resolution and semantic graphs

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

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

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

Journal of the ACM (JACM)
On Matrices with Connections

Journal of the ACM (JACM)
Path Resolution and Semantic Graphs

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Path resolution with link deletion

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce path dissolution, a rule or inference that operates on formulas in negation normal form. Path dissolution is strongly complete; i.e., it has the property that, given an unsatisfiable ground formula, any sequence of dissolution steps will produce the empty graph. This is accomplished by strictly reducing (at each step) the number of c-paths in the formula. Dissolution, unlike most resolution-based inference rules, does not directly lift into first-order logic; techniques for employing dissolution at the first order level are discussed.