Implementing a generalized version of resolution

Authors:
Heidi E. Dixon;Matthew L. Ginsberg;David K. Hofer;Eugene M. Luks;Andrew J. Parkes
Affiliations:
CIRL, CIS, University of Oregon, Eugene, OR;On Time Systems, Inc., Eugene, OR;CIS, University of Oregon, Eugene, OR;CIS, University of Oregon, Eugene, OR;CIS, University of Oregon, Eugene, OR
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 4
Cited 3

On the complexity of cutting-plane proofs

Discrete Applied Mathematics
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Integrating Equivalency Reasoning into Davis-Putnam Procedure

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
ZRES: The Old Davis-Putman Procedure Meets ZBDD

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

Compact propositional encoding of first-order theories

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Extended clause learning

Artificial Intelligence
Mining-based compression approach of propositional formulae

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have recently proposed augmenting clauses in a Boolean database with groups of permutations, the augmented clauses then standing for the set of all clauses constructed by acting on the original clause with a permutation in the group. This approach has many attractive theoretical properties, including representational generality and reductions from exponential to polynomial proof length in a variety of settings. In this paper, we discuss the issues that arise in implementing a group-based generalization of resolution, and give preliminary results describing this procedure's effectiveness.