Resolution with Limited Factoring

Authors:
Dafa Li
Affiliations:
Dept of mathematical sciences, Tsinghua University, Beijing, China 100084
Venue:
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
Year:
2009

Citing 5
Cited 0

First-order logic and automated theorem proving

First-order logic and automated theorem proving
Principles of automated theorem proving

Principles of automated theorem proving
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness

Proceedings of the 5th Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

The resolution principle was originally proposed by J.A. Robinson. Resolution with factoring rule is complete for the first-order logic. However, unlimited applications of factoring rule may generate many irrelevant and redundant clauses. Noll presented resolution rule with half-factoring. In this paper, we demonstrate how to eliminate the half-factoring.