Abstract
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 the symmetry group consists of all variable permutations. These examples remain exponentially hard even when the symmetry group is enlarged to include complementation. Examples are exhibited in which resolution with the global symmetry rule has an exponential speed-up with respect to the cutting plane refutation system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arai, N.H.: No feasible monotone interpolation for cut-free Gentzen type propositional calculus with permutation inference. Forthcoming, Theoretical Computer Science
Arai, N.H.: Tractability of cut-free gentzen type propositional calculus with permutation inference II. Theoretical Computer Science (Forthcoming)
Arai, N.H.: Tractability of cut-free gentzen type propositional calculus with permutation inference. Theoretical Computer Science 170, 129–144 (1996)
Ben-Sasson, E., Wigderson, A.: Short proofs are narrow -resolution made simple. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 517–526 (1999)
Bollobás, B.: Graph Theory. Springer, Heidelberg (1979)
Boppana, R., Sipser, M.: The complexity of finite functions. In: Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 757–804. MIT Press/Elsevier (1990)
Chvátal, V., Szemerédi, E.: Many hard examples for resolution. Journal of the Association for Computing Machinery 35, 759–768 (1988)
Cook, W., Coullard, C.R., Turán, G.: On the complexity of cutting plane proofs. Discrete Applied Mathematics 18, 25–38 (1987)
Gomory, R.E.: An algorithm for integer solutions of linear programs. In: Graves, R.L., Wolfe, P. (eds.) Recent advances in mathematical programming, pp. 269–302. McGraw-Hill, New York (1963)
Haken, A.: The intractability of resolution. Theoretical Computer Science 39, 297–308 (1985)
Harrison, M.A.: Introduction to switching and automata theory. McGraw-Hill Book Company, New York (1965)
Krishnamurthy, B.: Short proofs for tricky formulas. Acta Informatica 22, 253–275 (1985)
Pudlák, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic 62, 981–998 (1997)
Razborov, A.A.: Lower bounds on the monotone complexity of some Boo- lean functions. Doklady Akademii Nauk SSSR 281, 798–801 (1985); English translation. Soviet Mathematics, Doklady 31, 354–357 (1985)
Urquhart, A.: Hard examples for resolution. Journal of the Association for Computing Machinery 34, 209–219 (1987)
Urquhart, A.: The symmetry rule in propositional logic. Discrete Applied Mathematics 96-97, 177–193 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arai, N.H., Urquhart, A. (2000). Local Symmetries in Propositional Logic. In: Dyckhoff, R. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2000. Lecture Notes in Computer Science(), vol 1847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722086_3
Download citation
DOI: https://doi.org/10.1007/10722086_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67697-3
Online ISBN: 978-3-540-45008-5
eBook Packages: Springer Book Archive