A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The symmetry rule in propositional logic allows the exploitation of symmetries present in a problem. In the context of resolution, the rule enables the shortening of refutations by using symmetries present in an initial set of clauses. These symmetries can be local or global. The present paper proves that the local symmetry rule is strictly more powerful than the global symmetry rule. It also exhibits sets of clauses that show exponential lower bounds for the local symmetry rule, where thedoi:10.1007/10722086_3 fatcat:daicfvl26fazxidevd7eqojkvy