The Complexity of Resolution with Generalized Symmetry Rules [chapter]

Stefan Szeider
2003 Lecture Notes in Computer Science  
S. (2005) 'The complexity of resolution with generalized symmetry rules.', Theory of computing systems., 38 (2). pp. 171-188. Further information on publisher's website: http://dx. The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata
more » ... rd in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full DRO policy for further details. Abstract We generalize Krishnamurthy's well-studied symmetry rule for resolution systems by considering homomorphisms instead of symmetries; symmetries are injective maps of literals which preserve complements and clauses; homomorphisms arise from symmetries by releasing the constraint of being injective. We prove that the use of homomorphisms yields a strictly more powerful system than the use of symmetries by exhibiting an infinite sequence of sets of clauses for which the consideration of global homomorphisms allows exponentially shorter proofs than the consideration of local symmetries. It is known that local symmetries give rise to a strictly more powerful system than global symmetries; we prove a similar result for local and global homomorphisms. Finally, we obtain an exponential lower bound for the resolution system enhanced by the local homomorphism rule.
doi:10.1007/3-540-36494-3_42 fatcat:mrhkxexihbdszczec4dcqefvqm