Self-adjusting binary search trees
Journal of the ACM (JACM)
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)
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Rank/Activity: A Canonical Form for Binary Resolution
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Extending the regular restriction of resolution to non-linear subdeductions
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Counting the Number of Equivalent Binary Resolution Proofs
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Hi-index | 0.00 |
A given binary resolution proof, represented as a binary tree, is said to be iminimal if the resolutions cannot be reordered to generate an irregular proof. Minimality extends Tseitin"s regularity restriction and still retains completeness. A linear-time algorithm is introduced to decide whether a given proof is minimal. This algorithm can be used by a deduction system that avoids redundancy by retaining only minimal proofs and thus lessens its reliance on subsumption, a more general but more expensive technique.Any irregular binary resolution tree is made strictly smaller by an operation called iSurgery, which runs in time linear in the size of the tree. After surgery the result proved by the new tree is nonstrictly more general than the original result and has fewer violations of the regular restriction. Furthermore, any nonminimal tree can be made irregular in linear time by an operation called iSplay. Thus a combination of splaying and surgery efficiently reduces a nonminimal tree to a minimal one.Finally, a close correspondence between clause trees, recently introduced by the authors, and binary resolution trees is established. In that sense this work provides the first linear-time algorithms that detect minimality and perform surgery on clause trees.