Local symmetries in propositional logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1847 LNAI, Issue , 2000, Pages 40-51

  Arai, Noriko H ^a   Urquhart, Alasdair ^b  

^a HIROSHIMA CITY UNIVERSITY   (Japan)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEMENTATION; CUTTING PLANES; GLOBAL SYMMETRIES; LOCAL SYMMETRY; LOWER BOUNDS; PROPOSITIONAL LOGIC; SYMMETRY GROUPS; VARIABLE PERMUTATION;

QUANTUM THEORY;

FORMAL LOGIC;

EID: 78650675143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722086_3     Document Type: Conference Paper

References (17)

1. Noriko H. Arai. No feasible monotone interpolation for cut-free Gentzen type propositional calculus with permutation inference. Forthcoming, Theoretical ComputerScience.
2. Noriko H. Arai. Tractability of cut-free gentzen type propositional calculus with permutation inference II. Forthcoming, Theoretical Computer Science.
3. Noriko H. Arai. Tractability of cut-free gentzen type propositional calculus with permutation inference. Theoretical Computer Science, 170:129-144, 1996.
4. Eli Ben-Sasson and AviWigderson. Short proofs are narrow resolution made simple.In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 517-526, 1999.
5. Béla Bollobá s. Graph Theory. Springer-Verlag, 1979.
6. Ravi Boppana and Michael Sipser. The complexity of finite functions. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pages 757-804. MIT Press/Elsevier, 1990.
7. Vǎsek Chvátal and Endre Szemerédi. Many hard examples for resolution. Journal of the Association for Computing Machinery, 35:759-768, 1988.
8. W. Cook, C.R. Coullard, and Gy. Turán. On the complexity of cutting plane proofs. Discrete Applied Mathematics, 18:25-38, 1987.
9. Ralph E. Gomory. An algorithm for integer solutions of linear programs. In R.L. Graves and P.Wolfe, editors, Recent advances in mathematical programming, pages 269-302. McGraw-Hill, 1963.
10. Armin Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.
11. Michael A. Harrison. Introduction to switching and automata theory. McGraw-Hill Book Company, 1965.
12. Balakrishnan Krishnamurthy. Short proofs for tricky formulas. Acta Informatica, 22:253-275, 1985.
13. Pavel Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic, 62:981-998, 1997.
14. Alexander A. Razborov. Lower bounds on the monotone complexity of some Boolean functions. Doklady Akademii Nauk SSSR, 281:798-801, 1985.
15. English translation,Soviet Mathematics, Doklady, Vol. 31 (1985), 354-357.
16. Alasdair Urquhart. Hard examples for resolution. Journal of the Association for Computing Machinery, 34:209-219, 1987.
17. Alasdair Urquhart. The symmetry rule in propositional logic. Discrete Applied Mathematics, 96-97:177-193, 1999.