Extending the regular restriction of resolution to non-linear subdeductions

Authors:
Bruce Spencer;J. D. Horton
Affiliations:
University of New Burnswick, Fredericton, New Brunswick, Canada;University of New Burnswick, Fredericton, New Brunswick, Canada
Venue:
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Year:
1997

Citing 6
Cited 1

Automated reasoning: 33 BASIC research problems

Automated reasoning: 33 BASIC research problems
Regular resolution versus unrestricted resolution

SIAM Journal on Computing
Clause trees: a tool for understanding and implementing resolution in automated reasoning

Artificial Intelligence
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
The TPTP Problem Library

CADE-12 Proceedings of the 12th International Conference on Automated Deduction

Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

A binary resolution proof, represented as a binary tree, is irregular if some atom is resolved away and reappears on the same branch. We develop an algorithm, linear in the size of the tree, which detects whether reordering the resolutions in a given proof will generate an irregular proof. If so, the given proof is not minimal. A deduction system that keeps only minimal proofs retains completeness. We report on an initial implementation.